{"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/nell-995","name":"NELL-995","full_name":null,"description_markdown":"NELL-995 KG Completion Dataset","description_withheld":null,"homepage":"","introduced_date":"2017-07-20","introduced_date_note":null,"introduced_by":{"paper":"/paper/deeppath-a-reinforcement-learning-method-for","title":"DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning","first_author":"Wenhan Xiong","url":null},"license":null,"modalities":[],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Complex Query Answering","url":"/task/complex-query-answering","datasets_with_task":"/datasets/task/complex-query-answering"}],"languages":[],"variants":["NELL-995"],"data_loaders":[{"repo":"https://github.com/yiwei-liao/isac","url":"https://github.com/yiwei-liao/isac","frameworks":["tf"]}],"num_papers_in_archive":127,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/complex-query-answering-on-nell-995","task":"Complex Query Answering","dataset_variant":"NELL-995","rows":6,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up"],"first_row_in_archive_order":{"model":"QTO","paper":"/paper/answering-complex-logical-queries-on","metrics":{"MRR 1p":"0.607","MRR 2i":"0.425","MRR 2p":"0.241","MRR 2u":"0.204","MRR 3i":"0.506","MRR 3p":"0.216","MRR ip":"0.265","MRR pi":"0.313","MRR up":"0.179"},"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/link-prediction-on-nell-995","task":"Link Prediction","dataset_variant":"NELL-995","rows":4,"metrics":["Hits@1","Hits@10","MRR","Mean AP","HITS@3"],"first_row_in_archive_order":{"model":"Prob-CBR","paper":"/paper/probabilistic-case-based-reasoning-for-open","metrics":{"HITS@3":"0.85","Hits@1":"0.77","Hits@10":"0.89","MRR":"0.81"},"code_links":[{"title":"ameyagodbole/Prob-CBR","url":"https://github.com/ameyagodbole/Prob-CBR"}]},"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":10,"of":10,"counts":{"papers_with_a_benchmark_row":10,"with_a_code_link":9,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"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":1,"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/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/probabilistic-case-based-reasoning-for-open","slug":"probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contextual-parameter-generation-for-knowledge","slug":"contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","arxiv_id":null,"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/adapting-meta-knowledge-graph-information-for","slug":"adapting-meta-knowledge-graph-information-for","title":"Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations","date":"2019-08-30","arxiv_id":"1908.11513","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deeppath-a-reinforcement-learning-method-for","slug":"deeppath-a-reinforcement-learning-method-for","title":"DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning","date":"2017-07-20","arxiv_id":"1707.06690","rows_on_this_dataset":1,"code_links":2,"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":1,"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/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/probabilistic-case-based-reasoning-for-open","slug":"probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contextual-parameter-generation-for-knowledge","slug":"contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","arxiv_id":null,"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/adapting-meta-knowledge-graph-information-for","slug":"adapting-meta-knowledge-graph-information-for","title":"Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations","date":"2019-08-30","arxiv_id":"1908.11513","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deeppath-a-reinforcement-learning-method-for","slug":"deeppath-a-reinforcement-learning-method-for","title":"DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning","date":"2017-07-20","arxiv_id":"1707.06690","rows_on_this_dataset":1,"code_links":2,"syntology":null}],"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/dataset/nell-995/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/nell-995/papers/ran/1","json":"/dataset/nell-995/papers/ran/1.json","rows":5}],"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":5,"samples_harvested":73,"samples_ran":48,"samples_constructed":15,"samples_ran_checked":29,"samples_ran_instrument_failed":19,"samples_unverified":25,"pointer_only_for_licence":17,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":5,"papers_with_a_run_with_no_instrument_failure":4,"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":"9052b3924cba3172bfec6ba7f96c67f55c7f9aa1a5f8a9e360fcdcd8ed87b4fc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}