{"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/open-json","entry":"open_json","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":2,"unverified":0},"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":"2502.06884","arxiv_id_is_arxiv":true,"paper":"/paper/learning-conformal-abstention-policies-for","title":"Learning Conformal Abstention Policies for Adaptive Risk Management in Large Language and Vision-Language Models","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sinatayebati/vlm-uncertainty","path":"data_utils/common_utils.py","file_url":"https://github.com/sinatayebati/vlm-uncertainty/blob/HEAD/data_utils/common_utils.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":"8a064d582b5c57ea","code_sha256_prefix":"8a064d582b5c57ea","mcp_get_code":{"code_sha256":"8a064d582b5c57ea"}},{"arxiv_id":"2406.16540","arxiv_id_is_arxiv":true,"paper":"/paper/improving-robustness-to-corruptions-with","title":"Improving robustness to corruptions with multiplicative weight perturbations","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trungtrinh44/damp","path":"imagenet/eval_vit_imagenet_and_imagenet_c.py","file_url":"https://github.com/trungtrinh44/damp/blob/HEAD/imagenet/eval_vit_imagenet_and_imagenet_c.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trungtrinh44/damp when it was checked","code_sha256":"a1c31b015211f700","code_sha256_prefix":"a1c31b015211f700","mcp_get_code":{"code_sha256":"a1c31b015211f700"}},{"arxiv_id":"2404.00712","arxiv_id_is_arxiv":true,"paper":"/paper/survey-of-computerized-adaptive-testing-a","title":"Survey of Computerized Adaptive Testing: A Machine Learning Perspective","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/educat","path":"scripts/bobcat_train.py","file_url":"https://github.com/bigdata-ustc/educat/blob/HEAD/scripts/bobcat_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19ff79e2c7f97c94","code_sha256_prefix":"19ff79e2c7f97c94","mcp_get_code":{"code_sha256":"19ff79e2c7f97c94"}},{"arxiv_id":"2402.14418","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-aware-evaluation-for-vision","title":"Uncertainty-Aware Evaluation for Vision-Language Models","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ensec-ai/vlm-uncertainty-bench","path":"data_utils/common_utils.py","file_url":"https://github.com/ensec-ai/vlm-uncertainty-bench/blob/HEAD/data_utils/common_utils.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":"8a064d582b5c57ea","code_sha256_prefix":"8a064d582b5c57ea","mcp_get_code":{"code_sha256":"8a064d582b5c57ea"}},{"arxiv_id":"2311.07070","arxiv_id_is_arxiv":true,"paper":"/paper/explain-then-translate-an-analysis-on","title":"Explain-then-Translate: An Analysis on Improving Program Translation with Self-generated Explanations","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pootiet/explain-then-translate","path":"MultiPL-C2C/src/single_experiment_error_types.py","file_url":"https://github.com/pootiet/explain-then-translate/blob/HEAD/MultiPL-C2C/src/single_experiment_error_types.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, pootiet/explain-then-translate when it was checked","code_sha256":"929eacd69001d272","code_sha256_prefix":"929eacd69001d272","mcp_get_code":{"code_sha256":"929eacd69001d272"}},{"arxiv_id":"2024.acl-short.77","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-short.77","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dmg-illc/trade","path":"src/utils.py","file_url":"https://github.com/dmg-illc/trade/blob/HEAD/src/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":"7930ae85df3880b6","code_sha256_prefix":"7930ae85df3880b6","mcp_get_code":{"code_sha256":"7930ae85df3880b6"}}],"record_sha256":"54c79255e43cfd6f9688b97b4e6165dff6e9fc95e7006befd4560c1c8f1b45ff","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}