{"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/negation/papers/ran/1","list_of":"/task/negation","task":"Negation","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,41],"of":41,"counts":{"archive_papers_tagged":608,"with_a_code_link":173,"where_syntology_ran_a_sample":41,"not_listed_spam_title":0,"listed":608,"listed_where_code_ran":41,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":30,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":30,"listed_every_run_a_failure_of_syntologys_instrument":11,"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/negation/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/probing-the-geometry-of-truth-consistency-and","slug":"probing-the-geometry-of-truth-consistency-and","title":"Probing the Geometry of Truth: Consistency and Generalization of Truth Directions in LLMs Across Logical Transformations and Question Answering Tasks","date":"2025-06-01","arxiv_id":"2506.00823","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/probing-the-geometry-of-truth-consistency-and#ran","syntology_url":"https://syntology.ai/paper/2506.00823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.00823"}},"official":{"repos":["colored-dye/truthfulness_probe_generalization"],"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/formalmath-benchmarking-formal-mathematical","slug":"formalmath-benchmarking-formal-mathematical","title":"FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models","date":"2025-05-05","arxiv_id":"2505.02735","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/formalmath-benchmarking-formal-mathematical#ran","syntology_url":"https://syntology.ai/paper/2505.02735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.02735"}},"official":{"repos":["sphere-ai-lab/formalmath-bench"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-model-editing-with-task-vector","slug":"efficient-model-editing-with-task-vector","title":"Efficient Model Editing with Task Vector Bases: A Theoretical Framework and Scalable Approach","date":"2025-02-03","arxiv_id":"2502.01015","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 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) · 2 unverified","sample_list":"/paper/efficient-model-editing-with-task-vector#ran","syntology_url":"https://syntology.ai/paper/2502.01015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01015"}},"official":{"repos":["uiuctml/TaskVectorBasis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/negmerge-consensual-weight-negation-for","slug":"negmerge-consensual-weight-negation-for","title":"NegMerge: Consensual Weight Negation for Strong Machine Unlearning","date":"2024-10-08","arxiv_id":"2410.05583","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/negmerge-consensual-weight-negation-for#ran","syntology_url":"https://syntology.ai/paper/2410.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05583"}},"official":{"repos":["naver-ai/negmerge"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluation-of-pretrained-language-models-on","slug":"evaluation-of-pretrained-language-models-on","title":"Evaluation of pretrained language models on music understanding","date":"2024-09-17","arxiv_id":"2409.11449","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluation-of-pretrained-language-models-on#ran","syntology_url":"https://syntology.ai/paper/2409.11449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.11449"}},"official":{"repos":["YannisBilly/Evaluation-of-pretrained-language-models-on-music-understanding"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rublimp-russian-benchmark-of-linguistic","slug":"rublimp-russian-benchmark-of-linguistic","title":"RuBLiMP: Russian Benchmark of Linguistic Minimal Pairs","date":"2024-06-27","arxiv_id":"2406.19232","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rublimp-russian-benchmark-of-linguistic#ran","syntology_url":"https://syntology.ai/paper/2406.19232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19232"}},"official":{"repos":["russiannlp/rublimp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/towards-safer-large-language-models-through","slug":"towards-safer-large-language-models-through","title":"Towards Safer Large Language Models through Machine Unlearning","date":"2024-02-15","arxiv_id":"2402.10058","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/towards-safer-large-language-models-through#ran","syntology_url":"https://syntology.ai/paper/2402.10058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10058"}},"official":{"repos":["franciscoliu/sku"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/longhealth-a-question-answering-benchmark","slug":"longhealth-a-question-answering-benchmark","title":"LongHealth: A Question Answering Benchmark with Long Clinical Documents","date":"2024-01-25","arxiv_id":"2401.14490","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":0,"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/longhealth-a-question-answering-benchmark#ran","syntology_url":"https://syntology.ai/paper/2401.14490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14490"}},"official":{"repos":["kbressem/longhealth"],"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/expressive-sign-equivariant-networks-for-1","slug":"expressive-sign-equivariant-networks-for-1","title":"Expressive Sign Equivariant Networks for Spectral Geometric Learning","date":"2023-12-04","arxiv_id":"2312.02339","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 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) · 3 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/expressive-sign-equivariant-networks-for-1#ran","syntology_url":"https://syntology.ai/paper/2312.02339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02339"}},"official":{"repos":["cptq/sign-equivariant-nets"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/regularization-by-texts-for-latent-diffusion","slug":"regularization-by-texts-for-latent-diffusion","title":"Regularization by Texts for Latent Diffusion Inverse Solvers","date":"2023-11-27","arxiv_id":"2311.15658","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/regularization-by-texts-for-latent-diffusion#ran","syntology_url":"https://syntology.ai/paper/2311.15658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15658"}},"official":{"repos":["treg-inverse/treg"],"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/you-don-t-need-a-personality-test-to-know","slug":"you-don-t-need-a-personality-test-to-know","title":"You don't need a personality test to know these models are unreliable: Assessing the Reliability of Large Language Models on Psychometric Instruments","date":"2023-11-16","arxiv_id":"2311.09718","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/you-don-t-need-a-personality-test-to-know#ran","syntology_url":"https://syntology.ai/paper/2311.09718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09718"}},"official":{"repos":["orange0629/llm-personas"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/instant3d-instant-text-to-3d-generation","slug":"instant3d-instant-text-to-3d-generation","title":"Instant3D: Instant Text-to-3D Generation","date":"2023-11-14","arxiv_id":"2311.08403","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/instant3d-instant-text-to-3d-generation#ran","syntology_url":"https://syntology.ai/paper/2311.08403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08403"}},"official":{"repos":["ming1993li/instant3dcodes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/can-linguistic-knowledge-improve-multimodal","slug":"can-linguistic-knowledge-improve-multimodal","title":"Can Linguistic Knowledge Improve Multimodal Alignment in Vision-Language Pretraining?","date":"2023-08-24","arxiv_id":"2308.12898","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-linguistic-knowledge-improve-multimodal#ran","syntology_url":"https://syntology.ai/paper/2308.12898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12898"}},"official":{"repos":["wangfei-2019/snare"],"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":["official"]}}},{"url":"/paper/clipn-for-zero-shot-ood-detection-teaching","slug":"clipn-for-zero-shot-ood-detection-teaching","title":"CLIPN for Zero-Shot OOD Detection: Teaching CLIP to Say No","date":"2023-08-23","arxiv_id":"2308.12213","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":1,"n_ran_checked":8,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/clipn-for-zero-shot-ood-detection-teaching#ran","syntology_url":"https://syntology.ai/paper/2308.12213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12213"}},"official":{"repos":["xmed-lab/clipn"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/composing-parameter-efficient-modules-with","slug":"composing-parameter-efficient-modules-with","title":"Composing Parameter-Efficient Modules with Arithmetic Operations","date":"2023-06-26","arxiv_id":"2306.14870","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/composing-parameter-efficient-modules-with#ran","syntology_url":"https://syntology.ai/paper/2306.14870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14870"}},"official":{"repos":["hkust-nlp/pem_composition","sjtu-lit/pem_composition"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/an-examination-of-the-robustness-of-reference","slug":"an-examination-of-the-robustness-of-reference","title":"An Examination of the Robustness of Reference-Free Image Captioning Evaluation Metrics","date":"2023-05-24","arxiv_id":"2305.14998","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-examination-of-the-robustness-of-reference#ran","syntology_url":"https://syntology.ai/paper/2305.14998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14998"}},"official":{"repos":["saba96/img-cap-metrics-robustness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/factkg-fact-verification-via-reasoning-on","slug":"factkg-fact-verification-via-reasoning-on","title":"FactKG: Fact Verification via Reasoning on Knowledge Graphs","date":"2023-05-11","arxiv_id":"2305.06590","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/factkg-fact-verification-via-reasoning-on#ran","syntology_url":"https://syntology.ai/paper/2305.06590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06590"}},"official":{"repos":["jiho283/FactKG"],"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/say-what-you-mean-large-language-models-speak","slug":"say-what-you-mean-large-language-models-speak","title":"Say What You Mean! Large Language Models Speak Too Positively about Negative Commonsense Knowledge","date":"2023-05-10","arxiv_id":"2305.05976","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/say-what-you-mean-large-language-models-speak#ran","syntology_url":"https://syntology.ai/paper/2305.05976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05976"}},"official":{"repos":["jiangjiechen/uncommongen"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/crepe-can-vision-language-foundation-models","slug":"crepe-can-vision-language-foundation-models","title":"CREPE: Can Vision-Language Foundation Models Reason Compositionally?","date":"2022-12-13","arxiv_id":"2212.07796","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/crepe-can-vision-language-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2212.07796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.07796"}},"official":{"repos":["raivnlab/crepe"],"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"]}}},{"url":"/paper/editing-models-with-task-arithmetic","slug":"editing-models-with-task-arithmetic","title":"Editing Models with Task Arithmetic","date":"2022-12-08","arxiv_id":"2212.04089","repositories_listed":9,"syntology":{"n":15,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/editing-models-with-task-arithmetic#ran","syntology_url":"https://syntology.ai/paper/2212.04089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04089"}},"official":{"repos":["mlfoundations/task_vectors"],"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/discovering-latent-knowledge-in-language","slug":"discovering-latent-knowledge-in-language","title":"Discovering Latent Knowledge in Language Models Without Supervision","date":"2022-12-07","arxiv_id":"2212.03827","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 0 unverified","sample_list":"/paper/discovering-latent-knowledge-in-language#ran","syntology_url":"https://syntology.ai/paper/2212.03827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03827"}},"official":{"repos":["collin-burns/discovering_latent_knowledge"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gammae-gamma-embeddings-for-logical-queries","slug":"gammae-gamma-embeddings-for-logical-queries","title":"GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs","date":"2022-10-27","arxiv_id":"2210.15578","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gammae-gamma-embeddings-for-logical-queries#ran","syntology_url":"https://syntology.ai/paper/2210.15578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15578"}},"official":{"repos":["dyang67/GammaE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/are-all-spurious-features-in-natural-language","slug":"are-all-spurious-features-in-natural-language","title":"Are All Spurious Features in Natural Language Alike? An Analysis through a Causal Lens","date":"2022-10-25","arxiv_id":"2210.14011","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/are-all-spurious-features-in-natural-language#ran","syntology_url":"https://syntology.ai/paper/2210.14011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14011"}},"official":{"repos":["joshinh/spurious-correlations-nlp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-methods-for-logical-reasoning-over-1","slug":"neural-methods-for-logical-reasoning-over-1","title":"Neural Methods for Logical Reasoning Over Knowledge Graphs","date":"2022-09-28","arxiv_id":"2209.14464","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-methods-for-logical-reasoning-over-1#ran","syntology_url":"https://syntology.ai/paper/2209.14464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14464"}},"official":{"repos":["amayuelas/NNKGReasoning"],"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"]}}},{"url":"/paper/sbert-studies-meaning-representations","slug":"sbert-studies-meaning-representations","title":"SBERT studies Meaning Representations: Decomposing Sentence Embeddings into Explainable Semantic Features","date":"2022-06-14","arxiv_id":"2206.07023","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sbert-studies-meaning-representations#ran","syntology_url":"https://syntology.ai/paper/2206.07023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07023"}},"official":{"repos":["flipz357/S3BERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/robustlr-evaluating-robustness-to-logical","slug":"robustlr-evaluating-robustness-to-logical","title":"RobustLR: Evaluating Robustness to Logical Perturbation in Deductive Reasoning","date":"2022-05-25","arxiv_id":"2205.12598","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/robustlr-evaluating-robustness-to-logical#ran","syntology_url":"https://syntology.ai/paper/2205.12598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12598"}},"official":{"repos":["ink-usc/robustlr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-scientific-claims-for-zero-shot-1","slug":"generating-scientific-claims-for-zero-shot-1","title":"Generating Scientific Claims for Zero-Shot Scientific Fact Checking","date":"2022-03-24","arxiv_id":"2203.12990","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generating-scientific-claims-for-zero-shot-1#ran","syntology_url":"https://syntology.ai/paper/2203.12990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12990"}},"official":{"repos":["allenai/scientific-claim-generation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-analysis-of-negation-in-natural-language","slug":"an-analysis-of-negation-in-natural-language","title":"An Analysis of Negation in Natural Language Understanding Corpora","date":"2022-03-16","arxiv_id":"2203.08929","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-analysis-of-negation-in-natural-language#ran","syntology_url":"https://syntology.ai/paper/2203.08929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08929"}},"official":{"repos":["mosharafhossain/negation-and-nlu"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/greaselm-graph-reasoning-enhanced-language-1","slug":"greaselm-graph-reasoning-enhanced-language-1","title":"GreaseLM: Graph REASoning Enhanced Language Models for Question Answering","date":"2022-01-21","arxiv_id":"2201.08860","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":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/greaselm-graph-reasoning-enhanced-language-1#ran","syntology_url":"https://syntology.ai/paper/2201.08860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08860"}},"official":{"repos":["snap-stanford/greaselm"],"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/cone-cone-embeddings-for-multi-hop-reasoning","slug":"cone-cone-embeddings-for-multi-hop-reasoning","title":"ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphs","date":"2021-10-26","arxiv_id":"2110.13715","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":4,"n_ran_checked":5,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cone-cone-embeddings-for-multi-hop-reasoning#ran","syntology_url":"https://syntology.ai/paper/2110.13715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13715"}},"official":{"repos":["miralab-ustc/qe-cone"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/qa-gnn-reasoning-with-language-models-and","slug":"qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","arxiv_id":"2104.06378","repositories_listed":6,"syntology":{"n":25,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/qa-gnn-reasoning-with-language-models-and#ran","syntology_url":"https://syntology.ai/paper/2104.06378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06378"}},"official":{"repos":["michiyasunaga/qagnn","worksheets.codalab.org/worksheets/0xf215deb05edf44a2ac353c711f52a25f"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/logic-embeddings-for-complex-query-answering","slug":"logic-embeddings-for-complex-query-answering","title":"Logic Embeddings for Complex Query Answering","date":"2021-02-28","arxiv_id":"2103.00418","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logic-embeddings-for-complex-query-answering#ran","syntology_url":"https://syntology.ai/paper/2103.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00418"}},"official":{"repos":["francoisluus/KGReasoning"],"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/beta-embeddings-for-multi-hop-logical","slug":"beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","repositories_listed":9,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}},"official":null}},{"url":"/paper/it-s-not-a-non-issue-negation-as-a-source-of","slug":"it-s-not-a-non-issue-negation-as-a-source-of","title":"It's not a Non-Issue: Negation as a Source of Error in Machine Translation","date":"2020-10-12","arxiv_id":"2010.05432","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/it-s-not-a-non-issue-negation-as-a-source-of#ran","syntology_url":"https://syntology.ai/paper/2010.05432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05432"}},"official":{"repos":["mosharafhossain/negation-mt"],"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/how-recurrent-networks-implement-contextual","slug":"how-recurrent-networks-implement-contextual","title":"How recurrent networks implement contextual processing in sentiment analysis","date":"2020-04-17","arxiv_id":"2004.08013","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/how-recurrent-networks-implement-contextual#ran","syntology_url":"https://syntology.ai/paper/2004.08013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08013"}},"official":null}},{"url":"/paper/are-natural-language-inference-models","slug":"are-natural-language-inference-models","title":"Are Natural Language Inference Models IMPPRESsive? Learning IMPlicature and PRESupposition","date":"2020-04-07","arxiv_id":"2004.03066","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/are-natural-language-inference-models#ran","syntology_url":"https://syntology.ai/paper/2004.03066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03066"}},"official":{"repos":["alexwarstadt/data_generation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/negated-lama-birds-cannot-fly","slug":"negated-lama-birds-cannot-fly","title":"Negated and Misprimed Probes for Pretrained Language Models: Birds Can Talk, But Cannot Fly","date":"2019-11-08","arxiv_id":"1911.03343","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/negated-lama-birds-cannot-fly#ran","syntology_url":"https://syntology.ai/paper/1911.03343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03343"}},"official":{"repos":["facebookresearch/LAMA","norakassner/LAMA_primed_negated"],"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/explanation-by-progressive-exaggeration-1","slug":"explanation-by-progressive-exaggeration-1","title":"Explanation by Progressive Exaggeration","date":"2019-11-01","arxiv_id":"1911.00483","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/explanation-by-progressive-exaggeration-1#ran","syntology_url":"https://syntology.ai/paper/1911.00483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00483"}},"official":{"repos":["batmanlab/Explanation_by_Progressive_Exaggeration"],"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/what-bert-is-not-lessons-from-a-new-suite-of","slug":"what-bert-is-not-lessons-from-a-new-suite-of","title":"What BERT is not: Lessons from a new suite of psycholinguistic diagnostics for language models","date":"2019-07-31","arxiv_id":"1907.13528","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/what-bert-is-not-lessons-from-a-new-suite-of#ran","syntology_url":"https://syntology.ai/paper/1907.13528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.13528"}},"official":{"repos":["aetting/lm-diagnostics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evaluating-recurrent-neural-network","slug":"evaluating-recurrent-neural-network","title":"Evaluating Recurrent Neural Network Explanations","date":"2019-04-26","arxiv_id":"1904.11829","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/evaluating-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1904.11829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11829"}},"official":{"repos":["ArrasL/LRP_for_LSTM"],"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/negbio-a-high-performance-tool-for-negation","slug":"negbio-a-high-performance-tool-for-negation","title":"NegBio: a high-performance tool for negation and uncertainty detection in radiology reports","date":"2017-12-16","arxiv_id":"1712.05898","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/negbio-a-high-performance-tool-for-negation#ran","syntology_url":"https://syntology.ai/paper/1712.05898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.05898"}},"official":{"repos":["ncbi-nlp/NegBio"],"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":["official"]}}}],"record_sha256":"9bdd4d6b3235ab83690ea5896faedd21512cf498961c6cfcfdcac2db54e48af1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}