{"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/calculate-scores","entry":"calculate_scores","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":5,"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":19,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":19,"n_places_pointer_only":5,"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":6,"ran_fixture":0,"ran":12,"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":"2607.23519","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-23519","title":"Auditing Alignment Controllability in LLMs via Political Axes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"mbrcic/llm-political-steerability","path":"ingestion/01_collect/collect.py","file_url":"https://github.com/mbrcic/llm-political-steerability/blob/HEAD/ingestion/01_collect/collect.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e138e6d169cd6c8f","code_sha256_prefix":"e138e6d169cd6c8f","mcp_get_code":{"code_sha256":"e138e6d169cd6c8f"}},{"arxiv_id":"2602.11570","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11570","title":"PRIME: A Process-Outcome Alignment Benchmark for Verifiable Reasoning in Mathematics and Engineering","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"wonderful9462/PRIME","path":"evaluation/calculate_accuracy.py","file_url":"https://github.com/wonderful9462/PRIME/blob/HEAD/evaluation/calculate_accuracy.py","status":"ran","verification_level":1,"contract_check":null,"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, wonderful9462/PRIME when it was checked","code_sha256":"32f5344f9c7eac24","code_sha256_prefix":"32f5344f9c7eac24","mcp_get_code":{"code_sha256":"32f5344f9c7eac24"}},{"arxiv_id":"2510.08284","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-08284","title":"Neuron-Level Analysis of Cultural Understanding in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ynklab/CULNIG","path":"CULNIG/calc_neuron_score.py","file_url":"https://github.com/ynklab/CULNIG/blob/HEAD/CULNIG/calc_neuron_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29f11de6c42b7989","code_sha256_prefix":"29f11de6c42b7989","mcp_get_code":{"code_sha256":"29f11de6c42b7989"}},{"arxiv_id":"2408.17443","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-episodes-and-semantics-a-novel","title":"HERMES: temporal-coHERent long-forM understanding with Episodes and Semantics","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joslefaure/HERMES","path":"lavis/tasks/moviecore_eval.py","file_url":"https://github.com/joslefaure/HERMES/blob/HEAD/lavis/tasks/moviecore_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e0b77da286c6cb3","code_sha256_prefix":"6e0b77da286c6cb3","mcp_get_code":{"code_sha256":"6e0b77da286c6cb3"}},{"arxiv_id":"2406.11148","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-recognition-via-stage-wise-augmented","title":"Few-Shot Recognition via Stage-Wise Retrieval-Augmented Finetuning","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tian1327/swat","path":"testing.py","file_url":"https://github.com/tian1327/swat/blob/HEAD/testing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"482ccec6fd43050d","code_sha256_prefix":"482ccec6fd43050d","mcp_get_code":{"code_sha256":"482ccec6fd43050d"}},{"arxiv_id":"2403.14198","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-unlabeled-data-a-paradigm-for","title":"Unleashing Unlabeled Data: A Paradigm for Cross-View Geo-Localization","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liguopeng0923/UCVGL","path":"train_crossview_sat.py","file_url":"https://github.com/liguopeng0923/UCVGL/blob/HEAD/train_crossview_sat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, liguopeng0923/UCVGL when it was checked","code_sha256":"ce5319f0ee24eecd","code_sha256_prefix":"ce5319f0ee24eecd","mcp_get_code":{"code_sha256":"ce5319f0ee24eecd"}},{"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","verification_level":1,"contract_check":null,"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":"ccbc4540f0d52171","code_sha256_prefix":"ccbc4540f0d52171","mcp_get_code":{"code_sha256":"ccbc4540f0d52171"}},{"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":"41d07eb6c8fa7fe3","code_sha256_prefix":"41d07eb6c8fa7fe3","mcp_get_code":{"code_sha256":"41d07eb6c8fa7fe3"}},{"arxiv_id":"2311.09677","arxiv_id_is_arxiv":true,"paper":"/paper/r-tuning-teaching-large-language-models-to","title":"R-Tuning: Instructing Large Language Models to Say `I Don't Know'","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhediao/r-tuning","path":"evaluation/MMLU/results/calculate_ap.py","file_url":"https://github.com/shizhediao/r-tuning/blob/HEAD/evaluation/MMLU/results/calculate_ap.py","status":"ran","verification_level":1,"contract_check":null,"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, shizhediao/r-tuning when it was checked","code_sha256":"4215906aecd42093","code_sha256_prefix":"4215906aecd42093","mcp_get_code":{"code_sha256":"4215906aecd42093"}},{"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":"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":"c50ca9641c87e95d","code_sha256_prefix":"c50ca9641c87e95d","mcp_get_code":{"code_sha256":"c50ca9641c87e95d"}},{"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/nl2codesearch/evaluator/evaluator.py","file_url":"https://github.com/reddy-lab-code-research/xlcost/blob/HEAD/code/codesearch/nl2codesearch/evaluator/evaluator.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":"7f2ade7249aa5a35","code_sha256_prefix":"7f2ade7249aa5a35","mcp_get_code":{"code_sha256":"7f2ade7249aa5a35"}},{"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/evaluator.py","file_url":"https://github.com/wangdeze18/DACL/blob/HEAD/algorithm_classification/evaluator/evaluator.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":"83477337636fe464","code_sha256_prefix":"83477337636fe464","mcp_get_code":{"code_sha256":"83477337636fe464"}},{"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/evaluator_score.py","file_url":"https://github.com/wangdeze18/DACL/blob/HEAD/algorithm_classification/evaluator/evaluator_score.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":"77b01d53fe1ab5d8","code_sha256_prefix":"77b01d53fe1ab5d8","mcp_get_code":{"code_sha256":"77b01d53fe1ab5d8"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"790aecc4340767b7","code_sha256_prefix":"790aecc4340767b7","mcp_get_code":{"code_sha256":"790aecc4340767b7"}},{"arxiv_id":"2011.01837","arxiv_id_is_arxiv":true,"paper":"/paper/the-gap-on-gap-tackling-the-problem-of","title":"The Gap on GAP: Tackling the Problem of Differing Data Distributions in Bias-Measuring Datasets","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vid-koci/weightingGAP","path":"gap_scorer.py","file_url":"https://github.com/vid-koci/weightingGAP/blob/HEAD/gap_scorer.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":"db3dbbae0e8afc09","code_sha256_prefix":"db3dbbae0e8afc09","mcp_get_code":{"code_sha256":"db3dbbae0e8afc09"}},{"arxiv_id":"2010.02584","arxiv_id_is_arxiv":true,"paper":"/paper/universal-natural-language-processing-with","title":"Universal Natural Language Processing with Limited Annotations: Try Few-shot Textual Entailment as a Start","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/UniversalFewShotNLP","path":"Coreference/gap_scorer.py","file_url":"https://github.com/salesforce/UniversalFewShotNLP/blob/HEAD/Coreference/gap_scorer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84120ed8a77f6efa","code_sha256_prefix":"84120ed8a77f6efa","mcp_get_code":{"code_sha256":"84120ed8a77f6efa"}},{"arxiv_id":"2010.02584","arxiv_id_is_arxiv":true,"paper":"/paper/universal-natural-language-processing-with","title":"Universal Natural Language Processing with Limited Annotations: Try Few-shot Textual Entailment as a Start","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/UniversalFewShotNLP","path":"Non-Entail-Approach/gap_scorer_modified.py","file_url":"https://github.com/salesforce/UniversalFewShotNLP/blob/HEAD/Non-Entail-Approach/gap_scorer_modified.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2f6b157b471666d","code_sha256_prefix":"b2f6b157b471666d","mcp_get_code":{"code_sha256":"b2f6b157b471666d"}},{"arxiv_id":"2004.13590","arxiv_id_is_arxiv":true,"paper":"/paper/maven-a-massive-general-domain-event","title":"MAVEN: A Massive General Domain Event Detection Dataset","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/MAVEN-dataset","path":"baselines/DMBERT/run_ee.py","file_url":"https://github.com/THU-KEG/MAVEN-dataset/blob/HEAD/baselines/DMBERT/run_ee.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":"06d672f377907b09","code_sha256_prefix":"06d672f377907b09","mcp_get_code":{"code_sha256":"06d672f377907b09"}},{"arxiv_id":"1806.06498","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-affordance-learning-for-driving","title":"Conditional Affordance Learning for Driving in Urban Environments","date":"2018-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl-sr/CAL","path":"training/metrics.py","file_url":"https://github.com/xl-sr/CAL/blob/HEAD/training/metrics.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":"e077d404c9974a5b","code_sha256_prefix":"e077d404c9974a5b","mcp_get_code":{"code_sha256":"e077d404c9974a5b"}}],"record_sha256":"1c8aadbd90fc0b07d17a89432b3064c65783950b21d414ea7e07755d3b069d10","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}