{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/check-file-exists","entry":"check_file_exists","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2504.02949","paper":"/paper/vargpt-v1-1-improve-visual-autoregressive","title":"VARGPT-v1.1: Improve Visual Autoregressive Large Unified Model via Iterative Instruction Tuning and Reinforcement Learning","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VARGPT-family/VARGPT","path":"vargpt_llava/prepare_vargpt_llava.py","file_url":"https://github.com/VARGPT-family/VARGPT/blob/HEAD/vargpt_llava/prepare_vargpt_llava.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"155a5802e5cdb1fb","mcp_get_code":{"code_sha256":"155a5802e5cdb1fb"}},{"arxiv_id":"2502.10436","paper":"/paper/merge-3-efficient-evolutionary-merging-on","title":"MERGE$^3$: Efficient Evolutionary Merging on Consumer-grade GPUs","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tommasomncttn/merge3","path":"experiments/end2end_utils.py","file_url":"https://github.com/tommasomncttn/merge3/blob/HEAD/experiments/end2end_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aecf0f6af92bdbea","mcp_get_code":{"code_sha256":"aecf0f6af92bdbea"}},{"arxiv_id":"2402.14992","paper":"/paper/tinybenchmarks-evaluating-llms-with-fewer","title":"tinyBenchmarks: evaluating LLMs with fewer examples","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariushobbhahn/swebench-verified-mini","path":"run_all.py","file_url":"https://github.com/mariushobbhahn/swebench-verified-mini/blob/HEAD/run_all.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e37b7d40582ad9d","mcp_get_code":{"code_sha256":"3e37b7d40582ad9d"}},{"arxiv_id":"2402.01702","paper":"/paper/fluent-dreaming-for-language-models","title":"Fluent dreaming for language models","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"confirm-solutions/dreamy","path":"dreamy/experiment.py","file_url":"https://github.com/confirm-solutions/dreamy/blob/HEAD/dreamy/experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff0ddb961dafdda8","mcp_get_code":{"code_sha256":"ff0ddb961dafdda8"}},{"arxiv_id":"2106.10860","paper":"/paper/multiplying-matrices-without-multiplying","title":"Multiplying Matrices Without Multiplying","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joennlae/halutmatmul","path":"src/python/halutmatmul/model.py","file_url":"https://github.com/joennlae/halutmatmul/blob/HEAD/src/python/halutmatmul/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4e2c94e3f70116c","mcp_get_code":{"code_sha256":"f4e2c94e3f70116c"}}]}