{"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-choice","entry":"extract_choice","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":9,"n_places":10,"n_places_pointer_only":3,"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":5,"ran_fixture":0,"ran":4,"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":"2609.01224","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01224","title":"S$^2$Prune: Spatially Structured Visual Token Pruning for Multimodal Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"yuanyuanjia71-spec/S2Prune","path":"s2prune/metrics.py","file_url":"https://github.com/yuanyuanjia71-spec/S2Prune/blob/HEAD/s2prune/metrics.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, yuanyuanjia71-spec/S2Prune when it was checked","code_sha256":"a95bf748998486ec","code_sha256_prefix":"a95bf748998486ec","mcp_get_code":{"code_sha256":"a95bf748998486ec"}},{"arxiv_id":"2606.07532","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07532","title":"Durable Evaluation Framework: Adversarial Arbitration for Sycophancy Reduction in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NovelSystems/CANDOR","path":"def_arbitration/phase1_scripts/pilot10.py","file_url":"https://github.com/NovelSystems/CANDOR/blob/HEAD/def_arbitration/phase1_scripts/pilot10.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":"bf9d241625862123","code_sha256_prefix":"bf9d241625862123","mcp_get_code":{"code_sha256":"bf9d241625862123"}},{"arxiv_id":"2606.07532","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07532","title":"Durable Evaluation Framework: Adversarial Arbitration for Sycophancy Reduction in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NovelSystems/CANDOR","path":"def_arbitration/phase1_scripts/pilot11.py","file_url":"https://github.com/NovelSystems/CANDOR/blob/HEAD/def_arbitration/phase1_scripts/pilot11.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":"957125bccc621c1a","code_sha256_prefix":"957125bccc621c1a","mcp_get_code":{"code_sha256":"957125bccc621c1a"}},{"arxiv_id":"2601.00388","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-00388","title":"Vision-Language Reasoning for Geolocalization: A Reinforcement Learning Approach","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"aialt/geo-r","path":"src/open-r1-multimodal/src/open_r1/grpo_jsonl.py","file_url":"https://github.com/aialt/geo-r/blob/HEAD/src/open-r1-multimodal/src/open_r1/grpo_jsonl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"317605c76a72fc89","code_sha256_prefix":"317605c76a72fc89","mcp_get_code":{"code_sha256":"317605c76a72fc89"}},{"arxiv_id":"2505.15810","arxiv_id_is_arxiv":true,"paper":"/paper/gui-g1-understanding-r1-zero-like-training","title":"GUI-G1: Understanding R1-Zero-Like Training for Visual Grounding in GUI Agents","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuqi-zhou/gui-g1","path":"src/open-r1-multimodal/src/open_r1/grpo_jsonl.py","file_url":"https://github.com/yuqi-zhou/gui-g1/blob/HEAD/src/open-r1-multimodal/src/open_r1/grpo_jsonl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"317605c76a72fc89","code_sha256_prefix":"317605c76a72fc89","mcp_get_code":{"code_sha256":"317605c76a72fc89"}},{"arxiv_id":"2502.00698","arxiv_id_is_arxiv":true,"paper":"/paper/mm-iq-benchmarking-human-like-abstraction-and-1","title":"MM-IQ: Benchmarking Human-Like Abstraction and Reasoning in Multimodal Models","date":"2025-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AceCHQ/MMIQ","path":"mmiq/utils/eval_utils.py","file_url":"https://github.com/AceCHQ/MMIQ/blob/HEAD/mmiq/utils/eval_utils.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":"98c18be2c0a33db2","code_sha256_prefix":"98c18be2c0a33db2","mcp_get_code":{"code_sha256":"98c18be2c0a33db2"}},{"arxiv_id":"2412.13871","arxiv_id_is_arxiv":true,"paper":"/paper/llava-uhd-v2-an-mllm-integrating-high","title":"LLaVA-UHD v2: an MLLM Integrating High-Resolution Feature Pyramid via Hierarchical Window Transformer","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/llava-uhd","path":"VLMEvalKit/vlmeval/vlm/llava_qwen2_uhd_v3.py","file_url":"https://github.com/thunlp/llava-uhd/blob/HEAD/VLMEvalKit/vlmeval/vlm/llava_qwen2_uhd_v3.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":"46ca4942d73607af","code_sha256_prefix":"46ca4942d73607af","mcp_get_code":{"code_sha256":"46ca4942d73607af"}},{"arxiv_id":"2410.17885","arxiv_id_is_arxiv":true,"paper":"/paper/r-cot-reverse-chain-of-thought-problem","title":"R-CoT: Reverse Chain-of-Thought Problem Generation for Geometric Reasoning in Large Multimodal Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dle666/r-cot","path":"GeoQA_test/geo_acc_calculate.py","file_url":"https://github.com/dle666/r-cot/blob/HEAD/GeoQA_test/geo_acc_calculate.py","status":"ran","verification_level":1,"contract_check":null,"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, dle666/r-cot when it was checked","code_sha256":"ababfc3520297c21","code_sha256_prefix":"ababfc3520297c21","mcp_get_code":{"code_sha256":"ababfc3520297c21"}},{"arxiv_id":"2311.05812","arxiv_id_is_arxiv":true,"paper":"/paper/cfbenchmark-chinese-financial-assistant","title":"CFBenchmark: Chinese Financial Assistant Benchmark for Large Language Model","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongjifinlab/cfbenchmark","path":"CFBenchmark-OpenFinData/src/get_score.py","file_url":"https://github.com/tongjifinlab/cfbenchmark/blob/HEAD/CFBenchmark-OpenFinData/src/get_score.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":"698d9a725e80f15f","code_sha256_prefix":"698d9a725e80f15f","mcp_get_code":{"code_sha256":"698d9a725e80f15f"}},{"arxiv_id":"2306.09212","arxiv_id_is_arxiv":true,"paper":"/paper/cmmlu-measuring-massive-multitask-language","title":"CMMLU: Measuring massive multitask language understanding in Chinese","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haonan-li/cmmlu","path":"src/run_pci_eval.py","file_url":"https://github.com/haonan-li/cmmlu/blob/HEAD/src/run_pci_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, haonan-li/cmmlu when it was checked","code_sha256":"1fcb7e34115cc76c","code_sha256_prefix":"1fcb7e34115cc76c","mcp_get_code":{"code_sha256":"1fcb7e34115cc76c"}}],"record_sha256":"ed8f1ad36e386e15ba7b5897794f91eba5b4afb67e2520491bc3f85c02b94e5e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}