{"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/re-tacred","name":"Re-TACRED","full_name":"Revised-TACRED","description_markdown":"The Re-TACRED dataset is a significantly improved version of the TACRED dataset for relation extraction. Using new crowd-sourced labels, Re-TACRED prunes poorly annotated sentences and addresses TACRED relation definition ambiguity, ultimately correcting 23.9% of TACRED labels. This dataset contains over 91 thousand sentences spread across 40 relations. Dataset presented at AAAI 2021.\r\n\r\nPaper (arXiv): https://arxiv.org/abs/2104.08398","description_withheld":null,"homepage":"https://github.com/gstoica27/Re-TACRED","introduced_date":"2021-04-16","introduced_date_note":null,"introduced_by":{"paper":"/paper/re-tacred-addressing-shortcomings-of-the","title":"Re-TACRED: Addressing Shortcomings of the TACRED Dataset","first_author":"George Stoica","url":null},"license":null,"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Relation Extraction","url":"/task/relation-extraction","datasets_with_task":"/datasets/task/relation-extraction"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["Re-TACRED"],"data_loaders":[{"repo":"https://github.com/gstoica27/Re-TACRED","url":"https://github.com/gstoica27/Re-TACRED","frameworks":[]}],"num_papers_in_archive":56,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/relation-extraction-on-re-tacred","task":"Relation Extraction","dataset_variant":"Re-TACRED","rows":9,"metrics":["F1"],"first_row_in_archive_order":{"model":"EXOBRAIN","paper":"/paper/improving-sentence-level-relation-extraction","metrics":{"F1":"91.4"},"code_links":[]},"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":9,"of":9,"counts":{"papers_with_a_benchmark_row":9,"with_a_code_link":8,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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/retrieval-augmented-generation-based-relation","slug":"retrieval-augmented-generation-based-relation","title":"Retrieval-Augmented Generation-based Relation Extraction","date":"2024-04-20","arxiv_id":"2404.13397","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/aligning-instruction-tasks-unlocks-large","slug":"aligning-instruction-tasks-unlocks-large","title":"Aligning Instruction Tasks Unlocks Large Language Models as Zero-Shot Relation Extractors","date":"2023-05-18","arxiv_id":"2305.11159","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/generative-prompt-tuning-for-relation-1","slug":"generative-prompt-tuning-for-relation-1","title":"Generative Prompt Tuning for Relation Classification","date":"2022-10-22","arxiv_id":"2210.12435","rows_on_this_dataset":1,"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/improving-sentence-level-relation-extraction","slug":"improving-sentence-level-relation-extraction","title":"Improving Sentence-Level Relation Extraction through Curriculum Learning","date":"2021-07-20","arxiv_id":"2107.09332","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/an-improved-baseline-for-sentence-level","slug":"an-improved-baseline-for-sentence-level","title":"An Improved Baseline for Sentence-level Relation Extraction","date":"2021-02-02","arxiv_id":"2102.01373","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/graph-convolution-over-pruned-dependency","slug":"graph-convolution-over-pruned-dependency","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","date":"2018-09-26","arxiv_id":"1809.10185","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/position-aware-attention-and-supervised-data","slug":"position-aware-attention-and-supervised-data","title":"Position-aware Attention and Supervised Data Improve Slot Filling","date":"2017-09-01","arxiv_id":null,"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/retrieval-augmented-generation-based-relation","slug":"retrieval-augmented-generation-based-relation","title":"Retrieval-Augmented Generation-based Relation Extraction","date":"2024-04-20","arxiv_id":"2404.13397","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/aligning-instruction-tasks-unlocks-large","slug":"aligning-instruction-tasks-unlocks-large","title":"Aligning Instruction Tasks Unlocks Large Language Models as Zero-Shot Relation Extractors","date":"2023-05-18","arxiv_id":"2305.11159","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/generative-prompt-tuning-for-relation-1","slug":"generative-prompt-tuning-for-relation-1","title":"Generative Prompt Tuning for Relation Classification","date":"2022-10-22","arxiv_id":"2210.12435","rows_on_this_dataset":1,"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/improving-sentence-level-relation-extraction","slug":"improving-sentence-level-relation-extraction","title":"Improving Sentence-Level Relation Extraction through Curriculum Learning","date":"2021-07-20","arxiv_id":"2107.09332","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/an-improved-baseline-for-sentence-level","slug":"an-improved-baseline-for-sentence-level","title":"An Improved Baseline for Sentence-level Relation Extraction","date":"2021-02-02","arxiv_id":"2102.01373","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/graph-convolution-over-pruned-dependency","slug":"graph-convolution-over-pruned-dependency","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","date":"2018-09-26","arxiv_id":"1809.10185","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/position-aware-attention-and-supervised-data","slug":"position-aware-attention-and-supervised-data","title":"Position-aware Attention and Supervised Data Improve Slot Filling","date":"2017-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null}],"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/dataset/re-tacred/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/re-tacred/papers/ran/1","json":"/dataset/re-tacred/papers/ran/1.json","rows":1}],"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":1,"samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":1,"papers_with_a_run_with_no_instrument_failure":1,"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":"87f91b47393eeb398c356f59dc898e3e96f40cca39ba6abb853514faa4eca741","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}