{"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":"/task/relation-extraction/papers/ran/2","list_of":"/task/relation-extraction","task":"Relation Extraction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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'","n_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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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 task or check it against the task'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.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,111],"of":111,"counts":{"archive_papers_tagged":1977,"with_a_code_link":735,"where_syntology_ran_a_sample":111,"not_listed_spam_title":0,"listed":1977,"listed_where_code_ran":111,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":93,"every_run_a_failure_of_syntologys_instrument":18,"listed_with_a_run_with_no_instrument_failure":93,"listed_every_run_a_failure_of_syntologys_instrument":18,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/relation-extraction/papers/ran/1","prev":"/task/relation-extraction/papers/ran/1","next":null,"papers":[{"url":"/paper/simple-bert-models-for-relation-extraction","slug":"simple-bert-models-for-relation-extraction","title":"Simple BERT Models for Relation Extraction and Semantic Role Labeling","date":"2019-04-10","arxiv_id":"1904.05255","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-bert-models-for-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/1904.05255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05255"}},"official":{"repos":["Impavidity/relogic"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-dual-retrieval-module-for-semi","slug":"learning-dual-retrieval-module-for-semi","title":"Learning Dual Retrieval Module for Semi-supervised Relation Extraction","date":"2019-02-20","arxiv_id":"1902.07814","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-dual-retrieval-module-for-semi#ran","syntology_url":"https://syntology.ai/paper/1902.07814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07814"}},"official":{"repos":["INK-USC/DualRE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simplifying-graph-convolutional-networks","slug":"simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","arxiv_id":"1902.07153","repositories_listed":7,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplifying-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1902.07153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07153"}},"official":{"repos":["Tiiiger/SGC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/extracting-multiple-relations-in-one-pass","slug":"extracting-multiple-relations-in-one-pass","title":"Extracting Multiple-Relations in One-Pass with Pre-Trained Transformers","date":"2019-02-04","arxiv_id":"1902.01030","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/extracting-multiple-relations-in-one-pass#ran","syntology_url":"https://syntology.ai/paper/1902.01030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01030"}},"official":{"repos":["helloeve/mre-in-one-pass"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/biobert-a-pre-trained-biomedical-language","slug":"biobert-a-pre-trained-biomedical-language","title":"BioBERT: a pre-trained biomedical language representation model for biomedical text mining","date":"2019-01-25","arxiv_id":"1901.08746","repositories_listed":19,"syntology":{"n":25,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/biobert-a-pre-trained-biomedical-language#ran","syntology_url":"https://syntology.ai/paper/1901.08746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08746"}},"official":{"repos":["dmis-lab/biobert","naver/biobert-pretrained"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/reside-improving-distantly-supervised-neural","slug":"reside-improving-distantly-supervised-neural","title":"RESIDE: Improving Distantly-Supervised Neural Relation Extraction using Side Information","date":"2018-12-11","arxiv_id":"1812.04361","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/reside-improving-distantly-supervised-neural#ran","syntology_url":"https://syntology.ai/paper/1812.04361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.04361"}},"official":{"repos":["malllabiisc/RESIDE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-hierarchical-multi-task-approach-for","slug":"a-hierarchical-multi-task-approach-for","title":"A Hierarchical Multi-task Approach for Learning Embeddings from Semantic Tasks","date":"2018-11-14","arxiv_id":"1811.06031","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-hierarchical-multi-task-approach-for#ran","syntology_url":"https://syntology.ai/paper/1811.06031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06031"}},"official":null}},{"url":"/paper/fewrel-a-large-scale-supervised-few-shot","slug":"fewrel-a-large-scale-supervised-few-shot","title":"FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluation","date":"2018-10-24","arxiv_id":"1810.10147","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fewrel-a-large-scale-supervised-few-shot#ran","syntology_url":"https://syntology.ai/paper/1810.10147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.10147"}},"official":null}},{"url":"/paper/the-natural-language-decathlon-multitask","slug":"the-natural-language-decathlon-multitask","title":"The Natural Language Decathlon: Multitask Learning as Question Answering","date":"2018-06-20","arxiv_id":"1806.08730","repositories_listed":6,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-natural-language-decathlon-multitask#ran","syntology_url":"https://syntology.ai/paper/1806.08730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08730"}},"official":{"repos":["salesforce/decaNLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/robust-distant-supervision-relation","slug":"robust-distant-supervision-relation","title":"Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning","date":"2018-05-24","arxiv_id":"1805.09927","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-distant-supervision-relation#ran","syntology_url":"https://syntology.ai/paper/1805.09927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09927"}},"official":null}},{"url":"/paper/classifying-relations-by-ranking-with","slug":"classifying-relations-by-ranking-with","title":"Classifying Relations by Ranking with Convolutional Neural Networks","date":"2015-04-24","arxiv_id":"1504.06580","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/classifying-relations-by-ranking-with#ran","syntology_url":"https://syntology.ai/paper/1504.06580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1504.06580"}},"official":null}}],"record_sha256":"3f88ab3f8d8c9804fe5d713ce3e1836dc6630eb4b1c540b7795e63dda94c75ff","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}