{"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":"/code/read-predictions","entry":"read_predictions","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"unverified":1},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2509.24088","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24088","title":"CORRECT: Condensed Error Recognition via Knowledge Transfer in Multi-agent Systems","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"UIUC-MLSys/CORRECT","path":"src/evaluate.py","file_url":"https://github.com/UIUC-MLSys/CORRECT/blob/HEAD/src/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, UIUC-MLSys/CORRECT (NOASSERTION)","code_sha256":"d7e23813e9b7b1b0","code_sha256_prefix":"d7e23813e9b7b1b0","mcp_get_code":{"code_sha256":"d7e23813e9b7b1b0"}},{"arxiv_id":"2505.00212","arxiv_id_is_arxiv":true,"paper":"/paper/which-agent-causes-task-failures-and-when-on","title":"Which Agent Causes Task Failures and When? On Automated Failure Attribution of LLM Multi-Agent Systems","date":"2025-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyin1/agents_failure_attribution","path":"Automated_FA/evaluate.py","file_url":"https://github.com/mingyin1/agents_failure_attribution/blob/HEAD/Automated_FA/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23b923056bf19e53","code_sha256_prefix":"23b923056bf19e53","mcp_get_code":{"code_sha256":"23b923056bf19e53"}},{"arxiv_id":"2312.15614","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"clone/evaluator/evaluator.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/clone/evaluator/evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zwtnju/peft when it was checked","code_sha256":"bc0a52fa08b13927","code_sha256_prefix":"bc0a52fa08b13927","mcp_get_code":{"code_sha256":"bc0a52fa08b13927"}},{"arxiv_id":"2312.15614","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"defect/evaluator/evaluator.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/defect/evaluator/evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zwtnju/peft when it was checked","code_sha256":"c5842e6ad19a6199","code_sha256_prefix":"c5842e6ad19a6199","mcp_get_code":{"code_sha256":"c5842e6ad19a6199"}},{"arxiv_id":"2311.15781","arxiv_id_is_arxiv":true,"paper":"/paper/increasing-coverage-and-precision-of-textual","title":"Increasing Coverage and Precision of Textual Information in Multilingual Knowledge Graphs","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-kge","path":"src/evaluation/evaluate_coverage.py","file_url":"https://github.com/apple/ml-kge/blob/HEAD/src/evaluation/evaluate_coverage.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c669eba753b0ab5","code_sha256_prefix":"7c669eba753b0ab5","mcp_get_code":{"code_sha256":"7c669eba753b0ab5"}},{"arxiv_id":"2206.08474","arxiv_id_is_arxiv":true,"paper":"/paper/xlcost-a-benchmark-dataset-for-cross-lingual","title":"XLCoST: A Benchmark Dataset for Cross-lingual Code Intelligence","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reddy-lab-code-research/xlcost","path":"code/codesearch/code2codesearch/evaluator/evaluator.py","file_url":"https://github.com/reddy-lab-code-research/xlcost/blob/HEAD/code/codesearch/code2codesearch/evaluator/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bd511beb7477ff28","code_sha256_prefix":"bd511beb7477ff28","mcp_get_code":{"code_sha256":"bd511beb7477ff28"}},{"arxiv_id":"2112.02268","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-pre-trained-models-and-downstream","title":"Bridging Pre-trained Models and Downstream Tasks for Source Code Understanding","date":"2021-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangdeze18/DACL","path":"algorithm_classification/evaluator/eva_MAP.py","file_url":"https://github.com/wangdeze18/DACL/blob/HEAD/algorithm_classification/evaluator/eva_MAP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a82333e3033af699","code_sha256_prefix":"a82333e3033af699","mcp_get_code":{"code_sha256":"a82333e3033af699"}},{"arxiv_id":"2008.04838","arxiv_id_is_arxiv":true,"paper":"/paper/transnet-v2-an-effective-deep-network","title":"TransNet V2: An effective deep network architecture for fast shot transition detection","date":"2020-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shallwe999/TransNetV2-SBD-Visualize","path":"utils.py","file_url":"https://github.com/shallwe999/TransNetV2-SBD-Visualize/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa843917bfca3cfb","code_sha256_prefix":"fa843917bfca3cfb","mcp_get_code":{"code_sha256":"fa843917bfca3cfb"}},{"arxiv_id":"2007.15207","arxiv_id_is_arxiv":true,"paper":"/paper/mkqa-a-linguistically-diverse-benchmark-for","title":"MKQA: A Linguistically Diverse Benchmark for Multilingual Open Domain Question Answering","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-mkqa","path":"mkqa_eval.py","file_url":"https://github.com/apple/ml-mkqa/blob/HEAD/mkqa_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2e26d4764ff96b4","code_sha256_prefix":"e2e26d4764ff96b4","mcp_get_code":{"code_sha256":"e2e26d4764ff96b4"}}],"record_sha256":"6df0724b650827a1e05cb94c5fa5f60693d0c90a2fe8c0a4f5f7934369e27d6d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}