{"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/format-step","entry":"format_step","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":10,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":9,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":2,"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":4,"ran_fixture":0,"ran":1,"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":"2606.11063","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11063","title":"CIAware-Bench: Benchmarking Control Intervention Awareness Across Frontier LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"JoachimSchaeffer/CIAware-Bench","path":"cia/analysis/compare_interventions.py","file_url":"https://github.com/JoachimSchaeffer/CIAware-Bench/blob/HEAD/cia/analysis/compare_interventions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, JoachimSchaeffer/CIAware-Bench when it was checked","code_sha256":"fe9897f7e960225f","code_sha256_prefix":"fe9897f7e960225f","mcp_get_code":{"code_sha256":"fe9897f7e960225f"}},{"arxiv_id":"2403.03101","arxiv_id_is_arxiv":true,"paper":"/paper/knowagent-knowledge-augmented-planning-for","title":"KnowAgent: Knowledge-Augmented Planning for LLM-Based Agents","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowagent","path":"Path_Generation/hotpotqa_run/agent_arch.py","file_url":"https://github.com/zjunlp/knowagent/blob/HEAD/Path_Generation/hotpotqa_run/agent_arch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2403.00843","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-long-term-recommendation-with-bi","title":"Large Language Models are Learnable Planners for Long-Term Recommendation","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jizhi-zhang/billp","path":"Agents/agent_a2c.py","file_url":"https://github.com/jizhi-zhang/billp/blob/HEAD/Agents/agent_a2c.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7aa38bfabee25462","code_sha256_prefix":"7aa38bfabee25462","mcp_get_code":{"code_sha256":"7aa38bfabee25462"}},{"arxiv_id":"2402.14963","arxiv_id_is_arxiv":true,"paper":"/paper/mirror-a-multiple-perspective-self-reflection","title":"Mirror: A Multiple-perspective Self-Reflection Method for Knowledge-rich Reasoning","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanqi-qi/mirror","path":"agents_module.py","file_url":"https://github.com/hanqi-qi/mirror/blob/HEAD/agents_module.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, hanqi-qi/mirror when it was checked","code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2402.01622","arxiv_id_is_arxiv":true,"paper":"/paper/travelplanner-a-benchmark-for-real-world","title":"TravelPlanner: A Benchmark for Real-World Planning with Language Agents","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OSU-NLP-Group/TravelPlanner","path":"agents/tool_agents.py","file_url":"https://github.com/OSU-NLP-Group/TravelPlanner/blob/HEAD/agents/tool_agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2401.05268","arxiv_id_is_arxiv":true,"paper":"/paper/autoact-automatic-agent-learning-from-scratch","title":"AutoAct: Automatic Agent Learning from Scratch for QA via Self-Planning","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/autoact","path":"Self_Plan/Group_Planning/benchmark_run/Meta_agent_arch.py","file_url":"https://github.com/zjunlp/autoact/blob/HEAD/Self_Plan/Group_Planning/benchmark_run/Meta_agent_arch.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":"f62e3ab05a2163b7","code_sha256_prefix":"f62e3ab05a2163b7","mcp_get_code":{"code_sha256":"f62e3ab05a2163b7"}},{"arxiv_id":"2308.05960","arxiv_id_is_arxiv":true,"paper":"/paper/bolaa-benchmarking-and-orchestrating-llm","title":"BOLAA: Benchmarking and Orchestrating LLM-augmented Autonomous Agents","date":"2023-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/bolaa","path":"hotpotqa_run/agent_arch.py","file_url":"https://github.com/salesforce/bolaa/blob/HEAD/hotpotqa_run/agent_arch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2306.13304","arxiv_id_is_arxiv":true,"paper":"/paper/toolqa-a-dataset-for-llm-question-answering-1","title":"ToolQA: A Dataset for LLM Question Answering with External Tools","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"night-chen/toolqa","path":"benchmark/ReAct/code/agents.py","file_url":"https://github.com/night-chen/toolqa/blob/HEAD/benchmark/ReAct/code/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2303.11366","arxiv_id_is_arxiv":true,"paper":"/paper/reflexion-language-agents-with-verbal","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noahshinn/reflexion","path":"hotpotqa_runs/agents.py","file_url":"https://github.com/noahshinn/reflexion/blob/HEAD/hotpotqa_runs/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d28fbaf38b0a59","code_sha256_prefix":"84d28fbaf38b0a59","mcp_get_code":{"code_sha256":"84d28fbaf38b0a59"}},{"arxiv_id":"2203.04570","arxiv_id_is_arxiv":true,"paper":"/paper/cp-vit-cascade-vision-transformer-pruning-via","title":"CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Prediction","date":"2022-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ok858ok/CP-ViT","path":"CP-ViT/utils/dist_util.py","file_url":"https://github.com/ok858ok/CP-ViT/blob/HEAD/CP-ViT/utils/dist_util.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":"c60b852fb7e92a0d","code_sha256_prefix":"c60b852fb7e92a0d","mcp_get_code":{"code_sha256":"c60b852fb7e92a0d"}}],"record_sha256":"778f1beb25ba244baeb874e62f5d0783b66d22b8c4b552ff86b28fd018d6389b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}