{"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/get-choice","entry":"get_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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":0,"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":1,"ran_fixture":0,"ran":3,"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":"2505.13025","arxiv_id_is_arxiv":true,"paper":"/paper/libog-lifelong-learning-for-black-box","title":"LiBOG: Lifelong Learning for Black-Box Optimizer Generation","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peijy/libog","path":"model/utils.py","file_url":"https://github.com/peijy/libog/blob/HEAD/model/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":"4eec176e5155a959","code_sha256_prefix":"4eec176e5155a959","mcp_get_code":{"code_sha256":"4eec176e5155a959"}},{"arxiv_id":"2503.12797","arxiv_id_is_arxiv":true,"paper":"/paper/deepperception-advancing-r1-like-cognitive","title":"DeepPerception: Advancing R1-like Cognitive Visual Perception in MLLMs for Knowledge-Intensive Visual Grounding","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/deepperception","path":"karl/eval/evaluate.py","file_url":"https://github.com/thunlp/deepperception/blob/HEAD/karl/eval/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8e326ce619a294d","code_sha256_prefix":"e8e326ce619a294d","mcp_get_code":{"code_sha256":"e8e326ce619a294d"}},{"arxiv_id":"2409.12147","arxiv_id_is_arxiv":true,"paper":"/paper/magicore-multi-agent-iterative-coarse-to-fine","title":"MAgICoRe: Multi-Agent, Iterative, Coarse-to-Fine Refinement for Reasoning","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dinobby/magicore","path":"utils.py","file_url":"https://github.com/dinobby/magicore/blob/HEAD/utils.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":"a29f1c51ddcf33d9","code_sha256_prefix":"a29f1c51ddcf33d9","mcp_get_code":{"code_sha256":"a29f1c51ddcf33d9"}},{"arxiv_id":"2406.19707","arxiv_id_is_arxiv":true,"paper":"/paper/infinigen-efficient-generative-inference-of","title":"InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-comparch/infinigen","path":"speedup/flexgen/infinigen/flex_opt.py","file_url":"https://github.com/snu-comparch/infinigen/blob/HEAD/speedup/flexgen/infinigen/flex_opt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66b0a9c4c8b9fac3","code_sha256_prefix":"66b0a9c4c8b9fac3","mcp_get_code":{"code_sha256":"66b0a9c4c8b9fac3"}},{"arxiv_id":"2402.02355","arxiv_id_is_arxiv":true,"paper":"/paper/symbol-generating-flexible-black-box","title":"Symbol: Generating Flexible Black-Box Optimizers through Symbolic Equation Learning","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GMC-DRL/Symbol","path":"model/utils.py","file_url":"https://github.com/GMC-DRL/Symbol/blob/HEAD/model/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":"4eec176e5155a959","code_sha256_prefix":"4eec176e5155a959","mcp_get_code":{"code_sha256":"4eec176e5155a959"}},{"arxiv_id":"2303.06865","arxiv_id_is_arxiv":true,"paper":"/paper/high-throughput-generative-inference-of-large","title":"FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPU","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fminference/flexgen","path":"flexllmgen/flex_opt.py","file_url":"https://github.com/fminference/flexgen/blob/HEAD/flexllmgen/flex_opt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66b0a9c4c8b9fac3","code_sha256_prefix":"66b0a9c4c8b9fac3","mcp_get_code":{"code_sha256":"66b0a9c4c8b9fac3"}},{"arxiv_id":"2025.emnlp-main.1660","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.1660","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dinobby/MAgICoRe","path":"utils.py","file_url":"https://github.com/dinobby/MAgICoRe/blob/HEAD/utils.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":"a29f1c51ddcf33d9","code_sha256_prefix":"a29f1c51ddcf33d9","mcp_get_code":{"code_sha256":"a29f1c51ddcf33d9"}}],"record_sha256":"5d0a164d065463dc9e280b698928e8da4d2e0fd1c8e56bea68d0507a8aee8865","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}