{"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":"/dataset/wn18rr","name":"WN18RR","full_name":null,"description_markdown":"**WN18RR** is a link prediction dataset created from WN18, which is a subset of WordNet. WN18 consists of 18 relations and 40,943 entities. However, many text triples are obtained by inverting triples from the training set. Thus the WN18RR dataset is created to ensure that the evaluation dataset does not have inverse relation test leakage. In summary, WN18RR dataset contains 93,003 triples with 40,943 entities and 11 relation types.\r\n\r\nSource: [End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion](https://arxiv.org/abs/1811.04441)","description_withheld":null,"homepage":"https://download.microsoft.com/download/8/7/0/8700516A-AB3D-4850-B4BB-805C515AECE1/FB15K-237.2.zip","introduced_date":"2013-12-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","first_author":"Antoine Bordes","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Knowledge Graph Completion","url":"/task/knowledge-graph-completion","datasets_with_task":"/datasets/task/knowledge-graph-completion"},{"name":"Ancestor-descendant prediction","url":"/task/ancestor-descendant-prediction","datasets_with_task":"/datasets/task/ancestor-descendant-prediction"}],"languages":[],"variants":["WN18RR"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.WN18RR.html","frameworks":["pytorch"]},{"repo":"https://github.com/TimDettmers/ConvE","url":"https://github.com/TimDettmers/ConvE","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":394,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset_variant":"WN18RR","rows":75,"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR"],"first_row_in_archive_order":{"model":"MoCoKGC","paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","metrics":{"Hits@1":"0.665","Hits@10":"0.881","Hits@3":"0.792","MRR":"0.742"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","task":"Knowledge Graph Completion","dataset_variant":"WN18RR","rows":2,"metrics":["Hits@3","Hits@1","Hits@10"],"first_row_in_archive_order":{"model":"HAKE","paper":"/paper/learning-hierarchy-aware-knowledge-graph","metrics":{"Hits@3":"0.516"},"code_links":[{"title":"MIRALab-USTC/KGE-HAKE","url":"https://github.com/MIRALab-USTC/KGE-HAKE"},{"title":"thu-keg/eakit","url":"https://github.com/thu-keg/eakit"},{"title":"MIRALab-USTC/KGE-DURA","url":"https://github.com/MIRALab-USTC/KGE-DURA"},{"title":"miralab-ustc/qe-cone","url":"https://github.com/miralab-ustc/qe-cone"},{"title":"kamigaito/icml2022","url":"https://github.com/kamigaito/icml2022"},{"title":"guixiangyu1/KGE-HAKE-master","url":"https://github.com/guixiangyu1/KGE-HAKE-master"},{"title":"jiean001/models_m","url":"https://github.com/jiean001/models_m/tree/main/hake"},{"title":"kingcong/models","url":"https://github.com/kingcong/models/tree/main/hake"},{"title":"zyjcs/KGE-HAE","url":"https://github.com/zyjcs/KGE-HAE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/ancestor-descendant-prediction-on-wn18rr","task":"Ancestor-descendant prediction","dataset_variant":"WN18RR","rows":1,"metrics":["mAP-0%","mAP-50%","mAP-100%"],"first_row_in_archive_order":{"model":"ConE","paper":"/paper/modeling-heterogeneous-hierarchies-with","metrics":{"mAP-0%":"0.895","mAP-100%":"0.679","mAP-50%":"0.801"},"code_links":[{"title":"snap-stanford/ConE","url":"https://github.com/snap-stanford/ConE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":69,"of":69,"counts":{"papers_with_a_benchmark_row":69,"with_a_code_link":60,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":69,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":5,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/distance-adaptive-quaternion-knowledge-graph","slug":"distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","arxiv_id":"2412.04076","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","slug":"mocokgc-momentum-contrast-entity-encoding-for","title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","date":"2024-11-12","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/kermit-knowledge-graph-completion-of-enhanced","slug":"kermit-knowledge-graph-completion-of-enhanced","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","date":"2023-09-26","arxiv_id":"2309.14770","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocosa-momentum-contrast-for-knowledge-graph","slug":"mocosa-momentum-contrast-for-knowledge-graph","title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","date":"2023-08-16","arxiv_id":"2308.08204","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/logical-entity-representation-in-knowledge","slug":"logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["glaciohound/lerp"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/logical-entity-representation-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12738"}}}},{"paper":"/paper/self-distillation-with-meta-learning-for-1","slug":"self-distillation-with-meta-learning-for-1","title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","date":"2023-05-20","arxiv_id":"2305.12209","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}}}},{"paper":"/paper/palt-parameter-lite-transfer-of-language","slug":"palt-parameter-lite-transfer-of-language","title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","date":"2022-10-25","arxiv_id":"2210.13715","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["tranhungnghiep/meim-kge"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}}}},{"paper":"/paper/joint-language-semantic-and-structure","slug":"joint-language-semantic-and-structure","title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","date":"2022-09-19","arxiv_id":"2209.08721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/greenkgc-a-lightweight-knowledge-graph","slug":"greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","arxiv_id":"2208.09137","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/language-models-as-knowledge-embeddings","slug":"language-models-as-knowledge-embeddings","title":"Language Models as Knowledge Embeddings","date":"2022-06-25","arxiv_id":"2206.12617","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["neph0s/lmke"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-as-knowledge-embeddings#ran","syntology_url":"https://syntology.ai/paper/2206.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12617"}}}},{"paper":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["zjunlp/relphormer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}}}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}}}},{"paper":"/paper/from-discrimination-to-generation-knowledge","slug":"from-discrimination-to-generation-knowledge","title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","date":"2022-02-04","arxiv_id":"2202.02113","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/modeling-heterogeneous-hierarchies-with","slug":"modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","arxiv_id":"2110.14923","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["snap-stanford/ConE"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}}}},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgrefiner-knowledge-graph-refinement-for","slug":"kgrefiner-knowledge-graph-refinement-for","title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","date":"2021-06-27","arxiv_id":"2106.14233","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/duality-induced-regularizer-for-tensor","slug":"duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["MIRALab-USTC/KGE-DURA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/duality-induced-regularizer-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2011.05816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05816"}}}},{"paper":"/paper/probabilistic-case-based-reasoning-for-open","slug":"probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mlmlm-link-prediction-with-mean-likelihood","slug":"mlmlm-link-prediction-with-mean-likelihood","title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","date":"2020-09-15","arxiv_id":"2009.07058","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hitter-hierarchical-transformers-for","slug":"hitter-hierarchical-transformers-for","title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","date":"2020-08-28","arxiv_id":"2008.12813","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hitter-hierarchical-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2008.12813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12813"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","slug":"low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":"2005.00545","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":8,"official":{"repos":["tensorflow/neural-structured-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/low-dimensional-hyperbolic-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2005.00545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00545"}}}},{"paper":"/paper/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contextual-parameter-generation-for-knowledge","slug":"contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-via-graph","slug":"knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/orthogonal-relation-transforms-with-graph","slug":"orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","arxiv_id":"1911.04910","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}}}},{"paper":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["malllabiisc/InteractE"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}}}},{"paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","slug":"drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["yao8839836/kg-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}}}},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}}}},{"paper":"/paper/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["deepakn97/relationPrediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}}}},{"paper":"/paper/190600687","slug":"190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","arxiv_id":"1906.00687","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adaptive-convolution-for-multi-relational","slug":"adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/multi-relational-poincare-graph-embeddings","slug":"multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","arxiv_id":"1905.09791","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ibalazevic/multirelational-poincare"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-relational-poincare-graph-embeddings#ran","syntology_url":"https://syntology.ai/paper/1905.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09791"}}}},{"paper":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}}}},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/nscaching-simple-and-efficient-negative","slug":"nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}}}},{"paper":"/paper/predicting-semantic-relations-using-global","slug":"predicting-semantic-relations-using-global","title":"Predicting Semantic Relations using Global Graph Properties","date":"2018-08-27","arxiv_id":"1808.08644","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-capsule-network-based-embedding-model-for-1","slug":"a-capsule-network-based-embedding-model-for-1","title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","date":"2018-08-13","arxiv_id":"1808.04122","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/CapsE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-capsule-network-based-embedding-model-for-1#ran","syntology_url":"https://syntology.ai/paper/1808.04122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04122"}}}},{"paper":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/m-walk-learning-to-walk-over-graphs-using","slug":"m-walk-learning-to-walk-over-graphs-using","title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","date":"2018-02-12","arxiv_id":"1802.04394","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-novel-embedding-model-for-knowledge-base","slug":"a-novel-embedding-model-for-knowledge-base","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","date":"2017-12-06","arxiv_id":"1712.02121","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/ConvKB"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-novel-embedding-model-for-knowledge-base#ran","syntology_url":"https://syntology.ai/paper/1712.02121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02121"}}}},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}}}},{"paper":"/paper/convolutional-2d-knowledge-graph-embeddings","slug":"convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","arxiv_id":"1707.01476","rows_on_this_dataset":2,"code_links":8,"syntology":null},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","slug":"complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","rows_on_this_dataset":1,"code_links":9,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","slug":"embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","arxiv_id":"1412.6575","rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","slug":"translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":8,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/distance-adaptive-quaternion-knowledge-graph","slug":"distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","arxiv_id":"2412.04076","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","slug":"mocokgc-momentum-contrast-entity-encoding-for","title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","date":"2024-11-12","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/kermit-knowledge-graph-completion-of-enhanced","slug":"kermit-knowledge-graph-completion-of-enhanced","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","date":"2023-09-26","arxiv_id":"2309.14770","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocosa-momentum-contrast-for-knowledge-graph","slug":"mocosa-momentum-contrast-for-knowledge-graph","title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","date":"2023-08-16","arxiv_id":"2308.08204","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/logical-entity-representation-in-knowledge","slug":"logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["glaciohound/lerp"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/logical-entity-representation-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12738"}}}},{"paper":"/paper/self-distillation-with-meta-learning-for-1","slug":"self-distillation-with-meta-learning-for-1","title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","date":"2023-05-20","arxiv_id":"2305.12209","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}}}},{"paper":"/paper/palt-parameter-lite-transfer-of-language","slug":"palt-parameter-lite-transfer-of-language","title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","date":"2022-10-25","arxiv_id":"2210.13715","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["tranhungnghiep/meim-kge"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}}}},{"paper":"/paper/joint-language-semantic-and-structure","slug":"joint-language-semantic-and-structure","title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","date":"2022-09-19","arxiv_id":"2209.08721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/greenkgc-a-lightweight-knowledge-graph","slug":"greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","arxiv_id":"2208.09137","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/language-models-as-knowledge-embeddings","slug":"language-models-as-knowledge-embeddings","title":"Language Models as Knowledge Embeddings","date":"2022-06-25","arxiv_id":"2206.12617","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["neph0s/lmke"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-as-knowledge-embeddings#ran","syntology_url":"https://syntology.ai/paper/2206.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12617"}}}},{"paper":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["zjunlp/relphormer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}}}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}}}},{"paper":"/paper/from-discrimination-to-generation-knowledge","slug":"from-discrimination-to-generation-knowledge","title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","date":"2022-02-04","arxiv_id":"2202.02113","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/modeling-heterogeneous-hierarchies-with","slug":"modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","arxiv_id":"2110.14923","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["snap-stanford/ConE"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}}}},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgrefiner-knowledge-graph-refinement-for","slug":"kgrefiner-knowledge-graph-refinement-for","title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","date":"2021-06-27","arxiv_id":"2106.14233","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/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,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/duality-induced-regularizer-for-tensor","slug":"duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["MIRALab-USTC/KGE-DURA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/duality-induced-regularizer-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2011.05816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05816"}}}},{"paper":"/paper/probabilistic-case-based-reasoning-for-open","slug":"probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mlmlm-link-prediction-with-mean-likelihood","slug":"mlmlm-link-prediction-with-mean-likelihood","title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","date":"2020-09-15","arxiv_id":"2009.07058","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hitter-hierarchical-transformers-for","slug":"hitter-hierarchical-transformers-for","title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","date":"2020-08-28","arxiv_id":"2008.12813","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hitter-hierarchical-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2008.12813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12813"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","slug":"low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":"2005.00545","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":8,"official":{"repos":["tensorflow/neural-structured-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/low-dimensional-hyperbolic-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2005.00545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00545"}}}},{"paper":"/paper/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contextual-parameter-generation-for-knowledge","slug":"contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-via-graph","slug":"knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/orthogonal-relation-transforms-with-graph","slug":"orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","arxiv_id":"1911.04910","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}}}},{"paper":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["malllabiisc/InteractE"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}}}},{"paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","slug":"drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["yao8839836/kg-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}}}},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}}}},{"paper":"/paper/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["deepakn97/relationPrediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}}}},{"paper":"/paper/190600687","slug":"190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","arxiv_id":"1906.00687","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adaptive-convolution-for-multi-relational","slug":"adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/multi-relational-poincare-graph-embeddings","slug":"multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","arxiv_id":"1905.09791","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ibalazevic/multirelational-poincare"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-relational-poincare-graph-embeddings#ran","syntology_url":"https://syntology.ai/paper/1905.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09791"}}}},{"paper":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}}}},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/nscaching-simple-and-efficient-negative","slug":"nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}}}},{"paper":"/paper/predicting-semantic-relations-using-global","slug":"predicting-semantic-relations-using-global","title":"Predicting Semantic Relations using Global Graph Properties","date":"2018-08-27","arxiv_id":"1808.08644","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-capsule-network-based-embedding-model-for-1","slug":"a-capsule-network-based-embedding-model-for-1","title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","date":"2018-08-13","arxiv_id":"1808.04122","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/CapsE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-capsule-network-based-embedding-model-for-1#ran","syntology_url":"https://syntology.ai/paper/1808.04122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04122"}}}},{"paper":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/m-walk-learning-to-walk-over-graphs-using","slug":"m-walk-learning-to-walk-over-graphs-using","title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","date":"2018-02-12","arxiv_id":"1802.04394","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-novel-embedding-model-for-knowledge-base","slug":"a-novel-embedding-model-for-knowledge-base","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","date":"2017-12-06","arxiv_id":"1712.02121","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/ConvKB"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-novel-embedding-model-for-knowledge-base#ran","syntology_url":"https://syntology.ai/paper/1712.02121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02121"}}}},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}}}},{"paper":"/paper/convolutional-2d-knowledge-graph-embeddings","slug":"convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","arxiv_id":"1707.01476","rows_on_this_dataset":2,"code_links":8,"syntology":null},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","slug":"complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","rows_on_this_dataset":1,"code_links":9,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","slug":"embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","arxiv_id":"1412.6575","rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","slug":"translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":8,"syntology":null}],"papers_where_code_ran":22,"papers_where_code_ran_first_page":"/dataset/wn18rr/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/wn18rr/papers/ran/1","json":"/dataset/wn18rr/papers/ran/1.json","rows":22}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":24,"samples_harvested":118,"samples_ran":90,"samples_constructed":3,"samples_ran_checked":59,"samples_ran_instrument_failed":31,"samples_unverified":28,"pointer_only_for_licence":32,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":22,"papers_with_a_run_with_no_instrument_failure":17,"papers_where_every_run_was_an_instrument_failure":5,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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)"},"since_archive_judged":{"papers":2,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/link-prediction-on-wn18rr","since_archive":"/sota/link-prediction-on-wn18rr#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","since_archive":"/sota/knowledge-graph-completion-on-wn18rr#since-judged","papers_judged":2,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"370f6e6d8f0cc2bfdf4f6d6c824116210eeb356d097e990720efcfbff92958a2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}