{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/state","entry":"State","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":8,"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":13,"n_samples_ran":8,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":8,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"unverified":5},"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":"2608.08588","paper":"/paper/arxiv-2608-08588","title":"LazyHMC: Hamiltonian Monte Carlo Simulation for Lazy, Infinite Dimensional Probabilistic Programs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lazyppl-team/lazyhmc","path":"NPHMC-comparison/inferWoTruncInitialExt.py","file_url":"https://github.com/lazyppl-team/lazyhmc/blob/HEAD/NPHMC-comparison/inferWoTruncInitialExt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43d3ce6a63d42671","mcp_get_code":{"code_sha256":"43d3ce6a63d42671"}},{"arxiv_id":"2602.01485","paper":"/paper/arxiv-2602-01485","title":"Predicting and improving test-time scaling laws via reward tail-guided search","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"PotatoJnny/Scaling-Law-Guided-search","path":"Algorithm/algorithms.py","file_url":"https://github.com/PotatoJnny/Scaling-Law-Guided-search/blob/HEAD/Algorithm/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"149f1b3dd419c067","mcp_get_code":{"code_sha256":"149f1b3dd419c067"}},{"arxiv_id":"2402.01469","paper":"/paper/amor-a-recipe-for-building-adaptable-modular","title":"AMOR: A Recipe for Building Adaptable Modular Knowledge Agents Through Process Feedback","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianguanthu/amor","path":"code/manager.py","file_url":"https://github.com/jianguanthu/amor/blob/HEAD/code/manager.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5fc26624516c1588","mcp_get_code":{"code_sha256":"5fc26624516c1588"}},{"arxiv_id":"2402.01030","paper":"/paper/executable-code-actions-elicit-better-llm","title":"Executable Code Actions Elicit Better LLM Agents","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingyaoww/code-act","path":"mint/agents/base.py","file_url":"https://github.com/xingyaoww/code-act/blob/HEAD/mint/agents/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb465719419c1b62","mcp_get_code":{"code_sha256":"bb465719419c1b62"}},{"arxiv_id":"2401.13246","paper":"/paper/seer-facilitating-structured-reasoning-and","title":"SEER: Facilitating Structured Reasoning and Explanation via Reinforcement Learning","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chen-GX/SEER","path":"etree_task1/src/RL_etree.py","file_url":"https://github.com/Chen-GX/SEER/blob/HEAD/etree_task1/src/RL_etree.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7dab5599647f8485","mcp_get_code":{"code_sha256":"7dab5599647f8485"}},{"arxiv_id":"2312.04266","paper":"/paper/activity-grammars-for-temporal-action-1","title":"Activity Grammars for Temporal Action Segmentation","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gongda0e/kari","path":"bep.py","file_url":"https://github.com/gongda0e/kari/blob/HEAD/bep.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5a7ca180bd4ca14","mcp_get_code":{"code_sha256":"a5a7ca180bd4ca14"}},{"arxiv_id":"2210.03629","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":"liyuan24/nanodeepresearch","path":"agent/react_agent.py","file_url":"https://github.com/liyuan24/nanodeepresearch/blob/HEAD/agent/react_agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b31daddc6c61beaf","mcp_get_code":{"code_sha256":"b31daddc6c61beaf"}},{"arxiv_id":"2209.08801","paper":"/paper/sequence-to-set-generative-models","title":"Sequence-to-Set Generative Models","date":"2022-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longtaotang/setlearning","path":"SubsetLearningFramework/GRUv2.py","file_url":"https://github.com/longtaotang/setlearning/blob/HEAD/SubsetLearningFramework/GRUv2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"08fd47a7f4f73c08","mcp_get_code":{"code_sha256":"08fd47a7f4f73c08"}},{"arxiv_id":"2106.09146","paper":"/paper/contrastive-reinforcement-learning-of","title":"Contrastive Reinforcement Learning of Symbolic Reasoning Domains","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpoesia/socratic-tutor","path":"agent.py","file_url":"https://github.com/gpoesia/socratic-tutor/blob/HEAD/agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a263044fe206c128","mcp_get_code":{"code_sha256":"a263044fe206c128"}},{"arxiv_id":"2101.04237","paper":"/paper/solving-common-payoff-games-with-approximate","title":"Solving Common-Payoff Games with Approximate Policy Iteration","date":"2021-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssokota/capi","path":"capi/agents.py","file_url":"https://github.com/ssokota/capi/blob/HEAD/capi/agents.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a41dfa5b1829b26","mcp_get_code":{"code_sha256":"6a41dfa5b1829b26"}},{"arxiv_id":"2009.07365","paper":"/paper/fast-semantic-parsing-with-well-typedness","title":"Fast semantic parsing with well-typedness guarantees","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Oneplus/tamr","path":"amr_aligner/system/eager/state.py","file_url":"https://github.com/Oneplus/tamr/blob/HEAD/amr_aligner/system/eager/state.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f5649064480547ca","mcp_get_code":{"code_sha256":"f5649064480547ca"}},{"arxiv_id":"2006.06649","paper":"/paper/closed-loop-neural-symbolic-learning-via","title":"Closed Loop Neural-Symbolic Learning via Integrating Neural Perception, Grammar Parsing, and Symbolic Reasoning","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqing-ustc/NGS","path":"GEP/generalizedearley.py","file_url":"https://github.com/liqing-ustc/NGS/blob/HEAD/GEP/generalizedearley.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b31ba70b99ba3351","mcp_get_code":{"code_sha256":"b31ba70b99ba3351"}},{"arxiv_id":"2005.01791","paper":"/paper/discrete-optimization-for-unsupervised","title":"Discrete Optimization for Unsupervised Sentence Summarization with Word-Level Extraction","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raphael-sch/HC_Sentence_Summarization","path":"model.py","file_url":"https://github.com/raphael-sch/HC_Sentence_Summarization/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"b4aa1e93c2eb56d1","mcp_get_code":{"code_sha256":"b4aa1e93c2eb56d1"}}]}