{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/knowledge-graph-embedding/papers/2","list_of":"/task/knowledge-graph-embedding","task":"Knowledge Graph Embedding","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":467,"counts":{"archive_papers_tagged":467,"with_a_code_link":220,"where_syntology_ran_a_sample":40,"not_listed_spam_title":0,"listed":467,"listed_where_code_ran":40,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":39,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":39,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/knowledge-graph-embedding","prev":"/task/knowledge-graph-embedding","next":"/task/knowledge-graph-embedding/papers/3","papers":[{"url":"/paper/improving-dis-agreement-detection-with","slug":"improving-dis-agreement-detection-with","title":"Improving (Dis)agreement Detection with Inductive Social Relation Information From Comment-Reply Interactions","date":"2023-02-08","arxiv_id":"2302.03950","repositories_listed":1,"syntology":null},{"url":"/paper/learning-representations-of-bi-level","slug":"learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","arxiv_id":"2302.02601","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-representations-of-bi-level#ran","syntology_url":"https://syntology.ai/paper/2302.02601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02601"}},"official":{"repos":["bdi-lab/bive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/entity-agnostic-representation-learning-for","slug":"entity-agnostic-representation-learning-for","title":"Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding","date":"2023-02-03","arxiv_id":"2302.01849","repositories_listed":1,"syntology":null},{"url":"/paper/analogical-inference-enhanced-knowledge-graph","slug":"analogical-inference-enhanced-knowledge-graph","title":"Analogical Inference Enhanced Knowledge Graph Embedding","date":"2023-01-03","arxiv_id":"2301.00982","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/analogical-inference-enhanced-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2301.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00982"}},"official":{"repos":["zjukg/ankge"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/predicting-missing-annotations-in-gene","slug":"predicting-missing-annotations-in-gene","title":"Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-over-different-types-of-knowledge","slug":"reasoning-over-different-types-of-knowledge","title":"A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal","date":"2022-12-12","arxiv_id":"2212.05767","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-relation-aware-neighborhood","slug":"efficient-relation-aware-neighborhood","title":"Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition","date":"2022-12-11","arxiv_id":"2212.05581","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-refinement-based-on-triplet","slug":"knowledge-graph-refinement-based-on-triplet","title":"Knowledge Graph Refinement based on Triplet BERT-Networks","date":"2022-11-18","arxiv_id":"2211.10460","repositories_listed":1,"syntology":null},{"url":"/paper/deepe-a-deep-neural-network-for-knowledge","slug":"deepe-a-deep-neural-network-for-knowledge","title":"DeepE: a deep neural network for knowledge graph embedding","date":"2022-11-09","arxiv_id":"2211.04620","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-wikidata-s-edit-history-in","slug":"leveraging-wikidata-s-edit-history-in","title":"Leveraging Wikidata's edit history in knowledge graph refinement tasks","date":"2022-10-27","arxiv_id":"2210.15495","repositories_listed":1,"syntology":null},{"url":"/paper/rule-neural-symbolic-knowledge-graph","slug":"rule-neural-symbolic-knowledge-graph","title":"RulE: Knowledge Graph Reasoning with Rule Embedding","date":"2022-10-24","arxiv_id":"2210.14905","repositories_listed":1,"syntology":null},{"url":"/paper/along-the-time-timeline-traced-embedding-for","slug":"along-the-time-timeline-traced-embedding-for","title":"Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/entity-aware-negative-sampling-with-auxiliary","slug":"entity-aware-negative-sampling-with-auxiliary","title":"Entity Aware Negative Sampling with Auxiliary Loss of False Negative Prediction for Knowledge Graph Embedding","date":"2022-10-12","arxiv_id":"2210.06242","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hierarchy-aware-quaternion-knowledge","slug":"learning-hierarchy-aware-quaternion-knowledge","title":"Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/embedding-based-entity-alignment-using","slug":"embedding-based-entity-alignment-using","title":"Embedding-Based Entity Alignment Using Relation Structural Similarity","date":"2022-09-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/geolocation-of-cultural-heritage-using-multi","slug":"geolocation-of-cultural-heritage-using-multi","title":"Geolocation of Cultural Heritage using Multi-View Knowledge Graph Embedding","date":"2022-09-08","arxiv_id":"2209.03638","repositories_listed":1,"syntology":null},{"url":"/paper/repurposing-knowledge-graph-embeddings-for","slug":"repurposing-knowledge-graph-embeddings-for","title":"Repurposing Knowledge Graph Embeddings for Triple Representation via Weak Supervision","date":"2022-08-22","arxiv_id":"2208.10328","repositories_listed":1,"syntology":null},{"url":"/paper/i-know-what-you-do-not-know-knowledge-graph","slug":"i-know-what-you-do-not-know-knowledge-graph","title":"I Know What You Do Not Know: Knowledge Graph Embedding via Co-distillation Learning","date":"2022-08-21","arxiv_id":"2208.09828","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/i-know-what-you-do-not-know-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2208.09828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.09828"}},"official":{"repos":["nju-websoft/cole"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/integrating-knowledge-graph-embedding-and","slug":"integrating-knowledge-graph-embedding-and","title":"Integrating Knowledge Graph embedding and pretrained Language Models in Hypercomplex Spaces","date":"2022-08-04","arxiv_id":"2208.02743","repositories_listed":1,"syntology":null},{"url":"/paper/m-text-kg-a-library-for-multi-source","slug":"m-text-kg-a-library-for-multi-source","title":"$μ\\text{KG}$: A Library for Multi-source Knowledge Graph Embeddings and Applications","date":"2022-07-23","arxiv_id":"2207.11442","repositories_listed":1,"syntology":null},{"url":"/paper/dhge-dual-view-hyper-relational-knowledge","slug":"dhge-dual-view-hyper-relational-knowledge","title":"DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing","date":"2022-07-18","arxiv_id":"2207.08562","repositories_listed":1,"syntology":null},{"url":"/paper/hardware-agnostic-computation-for-large-scale","slug":"hardware-agnostic-computation-for-large-scale","title":"Hardware-agnostic Computation for Large-scale Knowledge Graph Embeddings","date":"2022-07-18","arxiv_id":"2207.08544","repositories_listed":1,"syntology":null},{"url":"/paper/the-dlcc-node-classification-benchmark-for","slug":"the-dlcc-node-classification-benchmark-for","title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","date":"2022-07-13","arxiv_id":"2207.06014","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-the-effects-of-hyperparameters-on","slug":"assessing-the-effects-of-hyperparameters-on","title":"Assessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality","date":"2022-07-01","arxiv_id":"2207.00473","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-2","slug":"learning-to-borrow-relation-representation-2","title":"Learning to Borrow– Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-analysis-of-negative-sampling","slug":"comprehensive-analysis-of-negative-sampling","title":"Comprehensive Analysis of Negative Sampling in Knowledge Graph Representation Learning","date":"2022-06-21","arxiv_id":"2206.10140","repositories_listed":1,"syntology":null},{"url":"/paper/text-based-automatic-personality-prediction","slug":"text-based-automatic-personality-prediction","title":"Text-Based Automatic Personality Prediction Using KGrAt-Net; A Knowledge Graph Attention Network Classifier","date":"2022-05-27","arxiv_id":"2205.13780","repositories_listed":1,"syntology":null},{"url":"/paper/kronecker-decomposition-for-knowledge-graph","slug":"kronecker-decomposition-for-knowledge-graph","title":"Kronecker Decomposition for Knowledge Graph Embeddings","date":"2022-05-13","arxiv_id":"2205.06560","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-knowledge-graph-embedding","slug":"explainable-knowledge-graph-embedding","title":"Explainable Knowledge Graph Embedding: Inference Reconciliation for Knowledge Inferences Supporting Robot Actions","date":"2022-05-04","arxiv_id":"2205.01836","repositories_listed":1,"syntology":null},{"url":"/paper/cogkge-a-knowledge-graph-embedding-toolkit","slug":"cogkge-a-knowledge-graph-embedding-toolkit","title":"CogKGE: A Knowledge Graph Embedding Toolkit and Benchmark for Representing Multi-source and Heterogeneous Knowledge","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hyper-parameter-search-for-1","slug":"efficient-hyper-parameter-search-for-1","title":"Efficient Hyper-parameter Search for Knowledge Graph Embedding","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-1","slug":"learning-to-borrow-relation-representation-1","title":"Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-04-27","arxiv_id":"2204.13097","repositories_listed":1,"syntology":null},{"url":"/paper/transher-translating-knowledge-graph","slug":"transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","arxiv_id":"2204.13221","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/transher-translating-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2204.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13221"}},"official":{"repos":["yizhilll/transher"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-knowledge-graph-reasoning-with-low","slug":"temporal-knowledge-graph-reasoning-with-low","title":"Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations","date":"2022-04-10","arxiv_id":"2204.04783","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-knowledge-graphs-for-better-link","slug":"augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","arxiv_id":"2203.13965","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/augmenting-knowledge-graphs-for-better-link#ran","syntology_url":"https://syntology.ai/paper/2203.13965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13965"}},"official":{"repos":["otamio/kga"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-knowledge-graph-1","slug":"sequence-to-sequence-knowledge-graph-1","title":"Sequence-to-Sequence Knowledge Graph Completion and Question Answering","date":"2022-03-19","arxiv_id":"2203.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sequence-to-sequence-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2203.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10321"}},"official":{"repos":["apoorvumang/kgt5"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-embedding-methods-for-entity","slug":"knowledge-graph-embedding-methods-for-entity","title":"Knowledge Graph Embedding Methods for Entity Alignment: An Experimental Review","date":"2022-03-17","arxiv_id":"2203.09280","repositories_listed":1,"syntology":null},{"url":"/paper/cake-a-scalable-commonsense-aware-framework","slug":"cake-a-scalable-commonsense-aware-framework","title":"CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion","date":"2022-02-25","arxiv_id":"2202.13785","repositories_listed":1,"syntology":null},{"url":"/paper/neuralkg-an-open-source-library-for-diverse","slug":"neuralkg-an-open-source-library-for-diverse","title":"NeuralKG: An Open Source Library for Diverse Representation Learning of Knowledge Graphs","date":"2022-02-25","arxiv_id":"2202.12571","repositories_listed":1,"syntology":null},{"url":"/paper/house-knowledge-graph-embedding-with","slug":"house-knowledge-graph-embedding-with","title":"HousE: Knowledge Graph Embedding with Householder Parameterization","date":"2022-02-16","arxiv_id":"2202.07919","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/house-knowledge-graph-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2202.07919","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07919"}},"official":{"repos":["anrep/house"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/box-embeddings-for-the-description-logic-el","slug":"box-embeddings-for-the-description-logic-el","title":"Faithiful Embeddings for EL++ Knowledge Bases","date":"2022-01-24","arxiv_id":"2201.09919","repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-through-memorization-nearest","slug":"reasoning-through-memorization-nearest","title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","date":"2022-01-14","arxiv_id":"2201.05575","repositories_listed":1,"syntology":null},{"url":"/paper/lp-bert-multi-task-pre-training-knowledge","slug":"lp-bert-multi-task-pre-training-knowledge","title":"Multi-task Pre-training Language Model for Semantic Network Completion","date":"2022-01-13","arxiv_id":"2201.04843","repositories_listed":1,"syntology":null},{"url":"/paper/stay-positive-knowledge-graph-embedding","slug":"stay-positive-knowledge-graph-embedding","title":"Stay Positive: Knowledge Graph Embedding Without Negative Sampling","date":"2022-01-07","arxiv_id":"2201.02661","repositories_listed":1,"syntology":null},{"url":"/paper/self-attention-presents-low-dimensional","slug":"self-attention-presents-low-dimensional","title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","date":"2021-12-20","arxiv_id":"2112.10644","repositories_listed":1,"syntology":null},{"url":"/paper/two-view-graph-neural-networks-for-knowledge","slug":"two-view-graph-neural-networks-for-knowledge","title":"Two-view Graph Neural Networks for Knowledge Graph Completion","date":"2021-12-16","arxiv_id":"2112.09231","repositories_listed":1,"syntology":null},{"url":"/paper/implications-of-topological-imbalance-for","slug":"implications-of-topological-imbalance-for","title":"Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphs","date":"2021-12-13","arxiv_id":"2112.06567","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implications-of-topological-imbalance-for#ran","syntology_url":"https://syntology.ai/paper/2112.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.06567"}},"official":{"repos":["astrazeneca/biomedical-kg-topological-imbalance"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/learning-numeracy-a-simple-yet-effective","slug":"learning-numeracy-a-simple-yet-effective","title":"Learning Numeracy: A Simple Yet Effective Number Embedding Approach Using Knowledge Graph","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parallel-training-of-knowledge-graph","slug":"parallel-training-of-knowledge-graph","title":"Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/standing-on-the-shoulders-of-predecessors","slug":"standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-entity-representation-model-for","slug":"probabilistic-entity-representation-model-for","title":"Probabilistic Entity Representation Model for Reasoning over Knowledge Graphs","date":"2021-10-26","arxiv_id":"2110.13522","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/probabilistic-entity-representation-model-for#ran","syntology_url":"https://syntology.ai/paper/2110.13522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13522"}},"official":{"repos":["akirato/perm-gaussiankg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-sheaves-a-sheaf-theoretic-framework","slug":"knowledge-sheaves-a-sheaf-theoretic-framework","title":"Knowledge Sheaves: A Sheaf-Theoretic Framework for Knowledge Graph Embedding","date":"2021-10-07","arxiv_id":"2110.03789","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/how-does-knowledge-graph-embedding","slug":"how-does-knowledge-graph-embedding","title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","date":"2021-09-24","arxiv_id":"2109.11800","repositories_listed":1,"syntology":null},{"url":"/paper/learning-through-structure-towards-deep","slug":"learning-through-structure-towards-deep","title":"Learning through structure: towards deep neuromorphic knowledge graph embeddings","date":"2021-09-21","arxiv_id":"2109.10376","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/hopfe-knowledge-graph-representation-learning","slug":"hopfe-knowledge-graph-representation-learning","title":"HopfE: Knowledge Graph Representation Learning using Inverse Hopf Fibrations","date":"2021-08-12","arxiv_id":"2108.05774","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-latent-relation-modeling-for","slug":"hierarchical-latent-relation-modeling-for","title":"Hierarchical Latent Relation Modeling for Collaborative Metric Learning","date":"2021-07-26","arxiv_id":"2108.04655","repositories_listed":1,"syntology":null},{"url":"/paper/echoea-echo-information-between-entities-and","slug":"echoea-echo-information-between-entities-and","title":"EchoEA: Echo Information between Entities and Relations for Entity Alignment","date":"2021-07-07","arxiv_id":"2107.03054","repositories_listed":1,"syntology":null},{"url":"/paper/unified-interpretation-of-softmax-cross","slug":"unified-interpretation-of-softmax-cross","title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","date":"2021-06-14","arxiv_id":"2106.07250","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-knowledge-graphs-attentive-to","slug":"embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/out-of-vocabulary-entities-in-link-prediction","slug":"out-of-vocabulary-entities-in-link-prediction","title":"Out-of-Vocabulary Entities in Link Prediction","date":"2021-05-26","arxiv_id":"2105.12524","repositories_listed":1,"syntology":null},{"url":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","repositories_listed":1,"syntology":null},{"url":"/paper/learning-embeddings-from-knowledge-graphs","slug":"learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","arxiv_id":"2105.08683","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-embeddings-from-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2105.08683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08683"}},"official":{"repos":["Accenture/AmpliGraph"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-knowledge-graphs-embedding","slug":"federated-knowledge-graphs-embedding","title":"Differentially Private Federated Knowledge Graphs Embedding","date":"2021-05-17","arxiv_id":"2105.07615","repositories_listed":1,"syntology":null},{"url":"/paper/ontoea-ontology-guided-entity-alignment-via","slug":"ontoea-ontology-guided-entity-alignment-via","title":"OntoEA: Ontology-guided Entity Alignment via Joint Knowledge Graph Embedding","date":"2021-05-17","arxiv_id":"2105.07688","repositories_listed":1,"syntology":null},{"url":"/paper/an-adversarial-transfer-network-for-knowledge","slug":"an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","arxiv_id":"2104.14757","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-adversarial-transfer-network-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.14757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14757"}},"official":{"repos":["LemonNoel/ATransN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-non-sampling-knowledge-graph","slug":"efficient-non-sampling-knowledge-graph","title":"Efficient Non-Sampling Knowledge Graph Embedding","date":"2021-04-21","arxiv_id":"2104.10796","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-run-ensemble-learning-withlow","slug":"multiple-run-ensemble-learning-withlow","title":"Multiple Run Ensemble Learning with Low-Dimensional Knowledge Graph Embeddings","date":"2021-04-11","arxiv_id":"2104.05003","repositories_listed":1,"syntology":null},{"url":"/paper/highly-efficient-knowledge-graph-embedding","slug":"highly-efficient-knowledge-graph-embedding","title":"Highly Efficient Knowledge Graph Embedding Learning with Orthogonal Procrustes Analysis","date":"2021-04-10","arxiv_id":"2104.04676","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-box-embeddings-for-uncertain","slug":"probabilistic-box-embeddings-for-uncertain","title":"Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning","date":"2021-04-09","arxiv_id":"2104.04597","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/probabilistic-box-embeddings-for-uncertain#ran","syntology_url":"https://syntology.ai/paper/2104.04597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04597"}},"official":{"repos":["stasl0217/beurre"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/re-improving-multi-hop-question-answering","slug":"re-improving-multi-hop-question-answering","title":"[Re] Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relwalk-a-latent-variable-model-approach-to-1","slug":"relwalk-a-latent-variable-model-approach-to-1","title":"RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding","date":"2021-01-25","arxiv_id":"2101.10070","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-of-knowledge-graph","slug":"continual-learning-of-knowledge-graph","title":"Continual Learning of Knowledge Graph Embeddings","date":"2021-01-14","arxiv_id":"2101.05850","repositories_listed":1,"syntology":null},{"url":"/paper/a-duet-recommendation-algorithm-based-on","slug":"a-duet-recommendation-algorithm-based-on","title":"Unify Local and Global Information for Top-$N$ Recommendation","date":"2020-12-03","arxiv_id":"2012.01635","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-simple-and-automated-negative","slug":"efficient-simple-and-automated-negative","title":"Efficient, Simple and Automated Negative Sampling for Knowledge Graph Embedding","date":"2020-10-24","arxiv_id":"2010.14227","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-neural-matrix-factorization-with","slug":"explaining-neural-matrix-factorization-with","title":"Explaining Neural Matrix Factorization with Gradient Rollback","date":"2020-10-12","arxiv_id":"2010.05516","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-complementary-nature-of-knowledge","slug":"on-the-complementary-nature-of-knowledge","title":"On the Complementary Nature of Knowledge Graph Embedding, Fine Grain Entity Types, and Language Modeling","date":"2020-10-12","arxiv_id":"2010.05732","repositories_listed":1,"syntology":null},{"url":"/paper/libkge-a-knowledge-graph-embedding-library","slug":"libkge-a-knowledge-graph-embedding-library","title":"LibKGE - A knowledge graph embedding library for reproducible research","date":"2020-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inductively-representing-out-of-knowledge","slug":"inductively-representing-out-of-knowledge","title":"Inductively Representing Out-of-Knowledge-Graph Entities by Optimal Estimation Under Translational Assumptions","date":"2020-09-27","arxiv_id":"2009.12765","repositories_listed":1,"syntology":null},{"url":"/paper/rdf2vec-light-a-lightweight-approachfor","slug":"rdf2vec-light-a-lightweight-approachfor","title":"RDF2Vec Light -- A Lightweight Approach for Knowledge Graph Embeddings","date":"2020-09-16","arxiv_id":"2009.07659","repositories_listed":1,"syntology":null},{"url":"/paper/torchkge-knowledge-graph-embedding-in-python","slug":"torchkge-knowledge-graph-embedding-in-python","title":"TorchKGE: Knowledge Graph Embedding in Python and PyTorch","date":"2020-09-07","arxiv_id":"2009.02963","repositories_listed":1,"syntology":null},{"url":"/paper/nase-learning-knowledge-graph-embedding-for","slug":"nase-learning-knowledge-graph-embedding-for","title":"NASE: Learning Knowledge Graph Embedding for Link Prediction via Neural Architecture Search","date":"2020-08-18","arxiv_id":"2008.07723","repositories_listed":1,"syntology":null},{"url":"/paper/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","repositories_listed":1,"syntology":null},{"url":"/paper/can-we-predict-new-facts-with-open-knowledge","slug":"can-we-predict-new-facts-with-open-knowledge","title":"Can We Predict New Facts with Open Knowledge Graph Embeddings? A Benchmark for Open Link Prediction","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-and-best-practices-for-biomedical-1","slug":"benchmark-and-best-practices-for-biomedical-1","title":"Benchmark and Best Practices for Biomedical Knowledge Graph Embeddings","date":"2020-06-24","arxiv_id":"2006.13774","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-multi-relational-graph","slug":"generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","arxiv_id":"2006.07331","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/generalized-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/2006.07331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07331"}},"official":{"repos":["Maysir/GEM-GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-base-completion-baseline-strikes","slug":"knowledge-base-completion-baseline-strikes","title":"Knowledge Base Completion: Baseline strikes back (Again)","date":"2020-05-02","arxiv_id":"2005.00804","repositories_listed":1,"syntology":null},{"url":"/paper/seek-segmented-embedding-of-knowledge-graphs","slug":"seek-segmented-embedding-of-knowledge-graphs","title":"SEEK: Segmented Embedding of Knowledge Graphs","date":"2020-05-02","arxiv_id":"2005.00856","repositories_listed":1,"syntology":null},{"url":"/paper/se-kge-a-location-aware-knowledge-graph","slug":"se-kge-a-location-aware-knowledge-graph","title":"SE-KGE: A Location-Aware Knowledge Graph Embedding Model for Geographic Question Answering and Spatial Semantic Lifting","date":"2020-04-25","arxiv_id":"2004.14171","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/se-kge-a-location-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2004.14171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14171"}},"official":null}},{"url":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-for-link-prediction","slug":"knowledge-graph-embedding-for-link-prediction","title":"Knowledge Graph Embedding for Link Prediction: A Comparative Analysis","date":"2020-02-03","arxiv_id":"2002.00819","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-knowledge-graphs-representation","slug":"a-survey-on-knowledge-graphs-representation","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","date":"2020-02-02","arxiv_id":"2002.00388","repositories_listed":1,"syntology":null},{"url":"/paper/the-keen-universe-an-ecosystem-for-knowledge","slug":"the-keen-universe-an-ecosystem-for-knowledge","title":"The KEEN Universe: An Ecosystem for Knowledge Graph Embeddings with a Focus on Reproducibility and Transferability","date":"2020-01-28","arxiv_id":"2001.10560","repositories_listed":1,"syntology":null},{"url":"/paper/a-physical-embedding-model-for-knowledge","slug":"a-physical-embedding-model-for-knowledge","title":"A Physical Embedding Model for Knowledge Graphs","date":"2020-01-21","arxiv_id":"2001.07418","repositories_listed":1,"syntology":null},{"url":"/paper/decompressing-knowledge-graph-representations","slug":"decompressing-knowledge-graph-representations","title":"Decompressing Knowledge Graph Representations for Link Prediction","date":"2019-11-11","arxiv_id":"1911.04053","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-scholarly-data-by-semantic-query-on","slug":"exploring-scholarly-data-by-semantic-query-on","title":"Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space","date":"2019-09-17","arxiv_id":"1909.08191","repositories_listed":1,"syntology":null},{"url":"/paper/bayes-embedding-bem-refining-representation","slug":"bayes-embedding-bem-refining-representation","title":"Bayes EMbedding (BEM): Refining Representation by Integrating Knowledge Graphs and Behavior-specific Networks","date":"2019-08-28","arxiv_id":"1908.10611","repositories_listed":1,"syntology":null}],"record_sha256":"5d4640b7cf924a81eb34750aa5181756c502eca392fb806a976b5155e072f63f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}