{"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/code-search/papers/ran/1","list_of":"/task/code-search","task":"Code Search","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,16],"of":16,"counts":{"archive_papers_tagged":125,"with_a_code_link":60,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":125,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/code-search/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/coir-a-comprehensive-benchmark-for-code","slug":"coir-a-comprehensive-benchmark-for-code","title":"CoIR: A Comprehensive Benchmark for Code Information Retrieval Models","date":"2024-07-03","arxiv_id":"2407.02883","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"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 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) · 3 unverified","sample_list":"/paper/coir-a-comprehensive-benchmark-for-code#ran","syntology_url":"https://syntology.ai/paper/2407.02883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02883"}},"official":{"repos":["coir-team/coir"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/repoqa-evaluating-long-context-code","slug":"repoqa-evaluating-long-context-code","title":"RepoQA: Evaluating Long Context Code Understanding","date":"2024-06-10","arxiv_id":"2406.06025","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/repoqa-evaluating-long-context-code#ran","syntology_url":"https://syntology.ai/paper/2406.06025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06025"}},"official":{"repos":["evalplus/repoqa"],"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/autocoderover-autonomous-program-improvement","slug":"autocoderover-autonomous-program-improvement","title":"AutoCodeRover: Autonomous Program Improvement","date":"2024-04-08","arxiv_id":"2404.05427","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/autocoderover-autonomous-program-improvement#ran","syntology_url":"https://syntology.ai/paper/2404.05427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05427"}},"official":{"repos":["nus-apr/auto-code-rover"],"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/rewriting-the-code-a-simple-method-for-large","slug":"rewriting-the-code-a-simple-method-for-large","title":"Rewriting the Code: A Simple Method for Large Language Model Augmented Code Search","date":"2024-01-09","arxiv_id":"2401.04514","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/rewriting-the-code-a-simple-method-for-large#ran","syntology_url":"https://syntology.ai/paper/2401.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04514"}},"official":{"repos":["alex-haochenli/reco"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-language-model-pretraining","slug":"structure-aware-language-model-pretraining","title":"Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data","date":"2023-05-31","arxiv_id":"2305.19912","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structure-aware-language-model-pretraining#ran","syntology_url":"https://syntology.ai/paper/2305.19912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19912"}},"official":{"repos":["openmatch/openmatch"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/backdooring-neural-code-search","slug":"backdooring-neural-code-search","title":"Backdooring Neural Code Search","date":"2023-05-27","arxiv_id":"2305.17506","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/backdooring-neural-code-search#ran","syntology_url":"https://syntology.ai/paper/2305.17506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17506"}},"official":{"repos":["wssun/badcode"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/codet5-open-code-large-language-models-for","slug":"codet5-open-code-large-language-models-for","title":"CodeT5+: Open Code Large Language Models for Code Understanding and Generation","date":"2023-05-13","arxiv_id":"2305.07922","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/codet5-open-code-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.07922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07922"}},"official":{"repos":["salesforce/codet5"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tail-batch-sampling-approximating-global","slug":"tail-batch-sampling-approximating-global","title":"Global Contrastive Batch Sampling via Optimization on Sample Permutations","date":"2022-10-23","arxiv_id":"2210.12874","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/tail-batch-sampling-approximating-global#ran","syntology_url":"https://syntology.ai/paper/2210.12874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12874"}},"official":{"repos":["vinayak1/gcbs"],"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/contragen-effective-contrastive-learning-for","slug":"contragen-effective-contrastive-learning-for","title":"ContraCLM: Contrastive Learning For Causal Language Model","date":"2022-10-03","arxiv_id":"2210.01185","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/contragen-effective-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2210.01185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01185"}},"official":null}},{"url":"/paper/xlcost-a-benchmark-dataset-for-cross-lingual","slug":"xlcost-a-benchmark-dataset-for-cross-lingual","title":"XLCoST: A Benchmark Dataset for Cross-lingual Code Intelligence","date":"2022-06-16","arxiv_id":"2206.08474","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":2,"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/xlcost-a-benchmark-dataset-for-cross-lingual#ran","syntology_url":"https://syntology.ai/paper/2206.08474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08474"}},"official":{"repos":["reddy-lab-code-research/xlcost"],"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/unixcoder-unified-cross-modal-pre-training","slug":"unixcoder-unified-cross-modal-pre-training","title":"UniXcoder: Unified Cross-Modal Pre-training for Code Representation","date":"2022-03-08","arxiv_id":"2203.03850","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"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 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) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/unixcoder-unified-cross-modal-pre-training#ran","syntology_url":"https://syntology.ai/paper/2203.03850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03850"}},"official":{"repos":["microsoft/CodeBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-importance-of-building-high-quality","slug":"on-the-importance-of-building-high-quality","title":"On the Importance of Building High-quality Training Datasets for Neural Code Search","date":"2022-02-14","arxiv_id":"2202.06649","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":3,"n_no_contract":0,"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, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-importance-of-building-high-quality#ran","syntology_url":"https://syntology.ai/paper/2202.06649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06649"}},"official":{"repos":["v587su/nlqf"],"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/bridging-pre-trained-models-and-downstream","slug":"bridging-pre-trained-models-and-downstream","title":"Bridging Pre-trained Models and Downstream Tasks for Source Code Understanding","date":"2021-12-04","arxiv_id":"2112.02268","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bridging-pre-trained-models-and-downstream#ran","syntology_url":"https://syntology.ai/paper/2112.02268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02268"}},"official":{"repos":["wangdeze18/DACL"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/codesc-a-large-code-description-parallel","slug":"codesc-a-large-code-description-parallel","title":"CoDesc: A Large Code-Description Parallel Dataset","date":"2021-05-29","arxiv_id":"2105.14220","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":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/codesc-a-large-code-description-parallel#ran","syntology_url":"https://syntology.ai/paper/2105.14220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14220"}},"official":{"repos":["csebuetnlp/CoDesc"],"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/codexglue-a-machine-learning-benchmark","slug":"codexglue-a-machine-learning-benchmark","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","date":"2021-02-09","arxiv_id":"2102.04664","repositories_listed":7,"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/codexglue-a-machine-learning-benchmark#ran","syntology_url":"https://syntology.ai/paper/2102.04664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04664"}},"official":{"repos":["microsoft/CodeXGLUE"],"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/codesearchnet-challenge-evaluating-the-state","slug":"codesearchnet-challenge-evaluating-the-state","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","date":"2019-09-20","arxiv_id":"1909.09436","repositories_listed":14,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/codesearchnet-challenge-evaluating-the-state#ran","syntology_url":"https://syntology.ai/paper/1909.09436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09436"}},"official":{"repos":["github/CodeSearchNet"],"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":["listed","official"]}}}],"record_sha256":"624a00f9469467bceb6dd36034ccbea86fde3ee358ab59c9cac3d7f2d301b9d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}