{"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/evaluate-exact-match-accuracy","entry":"evaluate_exact_match_accuracy","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2509.19003","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19003","title":"Unveiling Chain of Step Reasoning for Vision-Language Models with Fine-grained Rewards","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"baaivision/CoS","path":"eval/vqa/score_with_prm.py","file_url":"https://github.com/baaivision/CoS/blob/HEAD/eval/vqa/score_with_prm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from brandon3964/multimodal-task-vector, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"e159a001bd4cbfaa","code_sha256_prefix":"e159a001bd4cbfaa","mcp_get_code":{"code_sha256":"e159a001bd4cbfaa"}},{"arxiv_id":"2412.05185","arxiv_id_is_arxiv":true,"paper":"/paper/linvt-empower-your-image-level-large-language","title":"LinVT: Empower Your Image-level Large Language Model to Understand Videos","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e159a001bd4cbfaa","code_sha256_prefix":"e159a001bd4cbfaa","mcp_get_code":{"code_sha256":"e159a001bd4cbfaa"}},{"arxiv_id":"2412.03324","arxiv_id_is_arxiv":true,"paper":"/paper/a-stitch-in-time-saves-nine-small-vlm-is-a","title":"A Stitch in Time Saves Nine: Small VLM is a Precise Guidance for Accelerating Large VLMs","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e159a001bd4cbfaa","code_sha256_prefix":"e159a001bd4cbfaa","mcp_get_code":{"code_sha256":"e159a001bd4cbfaa"}},{"arxiv_id":"2410.16261","arxiv_id_is_arxiv":true,"paper":"/paper/mini-internvl-a-flexible-transfer-pocket","title":"Mini-InternVL: A Flexible-Transfer Pocket Multimodal Model with 5% Parameters and 90% Performance","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e159a001bd4cbfaa","code_sha256_prefix":"e159a001bd4cbfaa","mcp_get_code":{"code_sha256":"e159a001bd4cbfaa"}},{"arxiv_id":"2407.01976","arxiv_id_is_arxiv":true,"paper":"/paper/a-bounding-box-is-worth-one-token","title":"A Bounding Box is Worth One Token: Interleaving Layout and Text in a Large Language Model for Document Understanding","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laytextllm/laytextllm","path":"eval/utils.py","file_url":"https://github.com/laytextllm/laytextllm/blob/HEAD/eval/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, laytextllm/laytextllm when it was checked","code_sha256":"15713876351e02ec","code_sha256_prefix":"15713876351e02ec","mcp_get_code":{"code_sha256":"15713876351e02ec"}},{"arxiv_id":"2406.15334","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-task-vectors-enable-many-shot","title":"Multimodal Task Vectors Enable Many-Shot Multimodal In-Context Learning","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brandon3964/multimodal-task-vector","path":"eval_mm/evaluate_vqa.py","file_url":"https://github.com/brandon3964/multimodal-task-vector/blob/HEAD/eval_mm/evaluate_vqa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, brandon3964/multimodal-task-vector (NOASSERTION)","code_sha256":"e159a001bd4cbfaa","code_sha256_prefix":"e159a001bd4cbfaa","mcp_get_code":{"code_sha256":"e159a001bd4cbfaa"}},{"arxiv_id":"2405.11985","arxiv_id_is_arxiv":true,"paper":"/paper/mtvqa-benchmarking-multilingual-text-centric","title":"MTVQA: Benchmarking Multilingual Text-Centric Visual Question Answering","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/MTVQA","path":"scripts/acc.py","file_url":"https://github.com/bytedance/MTVQA/blob/HEAD/scripts/acc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bytedance/MTVQA when it was checked","code_sha256":"152082cc5f135e87","code_sha256_prefix":"152082cc5f135e87","mcp_get_code":{"code_sha256":"152082cc5f135e87"}}],"record_sha256":"7df2ce7a8ecf6caf5d269479d3e735ba0c5649556bb82146210aa90686d90f51","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}