{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/link-prediction","name":"Link Prediction","slug":"link-prediction","description_markdown":"**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>","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1949,"papers_with_code":974,"benchmarks":80,"benchmark_tables_in_archive":80,"benchmark_tables_shown":80,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":67,"subtasks":6,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-fb15k-237","slug":"link-prediction-on-fb15k-237","dataset":"FB15k-237","dataset_url":"/dataset/fb15k-237","rows_in_archive":75,"metrics":["Hits@1","Hits@3","Hits@10","MRR","MR","training time (s)","Hit@1","Hit@10"],"first_row_in_archive_order":{"model":"NBFNet","paper_title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","paper_url":"/paper/neural-bellman-ford-networks-a-general-graph","paper_date":"2021-06-13","arxiv_id":"2106.06935","code_links":[{"title":"DeepGraphLearning/NBFNet","url":"https://github.com/DeepGraphLearning/NBFNet"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink/blob/main/example/ogbl_ppa_ra.py"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink"}],"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/link-prediction-on-wn18rr","slug":"link-prediction-on-wn18rr","dataset":"WN18RR","dataset_url":"/dataset/wn18rr","rows_in_archive":75,"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR"],"first_row_in_archive_order":{"model":"MoCoKGC","paper_title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","paper_url":"/paper/mocokgc-momentum-contrast-entity-encoding-for","paper_date":"2024-11-12","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-wn18","slug":"link-prediction-on-wn18","dataset":"WN18","dataset_url":"/dataset/wn18","rows_in_archive":37,"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR","training time (s)"],"first_row_in_archive_order":{"model":"Inverse Model","paper_title":"Convolutional 2D Knowledge Graph Embeddings","paper_url":"/paper/convolutional-2d-knowledge-graph-embeddings","paper_date":"2017-07-05","arxiv_id":"1707.01476","code_links":[{"title":"TimDettmers/ConvE","url":"https://github.com/TimDettmers/ConvE"},{"title":"INK-USC/RE-Net","url":"https://github.com/INK-USC/RE-Net"},{"title":"thu-keg/eakit","url":"https://github.com/thu-keg/eakit"},{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"},{"title":"bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph"},{"title":"uma-pi1/kge-iclr20","url":"https://github.com/uma-pi1/kge-iclr20"},{"title":"LB0828/conve_reproduce","url":"https://github.com/LB0828/conve_reproduce"},{"title":"oliver-lloyd/kge_param_sens","url":"https://github.com/oliver-lloyd/kge_param_sens"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb15k","slug":"link-prediction-on-fb15k","dataset":"FB15k","dataset_url":"/dataset/fb15k","rows_in_archive":23,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","training time (s)"],"first_row_in_archive_order":{"model":"AutoKGE","paper_title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","paper_url":"/paper/autokge-searching-scoring-functions-for","paper_date":"2019-04-26","arxiv_id":"1904.11682","code_links":[{"title":"AutoML-4Paradigm/ERAS","url":"https://github.com/AutoML-4Paradigm/ERAS"},{"title":"AutoML-4Paradigm/S2S","url":"https://github.com/AutoML-4Paradigm/S2S"},{"title":"AutoML-Research/S2S","url":"https://github.com/AutoML-Research/S2S"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-pcqm-contact","slug":"link-prediction-on-pcqm-contact","dataset":"PCQM-Contact","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":18,"metrics":["Hits@1","Hits@3","Hits@10","MRR","MRR-ext-filtered"],"first_row_in_archive_order":{"model":"ViT-PS","paper_title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","paper_url":"/paper/learning-probabilistic-symmetrization-for-1","paper_date":"2023-06-05","arxiv_id":"2306.02866","code_links":[{"title":"jw9730/lps","url":"https://github.com/jw9730/lps"}],"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-probabilistic-symmetrization-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02866"}},"official":{"repos":["jw9730/lps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-yago3-10","slug":"link-prediction-on-yago3-10","dataset":"YAGO3-10","dataset_url":"/dataset/yago3-10","rows_in_archive":18,"metrics":["Hits@1","Hits@3","Hits@10","MRR","MR"],"first_row_in_archive_order":{"model":"MEIM","paper_title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","paper_url":"/paper/meim-multi-partition-embedding-interaction","paper_date":"2022-09-30","arxiv_id":"2209.15597","code_links":[{"title":"tranhungnghiep/AnalyzingKGEmbeddings","url":"https://github.com/tranhungnghiep/AnalyzingKGEmbeddings"},{"title":"tranhungnghiep/AnalyzeKGE","url":"https://github.com/tranhungnghiep/AnalyzeKGE"},{"title":"tranhungnghiep/meim-kge","url":"https://github.com/tranhungnghiep/meim-kge"},{"title":"tranhungnghiep/MEI-KGE","url":"https://github.com/tranhungnghiep/MEI-KGE"}],"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/link-prediction-on-icews05-15-1","slug":"link-prediction-on-icews05-15-1","dataset":"ICEWS05-15","dataset_url":"/dataset/icews","rows_in_archive":16,"metrics":["MRR"],"first_row_in_archive_order":{"model":"SPA","paper_title":"Search to Pass Messages for Temporal Knowledge Graph Completion","paper_url":"/paper/search-to-pass-messages-for-temporal","paper_date":"2022-10-30","arxiv_id":"2210.16740","code_links":[{"title":"striderdu/spa","url":"https://github.com/striderdu/spa"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-icews14-1","slug":"link-prediction-on-icews14-1","dataset":"ICEWS14","dataset_url":"/dataset/icews","rows_in_archive":16,"metrics":["MRR"],"first_row_in_archive_order":{"model":"SPA","paper_title":"Search to Pass Messages for Temporal Knowledge Graph Completion","paper_url":"/paper/search-to-pass-messages-for-temporal","paper_date":"2022-10-30","arxiv_id":"2210.16740","code_links":[{"title":"striderdu/spa","url":"https://github.com/striderdu/spa"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-wikidata5m","slug":"link-prediction-on-wikidata5m","dataset":"Wikidata5M","dataset_url":"/dataset/wikidata5m","rows_in_archive":14,"metrics":["MRR","Hits@10","Hits@1","Hits@3"],"first_row_in_archive_order":{"model":"MoCoKGC","paper_title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","paper_url":"/paper/mocokgc-momentum-contrast-entity-encoding-for","paper_date":"2024-11-12","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-citeseer","slug":"link-prediction-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":13,"metrics":["AUC","AP","Accuracy","ACC"],"first_row_in_archive_order":{"model":"NESS","paper_title":"NESS: Node Embeddings from Static SubGraphs","paper_url":"/paper/ness-learning-node-embeddings-from-static","paper_date":"2023-03-15","arxiv_id":"2303.08958","code_links":[{"title":"AstraZeneca/NESS","url":"https://github.com/AstraZeneca/NESS"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-cora","slug":"link-prediction-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":13,"metrics":["AUC","AP","Accuracy","ACC"],"first_row_in_archive_order":{"model":"NESS","paper_title":"NESS: Node Embeddings from Static SubGraphs","paper_url":"/paper/ness-learning-node-embeddings-from-static","paper_date":"2023-03-15","arxiv_id":"2303.08958","code_links":[{"title":"AstraZeneca/NESS","url":"https://github.com/AstraZeneca/NESS"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-pubmed","slug":"link-prediction-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":13,"metrics":["AUC","AP","Accuracy","ACC"],"first_row_in_archive_order":{"model":null,"paper_title":"An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022","paper_url":"/paper/an-effective-graph-learning-based-approach","paper_date":"2022-03-01","arxiv_id":"2203.01820","code_links":[{"title":"im0qianqian/WSDM2022TGP-AntGraph","url":"https://github.com/im0qianqian/WSDM2022TGP-AntGraph"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-gdelt","slug":"link-prediction-on-gdelt","dataset":"GDELT","dataset_url":"/dataset/gdelt","rows_in_archive":11,"metrics":["MRR"],"first_row_in_archive_order":{"model":"SPA","paper_title":"Search to Pass Messages for Temporal Knowledge Graph Completion","paper_url":"/paper/search-to-pass-messages-for-temporal","paper_date":"2022-10-30","arxiv_id":"2210.16740","code_links":[{"title":"striderdu/spa","url":"https://github.com/striderdu/spa"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb15k-1","slug":"link-prediction-on-fb15k-1","dataset":"FB15k","dataset_url":"/dataset/fb15k","rows_in_archive":10,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","MRR raw","Hits@5"],"first_row_in_archive_order":{"model":"ComplEx-N3 (reciprocal)","paper_title":"Canonical Tensor Decomposition for Knowledge Base Completion","paper_url":"/paper/canonical-tensor-decomposition-for-knowledge","paper_date":"2018-06-19","arxiv_id":"1806.07297","code_links":[{"title":"facebookresearch/kbc","url":"https://github.com/facebookresearch/kbc"},{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"},{"title":"twktheainur/kbc","url":"https://github.com/twktheainur/kbc"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"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"]}}}},{"leaderboard":"/sota/link-prediction-on-umls","slug":"link-prediction-on-umls","dataset":"UMLS","dataset_url":"/dataset/umls","rows_in_archive":10,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"LP-BERT","paper_title":"Multi-task Pre-training Language Model for Semantic Network Completion","paper_url":"/paper/lp-bert-multi-task-pre-training-knowledge","paper_date":"2022-01-13","arxiv_id":"2201.04843","code_links":[{"title":"763337092/LP-BERT","url":"https://github.com/763337092/LP-BERT"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-yelp","slug":"link-prediction-on-yelp","dataset":"Yelp","dataset_url":"/dataset/yelp","rows_in_archive":9,"metrics":["HR@10","AUC","nDCG@10"],"first_row_in_archive_order":{"model":"PEAGAT","paper_title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","paper_url":"/paper/metapath-and-entity-aware-graph-neural","paper_date":"2020-10-22","arxiv_id":"2010.11793","code_links":[{"title":"ecml-peagnn/PEAGNN","url":"https://github.com/ecml-peagnn/PEAGNN"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-openbiolink","slug":"link-prediction-on-openbiolink","dataset":"OpenBioLink","dataset_url":null,"rows_in_archive":8,"metrics":["Hits@10","Interpretable"],"first_row_in_archive_order":{"model":"DistMult","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-codex-medium","slug":"link-prediction-on-codex-medium","dataset":"CoDEx Medium","dataset_url":"/dataset/codex-medium","rows_in_archive":7,"metrics":["MRR","Hits@1","Hits@3","Hits@10"],"first_row_in_archive_order":{"model":"ULTRA","paper_title":"Towards Foundation Models for Knowledge Graph Reasoning","paper_url":"/paper/towards-foundation-models-for-knowledge-graph","paper_date":"2023-10-06","arxiv_id":"2310.04562","code_links":[{"title":"DeepGraphLearning/ULTRA","url":"https://github.com/DeepGraphLearning/ULTRA"}],"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-foundation-models-for-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2310.04562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04562"}},"official":{"repos":["DeepGraphLearning/ULTRA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/link-prediction-on-movielens-25m","slug":"link-prediction-on-movielens-25m","dataset":"MovieLens 25M","dataset_url":"/dataset/movielens","rows_in_archive":7,"metrics":["nDCG@10","Hits@10"],"first_row_in_archive_order":{"model":"PEAGAT","paper_title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","paper_url":"/paper/metapath-and-entity-aware-graph-neural","paper_date":"2020-10-22","arxiv_id":"2010.11793","code_links":[{"title":"ecml-peagnn/PEAGNN","url":"https://github.com/ecml-peagnn/PEAGNN"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-wordnet","slug":"link-prediction-on-wordnet","dataset":"WordNet","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy","AUC","AUPR"],"first_row_in_archive_order":{"model":"Hyperbolic Entailment Cones","paper_title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","paper_url":"/paper/hyperbolic-entailment-cones-for-learning","paper_date":"2018-04-03","arxiv_id":"1804.01882","code_links":[{"title":"dalab/hyperbolic_cones","url":"https://github.com/dalab/hyperbolic_cones"},{"title":"dinobby/hypemo","url":"https://github.com/dinobby/hypemo"},{"title":"iesl/geometric_graph_embedding","url":"https://github.com/iesl/geometric_graph_embedding"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-codex","slug":"link-prediction-on-codex","dataset":"CoDEx Small","dataset_url":"/dataset/codex","rows_in_archive":6,"metrics":["MRR","Hits@1","Hits@3","Hits@10"],"first_row_in_archive_order":{"model":"ComplEx-N3-RP","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","paper_url":"/paper/relation-prediction-as-an-auxiliary-training","paper_date":"2021-10-06","arxiv_id":"2110.02834","code_links":[{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-codex-large","slug":"link-prediction-on-codex-large","dataset":"CoDEx Large","dataset_url":"/dataset/codex-large","rows_in_archive":6,"metrics":["MRR","Hits@1","Hits@3","Hits@10"],"first_row_in_archive_order":{"model":"ComplEx-N3-RP","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","paper_url":"/paper/relation-prediction-as-an-auxiliary-training","paper_date":"2021-10-06","arxiv_id":"2110.02834","code_links":[{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb122","slug":"link-prediction-on-fb122","dataset":"FB122","dataset_url":"/dataset/fb122","rows_in_archive":5,"metrics":["HITS@3","Hits@5","Hits@10","MRR"],"first_row_in_archive_order":{"model":"Prob-CBR","paper_title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","paper_url":"/paper/probabilistic-case-based-reasoning-for-open","paper_date":"2020-10-07","arxiv_id":"2010.03548","code_links":[{"title":"ameyagodbole/Prob-CBR","url":"https://github.com/ameyagodbole/Prob-CBR"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-nell-995","slug":"link-prediction-on-nell-995","dataset":"NELL-995","dataset_url":"/dataset/nell-995","rows_in_archive":4,"metrics":["Hits@1","Hits@10","MRR","Mean AP","HITS@3"],"first_row_in_archive_order":{"model":"Prob-CBR","paper_title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","paper_url":"/paper/probabilistic-case-based-reasoning-for-open","paper_date":"2020-10-07","arxiv_id":"2010.03548","code_links":[{"title":"ameyagodbole/Prob-CBR","url":"https://github.com/ameyagodbole/Prob-CBR"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-tsp-hcp-benchmark-set","slug":"link-prediction-on-tsp-hcp-benchmark-set","dataset":"TSP/HCP Benchmark set","dataset_url":"/dataset/tsp-hcp-benchmark-set","rows_in_archive":4,"metrics":["F1"],"first_row_in_archive_order":{"model":"TGT-Agx4","paper_title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","paper_url":"/paper/triplet-interaction-improves-graph","paper_date":"2024-02-07","arxiv_id":"2402.04538","code_links":[{"title":"shamim-hussain/egt_pytorch","url":"https://github.com/shamim-hussain/egt_pytorch"},{"title":"shamim-hussain/tgt","url":"https://github.com/shamim-hussain/tgt"},{"title":"shamim-hussain/egt_triangular","url":"https://github.com/shamim-hussain/egt_triangular"}],"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}}},{"leaderboard":"/sota/link-prediction-on-dblp","slug":"link-prediction-on-dblp","dataset":"DBLP","dataset_url":"/dataset/dblp","rows_in_archive":3,"metrics":["AUC","AP"],"first_row_in_archive_order":{"model":"GLACE","paper_title":"Gaussian Embedding of Large-scale Attributed Graphs","paper_url":"/paper/gaussian-embedding-of-large-scale-attributed","paper_date":"2019-12-02","arxiv_id":"1912.00536","code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-jf17k","slug":"link-prediction-on-jf17k","dataset":"JF17K","dataset_url":null,"rows_in_archive":3,"metrics":["MRR","Hit@1","Hit@10","Hit@5","H@1","H@10"],"first_row_in_archive_order":{"model":"HAHE","paper_title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","paper_url":"/paper/hahe-hierarchical-attention-for-hyper","paper_date":"2023-05-11","arxiv_id":"2305.06588","code_links":[{"title":"lhrlab/hahe","url":"https://github.com/lhrlab/hahe"}],"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hahe-hierarchical-attention-for-hyper#ran","syntology_url":"https://syntology.ai/paper/2305.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06588"}},"official":{"repos":["lhrlab/hahe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-kg20c","slug":"link-prediction-on-kg20c","dataset":"KG20C","dataset_url":"/dataset/kg20c","rows_in_archive":3,"metrics":["MRR","Hits@1","Hits@3","Hits@10"],"first_row_in_archive_order":{"model":"MEI (small)","paper_title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","paper_url":"/paper/multi-partition-embedding-interaction-with","paper_date":"2020-06-29","arxiv_id":"2006.16365","code_links":[{"title":"tranhungnghiep/AnalyzeKGE","url":"https://github.com/tranhungnghiep/AnalyzeKGE"},{"title":"tranhungnghiep/MEI-KGE","url":"https://github.com/tranhungnghiep/MEI-KGE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-citeseer-biased-evaluation","slug":"link-prediction-on-citeseer-biased-evaluation","dataset":"Citeseer (biased evaluation)","dataset_url":"/dataset/citeseer","rows_in_archive":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"GraphStar (double weight on positive examples)","paper_title":"Graph Star Net for Generalized Multi-Task Learning","paper_url":"/paper/graph-star-net-for-generalized-multi-task-1","paper_date":"2019-06-21","arxiv_id":"1906.12330","code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}],"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}}},{"leaderboard":"/sota/link-prediction-on-cora-biased-evaluation","slug":"link-prediction-on-cora-biased-evaluation","dataset":"Cora (biased evaluation)","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"GraphStar (double weight on positive examples)","paper_title":"Graph Star Net for Generalized Multi-Task Learning","paper_url":"/paper/graph-star-net-for-generalized-multi-task-1","paper_date":"2019-06-21","arxiv_id":"1906.12330","code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}],"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}}},{"leaderboard":"/sota/link-prediction-on-decagon","slug":"link-prediction-on-decagon","dataset":"Decagon","dataset_url":"/dataset/decagon","rows_in_archive":2,"metrics":["AUROC","AUPRC","mAP@50"],"first_row_in_archive_order":{"model":"Decagon","paper_title":"Modeling polypharmacy side effects with graph convolutional networks","paper_url":"/paper/modeling-polypharmacy-side-effects-with-graph","paper_date":"2018-02-02","arxiv_id":"1802.00543","code_links":[{"title":"mims-harvard/decagon","url":"https://github.com/mims-harvard/decagon"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-douban","slug":"link-prediction-on-douban","dataset":"Douban","dataset_url":"/dataset/douban","rows_in_archive":2,"metrics":["AUC"],"first_row_in_archive_order":{"model":"HSRL (DW)","paper_title":"Learning Topological Representation for Networks via Hierarchical Sampling","paper_url":"/paper/learning-topological-representation-for","paper_date":"2019-02-15","arxiv_id":"1902.06684","code_links":[{"title":"fuguoji/HSRL","url":"https://github.com/fuguoji/HSRL"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-gps","slug":"link-prediction-on-gps","dataset":"GPS","dataset_url":null,"rows_in_archive":2,"metrics":["AUC","AUPR"],"first_row_in_archive_order":{"model":"Hyper-SAGNN-E","paper_title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","paper_url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","paper_date":"2019-11-06","arxiv_id":"1911.02613","code_links":[{"title":"ma-compbio/Hyper-SAGNN","url":"https://github.com/ma-compbio/Hyper-SAGNN"}],"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-livejournal","slug":"link-prediction-on-livejournal","dataset":"LiveJournal","dataset_url":null,"rows_in_archive":2,"metrics":["Hits@10","MR","MRR"],"first_row_in_archive_order":{"model":"PBG (1 partition)","paper_title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","paper_url":"/paper/pytorch-biggraph-a-large-scale-graph","paper_date":"2019-03-28","arxiv_id":"1903.12287","code_links":[{"title":"facebookresearch/PyTorch-BigGraph","url":"https://github.com/facebookresearch/PyTorch-BigGraph"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-movielens-1m","slug":"link-prediction-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":2,"metrics":["AUPR","AUC"],"first_row_in_archive_order":{"model":"Hyper-SAGNN-W","paper_title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","paper_url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","paper_date":"2019-11-06","arxiv_id":"1911.02613","code_links":[{"title":"ma-compbio/Hyper-SAGNN","url":"https://github.com/ma-compbio/Hyper-SAGNN"}],"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-ppi","slug":"link-prediction-on-ppi","dataset":"PPI","dataset_url":"/dataset/ppi","rows_in_archive":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"PPPNE","paper_title":"PPPNE: Personalized proximity preserved network embedding","paper_url":"/paper/pppne-personalized-proximity-preserved","paper_date":"2022-02-01","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-pubmed-biased-evaluation","slug":"link-prediction-on-pubmed-biased-evaluation","dataset":"Pubmed (biased evaluation)","dataset_url":"/dataset/pubmed","rows_in_archive":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"GraphStar (double weight on positive examples)","paper_title":"Graph Star Net for Generalized Multi-Task Learning","paper_url":"/paper/graph-star-net-for-generalized-multi-task-1","paper_date":"2019-06-21","arxiv_id":"1906.12330","code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}],"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}}},{"leaderboard":"/sota/link-prediction-on-usair","slug":"link-prediction-on-usair","dataset":"USAir","dataset_url":null,"rows_in_archive":2,"metrics":["AUC"],"first_row_in_archive_order":{"model":"SEAL","paper_title":"Link Prediction Based on Graph Neural Networks","paper_url":"/paper/link-prediction-based-on-graph-neural","paper_date":"2018-02-27","arxiv_id":"1802.09691","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal"},{"title":"muhanzhang/SEAL","url":"https://github.com/muhanzhang/SEAL"},{"title":"facebookresearch/SEAL_OGB","url":"https://github.com/facebookresearch/SEAL_OGB"},{"title":"venomouscyanide/s3grl","url":"https://github.com/venomouscyanide/s3grl"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink/blob/main/example/ogbl_ppa_ra.py"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink"},{"title":"venomouscyanide/s3grl_ogb","url":"https://github.com/venomouscyanide/s3grl_ogb"},{"title":"venomouscyanide/S3GRL_OGB","url":"https://github.com/venomouscyanide/S3GRL_OGB"},{"title":"arianemarandon/linkpredconf","url":"https://github.com/arianemarandon/linkpredconf"},{"title":"sreycodes/YLR","url":"https://github.com/sreycodes/YLR"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/link-prediction-based-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1802.09691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09691"}},"official":{"repos":["muhanzhang/SEAL"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/link-prediction-on-wd50k","slug":"link-prediction-on-wd50k","dataset":"Temp8","dataset_url":null,"rows_in_archive":2,"metrics":["Hit@1","Hit@10","MRR"],"first_row_in_archive_order":{"model":"HAHE","paper_title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","paper_url":"/paper/hahe-hierarchical-attention-for-hyper","paper_date":"2023-05-11","arxiv_id":"2305.06588","code_links":[{"title":"lhrlab/hahe","url":"https://github.com/lhrlab/hahe"}],"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hahe-hierarchical-attention-for-hyper#ran","syntology_url":"https://syntology.ai/paper/2305.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06588"}},"official":{"repos":["lhrlab/hahe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-wiki","slug":"link-prediction-on-wiki","dataset":"Wiki","dataset_url":"/dataset/wiki","rows_in_archive":2,"metrics":["AUC"],"first_row_in_archive_order":{"model":null,"paper_title":"An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022","paper_url":"/paper/an-effective-graph-learning-based-approach","paper_date":"2022-03-01","arxiv_id":"2203.01820","code_links":[{"title":"im0qianqian/WSDM2022TGP-AntGraph","url":"https://github.com/im0qianqian/WSDM2022TGP-AntGraph"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-yago15k-1","slug":"link-prediction-on-yago15k-1","dataset":"YAGO15k","dataset_url":"/dataset/yago","rows_in_archive":2,"metrics":["MRR"],"first_row_in_archive_order":{"model":"TNTComplEx (x10)","paper_title":"Tensor Decompositions for temporal knowledge base completion","paper_url":"/paper/tensor-decompositions-for-temporal-knowledge-1","paper_date":"2020-04-10","arxiv_id":"2004.04926","code_links":[{"title":"apoorvumang/CronKGQA","url":"https://github.com/apoorvumang/CronKGQA"},{"title":"facebookresearch/tkbc","url":"https://github.com/facebookresearch/tkbc"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-yago37","slug":"link-prediction-on-yago37","dataset":"YAGO37","dataset_url":"/dataset/yago","rows_in_archive":2,"metrics":["Hits@1","Hits@10","Hits@3","Hits@5","MRR"],"first_row_in_archive_order":{"model":"SEEK","paper_title":"SEEK: Segmented Embedding of Knowledge Graphs","paper_url":"/paper/seek-segmented-embedding-of-knowledge-graphs","paper_date":"2020-05-02","arxiv_id":"2005.00856","code_links":[{"title":"Wentao-Xu/SEEK","url":"https://github.com/Wentao-Xu/SEEK"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-youtube","slug":"link-prediction-on-youtube","dataset":"YouTube","dataset_url":null,"rows_in_archive":2,"metrics":["F1-Score","Macro F1","Micro F1","PR AUC","ROC AUC"],"first_row_in_archive_order":{"model":"GATNE-T","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","paper_url":"/paper/190501669","paper_date":"2019-05-05","arxiv_id":"1905.01669","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T"},{"title":"THUDM/GATNE","url":"https://github.com/THUDM/GATNE"},{"title":"cenyk1230/GATNE","url":"https://github.com/cenyk1230/GATNE"},{"title":"SY1706203/GATNE","url":"https://github.com/SY1706203/GATNE"}],"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-abstrct-neoplasm","slug":"link-prediction-on-abstrct-neoplasm","dataset":"AbstRCT - Neoplasm","dataset_url":"/dataset/abstrct-neoplasm","rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"ResAttArg","paper_title":"Multi-Task Attentive Residual Networks for Argument Mining","paper_url":"/paper/multi-task-attentive-residual-networks-for","paper_date":"2021-02-24","arxiv_id":"2102.12227","code_links":[{"title":"AGalassi/StructurePrediction18","url":"https://github.com/AGalassi/StructurePrediction18"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-acm","slug":"link-prediction-on-acm","dataset":"ACM","dataset_url":"/dataset/acm","rows_in_archive":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper_title":"Gaussian Embedding of Large-scale Attributed Graphs","paper_url":"/paper/gaussian-embedding-of-large-scale-attributed","paper_date":"2019-12-02","arxiv_id":"1912.00536","code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-aksw-bib","slug":"link-prediction-on-aksw-bib","dataset":"AKSW-bib","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3"],"first_row_in_archive_order":{"model":"KG2Vec LSTM","paper_title":"Expeditious Generation of Knowledge Graph Embeddings","paper_url":"/paper/expeditious-generation-of-knowledge-graph","paper_date":"2018-03-21","arxiv_id":"1803.07828","code_links":[{"title":"AKSW/KG2Vec","url":"https://github.com/AKSW/KG2Vec"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-alibaba","slug":"link-prediction-on-alibaba","dataset":"Alibaba","dataset_url":null,"rows_in_archive":1,"metrics":["F1-Score","PR AUC","ROC AUC"],"first_row_in_archive_order":{"model":"GATNE-I","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","paper_url":"/paper/190501669","paper_date":"2019-05-05","arxiv_id":"1905.01669","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T"},{"title":"THUDM/GATNE","url":"https://github.com/THUDM/GATNE"},{"title":"cenyk1230/GATNE","url":"https://github.com/cenyk1230/GATNE"},{"title":"SY1706203/GATNE","url":"https://github.com/SY1706203/GATNE"}],"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-alibaba-s","slug":"link-prediction-on-alibaba-s","dataset":"Alibaba-S","dataset_url":null,"rows_in_archive":1,"metrics":["F1-Score","PR AUC","ROC AUC"],"first_row_in_archive_order":{"model":"GATNE-T","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","paper_url":"/paper/190501669","paper_date":"2019-05-05","arxiv_id":"1905.01669","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T"},{"title":"THUDM/GATNE","url":"https://github.com/THUDM/GATNE"},{"title":"cenyk1230/GATNE","url":"https://github.com/cenyk1230/GATNE"},{"title":"SY1706203/GATNE","url":"https://github.com/SY1706203/GATNE"}],"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-amazon","slug":"link-prediction-on-amazon","dataset":"Amazon","dataset_url":null,"rows_in_archive":1,"metrics":["F1-Score","PR AUC","ROC AUC"],"first_row_in_archive_order":{"model":"GATNE-T","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","paper_url":"/paper/190501669","paper_date":"2019-05-05","arxiv_id":"1905.01669","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T"},{"title":"THUDM/GATNE","url":"https://github.com/THUDM/GATNE"},{"title":"cenyk1230/GATNE","url":"https://github.com/cenyk1230/GATNE"},{"title":"SY1706203/GATNE","url":"https://github.com/SY1706203/GATNE"}],"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-aristo-v4","slug":"link-prediction-on-aristo-v4","dataset":"Aristo-v4","dataset_url":"/dataset/aristo-v4","rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"ComplEx-N3-RP","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","paper_url":"/paper/relation-prediction-as-an-auxiliary-training","paper_date":"2021-10-06","arxiv_id":"2110.02834","code_links":[{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-cdcp","slug":"link-prediction-on-cdcp","dataset":"CDCP","dataset_url":"/dataset/cdcp","rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"ResAttArg","paper_title":"Multi-Task Attentive Residual Networks for Argument Mining","paper_url":"/paper/multi-task-attentive-residual-networks-for","paper_date":"2021-02-24","arxiv_id":"2102.12227","code_links":[{"title":"AGalassi/StructurePrediction18","url":"https://github.com/AGalassi/StructurePrediction18"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-cit-hepph","slug":"link-prediction-on-cit-hepph","dataset":"Cit-HepPH","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"Asymmetric Transitivity Preservation","paper_title":"ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation","paper_url":"/paper/atp-directed-graph-embedding-with-asymmetric","paper_date":"2018-11-02","arxiv_id":"1811.00839","code_links":[{"title":"zhenv5/atp","url":"https://github.com/zhenv5/atp"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-citeseer-nonstandard","slug":"link-prediction-on-citeseer-nonstandard","dataset":"Citeseer (nonstandard variant)","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper_title":"Gaussian Embedding of Large-scale Attributed Graphs","paper_url":"/paper/gaussian-embedding-of-large-scale-attributed","paper_date":"2019-12-02","arxiv_id":"1912.00536","code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-collab","slug":"link-prediction-on-collab","dataset":"COLLAB","dataset_url":"/dataset/collab","rows_in_archive":1,"metrics":["Hits"],"first_row_in_archive_order":{"model":"GatedGCN-PE","paper_title":"Benchmarking Graph Neural Networks","paper_url":"/paper/benchmarking-graph-neural-networks","paper_date":"2020-03-02","arxiv_id":"2003.00982","code_links":[{"title":"graphdeeplearning/benchmarking-gnns","url":"https://github.com/graphdeeplearning/benchmarking-gnns"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/ogbn-arxiv/unimp_appnp_vnode_smooth"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/ogbn-proteins/unimp_cross_feat"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/master/examples/GaAN"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/master/ogb_examples/nodeproppred/ogbn-arxiv"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/graphproppred/ogbg_molpcba"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"karl-zhao/benchmarking-gnns-pyg","url":"https://github.com/karl-zhao/benchmarking-gnns-pyg"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"chenfengzhao/gnnhls","url":"https://github.com/chenfengzhao/gnnhls"},{"title":"yashkotadia/GatedGCN-PATTERN","url":"https://github.com/yashkotadia/GatedGCN-PATTERN"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"},{"title":"liketheflower/jimmy_dgl","url":"https://github.com/liketheflower/jimmy_dgl"},{"title":"icml2024357/hombasis-gnn","url":"https://github.com/icml2024357/hombasis-gnn"}],"syntology":{"n":23,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}},"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}},{"leaderboard":"/sota/link-prediction-on-cora-nonstandard-variant","slug":"link-prediction-on-cora-nonstandard-variant","dataset":"Cora (nonstandard variant)","dataset_url":"/dataset/cora","rows_in_archive":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper_title":"Gaussian Embedding of Large-scale Attributed Graphs","paper_url":"/paper/gaussian-embedding-of-large-scale-attributed","paper_date":"2019-12-02","arxiv_id":"1912.00536","code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-ddb14","slug":"link-prediction-on-ddb14","dataset":"DDB14","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"ConE","paper_title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","paper_url":"/paper/modeling-heterogeneous-hierarchies-with","paper_date":"2021-10-28","arxiv_id":"2110.14923","code_links":[{"title":"snap-stanford/ConE","url":"https://github.com/snap-stanford/ConE"}],"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}},"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"]}}}},{"leaderboard":"/sota/link-prediction-on-dr-inventor","slug":"link-prediction-on-dr-inventor","dataset":"DRI Corpus","dataset_url":"/dataset/dr-inventor","rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"ResAttArg","paper_title":"Multi-Task Attentive Residual Networks for Argument Mining","paper_url":"/paper/multi-task-attentive-residual-networks-for","paper_date":"2021-02-24","arxiv_id":"2102.12227","code_links":[{"title":"AGalassi/StructurePrediction18","url":"https://github.com/AGalassi/StructurePrediction18"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-drug-drug-interactions","slug":"link-prediction-on-drug-drug-interactions","dataset":"Drug-Drug Interactions","dataset_url":null,"rows_in_archive":1,"metrics":["AUPRC"],"first_row_in_archive_order":{"model":"HOGCN","paper_title":"Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks","paper_url":"/paper/predicting-biomedical-interactions-with","paper_date":"2020-10-16","arxiv_id":"2010.08516","code_links":[{"title":"kckishan/HOGCN-LP","url":"https://github.com/kckishan/HOGCN-LP"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-drug-target-interactions","slug":"link-prediction-on-drug-target-interactions","dataset":"Drug-target interactions","dataset_url":null,"rows_in_archive":1,"metrics":["AUPRC"],"first_row_in_archive_order":{"model":"HOGCN","paper_title":"Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks","paper_url":"/paper/predicting-biomedical-interactions-with","paper_date":"2020-10-16","arxiv_id":"2010.08516","code_links":[{"title":"kckishan/HOGCN-LP","url":"https://github.com/kckishan/HOGCN-LP"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb-auto","slug":"link-prediction-on-fb-auto","dataset":"FB-AUTO","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","MRR","Hits@1"],"first_row_in_archive_order":{"model":"BoxE","paper_title":"BoxE: A Box Embedding Model for Knowledge Base Completion","paper_url":"/paper/boxe-a-box-embedding-model-for-knowledge-base","paper_date":"2020-07-13","arxiv_id":"2007.06267","code_links":[{"title":"ralphabb/BoxE","url":"https://github.com/ralphabb/BoxE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb15k-237-ind","slug":"link-prediction-on-fb15k-237-ind","dataset":"FB15k-237-ind","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"kNN-KGE","paper_title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","paper_url":"/paper/reasoning-through-memorization-nearest","paper_date":"2022-01-14","arxiv_id":"2201.05575","code_links":[{"title":"zjunlp/knn-kg","url":"https://github.com/zjunlp/knn-kg"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-fb15k-filtered","slug":"link-prediction-on-fb15k-filtered","dataset":"FB15k (filtered)","dataset_url":"/dataset/fb15k","rows_in_archive":1,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"ParTransH","paper_title":"Efficient Parallel Translating Embedding For Knowledge Graphs","paper_url":"/paper/efficient-parallel-translating-embedding-for","paper_date":"2017-03-30","arxiv_id":"1703.10316","code_links":[{"title":"zdh2292390/ParTrans-X","url":"https://github.com/zdh2292390/ParTrans-X"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-gene-disease-interactions","slug":"link-prediction-on-gene-disease-interactions","dataset":"Gene-disease interactions","dataset_url":null,"rows_in_archive":1,"metrics":["AUPRC"],"first_row_in_archive_order":{"model":"HOGCN","paper_title":"Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks","paper_url":"/paper/predicting-biomedical-interactions-with","paper_date":"2020-10-16","arxiv_id":"2010.08516","code_links":[{"title":"kckishan/HOGCN-LP","url":"https://github.com/kckishan/HOGCN-LP"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-gnutella","slug":"link-prediction-on-gnutella","dataset":"Gnutella","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"Asymmetric Transitivity Preservation","paper_title":"ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation","paper_url":"/paper/atp-directed-graph-embedding-with-asymmetric","paper_date":"2018-11-02","arxiv_id":"1811.00839","code_links":[{"title":"zhenv5/atp","url":"https://github.com/zhenv5/atp"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-go21","slug":"link-prediction-on-go21","dataset":"GO21","dataset_url":"/dataset/go21","rows_in_archive":1,"metrics":["Hit@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"ConE","paper_title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","paper_url":"/paper/modeling-heterogeneous-hierarchies-with","paper_date":"2021-10-28","arxiv_id":"2110.14923","code_links":[{"title":"snap-stanford/ConE","url":"https://github.com/snap-stanford/ConE"}],"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}},"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"]}}}},{"leaderboard":"/sota/link-prediction-on-imdb","slug":"link-prediction-on-imdb","dataset":"IMDb","dataset_url":"/dataset/imdb-movie-reviews","rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"Event2vec","paper_title":"Representation Learning for Heterogeneous Information Networks via Embedding Events","paper_url":"/paper/representation-learning-for-heterogeneous","paper_date":"2019-01-29","arxiv_id":"1901.10234","code_links":[{"title":"fuguoji/Event2vec","url":"https://github.com/fuguoji/Event2vec"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-lastfm","slug":"link-prediction-on-lastfm","dataset":"Last.FM","dataset_url":null,"rows_in_archive":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"MAGNN","paper_title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","paper_url":"/paper/magnn-metapath-aggregated-graph-neural","paper_date":"2020-02-05","arxiv_id":"2002.01680","code_links":[{"title":"cynricfu/MAGNN","url":"https://github.com/cynricfu/MAGNN"},{"title":"nmvdlei/PPMI_MAGNN","url":"https://github.com/nmvdlei/PPMI_MAGNN"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-mit","slug":"link-prediction-on-mit","dataset":"MIT","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"HSRL (DW)","paper_title":"Learning Topological Representation for Networks via Hierarchical Sampling","paper_url":"/paper/learning-topological-representation-for","paper_date":"2019-02-15","arxiv_id":"1902.06684","code_links":[{"title":"fuguoji/HSRL","url":"https://github.com/fuguoji/HSRL"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-ogbl-collab","slug":"link-prediction-on-ogbl-collab","dataset":"ogbl-collab","dataset_url":"/dataset/ogb","rows_in_archive":1,"metrics":["Test Hits@50"],"first_row_in_archive_order":{"model":"Edge2Node","paper_title":"Edge2Node: Reducing Edge Prediction to Node Classification","paper_url":"/paper/edge2node-reducing-edge-prediction-to-node","paper_date":"2023-11-06","arxiv_id":"2311.02921","code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-openbg500","slug":"link-prediction-on-openbg500","dataset":"OpenBG500","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"MoCoSA","paper_title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","paper_url":"/paper/mocosa-momentum-contrast-for-knowledge-graph","paper_date":"2023-08-16","arxiv_id":"2308.08204","code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-protein-protein","slug":"link-prediction-on-protein-protein","dataset":"protein-protein interactions","dataset_url":null,"rows_in_archive":1,"metrics":["AUPRC"],"first_row_in_archive_order":{"model":"HOGCN","paper_title":"Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks","paper_url":"/paper/predicting-biomedical-interactions-with","paper_date":"2020-10-16","arxiv_id":"2010.08516","code_links":[{"title":"kckishan/HOGCN-LP","url":"https://github.com/kckishan/HOGCN-LP"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-pubmed-nonstandard-variant","slug":"link-prediction-on-pubmed-nonstandard-variant","dataset":"Pubmed (nonstandard variant)","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper_title":"Gaussian Embedding of Large-scale Attributed Graphs","paper_url":"/paper/gaussian-embedding-of-large-scale-attributed","paper_date":"2019-12-02","arxiv_id":"1912.00536","code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-sins","slug":"link-prediction-on-sins","dataset":"SINS","dataset_url":"/dataset/sins","rows_in_archive":1,"metrics":["Scaled time-delay embeddings"],"first_row_in_archive_order":{"model":"mlp","paper_title":"Deep Learning in Mobile and Wireless Networking: A Survey","paper_url":"/paper/deep-learning-in-mobile-and-wireless","paper_date":"2018-03-12","arxiv_id":"1803.04311","code_links":[],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-twitter","slug":"link-prediction-on-twitter","dataset":"Twitter","dataset_url":null,"rows_in_archive":1,"metrics":["F1-Score","PR AUC","ROC AUC"],"first_row_in_archive_order":{"model":"GATNE-T","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","paper_url":"/paper/190501669","paper_date":"2019-05-05","arxiv_id":"1905.01669","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T"},{"title":"THUDM/GATNE","url":"https://github.com/THUDM/GATNE"},{"title":"cenyk1230/GATNE","url":"https://github.com/cenyk1230/GATNE"},{"title":"SY1706203/GATNE","url":"https://github.com/SY1706203/GATNE"}],"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-wiki-vote","slug":"link-prediction-on-wiki-vote","dataset":"Wiki-Vote","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"Asymmetric Transitivity Preservation","paper_title":"ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation","paper_url":"/paper/atp-directed-graph-embedding-with-asymmetric","paper_date":"2018-11-02","arxiv_id":"1811.00839","code_links":[{"title":"zhenv5/atp","url":"https://github.com/zhenv5/atp"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-wikidata12k","slug":"link-prediction-on-wikidata12k","dataset":"Wikidata12k","dataset_url":null,"rows_in_archive":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"TimePlex","paper_title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","paper_url":"/paper/temporal-knowledge-base-completion-new","paper_date":"2020-05-02","arxiv_id":"2005.05035","code_links":[{"title":"dair-iitd/tkbi","url":"https://github.com/dair-iitd/tkbi"}],"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-wikipeople","slug":"link-prediction-on-wikipeople","dataset":"Wikipeople","dataset_url":null,"rows_in_archive":1,"metrics":["H@1","H@10","MRR"],"first_row_in_archive_order":{"model":"HAHE","paper_title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","paper_url":"/paper/hahe-hierarchical-attention-for-hyper","paper_date":"2023-05-11","arxiv_id":"2305.06588","code_links":[{"title":"lhrlab/hahe","url":"https://github.com/lhrlab/hahe"}],"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hahe-hierarchical-attention-for-hyper#ran","syntology_url":"https://syntology.ai/paper/2305.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06588"}},"official":{"repos":["lhrlab/hahe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-wn18-filtered","slug":"link-prediction-on-wn18-filtered","dataset":"WN18 (filtered)","dataset_url":"/dataset/wn18","rows_in_archive":1,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"ParTransH","paper_title":"Efficient Parallel Translating Embedding For Knowledge Graphs","paper_url":"/paper/efficient-parallel-translating-embedding-for","paper_date":"2017-03-30","arxiv_id":"1703.10316","code_links":[{"title":"zdh2292390/ParTrans-X","url":"https://github.com/zdh2292390/ParTrans-X"}],"syntology":null}},{"leaderboard":"/sota/link-prediction-on-yago11k","slug":"link-prediction-on-yago11k","dataset":"Yago11k","dataset_url":"/dataset/yago","rows_in_archive":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"TimePlex","paper_title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","paper_url":"/paper/temporal-knowledge-base-completion-new","paper_date":"2020-05-02","arxiv_id":"2005.05035","code_links":[{"title":"dair-iitd/tkbi","url":"https://github.com/dair-iitd/tkbi"}],"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/link-prediction-on-yago39k","slug":"link-prediction-on-yago39k","dataset":"YAGO39K","dataset_url":"/dataset/yago","rows_in_archive":1,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"TransC (bern)","paper_title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","paper_url":"/paper/differentiating-concepts-and-instances-for","paper_date":"2018-11-12","arxiv_id":"1811.04588","code_links":[{"title":"davidlvxin/TransC","url":"https://github.com/davidlvxin/TransC"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/imdb-movie-reviews","name":"IMDb Movie Reviews","full_name":"","num_papers_in_archive":1787},{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/wn18","name":"WN18","full_name":"WordNet18","num_papers_in_archive":485},{"url":"/dataset/fb15k-237","name":"FB15k-237","full_name":"","num_papers_in_archive":452},{"url":"/dataset/wn18rr","name":"WN18RR","full_name":"","num_papers_in_archive":394},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/yago","name":"YAGO","full_name":"Yet Another Great Ontology","num_papers_in_archive":359},{"url":"/dataset/ppi","name":"PPI","full_name":"Protein-Protein Interactions (PPI)","num_papers_in_archive":309},{"url":"/dataset/collab","name":"COLLAB","full_name":"","num_papers_in_archive":259},{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/nell","name":"NELL","full_name":"Never Ending Language Learning","num_papers_in_archive":177},{"url":"/dataset/snap","name":"SNAP","full_name":"Stanford Large Network Dataset Collection","num_papers_in_archive":174},{"url":"/dataset/nell-995","name":"NELL-995","full_name":"","num_papers_in_archive":127},{"url":"/dataset/yelp2018","name":"Yelp2018","full_name":"Yelp2018","num_papers_in_archive":125},{"url":"/dataset/icews","name":"ICEWS","full_name":"","num_papers_in_archive":113},{"url":"/dataset/wiki-cs","name":"Wiki-CS","full_name":"","num_papers_in_archive":111},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/orkut","name":"Orkut","full_name":"","num_papers_in_archive":85},{"url":"/dataset/douban","name":"Douban","full_name":"Douban Conversation Corpus","num_papers_in_archive":81},{"url":"/dataset/aminer","name":"AMiner","full_name":"","num_papers_in_archive":80},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/wikidata5m","name":"Wikidata5M","full_name":"","num_papers_in_archive":54},{"url":"/dataset/mmkg","name":"MMKG","full_name":"","num_papers_in_archive":49},{"url":"/dataset/string","name":"STRING","full_name":"STRING","num_papers_in_archive":35},{"url":"/dataset/biogrid","name":"BioGRID","full_name":"Biological General Repository for Interaction Datasets","num_papers_in_archive":34},{"url":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","num_papers_in_archive":34},{"url":"/dataset/decagon","name":"Decagon","full_name":"Bio-decagon","num_papers_in_archive":33},{"url":"/dataset/email-eu","name":"Email-EU","full_name":null,"num_papers_in_archive":33},{"url":"/dataset/yago3-10","name":"YAGO3-10","full_name":"Yet Another Great Ontology 3-10","num_papers_in_archive":20},{"url":"/dataset/umls","name":"UMLS","full_name":"Unified Medical Language System","num_papers_in_archive":19},{"url":"/dataset/cdcp","name":"CDCP","full_name":"Cornell eRulemaking Corpus","num_papers_in_archive":12},{"url":"/dataset/arxiv-astro-ph","name":"arXiv Astro-Ph","full_name":"","num_papers_in_archive":10},{"url":"/dataset/fb122","name":"FB122","full_name":"Freebase-122","num_papers_in_archive":10},{"url":"/dataset/proteinkg25","name":"ProteinKG25","full_name":"","num_papers_in_archive":8},{"url":"/dataset/wiki","name":"Wiki","full_name":"Web Traffic Time Series Forecasting","num_papers_in_archive":8},{"url":"/dataset/codex-medium","name":"CoDEx Medium","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex","name":"CoDEx Small","full_name":"","num_papers_in_archive":5},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/tsp-hcp-benchmark-set","name":"TSP/HCP Benchmark set","full_name":"","num_papers_in_archive":5},{"url":"/dataset/acm","name":"ACM","full_name":"Association for Computing Machinery\nActive Contour Model\nalgebraic collective model\nand-Compare Module\nActive Contour Models","num_papers_in_archive":4},{"url":"/dataset/codex-large","name":"CoDEx Large","full_name":"","num_papers_in_archive":4},{"url":"/dataset/is-a","name":"IS-A","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/arxiv-gr-qc","name":"Arxiv GR-QC","full_name":"General Relativity and Quantum Cosmology collaboration network","num_papers_in_archive":3},{"url":"/dataset/fb15k-237-low","name":"FB15k-237-low","full_name":null,"num_papers_in_archive":3},{"url":"/dataset/gdelt","name":"GDELT","full_name":"","num_papers_in_archive":3},{"url":"/dataset/dr-inventor","name":"DRI Corpus","full_name":"Dr. Inventor Multi-layer Scientific Corpus","num_papers_in_archive":2},{"url":"/dataset/dtgb","name":"DTGB","full_name":"Dynamic Text-attributed Graph Benchmark","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/kinships","name":"Kinships","full_name":"","num_papers_in_archive":2},{"url":"/dataset/nations","name":"Nations","full_name":"","num_papers_in_archive":2},{"url":"/dataset/abstrct-neoplasm","name":"AbstRCT - Neoplasm","full_name":"","num_papers_in_archive":1},{"url":"/dataset/aristo-v4","name":"Aristo-v4","full_name":"Aristo Tuple KB Version 4","num_papers_in_archive":1},{"url":"/dataset/cve","name":"CVE","full_name":"Common Vulnerabilities and Exposures","num_papers_in_archive":1},{"url":"/dataset/fb1-5m","name":"FB1.5M","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1},{"url":"/dataset/go21","name":"GO21","full_name":"","num_papers_in_archive":1},{"url":"/dataset/halvest-geometric","name":"HALvest-Geometric","full_name":"","num_papers_in_archive":1},{"url":"/dataset/htdm","name":"HTDM","full_name":"Hypertention Disease Medication","num_papers_in_archive":1},{"url":"/dataset/maple","name":"MAPLE","full_name":"","num_papers_in_archive":1},{"url":"/dataset/myket-android-application-install","name":"Myket Android Application Install","full_name":"","num_papers_in_archive":1},{"url":"/dataset/part-of","name":"PART-OF","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/pubmed-paper-reading-dataset","name":"PubMed Paper Reading Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/sins","name":"SINS","full_name":"SINS","num_papers_in_archive":1}],"subtasks":[{"url":"/task/anchor-link-prediction","name":"Anchor link prediction"},{"url":"/task/calibration-for-link-prediction","name":"Calibration for Link Prediction"},{"url":"/task/dynamic-link-prediction","name":"Dynamic Link Prediction"},{"url":"/task/hyperedge-prediction","name":"Hyperedge Prediction"},{"url":"/task/inductive-link-prediction","name":"Inductive Link Prediction"},{"url":"/task/link-prediction-on-dh-kgs","name":"Link prediction on DH-KGs"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":20,"rows_per_page":100,"shown":100,"of":1949,"of_with_code":974,"tagged_in_all":1949,"counts":{"archive_papers_tagged":1949,"with_a_code_link":974,"where_syntology_ran_a_sample":233,"not_listed_spam_title":0,"listed":1949,"listed_where_code_ran":233,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":205,"every_run_a_failure_of_syntologys_instrument":28,"listed_with_a_run_with_no_instrument_failure":205,"listed_every_run_a_failure_of_syntologys_instrument":28,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","repositories_listed":595,"syntology":{"n":946,"n_ran":610,"n_constructed":293,"n_ran_checked":529,"n_instrument":81,"n_unverified":336,"n_honours":45,"n_violates":15,"n_no_contract":469,"n_pointer_only":451,"phrase":"610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}},"official":{"repos":["tensorflow/tensor2tensor"],"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":["listed","unlocated"]}}},{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"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","unlocated"]}}},{"url":"/paper/variational-graph-auto-encoders","slug":"variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}},"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}},"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/node2vec-scalable-feature-learning-for","slug":"node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","arxiv_id":"1607.00653","repositories_listed":20,"syntology":{"n":25,"n_ran":15,"n_constructed":2,"n_ran_checked":12,"n_instrument":3,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/node2vec-scalable-feature-learning-for#ran","syntology_url":"https://syntology.ai/paper/1607.00653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00653"}},"official":{"repos":["aditya-grover/node2vec"],"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":["listed","unlocated"]}}},{"url":"/paper/graph-convolutional-matrix-completion","slug":"graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","repositories_listed":17,"syntology":null},{"url":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","repositories_listed":15,"syntology":{"n":23,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}},"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation#ran","syntology_url":"https://syntology.ai/paper/1903.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03894"}},"official":{"repos":["RexYing/gnn-model-explainer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/link-prediction-based-on-graph-neural","slug":"link-prediction-based-on-graph-neural","title":"Link Prediction Based on Graph Neural Networks","date":"2018-02-27","arxiv_id":"1802.09691","repositories_listed":10,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/link-prediction-based-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1802.09691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09691"}},"official":{"repos":["muhanzhang/SEAL"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/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","repositories_listed":10,"syntology":null},{"url":"/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","repositories_listed":9,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/hyperspherical-variational-auto-encoders","slug":"hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","arxiv_id":"1804.00891","repositories_listed":9,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/hyperspherical-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1804.00891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00891"}},"official":{"repos":["nicola-decao/s-vae","nicola-decao/s-vae-pytorch","nicola-decao/s-vae-tf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":9,"syntology":null},{"url":"/paper/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/line-large-scale-information-network#ran","syntology_url":"https://syntology.ai/paper/1503.03578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03578"}},"official":{"repos":["tangjianpku/LINE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":8,"syntology":null},{"url":"/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,"repositories_listed":8,"syntology":null},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/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","repositories_listed":6,"syntology":null},{"url":"/paper/neural-factorization-machines-for-sparse","slug":"neural-factorization-machines-for-sparse","title":"Neural Factorization Machines for Sparse Predictive Analytics","date":"2017-08-16","arxiv_id":"1708.05027","repositories_listed":6,"syntology":null},{"url":"/paper/structural-deep-network-embedding","slug":"structural-deep-network-embedding","title":"Structural Deep Network Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/effect-of-choosing-loss-function-when-using-t","slug":"effect-of-choosing-loss-function-when-using-t","title":"Effect of Choosing Loss Function when Using T-batching for Representation Learning on Dynamic Networks","date":"2023-08-13","arxiv_id":"2308.06862","repositories_listed":5,"syntology":null},{"url":"/paper/inductive-representation-learning-on-temporal-1","slug":"inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/inductive-representation-learning-on-temporal-1#ran","syntology_url":"https://syntology.ai/paper/2002.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07962"}},"official":{"repos":["StatsDLMathsRecomSys/Inductive-representation-learning-on-temporal-graphs"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/mmkg-multi-modal-knowledge-graphs","slug":"mmkg-multi-modal-knowledge-graphs","title":"MMKG: Multi-Modal Knowledge Graphs","date":"2019-03-13","arxiv_id":"1903.05485","repositories_listed":5,"syntology":null},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/paper/180503352","slug":"180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","date":"2018-05-09","arxiv_id":"1805.03352","repositories_listed":5,"syntology":null},{"url":"/paper/graphgan-graph-representation-learning-with","slug":"graphgan-graph-representation-learning-with","title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","date":"2017-11-22","arxiv_id":"1711.08267","repositories_listed":5,"syntology":null},{"url":"/paper/llms-as-zero-shot-graph-learners-alignment-of","slug":"llms-as-zero-shot-graph-learners-alignment-of","title":"LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings","date":"2024-08-25","arxiv_id":"2408.14512","repositories_listed":4,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llms-as-zero-shot-graph-learners-alignment-of#ran","syntology_url":"https://syntology.ai/paper/2408.14512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14512"}},"official":{"repos":["w-rudder/tea-glm"],"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"]}}},{"url":"/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","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/node-feature-extraction-by-self-supervised-1","slug":"node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","arxiv_id":"2111.00064","repositories_listed":4,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":3,"n_honours":4,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/node-feature-extraction-by-self-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2111.00064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.00064"}},"official":{"repos":["amzn/pecos"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/nodepiece-compositional-and-parameter","slug":"nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/logic-embeddings-for-complex-query-answering","slug":"logic-embeddings-for-complex-query-answering","title":"Logic Embeddings for Complex Query Answering","date":"2021-02-28","arxiv_id":"2103.00418","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logic-embeddings-for-complex-query-answering#ran","syntology_url":"https://syntology.ai/paper/2103.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00418"}},"official":{"repos":["francoisluus/KGReasoning"],"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":["unlocated"]}}},{"url":"/paper/multi-relational-embedding-for-knowledge","slug":"multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}},"official":{"repos":["chennnM/GCNII"],"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":["found_in_text","listed","official"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-negative-sampling-in-graph","slug":"understanding-negative-sampling-in-graph","title":"Understanding Negative Sampling in Graph Representation Learning","date":"2020-05-20","arxiv_id":"2005.09863","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-negative-sampling-in-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09863"}},"official":{"repos":["zyang-16/MCNS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-collaborative-filtering-vs-matrix","slug":"neural-collaborative-filtering-vs-matrix","title":"Neural Collaborative Filtering vs. Matrix Factorization Revisited","date":"2020-05-19","arxiv_id":"2005.09683","repositories_listed":4,"syntology":null},{"url":"/paper/ktrain-a-low-code-library-for-augmented","slug":"ktrain-a-low-code-library-for-augmented","title":"ktrain: A Low-Code Library for Augmented Machine Learning","date":"2020-04-19","arxiv_id":"2004.10703","repositories_listed":4,"syntology":{"n":16,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/ktrain-a-low-code-library-for-augmented#ran","syntology_url":"https://syntology.ai/paper/2004.10703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10703"}},"official":{"repos":["amaiya/ktrain"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/190501669","slug":"190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linkage-based-face-clustering-via-graph","slug":"linkage-based-face-clustering-via-graph","title":"Linkage Based Face Clustering via Graph Convolution Network","date":"2019-03-27","arxiv_id":"1903.11306","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/linkage-based-face-clustering-via-graph#ran","syntology_url":"https://syntology.ai/paper/1903.11306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11306"}},"official":{"repos":["Zhongdao/gcn_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-regularized-graph-autoencoder","slug":"adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","repositories_listed":4,"syntology":null},{"url":"/paper/higher-order-factorization-machines","slug":"higher-order-factorization-machines","title":"Higher-Order Factorization Machines","date":"2016-07-25","arxiv_id":"1607.07195","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/higher-order-factorization-machines#ran","syntology_url":"https://syntology.ai/paper/1607.07195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.07195"}},"official":null}},{"url":"/paper/holographic-embeddings-of-knowledge-graphs","slug":"holographic-embeddings-of-knowledge-graphs","title":"Holographic Embeddings of Knowledge Graphs","date":"2015-10-16","arxiv_id":"1510.04935","repositories_listed":4,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/holographic-embeddings-of-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1510.04935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.04935"}},"official":null}},{"url":"/paper/triplet-interaction-improves-graph","slug":"triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/link-prediction-without-graph-neural-networks","slug":"link-prediction-without-graph-neural-networks","title":"Link Prediction without Graph Neural Networks","date":"2023-05-23","arxiv_id":"2305.13656","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-subgraph-representation-learning","slug":"simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/paper/a-generalization-of-transformer-networks-to","slug":"a-generalization-of-transformer-networks-to","title":"A Generalization of Transformer Networks to Graphs","date":"2020-12-17","arxiv_id":"2012.09699","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generalization-of-transformer-networks-to#ran","syntology_url":"https://syntology.ai/paper/2012.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09699"}},"official":{"repos":["graphdeeplearning/graphtransformer"],"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"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","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"}},"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":[]}}},{"url":"/paper/learning-on-attribute-missing-graphs","slug":"learning-on-attribute-missing-graphs","title":"Learning on Attribute-Missing Graphs","date":"2020-11-03","arxiv_id":"2011.01623","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-on-attribute-missing-graphs#ran","syntology_url":"https://syntology.ai/paper/2011.01623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01623"}},"official":{"repos":["xuChenSJTU/SAT-master-online"],"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":["listed","official"]}}},{"url":"/paper/flag-adversarial-data-augmentation-for-graph-1","slug":"flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","arxiv_id":"2010.09891","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flag-adversarial-data-augmentation-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2010.09891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09891"}},"official":{"repos":["devnkong/FLAG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/differentiable-reasoning-on-large-knowledge","slug":"differentiable-reasoning-on-large-knowledge","title":"Differentiable Reasoning on Large Knowledge Bases and Natural Language","date":"2019-12-17","arxiv_id":"1912.10824","repositories_listed":3,"syntology":{"n":26,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/differentiable-reasoning-on-large-knowledge#ran","syntology_url":"https://syntology.ai/paper/1912.10824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10824"}},"official":{"repos":["uclnlp/gntp","uclnlp/ntp","uclnlp/ctp"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/coke-contextualized-knowledge-graph-embedding","slug":"coke-contextualized-knowledge-graph-embedding","title":"CoKE: Contextualized Knowledge Graph Embedding","date":"2019-11-06","arxiv_id":"1911.02168","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/coke-contextualized-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.02168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02168"}},"official":{"repos":["PaddlePaddle/Research","PaddlePaddle/models"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperbolic-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1910.12933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12933"}},"official":null}},{"url":"/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","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/node-attribute-generation-on-graphs","slug":"node-attribute-generation-on-graphs","title":"Node Attribute Generation on Graphs","date":"2019-07-23","arxiv_id":"1907.09708","repositories_listed":3,"syntology":null},{"url":"/paper/geometric-laplacian-eigenmap-embedding","slug":"geometric-laplacian-eigenmap-embedding","title":"GLEE: Geometric Laplacian Eigenmap Embedding","date":"2019-05-23","arxiv_id":"1905.09763","repositories_listed":3,"syntology":null},{"url":"/paper/gravity-inspired-graph-autoencoders-for","slug":"gravity-inspired-graph-autoencoders-for","title":"Gravity-Inspired Graph Autoencoders for Directed Link Prediction","date":"2019-05-23","arxiv_id":"1905.09570","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":null},{"url":"/paper/learning-sequence-encoders-for-temporal","slug":"learning-sequence-encoders-for-temporal","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","date":"2018-09-10","arxiv_id":"1809.03202","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"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"]}}},{"url":"/paper/hyperbolic-entailment-cones-for-learning","slug":"hyperbolic-entailment-cones-for-learning","title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","date":"2018-04-03","arxiv_id":"1804.01882","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/end-to-end-differentiable-proving","slug":"end-to-end-differentiable-proving","title":"End-to-End Differentiable Proving","date":"2017-05-31","arxiv_id":"1705.11040","repositories_listed":3,"syntology":null},{"url":"/paper/subgraph2vec-learning-distributed","slug":"subgraph2vec-learning-distributed","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","date":"2016-06-29","arxiv_id":"1606.08928","repositories_listed":3,"syntology":null},{"url":"/paper/structural-alignment-in-link-prediction","slug":"structural-alignment-in-link-prediction","title":"Structural Alignment in Link Prediction","date":"2025-05-08","arxiv_id":"2505.04939","repositories_listed":2,"syntology":null},{"url":"/paper/neural-graph-pattern-machine","slug":"neural-graph-pattern-machine","title":"Beyond Message Passing: Neural Graph Pattern Machine","date":"2025-01-30","arxiv_id":"2501.18739","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-graph-pattern-machine#ran","syntology_url":"https://syntology.ai/paper/2501.18739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18739"}},"official":{"repos":["zehong-wang/gpm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reconsidering-the-performance-of-gae-in-link","slug":"reconsidering-the-performance-of-gae-in-link","title":"Reconsidering the Performance of GAE in Link Prediction","date":"2024-11-06","arxiv_id":"2411.03845","repositories_listed":2,"syntology":null},{"url":"/paper/mixed-curvature-decision-trees-and-random-1","slug":"mixed-curvature-decision-trees-and-random-1","title":"Mixed-curvature decision trees and random forests","date":"2024-10-03","arxiv_id":"2410.13879","repositories_listed":2,"syntology":null},{"url":"/paper/learning-based-link-anomaly-detection-in","slug":"learning-based-link-anomaly-detection-in","title":"Learning-Based Link Anomaly Detection in Continuous-Time Dynamic Graphs","date":"2024-05-28","arxiv_id":"2405.18050","repositories_listed":2,"syntology":null},{"url":"/paper/novel-node-category-detection-under","slug":"novel-node-category-detection-under","title":"Novel Node Category Detection Under Subpopulation Shift","date":"2024-04-01","arxiv_id":"2404.01216","repositories_listed":2,"syntology":null},{"url":"/paper/rdf-star2vec-rdf-star-graph-embeddings-for","slug":"rdf-star2vec-rdf-star-graph-embeddings-for","title":"RDF-star2Vec: RDF-star Graph Embeddings for Data Mining","date":"2023-12-25","arxiv_id":"2312.15626","repositories_listed":2,"syntology":null},{"url":"/paper/generalized-graph-prompt-toward-a-unification","slug":"generalized-graph-prompt-toward-a-unification","title":"Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphs","date":"2023-11-26","arxiv_id":"2311.15317","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generalized-graph-prompt-toward-a-unification#ran","syntology_url":"https://syntology.ai/paper/2311.15317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15317"}},"official":{"repos":["gmcmt/graph_prompt_extension"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/distributionally-robust-unsupervised-dense","slug":"distributionally-robust-unsupervised-dense","title":"Enhancing Dense Retrievers' Robustness with Group-level Reweighting","date":"2023-10-25","arxiv_id":"2310.16605","repositories_listed":2,"syntology":null},{"url":"/paper/does-graph-distillation-see-like-vision","slug":"does-graph-distillation-see-like-vision","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","date":"2023-10-13","arxiv_id":"2310.09192","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/does-graph-distillation-see-like-vision#ran","syntology_url":"https://syntology.ai/paper/2310.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09192"}},"official":{"repos":["ringbdstack/sgdd","suchun-sv/sgdd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":4,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 4 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-dynamic-graph-learning-new-1","slug":"towards-better-dynamic-graph-learning-new-1","title":"Towards Better Dynamic Graph Learning: New Architecture and Unified Library","date":"2023-03-23","arxiv_id":"2303.13047","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-dynamic-graph-learning-new-1#ran","syntology_url":"https://syntology.ai/paper/2303.13047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13047"}},"official":{"repos":["yule-buaa/dyglib"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/enhancing-knowledge-graph-embedding-models","slug":"enhancing-knowledge-graph-embedding-models","title":"Treat Different Negatives Differently: Enriching Loss Functions with Domain and Range Constraints for Link Prediction","date":"2023-03-01","arxiv_id":"2303.00286","repositories_listed":2,"syntology":null},{"url":"/paper/friend-recall-in-online-games-via-pre","slug":"friend-recall-in-online-games-via-pre","title":"Friend Ranking in Online Games via Pre-training Edge Transformers","date":"2023-02-20","arxiv_id":"2302.10043","repositories_listed":2,"syntology":null},{"url":"/paper/box-2-el-concept-and-role-box-embeddings-for","slug":"box-2-el-concept-and-role-box-embeddings-for","title":"Dual Box Embeddings for the Description Logic EL++","date":"2023-01-26","arxiv_id":"2301.11118","repositories_listed":2,"syntology":null},{"url":"/paper/sem-k-is-my-knowledge-graph-embedding-model","slug":"sem-k-is-my-knowledge-graph-embedding-model","title":"Sem@$K$: Is my knowledge graph embedding model semantic-aware?","date":"2023-01-13","arxiv_id":"2301.05601","repositories_listed":2,"syntology":null},{"url":"/paper/there-is-no-big-brother-or-small-brother","slug":"there-is-no-big-brother-or-small-brother","title":"There is No Big Brother or Small Brother: Knowledge Infusion in Language Models for Link Prediction and Question Answering","date":"2023-01-10","arxiv_id":"2301.04013","repositories_listed":2,"syntology":null},{"url":"/paper/bess-balanced-entity-sampling-and-sharing-for","slug":"bess-balanced-entity-sampling-and-sharing-for","title":"BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion","date":"2022-11-22","arxiv_id":"2211.12281","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bess-balanced-entity-sampling-and-sharing-for#ran","syntology_url":"https://syntology.ai/paper/2211.12281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12281"}},"official":{"repos":["graphcore/distributed-kge-poplar"],"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"]}}},{"url":"/paper/fedrule-federated-rule-recommendation-system","slug":"fedrule-federated-rule-recommendation-system","title":"FedRule: Federated Rule Recommendation System with Graph Neural Networks","date":"2022-11-13","arxiv_id":"2211.06812","repositories_listed":2,"syntology":null},{"url":"/paper/dyg2vec-representation-learning-for-dynamic","slug":"dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","date":"2022-10-30","arxiv_id":"2210.16906","repositories_listed":2,"syntology":null},{"url":"/paper/deep-bidirectional-language-knowledge-graph","slug":"deep-bidirectional-language-knowledge-graph","title":"Deep Bidirectional Language-Knowledge Graph Pretraining","date":"2022-10-17","arxiv_id":"2210.09338","repositories_listed":2,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-bidirectional-language-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2210.09338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09338"}},"official":{"repos":["michiyasunaga/dragon"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}}],"syntology_records":58,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":14,"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-fb15k-237","since_archive":"/sota/link-prediction-on-fb15k-237#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/link-prediction-on-wn18rr","since_archive":"/sota/link-prediction-on-wn18rr#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/link-prediction-on-cora","since_archive":"/sota/link-prediction-on-cora#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/link-prediction-on-pubmed","since_archive":"/sota/link-prediction-on-pubmed#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-movielens-25m","since_archive":"/sota/link-prediction-on-movielens-25m#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-dblp","since_archive":"/sota/link-prediction-on-dblp#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-yago15k-1","since_archive":"/sota/link-prediction-on-yago15k-1#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-drug-drug-interactions","since_archive":"/sota/link-prediction-on-drug-drug-interactions#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-wikipeople","since_archive":"/sota/link-prediction-on-wikipeople#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":233,"papers_where_code_ran_first_page":"/task/link-prediction/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":20,"url":"/task/link-prediction/papers/2","json":"/task/link-prediction/papers/2.json","rows":100},{"order":"archive","page":3,"of":20,"url":"/task/link-prediction/papers/3","json":"/task/link-prediction/papers/3.json","rows":100},{"order":"archive","page":4,"of":20,"url":"/task/link-prediction/papers/4","json":"/task/link-prediction/papers/4.json","rows":100},{"order":"archive","page":5,"of":20,"url":"/task/link-prediction/papers/5","json":"/task/link-prediction/papers/5.json","rows":100},{"order":"archive","page":6,"of":20,"url":"/task/link-prediction/papers/6","json":"/task/link-prediction/papers/6.json","rows":100},{"order":"archive","page":7,"of":20,"url":"/task/link-prediction/papers/7","json":"/task/link-prediction/papers/7.json","rows":100},{"order":"archive","page":8,"of":20,"url":"/task/link-prediction/papers/8","json":"/task/link-prediction/papers/8.json","rows":100},{"order":"archive","page":9,"of":20,"url":"/task/link-prediction/papers/9","json":"/task/link-prediction/papers/9.json","rows":100},{"order":"archive","page":10,"of":20,"url":"/task/link-prediction/papers/10","json":"/task/link-prediction/papers/10.json","rows":100},{"order":"archive","page":11,"of":20,"url":"/task/link-prediction/papers/11","json":"/task/link-prediction/papers/11.json","rows":100},{"order":"archive","page":12,"of":20,"url":"/task/link-prediction/papers/12","json":"/task/link-prediction/papers/12.json","rows":100},{"order":"archive","page":13,"of":20,"url":"/task/link-prediction/papers/13","json":"/task/link-prediction/papers/13.json","rows":100},{"order":"archive","page":14,"of":20,"url":"/task/link-prediction/papers/14","json":"/task/link-prediction/papers/14.json","rows":100},{"order":"archive","page":15,"of":20,"url":"/task/link-prediction/papers/15","json":"/task/link-prediction/papers/15.json","rows":100},{"order":"archive","page":16,"of":20,"url":"/task/link-prediction/papers/16","json":"/task/link-prediction/papers/16.json","rows":100},{"order":"archive","page":17,"of":20,"url":"/task/link-prediction/papers/17","json":"/task/link-prediction/papers/17.json","rows":100},{"order":"archive","page":18,"of":20,"url":"/task/link-prediction/papers/18","json":"/task/link-prediction/papers/18.json","rows":100},{"order":"archive","page":19,"of":20,"url":"/task/link-prediction/papers/19","json":"/task/link-prediction/papers/19.json","rows":100},{"order":"archive","page":20,"of":20,"url":"/task/link-prediction/papers/20","json":"/task/link-prediction/papers/20.json","rows":49},{"order":"ran","page":1,"of":3,"url":"/task/link-prediction/papers/ran/1","json":"/task/link-prediction/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/link-prediction/papers/ran/2","json":"/task/link-prediction/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/link-prediction/papers/ran/3","json":"/task/link-prediction/papers/ran/3.json","rows":33}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c003bef78544597de0595a0579809fdead4ad98bef5f536191c83e3c8c7ce3af","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}