{"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-prediction/papers/ran/1","list_of":"/task/relation-prediction","task":"Relation Prediction","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,20],"of":20,"counts":{"archive_papers_tagged":187,"with_a_code_link":89,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":187,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":6,"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-prediction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/solving-inequality-proofs-with-large-language","slug":"solving-inequality-proofs-with-large-language","title":"Solving Inequality Proofs with Large Language Models","date":"2025-06-09","arxiv_id":"2506.07927","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":1,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":4,"n_no_contract":1,"n_pointer_only":0,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/solving-inequality-proofs-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2506.07927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07927"}},"official":{"repos":["lupantech/ineqmath"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-large-language-models-for-knowledge","slug":"exploring-large-language-models-for-knowledge","title":"Exploring Large Language Models for Knowledge Graph Completion","date":"2023-08-26","arxiv_id":"2308.13916","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":1,"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/exploring-large-language-models-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2308.13916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13916"}},"official":{"repos":["yao8839836/kg-llm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/prototype-based-embedding-network-for-scene","slug":"prototype-based-embedding-network-for-scene","title":"Prototype-based Embedding Network for Scene Graph Generation","date":"2023-03-13","arxiv_id":"2303.07096","repositories_listed":1,"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":3,"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/prototype-based-embedding-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/2303.07096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.07096"}},"official":{"repos":["vl-group/penet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-general-purpose-representation","slug":"towards-general-purpose-representation","title":"Towards General-Purpose Representation Learning of Polygonal Geometries","date":"2022-09-29","arxiv_id":"2209.15458","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-general-purpose-representation#ran","syntology_url":"https://syntology.ai/paper/2209.15458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15458"}},"official":{"repos":["gengchenmai/polygon_encoder"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/r5-rule-discovery-with-reinforced-and-1","slug":"r5-rule-discovery-with-reinforced-and-1","title":"R5: Rule Discovery with Reinforced and Recurrent Relational Reasoning","date":"2022-05-13","arxiv_id":"2205.06454","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/r5-rule-discovery-with-reinforced-and-1#ran","syntology_url":"https://syntology.ai/paper/2205.06454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06454"}},"official":{"repos":["sluxsr/r5_graph_reasoning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/linkbert-pretraining-language-models-with","slug":"linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","arxiv_id":"2203.15827","repositories_listed":1,"syntology":{"n":14,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/linkbert-pretraining-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2203.15827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15827"}},"official":{"repos":["michiyasunaga/LinkBERT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/history-aware-multimodal-transformer-for","slug":"history-aware-multimodal-transformer-for","title":"History Aware Multimodal Transformer for Vision-and-Language Navigation","date":"2021-10-25","arxiv_id":"2110.13309","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":3,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/history-aware-multimodal-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2110.13309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13309"}},"official":null}},{"url":"/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","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}},{"url":"/paper/zero-shot-scene-graph-relation-prediction","slug":"zero-shot-scene-graph-relation-prediction","title":"Zero-Shot Scene Graph Relation Prediction through Commonsense Knowledge Integration","date":"2021-07-11","arxiv_id":"2107.05080","repositories_listed":1,"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":1,"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/zero-shot-scene-graph-relation-prediction#ran","syntology_url":"https://syntology.ai/paper/2107.05080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05080"}},"official":{"repos":["Wayfear/Coacher"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nodepiece-compositional-and-parameter","slug":"nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","slug":"structured-sparse-r-cnn-for-direct-scene","title":"Structured Sparse R-CNN for Direct Scene Graph Generation","date":"2021-06-21","arxiv_id":"2106.10815","repositories_listed":4,"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":1,"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/structured-sparse-r-cnn-for-direct-scene#ran","syntology_url":"https://syntology.ai/paper/2106.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10815"}},"official":{"repos":["mcg-nju/structured-sparse-rcnn"],"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":["unlocated"]}}},{"url":"/paper/prgc-potential-relation-and-global","slug":"prgc-potential-relation-and-global","title":"PRGC: Potential Relation and Global Correspondence Based Joint Relational Triple Extraction","date":"2021-06-18","arxiv_id":"2106.09895","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prgc-potential-relation-and-global#ran","syntology_url":"https://syntology.ai/paper/2106.09895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09895"}},"official":{"repos":["hy-struggle/PRGC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/entity-concept-enhanced-few-shot-relation","slug":"entity-concept-enhanced-few-shot-relation","title":"Entity Concept-enhanced Few-shot Relation Extraction","date":"2021-06-04","arxiv_id":"2106.02401","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/entity-concept-enhanced-few-shot-relation#ran","syntology_url":"https://syntology.ai/paper/2106.02401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02401"}},"official":{"repos":["LittleGuoKe/ConceptFERE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/annotating-columns-with-pre-trained-language","slug":"annotating-columns-with-pre-trained-language","title":"Annotating Columns with Pre-trained Language Models","date":"2021-04-05","arxiv_id":"2104.01785","repositories_listed":1,"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/annotating-columns-with-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2104.01785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01785"}},"official":{"repos":["megagonlabs/doduo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/entity-context-and-relational-paths-for","slug":"entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","arxiv_id":"2002.06757","repositories_listed":4,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 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; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/entity-context-and-relational-paths-for#ran","syntology_url":"https://syntology.ai/paper/2002.06757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06757"}},"official":{"repos":["hwwang55/PathCon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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":1,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"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/weakly-supervised-deep-anomaly-detection-with","slug":"weakly-supervised-deep-anomaly-detection-with","title":"Deep Weakly-supervised Anomaly Detection","date":"2019-10-30","arxiv_id":"1910.13601","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/weakly-supervised-deep-anomaly-detection-with#ran","syntology_url":"https://syntology.ai/paper/1910.13601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13601"}},"official":{"repos":["mala-lab/prenet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"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/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","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":1,"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/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"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"]}}}],"record_sha256":"8aac4a89ff2f7263827df86fcc7c0da240165b753ae15d6479a8ec5621e94aa6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}