{"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/knowledge-probing/papers/ran/1","list_of":"/task/knowledge-probing","task":"Knowledge Probing","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,10],"of":10,"counts":{"archive_papers_tagged":46,"with_a_code_link":23,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":46,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/knowledge-probing/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/correlation-and-navigation-in-the-vocabulary","slug":"correlation-and-navigation-in-the-vocabulary","title":"Correlation and Navigation in the Vocabulary Key Representation Space of Language Models","date":"2024-10-03","arxiv_id":"2410.02284","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/correlation-and-navigation-in-the-vocabulary#ran","syntology_url":"https://syntology.ai/paper/2410.02284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02284"}},"official":{"repos":["KomeijiForce/KeyNavi"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bear-a-unified-framework-for-evaluating","slug":"bear-a-unified-framework-for-evaluating","title":"BEAR: A Unified Framework for Evaluating Relational Knowledge in Causal and Masked Language Models","date":"2024-04-05","arxiv_id":"2404.04113","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/bear-a-unified-framework-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2404.04113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04113"}},"official":{"repos":["lm-pub-quiz/lm-pub-quiz"],"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/unveiling-llms-the-evolution-of-latent","slug":"unveiling-llms-the-evolution-of-latent","title":"Unveiling LLMs: The Evolution of Latent Representations in a Dynamic Knowledge Graph","date":"2024-04-04","arxiv_id":"2404.03623","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unveiling-llms-the-evolution-of-latent#ran","syntology_url":"https://syntology.ai/paper/2404.03623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03623"}},"official":{"repos":["Ipazia-AI/latent-explorer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/can-language-models-solve-graph-problems-in","slug":"can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","arxiv_id":"2305.10037","repositories_listed":2,"syntology":{"n":22,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/can-language-models-solve-graph-problems-in#ran","syntology_url":"https://syntology.ai/paper/2305.10037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10037"}},"official":{"repos":["arthur-heng/nlgraph"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/when-not-to-trust-language-models","slug":"when-not-to-trust-language-models","title":"When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memories","date":"2022-12-20","arxiv_id":"2212.10511","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":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) · 2 unverified","sample_list":"/paper/when-not-to-trust-language-models#ran","syntology_url":"https://syntology.ai/paper/2212.10511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10511"}},"official":{"repos":["alextmallen/adaptive-retrieval"],"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/galactica-a-large-language-model-for-science-1","slug":"galactica-a-large-language-model-for-science-1","title":"Galactica: A Large Language Model for Science","date":"2022-11-16","arxiv_id":"2211.09085","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/galactica-a-large-language-model-for-science-1#ran","syntology_url":"https://syntology.ai/paper/2211.09085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09085"}},"official":{"repos":["paperswithcode/galai"],"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/copen-probing-conceptual-knowledge-in-pre","slug":"copen-probing-conceptual-knowledge-in-pre","title":"COPEN: Probing Conceptual Knowledge in Pre-trained Language Models","date":"2022-11-08","arxiv_id":"2211.04079","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/copen-probing-conceptual-knowledge-in-pre#ran","syntology_url":"https://syntology.ai/paper/2211.04079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.04079"}},"official":{"repos":["thu-keg/copen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/calibrating-factual-knowledge-in-pretrained","slug":"calibrating-factual-knowledge-in-pretrained","title":"Calibrating Factual Knowledge in Pretrained Language Models","date":"2022-10-07","arxiv_id":"2210.03329","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/calibrating-factual-knowledge-in-pretrained#ran","syntology_url":"https://syntology.ai/paper/2210.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03329"}},"official":{"repos":["dqxiu/calinet"],"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/gpt-understands-too","slug":"gpt-understands-too","title":"GPT Understands, Too","date":"2021-03-18","arxiv_id":"2103.10385","repositories_listed":10,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gpt-understands-too#ran","syntology_url":"https://syntology.ai/paper/2103.10385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10385"}},"official":{"repos":["THUDM/P-tuning"],"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":["listed","official"]}}},{"url":"/paper/colake-contextualized-language-and-knowledge","slug":"colake-contextualized-language-and-knowledge","title":"CoLAKE: Contextualized Language and Knowledge Embedding","date":"2020-10-01","arxiv_id":"2010.00309","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/colake-contextualized-language-and-knowledge#ran","syntology_url":"https://syntology.ai/paper/2010.00309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00309"}},"official":{"repos":["txsun1997/CoLAKE"],"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"]}}}],"record_sha256":"8b643cd83224dd4e05d5e29e900f4971388373db5320fd7343a036a2237c6ebc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}