{"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/ace-2004","name":"ACE 2004","full_name":"ACE 2004 Multilingual Training Corpus","description_markdown":"**ACE 2004** Multilingual Training Corpus contains the complete set of English, Arabic and Chinese training data for the 2004 Automatic Content Extraction (ACE) technology evaluation. The corpus consists of data of various types annotated for entities and relations and was created by Linguistic Data Consortium with support from the ACE Program, with additional assistance from the DARPA TIDES (Translingual Information Detection, Extraction and Summarization) Program.\r\nThe objective of the ACE program is to develop automatic content extraction technology to support automatic processing of human language in text form. In September 2004, sites were evaluated on system performance in six areas: Entity Detection and Recognition (EDR), Entity Mention Detection (EMD), EDR Co-reference, Relation Detection and Recognition (RDR), Relation Mention Detection (RMD), and RDR given reference entities. All tasks were evaluated in three languages: English, Chinese and Arabic.\r\n\r\nSource: [https://catalog.ldc.upenn.edu/LDC2005T09](https://catalog.ldc.upenn.edu/LDC2005T09)","description_withheld":null,"homepage":"https://catalog.ldc.upenn.edu/LDC2005T09","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":null,"title":"Ace 2004 multilingual training corpus","first_author":null,"url":"https://catalog.ldc.upenn.edu/LDC2005T09"},"license":{"name":"Custom","url":"https://catalog.ldc.upenn.edu/license/ldc-non-members-agreement.pdf"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Named Entity Recognition (NER)","url":"/task/named-entity-recognition-ner","datasets_with_task":"/datasets/task/named-entity-recognition-ner"},{"name":"Relation Extraction","url":"/task/relation-extraction","datasets_with_task":"/datasets/task/relation-extraction"},{"name":"UIE","url":"/task/uie","datasets_with_task":"/datasets/task/uie"},{"name":"Entity Disambiguation","url":"/task/entity-disambiguation","datasets_with_task":"/datasets/task/entity-disambiguation"},{"name":"Nested Named Entity Recognition","url":"/task/nested-named-entity-recognition","datasets_with_task":"/datasets/task/nested-named-entity-recognition"},{"name":"Nested Mention Recognition","url":"/task/nested-mention-recognition","datasets_with_task":"/datasets/task/nested-mention-recognition"}],"languages":[{"name":"English","url":"/datasets/language/english"},{"name":"Mandarin Chinese","url":"/datasets/language/mandarin-chinese"},{"name":"Standard Arabic","url":"/datasets/language/standard-arabic"}],"variants":["ACE 2004","ACE2004"],"data_loaders":[],"num_papers_in_archive":51,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/nested-named-entity-recognition-on-ace-2004","task":"Nested Named Entity Recognition","dataset_variant":"ACE 2004","rows":24,"metrics":["F1"],"first_row_in_archive_order":{"model":"PromptNER [RoBERTa-large]","paper":"/paper/promptner-prompt-locating-and-typing-for","metrics":{"F1":"88.72"},"code_links":[{"title":"tricktreat/promptner","url":"https://github.com/tricktreat/promptner"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/relation-extraction-on-ace-2004","task":"Relation Extraction","dataset_variant":"ACE 2004","rows":11,"metrics":["RE+ Micro F1","RE Micro F1","NER Micro F1","Cross Sentence"],"first_row_in_archive_order":{"model":"PL-Marker","paper":"/paper/pack-together-entity-and-relation-extraction","metrics":{"Cross Sentence":"Yes","NER Micro F1":"90.4","RE Micro F1":"69.7","RE+ Micro F1":"66.5"},"code_links":[{"title":"tomaarsen/spanmarkerner","url":"https://github.com/tomaarsen/spanmarkerner"},{"title":"thunlp/pl-marker","url":"https://github.com/thunlp/pl-marker"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/named-entity-recognition-on-ace-2004","task":"Named Entity Recognition (NER)","dataset_variant":"ACE 2004","rows":9,"metrics":["F1","Multi-Task Supervision"],"first_row_in_archive_order":{"model":"Ours: cross-sentence ALB","paper":"/paper/a-frustratingly-easy-approach-for-joint","metrics":{"F1":"90.3","Multi-Task Supervision":"y"},"code_links":[{"title":"princeton-nlp/PURE","url":"https://github.com/princeton-nlp/PURE"},{"title":"YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2","url":"https://github.com/YaoXinZhi/BERT-for-BioNLP-OST2019-AGAC-Task2"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/nested-mention-recognition-on-ace-2004","task":"Nested Mention Recognition","dataset_variant":"ACE 2004","rows":7,"metrics":["F1"],"first_row_in_archive_order":{"model":"BoningKnife","paper":"/paper/boningknife-joint-entity-mention-detection","metrics":{"F1":"86.41"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/entity-disambiguation-on-ace2004","task":"Entity Disambiguation","dataset_variant":"ACE2004","rows":6,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"KBED","paper":"/paper/improving-entity-disambiguation-by-reasoning-1","metrics":{"Micro-F1":"93.4"},"code_links":[{"title":"alexa/refined","url":"https://github.com/alexa/refined"},{"title":"amazon-science/ReFinED","url":"https://github.com/amazon-science/ReFinED"},{"title":"amazon-research/ReFinED","url":"https://github.com/amazon-research/ReFinED"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/uie-on-ace-2004","task":"UIE","dataset_variant":"ACE 2004","rows":1,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"KnowCoder-7b-IE","paper":"/paper/knowcoder-coding-structured-knowledge-into","metrics":{"F1 score":"86.2"},"code_links":[{"title":"ICT-GoKnow/KnowCoder","url":"https://github.com/ICT-GoKnow/KnowCoder"}]},"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":40,"of":40,"counts":{"papers_with_a_benchmark_row":40,"with_a_code_link":37,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":40,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowcoder-coding-structured-knowledge-into","slug":"knowcoder-coding-structured-knowledge-into","title":"KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction","date":"2024-03-12","arxiv_id":"2403.07969","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/promptner-prompt-locating-and-typing-for","slug":"promptner-prompt-locating-and-typing-for","title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","date":"2023-05-26","arxiv_id":"2305.17104","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffusionner-boundary-diffusion-for-named","slug":"diffusionner-boundary-diffusion-for-named","title":"DiffusionNER: Boundary Diffusion for Named Entity Recognition","date":"2023-05-22","arxiv_id":"2305.13298","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/optimizing-bi-encoder-for-named-entity","slug":"optimizing-bi-encoder-for-named-entity","title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","date":"2022-08-30","arxiv_id":"2208.14565","rows_on_this_dataset":1,"code_links":1,"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":0,"official":{"repos":["microsoft/binder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-bi-encoder-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/2208.14565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.14565"}}}},{"paper":"/paper/an-embarrassingly-easy-but-strong-baseline","slug":"an-embarrassingly-easy-but-strong-baseline","title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","date":"2022-08-09","arxiv_id":"2208.04534","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-entity-disambiguation-by-reasoning-1","slug":"improving-entity-disambiguation-by-reasoning-1","title":"Improving Entity Disambiguation by Reasoning over a Knowledge Base","date":"2022-07-08","arxiv_id":"2207.04106","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/refined-an-efficient-zero-shot-capable-1","slug":"refined-an-efficient-zero-shot-capable-1","title":"ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking","date":"2022-07-08","arxiv_id":"2207.04108","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/boundary-smoothing-for-named-entity-1","slug":"boundary-smoothing-for-named-entity-1","title":"Boundary Smoothing for Named Entity Recognition","date":"2022-04-26","arxiv_id":"2204.12031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/parallel-instance-query-network-for-named","slug":"parallel-instance-query-network-for-named","title":"Parallel Instance Query Network for Named Entity Recognition","date":"2022-03-20","arxiv_id":"2203.10545","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unified-named-entity-recognition-as-word-word","slug":"unified-named-entity-recognition-as-word-word","title":"Unified Named Entity Recognition as Word-Word Relation Classification","date":"2021-12-19","arxiv_id":"2112.10070","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/named-entity-recognition-for-entity-linking","slug":"named-entity-recognition-for-entity-linking","title":"Named Entity Recognition for Entity Linking: What Works and What’s Next","date":"2021-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fusing-heterogeneous-factors-with-triaffine","slug":"fusing-heterogeneous-factors-with-triaffine","title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","date":"2021-10-14","arxiv_id":"2110.07480","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/pack-together-entity-and-relation-extraction","slug":"pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","arxiv_id":"2109.06067","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["thunlp/pl-marker"],"state":"official (archive's flag): 6 ran","n_ran":6,"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/pack-together-entity-and-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2109.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06067"}}}},{"paper":"/paper/a-partition-filter-network-for-joint-entity","slug":"a-partition-filter-network-for-joint-entity","title":"A Partition Filter Network for Joint Entity and Relation Extraction","date":"2021-08-27","arxiv_id":"2108.12202","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["Coopercoppers/PFN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-partition-filter-network-for-joint-entity#ran","syntology_url":"https://syntology.ai/paper/2108.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12202"}}}},{"paper":"/paper/nested-named-entity-recognition-via","slug":"nested-named-entity-recognition-via","title":"Nested Named Entity Recognition via Explicitly Excluding the Influence of the Best Path","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boningknife-joint-entity-mention-detection","slug":"boningknife-joint-entity-mention-detection","title":"BoningKnife: Joint Entity Mention Detection and Typing for Nested NER via prior Boundary Knowledge","date":"2021-07-20","arxiv_id":"2107.09429","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/a-unified-generative-framework-for-various","slug":"a-unified-generative-framework-for-various","title":"A Unified Generative Framework for Various NER Subtasks","date":"2021-06-02","arxiv_id":"2106.01223","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-sequence-to-set-network-for-nested-named","slug":"a-sequence-to-set-network-for-nested-named","title":"A Sequence-to-Set Network for Nested Named Entity Recognition","date":"2021-05-19","arxiv_id":"2105.08901","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["zqtan1024/sequence-to-set"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-sequence-to-set-network-for-nested-named#ran","syntology_url":"https://syntology.ai/paper/2105.08901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08901"}}}},{"paper":"/paper/locate-and-label-a-two-stage-identifier-for","slug":"locate-and-label-a-two-stage-identifier-for","title":"Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition","date":"2021-05-14","arxiv_id":"2105.06804","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/nested-named-entity-recognition-with","slug":"nested-named-entity-recognition-with","title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","date":"2020-12-15","arxiv_id":"2012.08478","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-frustratingly-easy-approach-for-joint","slug":"a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","arxiv_id":"2010.12812","rows_on_this_dataset":2,"code_links":2,"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":1,"official":{"repos":["princeton-nlp/PURE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-frustratingly-easy-approach-for-joint#ran","syntology_url":"https://syntology.ai/paper/2010.12812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12812"}}}},{"paper":"/paper/two-are-better-than-one-joint-entity-and","slug":"two-are-better-than-one-joint-entity-and","title":"Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders","date":"2020-10-08","arxiv_id":"2010.03851","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["LorrinWWW/two-are-better-than-one"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-are-better-than-one-joint-entity-and#ran","syntology_url":"https://syntology.ai/paper/2010.03851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03851"}}}},{"paper":"/paper/autoregressive-entity-retrieval","slug":"autoregressive-entity-retrieval","title":"Autoregressive Entity Retrieval","date":"2020-10-02","arxiv_id":"2010.00904","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/named-entity-recognition-as-dependency","slug":"named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","arxiv_id":"2005.07150","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["juntaoy/biaffine-ner"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/named-entity-recognition-as-dependency#ran","syntology_url":"https://syntology.ai/paper/2005.07150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07150"}}}},{"paper":"/paper/a-unified-mrc-framework-for-named-entity","slug":"a-unified-mrc-framework-for-named-entity","title":"A Unified MRC Framework for Named Entity Recognition","date":"2019-10-25","arxiv_id":"1910.11476","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["ShannonAI/mrc-for-flat-nested-ner"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-unified-mrc-framework-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/1910.11476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11476"}}}},{"paper":"/paper/nested-named-entity-recognition-via-second","slug":"nested-named-entity-recognition-via-second","title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","date":"2019-09-05","arxiv_id":"1909.02250","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/pre-training-of-deep-contextualized","slug":"pre-training-of-deep-contextualized","title":"Global Entity Disambiguation with BERT","date":"2019-09-01","arxiv_id":"1909.00426","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-architectures-for-nested-ner-through-1","slug":"neural-architectures-for-nested-ner-through-1","title":"Neural Architectures for Nested NER through Linearization","date":"2019-08-19","arxiv_id":"1908.06926","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/multi-grained-named-entity-recognition","slug":"multi-grained-named-entity-recognition","title":"Multi-Grained Named Entity Recognition","date":"2019-06-20","arxiv_id":"1906.08449","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/entity-relation-extraction-as-multi-turn","slug":"entity-relation-extraction-as-multi-turn","title":"Entity-Relation Extraction as Multi-Turn Question Answering","date":"2019-05-14","arxiv_id":"1905.05529","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-general-framework-for-information","slug":"a-general-framework-for-information","title":"A General Framework for Information Extraction using Dynamic Span Graphs","date":"2019-04-05","arxiv_id":"1904.03296","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/a-neural-transition-based-model-for-nested","slug":"a-neural-transition-based-model-for-nested","title":"A Neural Transition-based Model for Nested Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01808","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/neural-segmental-hypergraphs-for-overlapping","slug":"neural-segmental-hypergraphs-for-overlapping","title":"Neural Segmental Hypergraphs for Overlapping Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01817","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/adversarial-training-for-multi-context-joint","slug":"adversarial-training-for-multi-context-joint","title":"Adversarial training for multi-context joint entity and relation extraction","date":"2018-08-21","arxiv_id":"1808.06876","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-entity-recognition-and-relation","slug":"joint-entity-recognition-and-relation","title":"Joint entity recognition and relation extraction as a multi-head selection problem","date":"2018-04-20","arxiv_id":"1804.07847","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/going-out-on-a-limb-joint-extraction-of","slug":"going-out-on-a-limb-joint-extraction-of","title":"Going out on a limb: Joint Extraction of Entity Mentions and Relations without Dependency Trees","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-joint-entity-disambiguation-with-local","slug":"deep-joint-entity-disambiguation-with-local","title":"Deep Joint Entity Disambiguation with Local Neural Attention","date":"2017-04-17","arxiv_id":"1704.04920","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/end-to-end-relation-extraction-using-lstms-on","slug":"end-to-end-relation-extraction-using-lstms-on","title":"End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures","date":"2016-01-05","arxiv_id":"1601.00770","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/incremental-joint-extraction-of-entity","slug":"incremental-joint-extraction-of-entity","title":"Incremental Joint Extraction of Entity Mentions and Relations","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowcoder-coding-structured-knowledge-into","slug":"knowcoder-coding-structured-knowledge-into","title":"KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction","date":"2024-03-12","arxiv_id":"2403.07969","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/promptner-prompt-locating-and-typing-for","slug":"promptner-prompt-locating-and-typing-for","title":"PromptNER: Prompt Locating and Typing for Named Entity Recognition","date":"2023-05-26","arxiv_id":"2305.17104","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/diffusionner-boundary-diffusion-for-named","slug":"diffusionner-boundary-diffusion-for-named","title":"DiffusionNER: Boundary Diffusion for Named Entity Recognition","date":"2023-05-22","arxiv_id":"2305.13298","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/optimizing-bi-encoder-for-named-entity","slug":"optimizing-bi-encoder-for-named-entity","title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","date":"2022-08-30","arxiv_id":"2208.14565","rows_on_this_dataset":1,"code_links":1,"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":0,"official":{"repos":["microsoft/binder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-bi-encoder-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/2208.14565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.14565"}}}},{"paper":"/paper/an-embarrassingly-easy-but-strong-baseline","slug":"an-embarrassingly-easy-but-strong-baseline","title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","date":"2022-08-09","arxiv_id":"2208.04534","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-entity-disambiguation-by-reasoning-1","slug":"improving-entity-disambiguation-by-reasoning-1","title":"Improving Entity Disambiguation by Reasoning over a Knowledge Base","date":"2022-07-08","arxiv_id":"2207.04106","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/refined-an-efficient-zero-shot-capable-1","slug":"refined-an-efficient-zero-shot-capable-1","title":"ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking","date":"2022-07-08","arxiv_id":"2207.04108","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/boundary-smoothing-for-named-entity-1","slug":"boundary-smoothing-for-named-entity-1","title":"Boundary Smoothing for Named Entity Recognition","date":"2022-04-26","arxiv_id":"2204.12031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/parallel-instance-query-network-for-named","slug":"parallel-instance-query-network-for-named","title":"Parallel Instance Query Network for Named Entity Recognition","date":"2022-03-20","arxiv_id":"2203.10545","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/unified-named-entity-recognition-as-word-word","slug":"unified-named-entity-recognition-as-word-word","title":"Unified Named Entity Recognition as Word-Word Relation Classification","date":"2021-12-19","arxiv_id":"2112.10070","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/named-entity-recognition-for-entity-linking","slug":"named-entity-recognition-for-entity-linking","title":"Named Entity Recognition for Entity Linking: What Works and What’s Next","date":"2021-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fusing-heterogeneous-factors-with-triaffine","slug":"fusing-heterogeneous-factors-with-triaffine","title":"Fusing Heterogeneous Factors with Triaffine Mechanism for Nested Named Entity Recognition","date":"2021-10-14","arxiv_id":"2110.07480","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/pack-together-entity-and-relation-extraction","slug":"pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","arxiv_id":"2109.06067","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["thunlp/pl-marker"],"state":"official (archive's flag): 6 ran","n_ran":6,"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/pack-together-entity-and-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2109.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06067"}}}},{"paper":"/paper/a-partition-filter-network-for-joint-entity","slug":"a-partition-filter-network-for-joint-entity","title":"A Partition Filter Network for Joint Entity and Relation Extraction","date":"2021-08-27","arxiv_id":"2108.12202","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["Coopercoppers/PFN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-partition-filter-network-for-joint-entity#ran","syntology_url":"https://syntology.ai/paper/2108.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12202"}}}},{"paper":"/paper/nested-named-entity-recognition-via","slug":"nested-named-entity-recognition-via","title":"Nested Named Entity Recognition via Explicitly Excluding the Influence of the Best Path","date":"2021-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boningknife-joint-entity-mention-detection","slug":"boningknife-joint-entity-mention-detection","title":"BoningKnife: Joint Entity Mention Detection and Typing for Nested NER via prior Boundary Knowledge","date":"2021-07-20","arxiv_id":"2107.09429","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/a-unified-generative-framework-for-various","slug":"a-unified-generative-framework-for-various","title":"A Unified Generative Framework for Various NER Subtasks","date":"2021-06-02","arxiv_id":"2106.01223","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-sequence-to-set-network-for-nested-named","slug":"a-sequence-to-set-network-for-nested-named","title":"A Sequence-to-Set Network for Nested Named Entity Recognition","date":"2021-05-19","arxiv_id":"2105.08901","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["zqtan1024/sequence-to-set"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-sequence-to-set-network-for-nested-named#ran","syntology_url":"https://syntology.ai/paper/2105.08901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08901"}}}},{"paper":"/paper/locate-and-label-a-two-stage-identifier-for","slug":"locate-and-label-a-two-stage-identifier-for","title":"Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition","date":"2021-05-14","arxiv_id":"2105.06804","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/nested-named-entity-recognition-with","slug":"nested-named-entity-recognition-with","title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","date":"2020-12-15","arxiv_id":"2012.08478","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-frustratingly-easy-approach-for-joint","slug":"a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","arxiv_id":"2010.12812","rows_on_this_dataset":2,"code_links":2,"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":1,"official":{"repos":["princeton-nlp/PURE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-frustratingly-easy-approach-for-joint#ran","syntology_url":"https://syntology.ai/paper/2010.12812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12812"}}}},{"paper":"/paper/two-are-better-than-one-joint-entity-and","slug":"two-are-better-than-one-joint-entity-and","title":"Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders","date":"2020-10-08","arxiv_id":"2010.03851","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["LorrinWWW/two-are-better-than-one"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-are-better-than-one-joint-entity-and#ran","syntology_url":"https://syntology.ai/paper/2010.03851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03851"}}}},{"paper":"/paper/autoregressive-entity-retrieval","slug":"autoregressive-entity-retrieval","title":"Autoregressive Entity Retrieval","date":"2020-10-02","arxiv_id":"2010.00904","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/named-entity-recognition-as-dependency","slug":"named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","arxiv_id":"2005.07150","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["juntaoy/biaffine-ner"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/named-entity-recognition-as-dependency#ran","syntology_url":"https://syntology.ai/paper/2005.07150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07150"}}}},{"paper":"/paper/a-unified-mrc-framework-for-named-entity","slug":"a-unified-mrc-framework-for-named-entity","title":"A Unified MRC Framework for Named Entity Recognition","date":"2019-10-25","arxiv_id":"1910.11476","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["ShannonAI/mrc-for-flat-nested-ner"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-unified-mrc-framework-for-named-entity#ran","syntology_url":"https://syntology.ai/paper/1910.11476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11476"}}}},{"paper":"/paper/nested-named-entity-recognition-via-second","slug":"nested-named-entity-recognition-via-second","title":"Nested Named Entity Recognition via Second-best Sequence Learning and Decoding","date":"2019-09-05","arxiv_id":"1909.02250","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/pre-training-of-deep-contextualized","slug":"pre-training-of-deep-contextualized","title":"Global Entity Disambiguation with BERT","date":"2019-09-01","arxiv_id":"1909.00426","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-architectures-for-nested-ner-through-1","slug":"neural-architectures-for-nested-ner-through-1","title":"Neural Architectures for Nested NER through Linearization","date":"2019-08-19","arxiv_id":"1908.06926","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/multi-grained-named-entity-recognition","slug":"multi-grained-named-entity-recognition","title":"Multi-Grained Named Entity Recognition","date":"2019-06-20","arxiv_id":"1906.08449","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/entity-relation-extraction-as-multi-turn","slug":"entity-relation-extraction-as-multi-turn","title":"Entity-Relation Extraction as Multi-Turn Question Answering","date":"2019-05-14","arxiv_id":"1905.05529","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-general-framework-for-information","slug":"a-general-framework-for-information","title":"A General Framework for Information Extraction using Dynamic Span Graphs","date":"2019-04-05","arxiv_id":"1904.03296","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/a-neural-transition-based-model-for-nested","slug":"a-neural-transition-based-model-for-nested","title":"A Neural Transition-based Model for Nested Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01808","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/neural-segmental-hypergraphs-for-overlapping","slug":"neural-segmental-hypergraphs-for-overlapping","title":"Neural Segmental Hypergraphs for Overlapping Mention Recognition","date":"2018-10-03","arxiv_id":"1810.01817","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/adversarial-training-for-multi-context-joint","slug":"adversarial-training-for-multi-context-joint","title":"Adversarial training for multi-context joint entity and relation extraction","date":"2018-08-21","arxiv_id":"1808.06876","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-entity-recognition-and-relation","slug":"joint-entity-recognition-and-relation","title":"Joint entity recognition and relation extraction as a multi-head selection problem","date":"2018-04-20","arxiv_id":"1804.07847","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/going-out-on-a-limb-joint-extraction-of","slug":"going-out-on-a-limb-joint-extraction-of","title":"Going out on a limb: Joint Extraction of Entity Mentions and Relations without Dependency Trees","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-joint-entity-disambiguation-with-local","slug":"deep-joint-entity-disambiguation-with-local","title":"Deep Joint Entity Disambiguation with Local Neural Attention","date":"2017-04-17","arxiv_id":"1704.04920","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/end-to-end-relation-extraction-using-lstms-on","slug":"end-to-end-relation-extraction-using-lstms-on","title":"End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures","date":"2016-01-05","arxiv_id":"1601.00770","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/incremental-joint-extraction-of-entity","slug":"incremental-joint-extraction-of-entity","title":"Incremental Joint Extraction of Entity Mentions and Relations","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/dataset/ace-2004/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/ace-2004/papers/ran/1","json":"/dataset/ace-2004/papers/ran/1.json","rows":7}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":8,"samples_harvested":47,"samples_ran":32,"samples_constructed":6,"samples_ran_checked":15,"samples_ran_instrument_failed":17,"samples_unverified":15,"pointer_only_for_licence":16,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":7,"papers_with_a_run_with_no_instrument_failure":7,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"b4c84cb71116e82107e9c30e10fd785019b32b23d90a58dc216e892a2abff9cc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}