{"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/papers/ran/1","list_of":"/dataset/ace-2004","dataset":"ACE 2004","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","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,"rows":[1,7],"of":7,"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"},"first_page":"/dataset/ace-2004/papers/ran/1","prev":null,"next":null,"papers":[{"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-09-28T10:30:06+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/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-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"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":4,"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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"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":4,"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-09-28T10:30:06+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"}}}}],"record_sha256":"7987c84211a820f31bf49e2f8bbf32a084f48a367723a6516158b5c6fc1db555","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}