{"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/verify","entry":"verify","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":8,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":8,"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":1,"ran_fixture":0,"ran":1,"unverified":6},"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":"2607.11506","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-11506","title":"SCOPE-RL: Optimizing Reasoning Paths Before and After Success","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"tokencraft-lab/SCOPE-RL","path":"verl/recipe/scope_rl/reward_score/step_quality.py","file_url":"https://github.com/tokencraft-lab/SCOPE-RL/blob/HEAD/verl/recipe/scope_rl/reward_score/step_quality.py","status":"unverified","verification_level":0,"contract_check":null,"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, tokencraft-lab/SCOPE-RL when it was checked","code_sha256":"8ba769426b876be2","code_sha256_prefix":"8ba769426b876be2","mcp_get_code":{"code_sha256":"8ba769426b876be2"}},{"arxiv_id":"2605.26971","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26971","title":"RLVR Datasets and Where to Find Them: Tracing Data Lineage for Better Training Data","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Celine-hxy/ATLAS","path":"verl/verl/utils/reward_score/math_dapo.py","file_url":"https://github.com/Celine-hxy/ATLAS/blob/HEAD/verl/verl/utils/reward_score/math_dapo.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, Celine-hxy/ATLAS when it was checked","code_sha256":"8df35abb6563b077","code_sha256_prefix":"8df35abb6563b077","mcp_get_code":{"code_sha256":"8df35abb6563b077"}},{"arxiv_id":"2506.07972","arxiv_id_is_arxiv":true,"paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"egraph_extraction/program/verifier.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/egraph_extraction/program/verifier.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":"4fa724a25bba66d7","code_sha256_prefix":"4fa724a25bba66d7","mcp_get_code":{"code_sha256":"4fa724a25bba66d7"}},{"arxiv_id":"2504.19298","arxiv_id_is_arxiv":true,"paper":"/paper/androidgen-building-an-android-language-agent","title":"AndroidGen: Building an Android Language Agent under Data Scarcity","date":"2025-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/AndroidGen","path":"model/judge/judge.py","file_url":"https://github.com/THUDM/AndroidGen/blob/HEAD/model/judge/judge.py","status":"unverified","verification_level":0,"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":"142a9897a3c875e4","code_sha256_prefix":"142a9897a3c875e4","mcp_get_code":{"code_sha256":"142a9897a3c875e4"}},{"arxiv_id":"2410.05165","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-inference-for-large-language-model","title":"Efficient Inference for Large Language Model-based Generative Recommendation","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linxyhaha/AtSpeed","path":"code/beamSD.py","file_url":"https://github.com/Linxyhaha/AtSpeed/blob/HEAD/code/beamSD.py","status":"unverified","verification_level":0,"contract_check":null,"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, Linxyhaha/AtSpeed when it was checked","code_sha256":"f10b46ee09ea6eb9","code_sha256_prefix":"f10b46ee09ea6eb9","mcp_get_code":{"code_sha256":"f10b46ee09ea6eb9"}},{"arxiv_id":"2404.04815","arxiv_id_is_arxiv":true,"paper":"/paper/allo-a-programming-model-for-composable","title":"Allo: A Programming Model for Composable Accelerator Design","date":"2024-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/allo","path":"allo/verify.py","file_url":"https://github.com/cornell-zhang/allo/blob/HEAD/allo/verify.py","status":"unverified","verification_level":0,"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":"aa240a45a4e178b7","code_sha256_prefix":"aa240a45a4e178b7","mcp_get_code":{"code_sha256":"aa240a45a4e178b7"}},{"arxiv_id":"2210.03629","arxiv_id_is_arxiv":true,"paper":"/paper/react-synergizing-reasoning-and-acting-in","title":"ReAct: Synergizing Reasoning and Acting in Language Models","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sierra-research/tau-bench","path":"tau_bench/agents/chat_react_agent.py","file_url":"https://github.com/sierra-research/tau-bench/blob/HEAD/tau_bench/agents/chat_react_agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0ead272d4fc4589","code_sha256_prefix":"e0ead272d4fc4589","mcp_get_code":{"code_sha256":"e0ead272d4fc4589"}},{"arxiv_id":"1710.10766","arxiv_id_is_arxiv":true,"paper":"/paper/pixeldefend-leveraging-generative-models-to","title":"PixelDefend: Leveraging Generative Models to Understand and Defend against Adversarial Examples","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/PixelDefend","path":"utils.py","file_url":"https://github.com/Microsoft/PixelDefend/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b84804b8fc540494","code_sha256_prefix":"b84804b8fc540494","mcp_get_code":{"code_sha256":"b84804b8fc540494"}}],"record_sha256":"8b316f50a77fe3b21d6769832f9a832744d77136f16337f8911b4d8cad4871ce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}