{"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/new-york-times-annotated-corpus","name":"New York Times Annotated Corpus","full_name":null,"description_markdown":"The **New York Times Annotated Corpus** contains over 1.8 million articles written and published by the New York Times between January 1, 1987 and June 19, 2007 with article metadata provided by the New York Times Newsroom, the New York Times Indexing Service and the online production staff at nytimes.com. The corpus includes:\r\n\r\n- Over 1.8 million articles (excluding wire services articles that appeared during the covered period).\r\n- Over 650,000 article summaries written by library scientists.\r\n- Over 1,500,000 articles manually tagged by library scientists with tags drawn from a normalized indexing vocabulary of people, organizations, locations and topic descriptors.\r\n- Over 275,000 algorithmically-tagged articles that have been hand verified by the online production staff at nytimes.com.\r\nAs part of the New York Times' indexing procedures, most articles are manually summarized and tagged by a staff of library scientists. This collection contains over 650,000 article-summary pairs which may prove to be useful in the development and evaluation of algorithms for automated document summarization. Also, over 1.5 million documents have at least one tag. Articles are tagged for persons, places, organizations, titles and topics using a controlled vocabulary that is applied consistently across articles. For instance if one article mentions \"Bill Clinton\" and another refers to \"President William Jefferson Clinton\", both articles will be tagged with \"CLINTON, BILL\".\r\n\r\nSource: [https://catalog.ldc.upenn.edu/LDC2008T19](https://catalog.ldc.upenn.edu/LDC2008T19)","description_withheld":null,"homepage":"https://catalog.ldc.upenn.edu/LDC2008T19","introduced_date":"2008-10-17","introduced_date_note":null,"introduced_by":{"paper":null,"title":"The New York Times Annotated Corpus","first_author":null,"url":"http://catalog.ldc.upenn.edu/LDC2008T19"},"license":{"name":"Custom (research-only, non-commercial)","url":"https://catalog.ldc.upenn.edu/license/the-new-york-times-annotated-corpus-ldc2008t19.pdf"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Relation Extraction","url":"/task/relation-extraction","datasets_with_task":"/datasets/task/relation-extraction"},{"name":"Text Summarization","url":"/task/text-summarization","datasets_with_task":"/datasets/task/text-summarization"},{"name":"UIE","url":"/task/uie","datasets_with_task":"/datasets/task/uie"},{"name":"Open Information Extraction","url":"/task/open-information-extraction","datasets_with_task":"/datasets/task/open-information-extraction"},{"name":"Abstractive Text Summarization","url":"/task/abstractive-text-summarization","datasets_with_task":"/datasets/task/abstractive-text-summarization"},{"name":"Hierarchical Multi-label Classification","url":"/task/hierarchical-multi-label-classification","datasets_with_task":"/datasets/task/hierarchical-multi-label-classification"},{"name":"Joint Entity and Relation Extraction","url":"/task/joint-entity-and-relation-extraction","datasets_with_task":"/datasets/task/joint-entity-and-relation-extraction"},{"name":"Topic Models","url":"/task/topic-models","datasets_with_task":"/datasets/task/topic-models"},{"name":"Document Summarization","url":"/task/document-summarization","datasets_with_task":"/datasets/task/document-summarization"},{"name":"Relationship Extraction (Distant Supervised)","url":"/task/relationship-extraction-distant-supervised","datasets_with_task":"/datasets/task/relationship-extraction-distant-supervised"},{"name":"Document Dating","url":"/task/document-dating","datasets_with_task":"/datasets/task/document-dating"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["New York Times Corpus","NYT","New York Times Annotated Corpus"],"data_loaders":[],"num_papers_in_archive":262,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/relationship-extraction-distant-supervised-on","task":"Relationship Extraction (Distant Supervised)","dataset_variant":"New York Times Corpus","rows":9,"metrics":["P@10%","P@30%","AUC","Average Precision"],"first_row_in_archive_order":{"model":"KGPOOL","paper":"/paper/kgpool-dynamic-knowledge-graph-context","metrics":{"P@10%":"92.3","P@30%":"86.7"},"code_links":[{"title":"nadgeri14/KGPool","url":"https://github.com/nadgeri14/KGPool"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/relation-extraction-on-nyt","task":"Relation Extraction","dataset_variant":"NYT","rows":8,"metrics":["F1"],"first_row_in_archive_order":{"model":"ReLiK-Large","paper":"/paper/2408-00103","metrics":{"F1":"95"},"code_links":[{"title":"SapienzaNLP/relik","url":"https://github.com/SapienzaNLP/relik"},{"title":"RadeenXALNW/G-RAG_1.0","url":"https://github.com/RadeenXALNW/G-RAG_1.0"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/hierarchical-multi-label-classification-on-18","task":"Hierarchical Multi-label Classification","dataset_variant":"New York Times Annotated Corpus","rows":7,"metrics":["Macro F1","Micro F1"],"first_row_in_archive_order":{"model":"HiDEC+HBM Loss","paper":"/paper/hierarchy-aware-biased-bound-margin-loss","metrics":{"Macro F1":"70.69±0.19","Micro F1":"80.52±0.18"},"code_links":[{"title":"whitepurple/HBM-loss-for-HTC","url":"https://github.com/whitepurple/HBM-loss-for-HTC"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-nyt","task":"Joint Entity and Relation Extraction","dataset_variant":"NYT","rows":5,"metrics":["F1","Entity F1","Relation F1"],"first_row_in_archive_order":{"model":"SPN","paper":"/paper/joint-entity-and-relation-extraction-with-set","metrics":{"F1":"92.5"},"code_links":[{"title":"DianboWork/SPN4RE","url":"https://github.com/DianboWork/SPN4RE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/open-information-extraction-on-nyt","task":"Open Information Extraction","dataset_variant":"NYT","rows":4,"metrics":["F1","AUC"],"first_row_in_archive_order":{"model":"Deepstruct zero-shot","paper":"/paper/deepstruct-pretraining-of-language-models-for-1","metrics":{"F1":"28.9"},"code_links":[{"title":"cgraywang/deepstruct","url":"https://github.com/cgraywang/deepstruct"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/document-dating-on-nyt","task":"Document Dating","dataset_variant":"NYT","rows":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuralDater","paper":"/paper/dating-documents-using-graph-convolution","metrics":{"Accuracy":"58.9"},"code_links":[{"title":"malllabiisc/NeuralDater","url":"https://github.com/malllabiisc/NeuralDater"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/relationship-extraction-distant-supervised-on-2","task":"Relationship Extraction (Distant Supervised)","dataset_variant":"NYT","rows":1,"metrics":["P@100","P@200","P@300","PR AUC"],"first_row_in_archive_order":{"model":"DocDS","paper":"/paper/from-bag-of-sentences-to-document-distantly","metrics":{"P@100":"0.939","P@200":"0.889","P@300":"0.873","PR AUC":"0.595"},"code_links":[{"title":"lingyongyan/docds","url":"https://github.com/lingyongyan/docds"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/topic-models-on-nyt","task":"Topic Models","dataset_variant":"NYT","rows":1,"metrics":["MACC","Topic coherence@5"],"first_row_in_archive_order":{"model":"JoSH","paper":"/paper/hierarchical-topic-mining-via-joint-spherical","metrics":{"MACC":"90.91","Topic coherence@5":"0.0166"},"code_links":[{"title":"yumeng5/JoSH","url":"https://github.com/yumeng5/JoSH"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/uie-on-nyt","task":"UIE","dataset_variant":"NYT","rows":1,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"KnowCoder-7b-IE","paper":"/paper/knowcoder-coding-structured-knowledge-into","metrics":{"F1 score":"93.7"},"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":25,"of":25,"counts":{"papers_with_a_benchmark_row":25,"with_a_code_link":22,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":25,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"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/hierarchy-aware-biased-bound-margin-loss","slug":"hierarchy-aware-biased-bound-margin-loss","title":"Hierarchy-aware Biased Bound Margin Loss Function for Hierarchical Text Classification","date":"2024-08-13","arxiv_id":null,"rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/2408-00103","slug":"2408-00103","title":"ReLiK: Retrieve and LinK, Fast and Accurate Entity Linking and Relation Extraction on an Academic Budget","date":"2024-07-31","arxiv_id":"2408.00103","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/hill-hierarchy-aware-information-lossless","slug":"hill-hierarchy-aware-information-lossless","title":"HILL: Hierarchy-aware Information Lossless Contrastive Learning for Hierarchical Text Classification","date":"2024-03-26","arxiv_id":"2403.17307","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["rooooyy/hill"],"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/hill-hierarchy-aware-information-lossless#ran","syntology_url":"https://syntology.ai/paper/2403.17307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17307"}}}},{"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/hitin-hierarchy-aware-tree-isomorphism","slug":"hitin-hierarchy-aware-tree-isomorphism","title":"HiTIN: Hierarchy-aware Tree Isomorphism Network for Hierarchical Text Classification","date":"2023-05-24","arxiv_id":"2305.15182","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":13,"samples_constructed":3,"samples_ran_checked":7,"samples_ran_instrument_failed":6,"samples_unverified":4,"pointer_only_for_licence":17,"official":{"repos":["rooooyy/hitin"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hitin-hierarchy-aware-tree-isomorphism#ran","syntology_url":"https://syntology.ai/paper/2305.15182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15182"}}}},{"paper":"/paper/unirel-unified-representation-and-interaction","slug":"unirel-unified-representation-and-interaction","title":"UniRel: Unified Representation and Interaction for Joint Relational Triple Extraction","date":"2022-11-16","arxiv_id":"2211.09039","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/tdeer-an-efficient-translating-decoding","slug":"tdeer-an-efficient-translating-decoding","title":"TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations","date":"2021-11-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/rebel-relation-extraction-by-end-to-end","slug":"rebel-relation-extraction-by-end-to-end","title":"REBEL: Relation Extraction By End-to-end Language generation","date":"2021-10-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/zero-shot-information-extraction-as-a-unified","slug":"zero-shot-information-extraction-as-a-unified","title":"Zero-Shot Information Extraction as a Unified Text-to-Triple Translation","date":"2021-09-23","arxiv_id":"2109.11171","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adjacency-list-oriented-relational-fact","slug":"adjacency-list-oriented-relational-fact","title":"Adjacency List Oriented Relational Fact Extraction via Adaptive Multi-task Learning","date":"2021-06-03","arxiv_id":"2106.01559","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgpool-dynamic-knowledge-graph-context","slug":"kgpool-dynamic-knowledge-graph-context","title":"KGPool: Dynamic Knowledge Graph Context Selection for Relation Extraction","date":"2021-06-01","arxiv_id":"2106.00459","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distantly-supervised-long-tailed-relation","slug":"distantly-supervised-long-tailed-relation","title":"Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphs","date":"2021-05-24","arxiv_id":"2105.11225","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-distantly-supervised-relation-3","slug":"improving-distantly-supervised-relation-3","title":"Improving Distantly-Supervised Relation Extraction through BERT-based Label & Instance Embeddings","date":"2021-02-01","arxiv_id":"2102.01156","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-bag-of-sentences-to-document-distantly","slug":"from-bag-of-sentences-to-document-distantly","title":"From Bag of Sentences to Document: Distantly Supervised Relation Extraction via Machine Reading Comprehension","date":"2020-12-08","arxiv_id":"2012.04334","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-entity-and-relation-extraction-with-set","slug":"joint-entity-and-relation-extraction-with-set","title":"Joint Entity and Relation Extraction with Set Prediction Networks","date":"2020-11-03","arxiv_id":"2011.01675","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/recon-relation-extraction-using-knowledge","slug":"recon-relation-extraction-using-knowledge","title":"RECON: Relation Extraction using Knowledge Graph Context in a Graph Neural Network","date":"2020-09-18","arxiv_id":"2009.08694","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-topic-mining-via-joint-spherical","slug":"hierarchical-topic-mining-via-joint-spherical","title":"Hierarchical Topic Mining via Joint Spherical Tree and Text Embedding","date":"2020-07-18","arxiv_id":"2007.09536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dating-documents-using-graph-convolution","slug":"dating-documents-using-graph-convolution","title":"Dating Documents using Graph Convolution Networks","date":"2019-02-01","arxiv_id":"1902.00175","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-relation-extraction-via-inner-sentence","slug":"neural-relation-extraction-via-inner-sentence","title":"Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning","date":"2018-08-21","arxiv_id":"1808.06738","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/improving-distantly-supervised-relation-1","slug":"improving-distantly-supervised-relation-1","title":"Improving Distantly Supervised Relation Extraction using Word and Entity Based Attention","date":"2018-04-19","arxiv_id":"1804.06987","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/neural-relation-extraction-with-selective","slug":"neural-relation-extraction-with-selective","title":"Neural Relation Extraction with Selective Attention over Instances","date":"2016-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distant-supervision-for-relation-extraction","slug":"distant-supervision-for-relation-extraction","title":"Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-burstiness-aware-approach-for-document","slug":"a-burstiness-aware-approach-for-document","title":"A Burstiness-aware Approach for Document Dating","date":"2014-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/labeling-documents-with-timestamps-learning","slug":"labeling-documents-with-timestamps-learning","title":"Labeling Documents with Timestamps: Learning from their Time Expressions","date":"2012-07-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/hierarchy-aware-biased-bound-margin-loss","slug":"hierarchy-aware-biased-bound-margin-loss","title":"Hierarchy-aware Biased Bound Margin Loss Function for Hierarchical Text Classification","date":"2024-08-13","arxiv_id":null,"rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/2408-00103","slug":"2408-00103","title":"ReLiK: Retrieve and LinK, Fast and Accurate Entity Linking and Relation Extraction on an Academic Budget","date":"2024-07-31","arxiv_id":"2408.00103","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/hill-hierarchy-aware-information-lossless","slug":"hill-hierarchy-aware-information-lossless","title":"HILL: Hierarchy-aware Information Lossless Contrastive Learning for Hierarchical Text Classification","date":"2024-03-26","arxiv_id":"2403.17307","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["rooooyy/hill"],"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/hill-hierarchy-aware-information-lossless#ran","syntology_url":"https://syntology.ai/paper/2403.17307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17307"}}}},{"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/hitin-hierarchy-aware-tree-isomorphism","slug":"hitin-hierarchy-aware-tree-isomorphism","title":"HiTIN: Hierarchy-aware Tree Isomorphism Network for Hierarchical Text Classification","date":"2023-05-24","arxiv_id":"2305.15182","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":13,"samples_constructed":3,"samples_ran_checked":7,"samples_ran_instrument_failed":6,"samples_unverified":4,"pointer_only_for_licence":17,"official":{"repos":["rooooyy/hitin"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hitin-hierarchy-aware-tree-isomorphism#ran","syntology_url":"https://syntology.ai/paper/2305.15182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15182"}}}},{"paper":"/paper/unirel-unified-representation-and-interaction","slug":"unirel-unified-representation-and-interaction","title":"UniRel: Unified Representation and Interaction for Joint Relational Triple Extraction","date":"2022-11-16","arxiv_id":"2211.09039","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/tdeer-an-efficient-translating-decoding","slug":"tdeer-an-efficient-translating-decoding","title":"TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations","date":"2021-11-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/rebel-relation-extraction-by-end-to-end","slug":"rebel-relation-extraction-by-end-to-end","title":"REBEL: Relation Extraction By End-to-end Language generation","date":"2021-10-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/zero-shot-information-extraction-as-a-unified","slug":"zero-shot-information-extraction-as-a-unified","title":"Zero-Shot Information Extraction as a Unified Text-to-Triple Translation","date":"2021-09-23","arxiv_id":"2109.11171","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adjacency-list-oriented-relational-fact","slug":"adjacency-list-oriented-relational-fact","title":"Adjacency List Oriented Relational Fact Extraction via Adaptive Multi-task Learning","date":"2021-06-03","arxiv_id":"2106.01559","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgpool-dynamic-knowledge-graph-context","slug":"kgpool-dynamic-knowledge-graph-context","title":"KGPool: Dynamic Knowledge Graph Context Selection for Relation Extraction","date":"2021-06-01","arxiv_id":"2106.00459","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distantly-supervised-long-tailed-relation","slug":"distantly-supervised-long-tailed-relation","title":"Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphs","date":"2021-05-24","arxiv_id":"2105.11225","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-distantly-supervised-relation-3","slug":"improving-distantly-supervised-relation-3","title":"Improving Distantly-Supervised Relation Extraction through BERT-based Label & Instance Embeddings","date":"2021-02-01","arxiv_id":"2102.01156","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-bag-of-sentences-to-document-distantly","slug":"from-bag-of-sentences-to-document-distantly","title":"From Bag of Sentences to Document: Distantly Supervised Relation Extraction via Machine Reading Comprehension","date":"2020-12-08","arxiv_id":"2012.04334","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-entity-and-relation-extraction-with-set","slug":"joint-entity-and-relation-extraction-with-set","title":"Joint Entity and Relation Extraction with Set Prediction Networks","date":"2020-11-03","arxiv_id":"2011.01675","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/recon-relation-extraction-using-knowledge","slug":"recon-relation-extraction-using-knowledge","title":"RECON: Relation Extraction using Knowledge Graph Context in a Graph Neural Network","date":"2020-09-18","arxiv_id":"2009.08694","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-topic-mining-via-joint-spherical","slug":"hierarchical-topic-mining-via-joint-spherical","title":"Hierarchical Topic Mining via Joint Spherical Tree and Text Embedding","date":"2020-07-18","arxiv_id":"2007.09536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dating-documents-using-graph-convolution","slug":"dating-documents-using-graph-convolution","title":"Dating Documents using Graph Convolution Networks","date":"2019-02-01","arxiv_id":"1902.00175","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-relation-extraction-via-inner-sentence","slug":"neural-relation-extraction-via-inner-sentence","title":"Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning","date":"2018-08-21","arxiv_id":"1808.06738","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/improving-distantly-supervised-relation-1","slug":"improving-distantly-supervised-relation-1","title":"Improving Distantly Supervised Relation Extraction using Word and Entity Based Attention","date":"2018-04-19","arxiv_id":"1804.06987","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/neural-relation-extraction-with-selective","slug":"neural-relation-extraction-with-selective","title":"Neural Relation Extraction with Selective Attention over Instances","date":"2016-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distant-supervision-for-relation-extraction","slug":"distant-supervision-for-relation-extraction","title":"Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-burstiness-aware-approach-for-document","slug":"a-burstiness-aware-approach-for-document","title":"A Burstiness-aware Approach for Document Dating","date":"2014-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/labeling-documents-with-timestamps-learning","slug":"labeling-documents-with-timestamps-learning","title":"Labeling Documents with Timestamps: Learning from their Time Expressions","date":"2012-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/dataset/new-york-times-annotated-corpus/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/new-york-times-annotated-corpus/papers/ran/1","json":"/dataset/new-york-times-annotated-corpus/papers/ran/1.json","rows":3}],"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":3,"samples_harvested":33,"samples_ran":27,"samples_constructed":3,"samples_ran_checked":18,"samples_ran_instrument_failed":9,"samples_unverified":6,"pointer_only_for_licence":22,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":3,"papers_with_a_run_with_no_instrument_failure":3,"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":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/hierarchical-multi-label-classification-on-18","since_archive":"/sota/hierarchical-multi-label-classification-on-18#since-judged","papers_judged":1,"placed":0}]},"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":"08e9d049d0afa75a41d16f6a6eeb413e7d7745ef3187840708e4691bec09e9a0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}