{"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/action","entry":"Action","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":11,"n_samples_ran":7,"n_samples_constructed":7,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"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":0,"ran_fixture":0,"ran":7,"unverified":4},"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":"2605.05630","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05630","title":"One Turn Too Late: Response-Aware Defense Against Hidden Malicious Intent in Multi-Turn Dialogue","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Graph-COM/TurnGate","path":"src/defender.py","file_url":"https://github.com/Graph-COM/TurnGate/blob/HEAD/src/defender.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, Graph-COM/TurnGate, is not in the permissive set Syntology serves inline","code_sha256":"619449e80366482a","code_sha256_prefix":"619449e80366482a","mcp_get_code":{"code_sha256":"619449e80366482a"}},{"arxiv_id":"2602.01485","arxiv_id_is_arxiv":true,"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":"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, PotatoJnny/Scaling-Law-Guided-search when it was checked","code_sha256":"23702e4dd78af8de","code_sha256_prefix":"23702e4dd78af8de","mcp_get_code":{"code_sha256":"23702e4dd78af8de"}},{"arxiv_id":"2402.01030","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb65551e188ba525","code_sha256_prefix":"cb65551e188ba525","mcp_get_code":{"code_sha256":"cb65551e188ba525"}},{"arxiv_id":"2305.02556","arxiv_id_is_arxiv":true,"paper":"/paper/faithful-question-answering-with-monte-carlo","title":"Faithful Question Answering with Monte-Carlo Planning","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Raising-hrx/FAME","path":"code/RL_agent.py","file_url":"https://github.com/Raising-hrx/FAME/blob/HEAD/code/RL_agent.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":"913a8ad74b5da2f4","code_sha256_prefix":"913a8ad74b5da2f4","mcp_get_code":{"code_sha256":"913a8ad74b5da2f4"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69febc56d55428d1","code_sha256_prefix":"69febc56d55428d1","mcp_get_code":{"code_sha256":"69febc56d55428d1"}},{"arxiv_id":"2106.09146","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gpoesia/socratic-tutor when it was checked","code_sha256":"82b383962990e9ba","code_sha256_prefix":"82b383962990e9ba","mcp_get_code":{"code_sha256":"82b383962990e9ba"}},{"arxiv_id":"2106.03272","arxiv_id_is_arxiv":true,"paper":"/paper/signatured-deep-fictitious-play-for-mean","title":"Signatured Deep Fictitious Play for Mean Field Games with Common Noise","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmin0/SigDFP","path":"src/model.py","file_url":"https://github.com/mmin0/SigDFP/blob/HEAD/src/model.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":"e28bbd5c0e23f1c7","code_sha256_prefix":"e28bbd5c0e23f1c7","mcp_get_code":{"code_sha256":"e28bbd5c0e23f1c7"}},{"arxiv_id":"2103.07372","arxiv_id_is_arxiv":true,"paper":"/paper/action-net-multipath-excitation-for-action","title":"ACTION-Net: Multipath Excitation for Action Recognition","date":"2021-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"V-Sense/ACTION-Net","path":"models/action.py","file_url":"https://github.com/V-Sense/ACTION-Net/blob/HEAD/models/action.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6724e5136b57bb8","code_sha256_prefix":"b6724e5136b57bb8","mcp_get_code":{"code_sha256":"b6724e5136b57bb8"}},{"arxiv_id":"2010.14568","arxiv_id_is_arxiv":true,"paper":"/paper/strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/attach-juxtapose-parser","path":"transition_systems.py","file_url":"https://github.com/princeton-vl/attach-juxtapose-parser/blob/HEAD/transition_systems.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bc16c8163ecf854","code_sha256_prefix":"3bc16c8163ecf854","mcp_get_code":{"code_sha256":"3bc16c8163ecf854"}},{"arxiv_id":"1911.08265","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zeta36/muzero","path":"muzero.py","file_url":"https://github.com/Zeta36/muzero/blob/HEAD/muzero.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Zeta36/muzero, is not in the permissive set Syntology serves inline","code_sha256":"a2a9ed20152a3952","code_sha256_prefix":"a2a9ed20152a3952","mcp_get_code":{"code_sha256":"a2a9ed20152a3952"}},{"arxiv_id":"1911.08265","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmiracle/muzero-starter","path":"pseudocode.py","file_url":"https://github.com/dmiracle/muzero-starter/blob/HEAD/pseudocode.py","status":"ran","verification_level":1,"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, dmiracle/muzero-starter when it was checked","code_sha256":"6c89f46298706981","code_sha256_prefix":"6c89f46298706981","mcp_get_code":{"code_sha256":"6c89f46298706981"}}],"record_sha256":"b0ce599a0556074c5b7800204c5ada8f49f7bb637ee02a50a9385bf174f7b167","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}