{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/wn18","name":"WN18","full_name":"WordNet18","description_markdown":"The **WN18** dataset has 18 relations scraped from WordNet for roughly 41,000 synsets, resulting in 141,442 triplets. It was found out that a large number of the test triplets can be found in the training set with another relation or the inverse relation. Therefore, a new version of the dataset WN18RR has been proposed to address this issue.\r\n\r\nSource: [http://nlpprogress.com/english/relation_prediction.html](http://nlpprogress.com/english/relation_prediction.html)","description_withheld":null,"homepage":"https://everest.hds.utc.fr/doku.php?id=en:transe","introduced_date":"2013-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","first_author":"Antoine Bordes","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Knowledge Graph Completion","url":"/task/knowledge-graph-completion","datasets_with_task":"/datasets/task/knowledge-graph-completion"},{"name":"Dynamic Link Prediction","url":"/task/dynamic-link-prediction","datasets_with_task":"/datasets/task/dynamic-link-prediction"},{"name":"Ancestor-descendant prediction","url":"/task/ancestor-descendant-prediction","datasets_with_task":"/datasets/task/ancestor-descendant-prediction"}],"languages":[],"variants":["WN18","WN18RR","WN18 (filtered)"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.WN18Dataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/wordnet","frameworks":["tf","jax"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.WN18.html","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":485,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset_variant":"WN18","rows":37,"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR","training time (s)"],"first_row_in_archive_order":{"model":"Inverse Model","paper":"/paper/convolutional-2d-knowledge-graph-embeddings","metrics":{"Hits@1":"0.953","Hits@10":"0.964","Hits@3":"0.964","MR":"740","MRR":"0.963"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/dynamic-link-prediction-on-wn18-filtered","task":"Dynamic Link Prediction","dataset_variant":"WN18 (filtered)","rows":1,"metrics":["Mrr@2"],"first_row_in_archive_order":{"model":"ComplEx-N3 (reciprocal)","paper":"/paper/canonical-tensor-decomposition-for-knowledge","metrics":{"Mrr@2":"0.9"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-wn18-filtered","task":"Link Prediction","dataset_variant":"WN18 (filtered)","rows":1,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"ParTransH","paper":"/paper/efficient-parallel-translating-embedding-for","metrics":{"Hits@10":"76.6","MR":"203"},"code_links":[{"title":"zdh2292390/ParTrans-X","url":"https://github.com/zdh2292390/ParTrans-X"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":32,"of":32,"counts":{"papers_with_a_benchmark_row":32,"with_a_code_link":27,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pykeen-1-0-a-python-library-for-training-and","slug":"pykeen-1-0-a-python-library-for-training-and","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","date":"2020-07-28","arxiv_id":"2007.14175","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["pykeen/pykeen"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pykeen-1-0-a-python-library-for-training-and#ran","syntology_url":"https://syntology.ai/paper/2007.14175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14175"}}}},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-with-ordered-relation","slug":"representation-learning-with-ordered-relation","title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","date":"2019-09-26","arxiv_id":"1909.11864","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/logicenn-a-neural-based-knowledge-graphs","slug":"logicenn-a-neural-based-knowledge-graphs","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-08-20","arxiv_id":"1908.07141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}}}},{"paper":"/paper/adaptive-convolution-for-multi-relational","slug":"adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}}}},{"paper":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}}}},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/nscaching-simple-and-efficient-negative","slug":"nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/augmenting-compositional-models-for-knowledge","slug":"augmenting-compositional-models-for-knowledge","title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2018-11-02","arxiv_id":"1811.01062","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/auggan-cross-domain-adaptation-with-gan-based","slug":"auggan-cross-domain-adaptation-with-gan-based","title":"AugGAN: Cross Domain Adaptation with GAN-based Data Augmentation","date":"2018-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/simple-embedding-for-link-prediction-in","slug":"simple-embedding-for-link-prediction-in","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","date":"2018-02-13","arxiv_id":"1802.04868","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}}}},{"paper":"/paper/convolutional-2d-knowledge-graph-embeddings","slug":"convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","arxiv_id":"1707.01476","rows_on_this_dataset":2,"code_links":8,"syntology":null},{"paper":"/paper/analogical-inference-for-multi-relational","slug":"analogical-inference-for-multi-relational","title":"Analogical Inference for Multi-Relational Embeddings","date":"2017-05-06","arxiv_id":"1705.02426","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/discriminative-gaifman-models","slug":"discriminative-gaifman-models","title":"Discriminative Gaifman Models","date":"2016-10-28","arxiv_id":"1610.09369","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","slug":"complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","rows_on_this_dataset":1,"code_links":9,"syntology":null},{"paper":"/paper/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","slug":"embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","arxiv_id":"1412.6575","rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","slug":"translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":8,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pykeen-1-0-a-python-library-for-training-and","slug":"pykeen-1-0-a-python-library-for-training-and","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","date":"2020-07-28","arxiv_id":"2007.14175","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["pykeen/pykeen"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pykeen-1-0-a-python-library-for-training-and#ran","syntology_url":"https://syntology.ai/paper/2007.14175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14175"}}}},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-with-ordered-relation","slug":"representation-learning-with-ordered-relation","title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","date":"2019-09-26","arxiv_id":"1909.11864","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/logicenn-a-neural-based-knowledge-graphs","slug":"logicenn-a-neural-based-knowledge-graphs","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-08-20","arxiv_id":"1908.07141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}}}},{"paper":"/paper/adaptive-convolution-for-multi-relational","slug":"adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}}}},{"paper":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}}}},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/nscaching-simple-and-efficient-negative","slug":"nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/augmenting-compositional-models-for-knowledge","slug":"augmenting-compositional-models-for-knowledge","title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2018-11-02","arxiv_id":"1811.01062","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/auggan-cross-domain-adaptation-with-gan-based","slug":"auggan-cross-domain-adaptation-with-gan-based","title":"AugGAN: Cross Domain Adaptation with GAN-based Data Augmentation","date":"2018-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/simple-embedding-for-link-prediction-in","slug":"simple-embedding-for-link-prediction-in","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","date":"2018-02-13","arxiv_id":"1802.04868","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}}}},{"paper":"/paper/convolutional-2d-knowledge-graph-embeddings","slug":"convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","arxiv_id":"1707.01476","rows_on_this_dataset":2,"code_links":8,"syntology":null},{"paper":"/paper/analogical-inference-for-multi-relational","slug":"analogical-inference-for-multi-relational","title":"Analogical Inference for Multi-Relational Embeddings","date":"2017-05-06","arxiv_id":"1705.02426","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/discriminative-gaifman-models","slug":"discriminative-gaifman-models","title":"Discriminative Gaifman Models","date":"2016-10-28","arxiv_id":"1610.09369","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","slug":"complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","rows_on_this_dataset":1,"code_links":9,"syntology":null},{"paper":"/paper/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","slug":"embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","arxiv_id":"1412.6575","rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","slug":"translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":8,"syntology":null}],"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/dataset/wn18/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/wn18/papers/ran/1","json":"/dataset/wn18/papers/ran/1.json","rows":7}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":7,"samples_harvested":37,"samples_ran":30,"samples_constructed":0,"samples_ran_checked":29,"samples_ran_instrument_failed":1,"samples_unverified":7,"pointer_only_for_licence":2,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":7,"papers_with_a_run_with_no_instrument_failure":7,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"b64646253ec443b5917ae835c0ab84df68697afdbcc2d5a1cbc811c855e0c17c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}