{"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/extract-info","entry":"extract_info","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":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":0,"ran":3,"unverified":1},"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":"2506.18841","arxiv_id_is_arxiv":true,"paper":"/paper/longwriter-zero-mastering-ultra-long-text","title":"LongWriter-Zero: Mastering Ultra-Long Text Generation via Reinforcement Learning","date":"2025-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/longwriter","path":"evaluation/eval_quality.py","file_url":"https://github.com/thudm/longwriter/blob/HEAD/evaluation/eval_quality.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from mozhu621/superwriter, and GitHub detected no licence in that repository when it was checked","code_sha256":"05ae45b3b7e836be","code_sha256_prefix":"05ae45b3b7e836be","mcp_get_code":{"code_sha256":"05ae45b3b7e836be"}},{"arxiv_id":"2506.04180","arxiv_id_is_arxiv":true,"paper":"/paper/superwriter-reflection-driven-long-form","title":"SuperWriter: Reflection-Driven Long-Form Generation with Large Language Models","date":"2025-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozhu621/superwriter","path":"Agent/Super_write_agent.py","file_url":"https://github.com/mozhu621/superwriter/blob/HEAD/Agent/Super_write_agent.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, mozhu621/superwriter when it was checked","code_sha256":"05ae45b3b7e836be","code_sha256_prefix":"05ae45b3b7e836be","mcp_get_code":{"code_sha256":"05ae45b3b7e836be"}},{"arxiv_id":"2406.05720","arxiv_id_is_arxiv":true,"paper":"/paper/villageragent-a-graph-based-multi-agent","title":"VillagerAgent: A Graph-Based Multi-Agent Framework for Coordinating Complex Task Dependencies in Minecraft","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnsdqd-dyb/villageragent","path":"model/utils.py","file_url":"https://github.com/cnsdqd-dyb/villageragent/blob/HEAD/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, cnsdqd-dyb/villageragent when it was checked","code_sha256":"798386af5ebc3fb6","code_sha256_prefix":"798386af5ebc3fb6","mcp_get_code":{"code_sha256":"798386af5ebc3fb6"}},{"arxiv_id":"2402.17786","arxiv_id_is_arxiv":true,"paper":"/paper/stepwise-self-consistent-mathematical","title":"Stepwise Self-Consistent Mathematical Reasoning with Large Language Models","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhao-zilong/ssc-cot","path":"KG.py","file_url":"https://github.com/zhao-zilong/ssc-cot/blob/HEAD/KG.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":"f718a056b37ca750","code_sha256_prefix":"f718a056b37ca750","mcp_get_code":{"code_sha256":"f718a056b37ca750"}},{"arxiv_id":"2402.02309","arxiv_id_is_arxiv":true,"paper":"/paper/jailbreaking-attack-against-multimodal-large","title":"Jailbreaking Attack against Multimodal Large Language Model","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/jood","path":"evaluate_metrics.py","file_url":"https://github.com/naver-ai/jood/blob/HEAD/evaluate_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82dfbc3db8906d82","code_sha256_prefix":"82dfbc3db8906d82","mcp_get_code":{"code_sha256":"82dfbc3db8906d82"}},{"arxiv_id":"2310.08367","arxiv_id_is_arxiv":true,"paper":"/paper/mcu-a-task-centric-framework-for-open-ended","title":"Towards Evaluating Generalist Agents: An Automated Benchmark in Open World","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craftjarvis/mcu","path":"MCU_benchmark/run_task.py","file_url":"https://github.com/craftjarvis/mcu/blob/HEAD/MCU_benchmark/run_task.py","status":"ran","verification_level":1,"contract_check":null,"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, craftjarvis/mcu when it was checked","code_sha256":"f4d591306a89b6a5","code_sha256_prefix":"f4d591306a89b6a5","mcp_get_code":{"code_sha256":"f4d591306a89b6a5"}},{"arxiv_id":"2309.04077","arxiv_id_is_arxiv":true,"paper":"/paper/saynav-grounding-large-language-models-for","title":"SayNav: Grounding Large Language Models for Dynamic Planning to Navigation in New Environments","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arajv/SayNav","path":"src/python/pointnav_utils.py","file_url":"https://github.com/arajv/SayNav/blob/HEAD/src/python/pointnav_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, arajv/SayNav (NOASSERTION)","code_sha256":"fab4fadbda28248c","code_sha256_prefix":"fab4fadbda28248c","mcp_get_code":{"code_sha256":"fab4fadbda28248c"}},{"arxiv_id":"2025.emnlp-main.965","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.965","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"salmakh1/ACING","path":"Induction/logger.py","file_url":"https://github.com/salmakh1/ACING/blob/HEAD/Induction/logger.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":"9add3b16b441ab03","code_sha256_prefix":"9add3b16b441ab03","mcp_get_code":{"code_sha256":"9add3b16b441ab03"}}],"record_sha256":"35dc02635a734f657ba594c5dc1d638ffe66d60fb620c57140de4fcde7a2dc95","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}