{"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/extract-option","entry":"extract_option","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":5,"n_places_pointer_only":4,"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":1,"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.17040","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-17040","title":"From Easy to Hard: The MIR Benchmark for Progressive Interleaved Multi-Image Reasoning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Shelly-coder239/MIRBench","path":"vlm_infer.py","file_url":"https://github.com/Shelly-coder239/MIRBench/blob/HEAD/vlm_infer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Shelly-coder239/MIRBench when it was checked","code_sha256":"04d4ee322170e996","code_sha256_prefix":"04d4ee322170e996","mcp_get_code":{"code_sha256":"04d4ee322170e996"}},{"arxiv_id":"2503.23513","arxiv_id_is_arxiv":true,"paper":"/paper/rare-retrieval-augmented-reasoning-modeling","title":"RARE: Retrieval-Augmented Reasoning Modeling","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-dataflow/rare","path":"RL_KTO/process_kto.py","file_url":"https://github.com/open-dataflow/rare/blob/HEAD/RL_KTO/process_kto.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31eca3c5db5632d2","code_sha256_prefix":"31eca3c5db5632d2","mcp_get_code":{"code_sha256":"31eca3c5db5632d2"}},{"arxiv_id":"2411.14794","arxiv_id_is_arxiv":true,"paper":"/paper/videoespresso-a-large-scale-chain-of-thought","title":"VideoEspresso: A Large-Scale Chain-of-Thought Dataset for Fine-Grained Video Reasoning via Core Frame Selection","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hshjerry/videoespresso","path":"eval/score.py","file_url":"https://github.com/hshjerry/videoespresso/blob/HEAD/eval/score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hshjerry/videoespresso when it was checked","code_sha256":"237d5a4086d1081e","code_sha256_prefix":"237d5a4086d1081e","mcp_get_code":{"code_sha256":"237d5a4086d1081e"}},{"arxiv_id":"2406.10471","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-pieces-efficient-personalized","title":"Personalized Pieces: Efficient Personalized Large Language Models through Collaborative Efforts","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TamSiuhin/Per-Pcs","path":"utils.py","file_url":"https://github.com/TamSiuhin/Per-Pcs/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TamSiuhin/Per-Pcs when it was checked","code_sha256":"45a6039a5ec5e51b","code_sha256_prefix":"45a6039a5ec5e51b","mcp_get_code":{"code_sha256":"45a6039a5ec5e51b"}},{"arxiv_id":"2402.04401","arxiv_id_is_arxiv":true,"paper":"/paper/democratizing-large-language-models-via","title":"Democratizing Large Language Models via Personalized Parameter-Efficient Fine-tuning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tamsiuhin/oppu","path":"utils.py","file_url":"https://github.com/tamsiuhin/oppu/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tamsiuhin/oppu when it was checked","code_sha256":"45a6039a5ec5e51b","code_sha256_prefix":"45a6039a5ec5e51b","mcp_get_code":{"code_sha256":"45a6039a5ec5e51b"}}],"record_sha256":"afc2bc60ea32b9c6eb631b117b82602f0087c43b87b9ebc7e29f38da4bf9d6ce","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}