{"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/fb15k","name":"FB15k","full_name":"Freebase 15K","description_markdown":"The **FB15k** dataset contains knowledge base relation triples and textual mentions of Freebase entity pairs. It has a total of  592,213 triplets with 14,951 entities and 1,345 relationships. FB15K-237 is a variant of the original dataset where inverse relations are removed, since it was found that a large number of test triplets could be obtained by inverting triplets in the training set.\r\n\r\nSource: [https://www.microsoft.com/en-us/download/details.aspx?id=52312](https://www.microsoft.com/en-us/download/details.aspx?id=52312)\r\nImage Source: [http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data.pdf](http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data.pdf)","description_withheld":null,"homepage":"https://www.microsoft.com/en-us/download/details.aspx?id=52312","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":"CC BY 2.5","url":"https://creativecommons.org/licenses/by/2.5/"},"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":"Knowledge Graphs","url":"/task/knowledge-graphs","datasets_with_task":"/datasets/task/knowledge-graphs"},{"name":"Complex Query Answering","url":"/task/complex-query-answering","datasets_with_task":"/datasets/task/complex-query-answering"},{"name":"Knowledge Graph Embedding","url":"/task/knowledge-graph-embedding","datasets_with_task":"/datasets/task/knowledge-graph-embedding"}],"languages":[],"variants":[" FB15k","FB15k-237","FB15k","FB15k (filtered)"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.FB15k237Dataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.FB15k.html","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":641,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset_variant":"FB15k","rows":23,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","training time (s)"],"first_row_in_archive_order":{"model":"AutoKGE","paper":"/paper/autokge-searching-scoring-functions-for","metrics":{"Hits@10":"0.914","MRR":"0.861"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-fb15k-1","task":"Link Prediction","dataset_variant":"FB15k","rows":10,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","MRR raw","Hits@5"],"first_row_in_archive_order":{"model":"ComplEx-N3 (reciprocal)","paper":"/paper/canonical-tensor-decomposition-for-knowledge","metrics":{"Hits@10":"0.91","MRR":"0.86"},"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/complex-query-answering-on-fb15k","task":"Complex Query Answering","dataset_variant":"FB15k","rows":9,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up","Hits@3 1p","Hits@3 2i","Hits@3 2p","Hits@3 2u","Hits@3 3i","Hits@3 3p","Hits@3 ip","Hits@3 pi","Hits@3 up"],"first_row_in_archive_order":{"model":"QTO","paper":"/paper/answering-complex-logical-queries-on","metrics":{"MRR 1p":"0.895","MRR 2i":"0.803","MRR 2p":"0.674","MRR 2u":"0.767","MRR 3i":"0.836","MRR 3p":"0.588","MRR ip":"0.740","MRR pi":"0.752","MRR up":"0.613"},"code_links":[{"title":"bys0318/qto","url":"https://github.com/bys0318/qto"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graphs-on-fb15k","task":"Knowledge Graphs","dataset_variant":"FB15k","rows":2,"metrics":["MRR"],"first_row_in_archive_order":{"model":"HHolE","paper":"/paper/augmenting-compositional-models-for-knowledge","metrics":{"MRR":".796"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-embedding-on-fb15k-1","task":"Knowledge Graph Embedding","dataset_variant":"FB15k","rows":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"AcrE","paper":"/paper/knowledge-graph-embedding-with-atrous","metrics":{"MRR":"0.815"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-fb15k-filtered","task":"Link Prediction","dataset_variant":"FB15k (filtered)","rows":1,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"ParTransH","paper":"/paper/efficient-parallel-translating-embedding-for","metrics":{"Hits@10":"65.7","MR":"60"},"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":35,"of":35,"counts":{"papers_with_a_benchmark_row":35,"with_a_code_link":29,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":35,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":10,"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/adapting-neural-link-predictors-for-complex","slug":"adapting-neural-link-predictors-for-complex","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","date":"2023-01-29","arxiv_id":"2301.12313","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/answering-complex-logical-queries-on","slug":"answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","arxiv_id":"2212.09567","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":7,"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}}}},{"paper":"/paper/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}}}},{"paper":"/paper/complex-query-answering-with-neural-link-1","slug":"complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","arxiv_id":"2011.03459","rows_on_this_dataset":3,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["uclnlp/cqd"],"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/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}}}},{"paper":"/paper/knowledge-graph-embedding-with-atrous","slug":"knowledge-graph-embedding-with-atrous","title":"Knowledge Graph Embedding with Atrous Convolution and Residual Learning","date":"2020-10-23","arxiv_id":"2010.12121","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/beta-embeddings-for-multi-hop-logical","slug":"beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}}}},{"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/seek-segmented-embedding-of-knowledge-graphs","slug":"seek-segmented-embedding-of-knowledge-graphs","title":"SEEK: Segmented Embedding of Knowledge Graphs","date":"2020-05-02","arxiv_id":"2005.00856","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","slug":"query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","arxiv_id":"2002.05969","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":41,"samples_ran":30,"samples_constructed":13,"samples_ran_checked":18,"samples_ran_instrument_failed":12,"samples_unverified":11,"pointer_only_for_licence":2,"official":{"repos":["hyren/query2box"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/query2box-reasoning-over-knowledge-graphs-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05969"}}}},{"paper":"/paper/using-pairwise-occurrence-information-to","slug":"using-pairwise-occurrence-information-to","title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","date":"2019-10-25","arxiv_id":"1910.11583","rows_on_this_dataset":1,"code_links":0,"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/pytorch-biggraph-a-large-scale-graph","slug":"pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","arxiv_id":"1903.12287","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":2,"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":3,"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":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/embedding-logical-queries-on-knowledge-graphs","slug":"embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","arxiv_id":"1806.01445","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["williamleif/graphqembed"],"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/embedding-logical-queries-on-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1806.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01445"}}}},{"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/knowledge-graph-embedding-with-iterative","slug":"knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","arxiv_id":"1711.11231","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/knowledge-graph-completion-via-complex-tensor","slug":"knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","arxiv_id":"1702.06879","rows_on_this_dataset":2,"code_links":2,"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/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/adapting-neural-link-predictors-for-complex","slug":"adapting-neural-link-predictors-for-complex","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","date":"2023-01-29","arxiv_id":"2301.12313","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/answering-complex-logical-queries-on","slug":"answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","arxiv_id":"2212.09567","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":7,"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}}}},{"paper":"/paper/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}}}},{"paper":"/paper/complex-query-answering-with-neural-link-1","slug":"complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","arxiv_id":"2011.03459","rows_on_this_dataset":3,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["uclnlp/cqd"],"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/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}}}},{"paper":"/paper/knowledge-graph-embedding-with-atrous","slug":"knowledge-graph-embedding-with-atrous","title":"Knowledge Graph Embedding with Atrous Convolution and Residual Learning","date":"2020-10-23","arxiv_id":"2010.12121","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/beta-embeddings-for-multi-hop-logical","slug":"beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}}}},{"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/seek-segmented-embedding-of-knowledge-graphs","slug":"seek-segmented-embedding-of-knowledge-graphs","title":"SEEK: Segmented Embedding of Knowledge Graphs","date":"2020-05-02","arxiv_id":"2005.00856","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","slug":"query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","arxiv_id":"2002.05969","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":41,"samples_ran":30,"samples_constructed":13,"samples_ran_checked":18,"samples_ran_instrument_failed":12,"samples_unverified":11,"pointer_only_for_licence":2,"official":{"repos":["hyren/query2box"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/query2box-reasoning-over-knowledge-graphs-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05969"}}}},{"paper":"/paper/using-pairwise-occurrence-information-to","slug":"using-pairwise-occurrence-information-to","title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","date":"2019-10-25","arxiv_id":"1910.11583","rows_on_this_dataset":1,"code_links":0,"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/pytorch-biggraph-a-large-scale-graph","slug":"pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","arxiv_id":"1903.12287","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":2,"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":3,"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":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}}}},{"paper":"/paper/embedding-logical-queries-on-knowledge-graphs","slug":"embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","arxiv_id":"1806.01445","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["williamleif/graphqembed"],"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/embedding-logical-queries-on-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1806.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01445"}}}},{"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/knowledge-graph-embedding-with-iterative","slug":"knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","arxiv_id":"1711.11231","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/knowledge-graph-completion-via-complex-tensor","slug":"knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","arxiv_id":"1702.06879","rows_on_this_dataset":2,"code_links":2,"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/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":11,"papers_where_code_ran_first_page":"/dataset/fb15k/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/fb15k/papers/ran/1","json":"/dataset/fb15k/papers/ran/1.json","rows":11}],"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":11,"samples_harvested":102,"samples_ran":72,"samples_constructed":15,"samples_ran_checked":49,"samples_ran_instrument_failed":23,"samples_unverified":30,"pointer_only_for_licence":20,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":11,"papers_with_a_run_with_no_instrument_failure":10,"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":"2c13b58eaa79d5116a9f9518bbfde4204681e57889e57c71f600887b9023a597","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}