{"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/yago3-10","name":"YAGO3-10","full_name":"Yet Another Great Ontology 3-10","description_markdown":"YAGO3-10 is benchmark dataset for knowledge base completion. It is a subset of YAGO3 (which itself is an extension of YAGO) that contains entities associated with at least ten different relations. In total, YAGO3-10 has 123,182 entities and 37 relations and 1,179,040 triples, and most of the triples describe attributes of persons such as citizenship, gender, and profession.","description_withheld":null,"homepage":"","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"}],"languages":[],"variants":["YAGO3-10"],"data_loaders":[{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.YAGO310.html","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":20,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-yago3-10","task":"Link Prediction","dataset_variant":"YAGO3-10","rows":18,"metrics":["Hits@1","Hits@3","Hits@10","MRR","MR"],"first_row_in_archive_order":{"model":"MEIM","paper":"/paper/meim-multi-partition-embedding-interaction","metrics":{"Hits@1":"0.514","Hits@10":"0.716","Hits@3":"0.625","MRR":"0.585"},"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"}]},"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":15,"of":15,"counts":{"papers_with_a_benchmark_row":15,"with_a_code_link":14,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":15,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers 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/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}}}},{"paper":"/paper/start-small-think-big-on-hyperparameter","slug":"start-small-think-big-on-hyperparameter","title":"Start Small, Think Big: On Hyperparameter Optimization for Large-Scale Knowledge Graph Embeddings","date":"2022-07-11","arxiv_id":"2207.04979","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/paper/duality-induced-regularizer-for-tensor","slug":"duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["MIRALab-USTC/KGE-DURA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/duality-induced-regularizer-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2011.05816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05816"}}}},{"paper":"/paper/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/boxe-a-box-embedding-model-for-knowledge-base","slug":"boxe-a-box-embedding-model-for-knowledge-base","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","date":"2020-07-13","arxiv_id":"2007.06267","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","slug":"low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":"2005.00545","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":8,"official":{"repos":["tensorflow/neural-structured-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/low-dimensional-hyperbolic-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2005.00545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00545"}}}},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}}}},{"paper":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["malllabiisc/InteractE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}}}},{"paper":"/paper/190600687","slug":"190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","arxiv_id":"1906.00687","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/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/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":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/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}}}},{"paper":"/paper/start-small-think-big-on-hyperparameter","slug":"start-small-think-big-on-hyperparameter","title":"Start Small, Think Big: On Hyperparameter Optimization for Large-Scale Knowledge Graph Embeddings","date":"2022-07-11","arxiv_id":"2207.04979","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/paper/duality-induced-regularizer-for-tensor","slug":"duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["MIRALab-USTC/KGE-DURA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/duality-induced-regularizer-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2011.05816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05816"}}}},{"paper":"/paper/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/boxe-a-box-embedding-model-for-knowledge-base","slug":"boxe-a-box-embedding-model-for-knowledge-base","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","date":"2020-07-13","arxiv_id":"2007.06267","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","slug":"low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":"2005.00545","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":8,"official":{"repos":["tensorflow/neural-structured-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/low-dimensional-hyperbolic-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2005.00545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00545"}}}},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}}}},{"paper":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["malllabiisc/InteractE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}}}},{"paper":"/paper/190600687","slug":"190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","arxiv_id":"1906.00687","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/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/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":1,"code_links":8,"syntology":null}],"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/dataset/yago3-10/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/yago3-10/papers/ran/1","json":"/dataset/yago3-10/papers/ran/1.json","rows":6}],"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":47,"samples_ran":33,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":16,"samples_unverified":14,"pointer_only_for_licence":22,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":6,"papers_with_a_run_with_no_instrument_failure":5,"papers_where_every_run_was_an_instrument_failure":1,"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":"2a378399587d69834f121a2885eda0c8db57d755eb693d523436ff539725a716","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}