{"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":"/sota/link-prediction-on-fb15k-237","task":{"name":"Link Prediction","url":"/task/link-prediction","note":null},"dataset":{"name":"FB15k-237","url":"/dataset/fb15k-237"},"category":"Natural Language Processing","categories":["Graphs","Natural Language Processing"],"category_note":null,"description":"**Link Prediction** is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Inductive Representation Learning on Large Graphs](https://arxiv.org/pdf/1706.02216v4.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Hits@1","Hits@3","Hits@10","MRR","MR","training time (s)","Hit@1","Hit@10"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Hits@1":null,"Hits@3":null,"Hits@10":null,"MRR":"higher","MR":null,"training time (s)":null,"Hit@1":null,"Hit@10":null}},"counts":{"rows":75,"rows_with_code":67,"rows_with_paper_page":75,"rows_dated":75,"rows_using_additional_data":3},"rows":[{"rank_in_archive_order":1,"model":"NBFNet","metrics":{"Hits@1":"0.321","Hits@10":"0.599","Hits@3":"0.454","MR":"114","MRR":"0.415"},"uses_additional_data":false,"paper_date":"2021-06-13","paper":"/paper/neural-bellman-ford-networks-a-general-graph","paper_url":"https://arxiv.org/abs/2106.06935v4","paper_title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","code":"https://github.com/DeepGraphLearning/NBFNet","n_code_links":3,"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"]},"syntology":{"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_samples":15,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":2,"model":"KG-R3 (this work)","metrics":{"Hits@1":"0.315","Hits@3":"0.413","MRR":"0.39"},"uses_additional_data":false,"paper_date":"2022-12-19","paper":"/paper/a-retrieve-and-read-framework-for-knowledge","paper_url":"https://arxiv.org/abs/2212.09724v3","paper_title":"A Retrieve-and-Read Framework for Knowledge Graph Link Prediction","code":"https://github.com/OSU-NLP-Group/KG-R3","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"Relphormer","metrics":{"Hits@1":"0.314","Hits@10":"0.481","MRR":"0.371"},"uses_additional_data":false,"paper_date":"2022-05-22","paper":"/paper/relphormer-relational-graph-transformer-for","paper_url":"https://arxiv.org/abs/2205.10852v6","paper_title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","code":"https://github.com/zjunlp/relphormer","n_code_links":1,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":4,"model":"MetaSD","metrics":{"Hits@1":"0.300","Hits@10":"0.571","Hits@3":"0.428","MRR":"0.391"},"uses_additional_data":false,"paper_date":"2023-05-20","paper":"/paper/self-distillation-with-meta-learning-for-1","paper_url":"https://arxiv.org/abs/2305.12209v1","paper_title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","code":"https://github.com/pldlgb/MetaSD","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":5,"model":"ComplEx-N3-RP","metrics":{"Hits@1":"0.298","Hits@10":"0.568","Hits@3":"0.424","MR":"163","MRR":"0.389"},"uses_additional_data":false,"paper_date":"2021-10-06","paper":"/paper/relation-prediction-as-an-auxiliary-training","paper_url":"https://arxiv.org/abs/2110.02834v1","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","code":"https://github.com/facebookresearch/ssl-relation-prediction","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":6,"model":"SAFRAN","metrics":{"Hits@1":"0.298","Hits@10":"0.537","MRR":"0.389"},"uses_additional_data":false,"paper_date":"2021-09-16","paper":"/paper/safran-an-interpretable-rule-based-link","paper_url":"https://arxiv.org/abs/2109.08002v1","paper_title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","code":"https://github.com/OpenBioLink/SAFRAN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":7,"model":"MoCoKGC","metrics":{"Hits@1":"0.296","Hits@10":"0.580","Hits@3":"0.431","MRR":"0.391"},"uses_additional_data":false,"paper_date":"2024-11-12","paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","paper_url":"https://aclanthology.org/2024.emnlp-main.832/","paper_title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":8,"model":"MoCoSA","metrics":{"Hits@1":"0.292","Hits@10":"0.578","Hits@3":"0.42","MRR":"0.387"},"uses_additional_data":false,"paper_date":"2023-08-16","paper":"/paper/mocosa-momentum-contrast-for-knowledge-graph","paper_url":"https://arxiv.org/abs/2308.08204v1","paper_title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":9,"model":"kNN-KGE","metrics":{"Hits@1":"0.280","Hits@10":"0.550","Hits@3":"0.404","MR":"185","MRR":"0.370"},"uses_additional_data":true,"paper_date":"2022-01-14","paper":"/paper/reasoning-through-memorization-nearest","paper_url":"https://arxiv.org/abs/2201.05575v4","paper_title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","code":"https://github.com/zjunlp/knn-kg","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":10,"model":"ComplEx-DURA","metrics":{"Hits@1":"0.276","Hits@10":"0.560","MRR":"0.371"},"uses_additional_data":false,"paper_date":"2020-11-11","paper":"/paper/duality-induced-regularizer-for-tensor","paper_url":"https://arxiv.org/abs/2011.05816v2","paper_title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":3,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":11,"model":"MEIM","metrics":{"Hits@1":"0.274","Hits@10":"0.557","Hits@3":"0.406","MRR":"0.369"},"uses_additional_data":false,"paper_date":"2022-09-30","paper":"/paper/meim-multi-partition-embedding-interaction","paper_url":"https://arxiv.org/abs/2209.15597v2","paper_title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","code":"https://github.com/tranhungnghiep/AnalyzingKGEmbeddings","n_code_links":4,"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"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":7,"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"}}}},{"rank_in_archive_order":12,"model":"NePTuNe","metrics":{"Hits@1":"0.272","Hits@10":"0.547","Hits@3":"0.404","MRR":"0.366"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/neptune-neural-powered-tucker-network-for","paper_url":"https://arxiv.org/abs/2104.07824v1","paper_title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","code":"https://github.com/luffycodes/neptune","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":13,"model":"MEI","metrics":{"Hits@1":"0.271","Hits@10":"0.552","Hits@3":"0.402","MRR":"0.365"},"uses_additional_data":false,"paper_date":"2020-06-29","paper":"/paper/multi-partition-embedding-interaction-with","paper_url":"https://arxiv.org/abs/2006.16365v2","paper_title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","code":"https://github.com/tranhungnghiep/AnalyzeKGE","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"SE-GNN (ours)","metrics":{"Hits@1":"0.271","Hits@10":"0.549","Hits@3":"0.399","MR":"157","MRR":"0.365"},"uses_additional_data":false,"paper_date":"2021-09-24","paper":"/paper/how-does-knowledge-graph-embedding","paper_url":"https://arxiv.org/abs/2109.11800v3","paper_title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","code":"https://github.com/renli1024/se-gnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":15,"model":"RESCAL (SCE w/ LS pretrained)","metrics":{"Hits@1":"0.269","Hits@10":"0.55","Hits@3":"0.402","MRR":"0.364"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/unified-interpretation-of-softmax-cross","paper_url":"https://arxiv.org/abs/2106.07250v4","paper_title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","code":"https://github.com/kamigaito/acl2021kge","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":16,"model":"RESCAL (SCE w/ LS)","metrics":{"Hits@1":"0.269","Hits@10":"0.548","Hits@3":"0.4","MRR":"0.363"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/unified-interpretation-of-softmax-cross","paper_url":"https://arxiv.org/abs/2106.07250v4","paper_title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","code":"https://github.com/kamigaito/acl2021kge","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":17,"model":"QuatDE","metrics":{"Hits@1":"0.268","Hits@10":"0.563","Hits@3":"0.40","MR":"90","MRR":"0.365"},"uses_additional_data":false,"paper_date":"2021-05-19","paper":"/paper/quatde-dynamic-quaternion-embedding-for","paper_url":"https://arxiv.org/abs/2105.09002v2","paper_title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","code":"https://github.com/hopkin-ghp/QuatDE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":18,"model":"SAttLE","metrics":{"Hits@1":"0.268","Hits@10":"0.545","Hits@3":"0.396","MRR":"0.36"},"uses_additional_data":false,"paper_date":"2021-12-20","paper":"/paper/self-attention-presents-low-dimensional","paper_url":"https://arxiv.org/abs/2112.10644v3","paper_title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","code":"https://github.com/peyman-bi/sattle","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":19,"model":"GC-OTE","metrics":{"Hits@1":"0.267","Hits@10":"0.550","Hits@3":"0.396","MR":"154","MRR":"0.361"},"uses_additional_data":false,"paper_date":"2019-11-09","paper":"/paper/orthogonal-relation-transforms-with-graph","paper_url":"https://arxiv.org/abs/1911.04910v3","paper_title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":20,"model":"StAR","metrics":{"Hits@1":"0.266","Hits@10":"0.562","Hits@3":"0.404","MR":"117","MRR":"0.365"},"uses_additional_data":true,"paper_date":"2020-04-30","paper":"/paper/semantic-triple-encoder-for-fast-open-set","paper_url":"https://arxiv.org/abs/2004.14781v2","paper_title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","code":"https://github.com/wangbo9719/StAR_KGC","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":21,"model":"KERMIT","metrics":{"Hits@1":"0.266","Hits@10":"0.547","Hits@3":"0.396","MRR":"0.359"},"uses_additional_data":false,"paper_date":"2023-09-26","paper":"/paper/kermit-knowledge-graph-completion-of-enhanced","paper_url":"https://arxiv.org/abs/2309.14770v2","paper_title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","code":"https://github.com/lirt1231/kermit","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"TuckER","metrics":{"Hits@1":"0.266","Hits@10":"0.544","Hits@3":"0.394","MRR":"0.358"},"uses_additional_data":false,"paper_date":"2019-01-28","paper":"/paper/tucker-tensor-factorization-for-knowledge","paper_url":"https://arxiv.org/abs/1901.09590v2","paper_title":"TuckER: Tensor Factorization for Knowledge Graph Completion","code":"https://github.com/Sujit-O/pykg2vec","n_code_links":5,"official":null,"syntology":null},{"rank_in_archive_order":23,"model":"RotatE + GreenKGC (Ours)","metrics":{"Hits@1":"0.265","Hits@10":"0.507","Hits@3":"0.369","MRR":"0.345"},"uses_additional_data":false,"paper_date":"2022-08-19","paper":"/paper/greenkgc-a-lightweight-knowledge-graph","paper_url":"https://arxiv.org/abs/2208.09137v2","paper_title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","code":"https://github.com/yunchengwang/greenkgc","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":24,"model":"LineaRE","metrics":{"Hits@1":"0.264","Hits@10":"0.545","Hits@3":"0.391","MR":"155","MRR":"0.357"},"uses_additional_data":false,"paper_date":"2020-04-21","paper":"/paper/knowledge-graph-embedding-with-linear","paper_url":"https://arxiv.org/abs/2004.10037v2","paper_title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","code":"https://github.com/pengyanhui/LineaRE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":25,"model":"CompGCN","metrics":{"Hits@1":"0.264","Hits@10":"0.535","Hits@3":"0.390","MR":"197","MRR":"0.355"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/composition-based-multi-relational-graph","paper_url":"https://arxiv.org/abs/1911.03082v2","paper_title":"Composition-based Multi-Relational Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/compGCN","n_code_links":4,"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_samples":6,"n_pointer_only_licence":3,"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"}}}},{"rank_in_archive_order":26,"model":"TuckER-RP","metrics":{"Hits@1":"0.264","Hits@10":"0.535","Hits@3":"0.388","MRR":"0.354"},"uses_additional_data":false,"paper_date":"2021-10-06","paper":"/paper/relation-prediction-as-an-auxiliary-training","paper_url":"https://arxiv.org/abs/2110.02834v1","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","code":"https://github.com/facebookresearch/ssl-relation-prediction","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":27,"model":"InteractE","metrics":{"Hits@1":"0.263","Hits@10":"0.535","MR":"172","MRR":"0.354"},"uses_additional_data":false,"paper_date":"2019-11-01","paper":"/paper/interacte-improving-convolution-based","paper_url":"https://arxiv.org/abs/1911.00219v3","paper_title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","code":"https://github.com/malllabiisc/InteractE","n_code_links":1,"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"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":28,"model":"RESCAL + Decom","metrics":{"Hits@1":"0.261","Hits@10":"0.536","Hits@3":"0.388","MRR":"0.354"},"uses_additional_data":false,"paper_date":"2019-11-11","paper":"/paper/decompressing-knowledge-graph-representations","paper_url":"https://arxiv.org/abs/1911.04053v2","paper_title":"Decompressing Knowledge Graph Representations for Link Prediction","code":"https://github.com/shawnkx/Decom","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":29,"model":"ConvR","metrics":{"Hits@1":"0.261","Hits@10":"0.528","Hits@3":"0.385","MRR":"0.350"},"uses_additional_data":false,"paper_date":"2019-06-01","paper":"/paper/adaptive-convolution-for-multi-relational","paper_url":"https://aclanthology.org/N19-1103","paper_title":"Adaptive Convolution for Multi-Relational Learning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":30,"model":"Structure-Aware Convolutional Networks","metrics":{"Hits@1":"0.26","Hits@10":"0.54","Hits@3":"0.39","MRR":"0.35"},"uses_additional_data":false,"paper_date":"2018-11-11","paper":"/paper/end-to-end-structure-aware-convolutional","paper_url":"http://arxiv.org/abs/1811.04441v2","paper_title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","code":"https://github.com/JD-AI-Research-Silicon-Valley/SACN","n_code_links":1,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":31,"model":"RefE","metrics":{"Hits@1":"0.256","Hits@10":"0.541","Hits@3":"0.390","MRR":"0.351"},"uses_additional_data":false,"paper_date":"2020-05-01","paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","paper_url":"https://arxiv.org/abs/2005.00545v1","paper_title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","code":"https://github.com/tensorflow/neural-structured-learning/tree/master/research/kg_hyp_emb","n_code_links":3,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":7,"n_samples":11,"n_pointer_only_licence":8,"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"}}}},{"rank_in_archive_order":32,"model":"DensE","metrics":{"Hits@1":"0.256","Hits@10":"0.535","Hits@3":"0.384","MR":"169","MRR":"0.349"},"uses_additional_data":false,"paper_date":"2020-08-11","paper":"/paper/dense-an-enhanced-non-abelian-group","paper_url":"https://arxiv.org/abs/2008.04548v2","paper_title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","code":"https://github.com/anonymous-dense-submission/DensE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"DRUM (T=3)","metrics":{"Hits@1":"0.255","Hits@10":"0.516","Hits@3":"0.378","MRR":"0.343"},"uses_additional_data":false,"paper_date":"2019-10-31","paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","paper_url":"https://arxiv.org/abs/1911.00055v1","paper_title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","code":"https://github.com/alisadeghian/DRUM","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"HypER","metrics":{"Hits@1":"0.252","Hits@10":"0.520","Hits@3":"0.376","MRR":"0.341"},"uses_additional_data":false,"paper_date":"2018-08-21","paper":"/paper/hypernetwork-knowledge-graph-embeddings","paper_url":"https://arxiv.org/abs/1808.07018v5","paper_title":"Hypernetwork Knowledge Graph Embeddings","code":"https://github.com/ibalazevic/HypER","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":35,"model":"TransE + GreenKGC (Ours)","metrics":{"Hits@1":"0.251","Hits@10":"0.493","Hits@3":"0.356","MRR":"0.331"},"uses_additional_data":false,"paper_date":"2022-08-19","paper":"/paper/greenkgc-a-lightweight-knowledge-graph","paper_url":"https://arxiv.org/abs/2208.09137v2","paper_title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","code":"https://github.com/yunchengwang/greenkgc","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":36,"model":"HAKE","metrics":{"Hits@1":"0.25","Hits@3":"0.381","MRR":"0.346"},"uses_additional_data":false,"paper_date":"2019-11-21","paper":"/paper/learning-hierarchy-aware-knowledge-graph","paper_url":"https://arxiv.org/abs/1911.09419v3","paper_title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":9,"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"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_samples":8,"n_pointer_only_licence":1,"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"}}}},{"rank_in_archive_order":37,"model":"SimKGCIB(+PB+SN)","metrics":{"Hits@1":"0.249","Hits@10":"0.511","Hits@3":"0.365","MRR":"0.336"},"uses_additional_data":false,"paper_date":"2022-03-04","paper":"/paper/simkgc-simple-contrastive-knowledge-graph","paper_url":"https://arxiv.org/abs/2203.02167v1","paper_title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","code":"https://github.com/intfloat/simkgc","n_code_links":2,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_samples":6,"n_pointer_only_licence":3,"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"}}}},{"rank_in_archive_order":38,"model":"QuatE","metrics":{"Hits@1":"0.248","Hits@10":"0.550","Hits@3":"0.382","MR":"87","MRR":"0.348"},"uses_additional_data":false,"paper_date":"2019-04-23","paper":"/paper/quaternion-knowledge-graph-embedding","paper_url":"https://arxiv.org/abs/1904.10281v3","paper_title":"Quaternion Knowledge Graph Embeddings","code":"https://github.com/cheungdaven/QuatE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"DaBR","metrics":{"Hits@1":"0.247","Hits@10":"0.572","Hits@3":"0.410","MR":"83","MRR":"0.373"},"uses_additional_data":false,"paper_date":"2024-12-05","paper":"/paper/distance-adaptive-quaternion-knowledge-graph","paper_url":"https://arxiv.org/abs/2412.04076v2","paper_title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","code":"https://github.com/llqy123/dabr","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":40,"model":"ConE","metrics":{"Hits@1":"0.247","Hits@10":"0.54","Hits@3":"0.381","MRR":"0.345"},"uses_additional_data":false,"paper_date":"2021-10-28","paper":"/paper/modeling-heterogeneous-hierarchies-with","paper_url":"https://arxiv.org/abs/2110.14923v2","paper_title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","code":"https://github.com/snap-stanford/ConE","n_code_links":1,"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"]},"syntology":{"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":41,"model":"Rot-Pro","metrics":{"Hits@1":"0.246","Hits@10":"0.540","Hits@3":"0.383","MRR":"0.344"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/rot-pro-modeling-transitivity-by-projection","paper_url":"https://arxiv.org/abs/2110.14450v1","paper_title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","code":"https://github.com/tewiSong/Rot-Pro","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":42,"model":"MuRP","metrics":{"Hits@1":"0.245","Hits@10":"0.521","Hits@3":"0.370","MRR":"0.336"},"uses_additional_data":false,"paper_date":"2019-05-23","paper":"/paper/multi-relational-poincare-graph-embeddings","paper_url":"https://arxiv.org/abs/1905.09791v3","paper_title":"Multi-relational Poincaré Graph Embeddings","code":"https://github.com/ibalazevic/multirelational-poincare","n_code_links":1,"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_samples":6,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":43,"model":"RotatE","metrics":{"Hits@1":"0.241","Hits@10":"0.533","Hits@3":"0.375","MR":"177","MRR":"0.338"},"uses_additional_data":false,"paper_date":"2019-02-26","paper":"/paper/rotate-knowledge-graph-embedding-by","paper_url":"http://arxiv.org/abs/1902.10197v1","paper_title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/rotate.py","n_code_links":10,"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":44,"model":"BoxE","metrics":{"Hits@1":"0.238","Hits@10":"0.538","MRR":"0.337"},"uses_additional_data":false,"paper_date":"2020-07-13","paper":"/paper/boxe-a-box-embedding-model-for-knowledge-base","paper_url":"https://arxiv.org/abs/2007.06267v2","paper_title":"BoxE: A Box Embedding Model for Knowledge Base Completion","code":"https://github.com/ralphabb/BoxE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":45,"model":"ConvE","metrics":{"Hits@1":"0.237","Hits@10":"0.501","Hits@3":"0.356","MRR":"0.325"},"uses_additional_data":false,"paper_date":"2017-07-05","paper":"/paper/convolutional-2d-knowledge-graph-embeddings","paper_url":"http://arxiv.org/abs/1707.01476v6","paper_title":"Convolutional 2D Knowledge Graph Embeddings","code":"https://github.com/TimDettmers/ConvE","n_code_links":8,"official":null,"syntology":null},{"rank_in_archive_order":46,"model":"pRotatE","metrics":{"Hits@1":"0.23","Hits@10":"0.524","Hits@3":"0.365","MR":"178","MRR":"0.328"},"uses_additional_data":false,"paper_date":"2019-02-26","paper":"/paper/rotate-knowledge-graph-embedding-by","paper_url":"http://arxiv.org/abs/1902.10197v1","paper_title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/rotate.py","n_code_links":10,"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":47,"model":"LP-BERT","metrics":{"Hits@1":"0.223","Hits@10":"0.490","Hits@3":"0.336","MR":"154","MRR":"0.31"},"uses_additional_data":true,"paper_date":"2022-01-13","paper":"/paper/lp-bert-multi-task-pre-training-knowledge","paper_url":"https://arxiv.org/abs/2201.04843v2","paper_title":"Multi-task Pre-training Language Model for Semantic Network Completion","code":"https://github.com/763337092/LP-BERT","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":48,"model":"RotatE","metrics":{"Hits@1":"0.217","Hits@10":"0.511","Hits@3":"0.347","MR":"176","MRR":"0.314","training time (s)":"857"},"uses_additional_data":false,"paper_date":"2019-03-02","paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","paper_url":"http://arxiv.org/abs/1903.00757v1","paper_title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","code":"https://github.com/DeepGraphLearning/graphvite","n_code_links":1,"official":null,"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}}}},{"rank_in_archive_order":49,"model":"KGLM","metrics":{"Hits@1":"0.200","Hits@10":"0.468","Hits@3":"0.314","MR":"125.9","MRR":".289"},"uses_additional_data":false,"paper_date":"2022-11-04","paper":"/paper/kglm-integrating-knowledge-graph-structure-in","paper_url":"https://arxiv.org/abs/2211.02744v2","paper_title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","code":"https://github.com/ibpa/kglm","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":50,"model":"JoBi ComplEx","metrics":{"Hits@1":"0.199","Hits@10":"0.479","Hits@3":"0.319","MRR":"0.29"},"uses_additional_data":false,"paper_date":"2019-10-25","paper":"/paper/using-pairwise-occurrence-information-to","paper_url":"https://arxiv.org/abs/1910.11583v1","paper_title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":51,"model":"TransE","metrics":{"Hits@1":"0.1987","Hits@10":".4709","MRR":"0.2904"},"uses_additional_data":false,"paper_date":"2013-12-01","paper":"/paper/translating-embeddings-for-modeling-multi","paper_url":"http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data","paper_title":"Translating Embeddings for Modeling Multi-relational Data","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/transe.py","n_code_links":8,"official":null,"syntology":null},{"rank_in_archive_order":52,"model":"GenKGC","metrics":{"Hits@1":"0.192","Hits@10":"0.439","Hits@3":"0.355"},"uses_additional_data":false,"paper_date":"2022-02-04","paper":"/paper/from-discrimination-to-generation-knowledge","paper_url":"https://arxiv.org/abs/2202.02113v7","paper_title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","code":"https://github.com/zjunlp/PromptKG/tree/main/research/GenKGC","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":53,"model":"MLMLM","metrics":{"Hits@1":"0.1871","Hits@10":"0.4026","Hits@3":"0.2820","MR":"411","MRR":"0.2591"},"uses_additional_data":false,"paper_date":"2020-09-15","paper":"/paper/mlmlm-link-prediction-with-mean-likelihood","paper_url":"https://arxiv.org/abs/2009.07058v1","paper_title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":54,"model":"RR-GCN-PPV","metrics":{"Hits@1":"0.157","Hits@10":"0.412","Hits@3":"0.256","MRR":"0.238"},"uses_additional_data":false,"paper_date":"2022-03-04","paper":"/paper/r-gcn-the-r-could-stand-for-random","paper_url":"https://arxiv.org/abs/2203.02424v2","paper_title":"R-GCN: The R Could Stand for Random","code":"https://github.com/predict-idlab/RR-GCN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":55,"model":"TransD","metrics":{"Hits@1":"0.1483","Hits@10":"0.4605","MRR":"0.2527"},"uses_additional_data":false,"paper_date":"2015-07-01","paper":"/paper/knowledge-graph-embedding-via-dynamic-mapping","paper_url":"https://aclanthology.org/P15-1067","paper_title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","code":"https://github.com/yangyucheng000/transX","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":56,"model":"Inverse Model","metrics":{"Hits@1":"0.007","Hits@10":"0.014","Hits@3":"0.011","MR":"7030","MRR":"0.010"},"uses_additional_data":false,"paper_date":"2017-07-05","paper":"/paper/convolutional-2d-knowledge-graph-embeddings","paper_url":"http://arxiv.org/abs/1707.01476v6","paper_title":"Convolutional 2D Knowledge Graph Embeddings","code":"https://github.com/TimDettmers/ConvE","n_code_links":8,"official":null,"syntology":null},{"rank_in_archive_order":57,"model":"HittER","metrics":{"Hit@1":"0.279","Hit@10":"0.558","Hits@3":"0.409","MRR":"0.373"},"uses_additional_data":false,"paper_date":"2020-08-28","paper":"/paper/hitter-hierarchical-transformers-for","paper_url":"https://arxiv.org/abs/2008.12813v2","paper_title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","code":"https://github.com/zjunlp/relphormer","n_code_links":3,"official":null,"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":1,"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"}}}},{"rank_in_archive_order":58,"model":"AutoKGE","metrics":{"Hits@10":"0.555","MRR":"0.365"},"uses_additional_data":false,"paper_date":"2019-04-26","paper":"/paper/autokge-searching-scoring-functions-for","paper_url":"https://arxiv.org/abs/1904.11682v3","paper_title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","code":"https://github.com/AutoML-4Paradigm/ERAS","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":59,"model":"CP-N3-RP","metrics":{"Hits@10":"0.55","MRR":"0.366"},"uses_additional_data":false,"paper_date":"2021-10-06","paper":"/paper/relation-prediction-as-an-auxiliary-training","paper_url":"https://arxiv.org/abs/2110.02834v1","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","code":"https://github.com/facebookresearch/ssl-relation-prediction","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":60,"model":"DistMult (after variational EM)","metrics":{"Hits@10":"0.548","MRR":"0.357"},"uses_additional_data":false,"paper_date":"2019-07-01","paper":"/paper/augmenting-and-tuning-knowledge-graph","paper_url":"https://arxiv.org/abs/1907.01068v1","paper_title":"Augmenting and Tuning Knowledge Graph Embeddings","code":"https://github.com/mandt-lab/knowledge-graph-tuning","n_code_links":1,"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"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":61,"model":"KG-R3","metrics":{"Hits@10":"0.539"},"uses_additional_data":false,"paper_date":"2022-12-19","paper":"/paper/a-retrieve-and-read-framework-for-knowledge","paper_url":"https://arxiv.org/abs/2212.09724v3","paper_title":"A Retrieve-and-Read Framework for Knowledge Graph Link Prediction","code":"https://github.com/OSU-NLP-Group/KG-R3","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":62,"model":"LASS","metrics":{"Hits@10":"0.533","MR":"108"},"uses_additional_data":false,"paper_date":"2022-09-19","paper":"/paper/joint-language-semantic-and-structure","paper_url":"https://arxiv.org/abs/2209.08721v1","paper_title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","code":"https://github.com/pkusjh/lass","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":63,"model":"MDE_adv","metrics":{"Hits@10":"0.531","MR":"203","MRR":"0.344"},"uses_additional_data":false,"paper_date":"2019-05-25","paper":"/paper/mde-multi-distance-embeddings-for-link","paper_url":"https://arxiv.org/abs/1905.10702v8","paper_title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","code":"https://github.com/mlwin-de/MDE","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":64,"model":"GFA-NN","metrics":{"Hits@10":"0.522","MR":"186","MRR":"0.338"},"uses_additional_data":false,"paper_date":"2021-06-01","paper":"/paper/embedding-knowledge-graphs-attentive-to","paper_url":"https://2021.ecmlpkdd.org/wp-content/uploads/2021/07/sub_1096.pdf","paper_title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","code":"https://github.com/afshinsadeghi/GFA-NN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":65,"model":"KGRefiner","metrics":{"Hits@10":"0.489","MR":"203","MRR":"0.302","training time (s)":"1100"},"uses_additional_data":false,"paper_date":"2021-06-27","paper":"/paper/kgrefiner-knowledge-graph-refinement-for","paper_url":"https://arxiv.org/abs/2106.14233v2","paper_title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":66,"model":"ComplEx NSCaching","metrics":{"Hits@10":"0.4805","MR":"221","MRR":"0.3021"},"uses_additional_data":false,"paper_date":"2018-12-16","paper":"/paper/nscaching-simple-and-efficient-negative","paper_url":"http://arxiv.org/abs/1812.06410v2","paper_title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","code":"https://github.com/yzhangee/NSCaching","n_code_links":6,"official":null,"syntology":null},{"rank_in_archive_order":67,"model":"LogicENN","metrics":{"Hits@10":"0.473","MR":"424"},"uses_additional_data":false,"paper_date":"2019-08-20","paper":"/paper/logicenn-a-neural-based-knowledge-graphs","paper_url":"https://arxiv.org/abs/1908.07141v1","paper_title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":68,"model":"KBGAN (TransD + ComplEx)","metrics":{"Hits@10":"0.458","MRR":"0.277"},"uses_additional_data":false,"paper_date":"2017-11-11","paper":"/paper/kbgan-adversarial-learning-for-knowledge","paper_url":"http://arxiv.org/abs/1711.04071v3","paper_title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","code":"https://github.com/cai-lw/KBGAN","n_code_links":3,"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"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":69,"model":"PALT","metrics":{"Hits@10":"0.444","MR":"144"},"uses_additional_data":false,"paper_date":"2022-10-25","paper":"/paper/palt-parameter-lite-transfer-of-language","paper_url":"https://arxiv.org/abs/2210.13715v1","paper_title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","code":"https://github.com/yuanyehome/palt","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":70,"model":"ComplEx","metrics":{"Hits@10":"0.428"},"uses_additional_data":false,"paper_date":"2016-06-20","paper":"/paper/complex-embeddings-for-simple-link-prediction","paper_url":"http://arxiv.org/abs/1606.06357v1","paper_title":"Complex Embeddings for Simple Link Prediction","code":"https://github.com/pyg-team/pytorch_geometric/blob/2947af7733d87315a9218a0bfabbfda10b595f0e/torch_geometric/nn/kge/complex.py","n_code_links":9,"official":null,"syntology":null},{"rank_in_archive_order":71,"model":"ConvKB (Corrected)","metrics":{"Hits@10":".421","MR":"309","MRR":".309"},"uses_additional_data":false,"paper_date":"2019-11-10","paper":"/paper/a-re-evaluation-of-knowledge-graph-completion","paper_url":"https://arxiv.org/abs/1911.03903v3","paper_title":"A Re-evaluation of Knowledge Graph Completion Methods","code":"https://github.com/daiquocnguyen/ConvKB","n_code_links":2,"official":{"repos":["svjan5/kg-reeval"],"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}}}},{"rank_in_archive_order":72,"model":"KG-BERT","metrics":{"Hits@10":"0.42","MR":"153"},"uses_additional_data":false,"paper_date":"2019-09-07","paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","paper_url":"https://arxiv.org/abs/1909.03193v2","paper_title":"KG-BERT: BERT for Knowledge Graph Completion","code":"https://github.com/yao8839836/kg-bert","n_code_links":3,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":1,"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"}}}},{"rank_in_archive_order":73,"model":"DistMult","metrics":{"Hits@10":"0.419","MRR":"0.241"},"uses_additional_data":false,"paper_date":"2014-12-20","paper":"/paper/embedding-entities-and-relations-for-learning","paper_url":"http://arxiv.org/abs/1412.6575v4","paper_title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/distmult.py","n_code_links":10,"official":null,"syntology":null},{"rank_in_archive_order":74,"model":"KBAT (Corrected)","metrics":{"Hits@10":".331","MR":"270","MRR":".157"},"uses_additional_data":false,"paper_date":"2019-11-10","paper":"/paper/a-re-evaluation-of-knowledge-graph-completion","paper_url":"https://arxiv.org/abs/1911.03903v3","paper_title":"A Re-evaluation of Knowledge Graph Completion Methods","code":"https://github.com/daiquocnguyen/ConvKB","n_code_links":2,"official":{"repos":["svjan5/kg-reeval"],"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}}}},{"rank_in_archive_order":75,"model":"CapsE (Corrected)","metrics":{"Hits@10":".057","MR":"446","MRR":".032"},"uses_additional_data":false,"paper_date":"2019-11-10","paper":"/paper/a-re-evaluation-of-knowledge-graph-completion","paper_url":"https://arxiv.org/abs/1911.03903v3","paper_title":"A Re-evaluation of Knowledge Graph Completion Methods","code":"https://github.com/daiquocnguyen/ConvKB","n_code_links":2,"official":{"repos":["svjan5/kg-reeval"],"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"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}}}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 8 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,590 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 4 proposed a result; of those 4, 3 gave no cell that passed the extractor's own checks, 1 was rejected by the independent check, 0 await a verdict and 0 were placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":75,"metric_columns":8,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1590,"candidates":8,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":4,"no_cell_passed_checks":3,"rejected_by_independent_check":1,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; 4 newer papers judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables Claude Sonnet 4.5 judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"a_record_without_a_model":false,"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","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":4,"shown_on_page":4,"no_cell_split":{"no_cell_passed_checks_in_ledger":3,"rows_refused_by_rule":3,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2608.26729","outcome":"refused_by_rule","reason":"the row is an ablation variant, not the method itself"},{"arxiv_id":"2606.24948","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2604.21649","outcome":"rejected","reason":null},{"arxiv_id":"2602.10845","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric; the number the model quoted is not the number printed in the cell it pointed at"}]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":23,"rows_with_any_sample_ran":21,"rows_with_a_run_with_no_instrument_failure":18,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":21,"rows_whose_official_repository_has_a_sample_that_ran":15,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":11,"rows_community_repositories_only":2,"rows_runs_from_other_or_unrecorded_repositories":1,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology 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","distinct_papers_with_graph_line":20,"distinct_papers_with_any_sample_ran":18,"distinct_papers_with_a_run_with_no_instrument_failure":15,"samples_over_distinct_papers":{"n_ran":85,"n_constructed":2,"n_ran_checked":60,"n_instrument":25,"n_unverified":31,"n_samples":116,"n_pointer_only_licence":28,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":100,"n_constructed":2,"n_ran_checked":75,"n_instrument":25,"n_unverified":35,"n_samples":135,"n_pointer_only_licence":28,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"3993536830948fe8d50904c8a39920958f475266bd6a1939d56ad130a08cac79","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}