{"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/ensure-list","entry":"ensure_list","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":9,"n_places_pointer_only":4,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2607.14233","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14233","title":"LIGO-PINN: Learned Initialization via Gated Optimization to Alleviate Convergence Failures in Physics Informed Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"scailab/ligo-pinn","path":"experiments/generators.py","file_url":"https://github.com/scailab/ligo-pinn/blob/HEAD/experiments/generators.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, scailab/ligo-pinn when it was checked","code_sha256":"24cf97db61576704","code_sha256_prefix":"24cf97db61576704","mcp_get_code":{"code_sha256":"24cf97db61576704"}},{"arxiv_id":"2507.01006","arxiv_id_is_arxiv":true,"paper":"/paper/glm-4-1v-thinking-towards-versatile","title":"GLM-4.1V-Thinking: Towards Versatile Multimodal Reasoning with Scalable Reinforcement Learning","date":"2025-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/glm-4.1v-thinking","path":"glmv_reward/src/glmv_reward/utils/misc.py","file_url":"https://github.com/thudm/glm-4.1v-thinking/blob/HEAD/glmv_reward/src/glmv_reward/utils/misc.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":"fb051b57bae1999a","code_sha256_prefix":"fb051b57bae1999a","mcp_get_code":{"code_sha256":"fb051b57bae1999a"}},{"arxiv_id":"2411.02391","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-vision-language-computer-agents-via","title":"Attacking Vision-Language Computer Agents via Pop-ups","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SALT-NLP/PopupAttack","path":"OSWorld/image_processing.py","file_url":"https://github.com/SALT-NLP/PopupAttack/blob/HEAD/OSWorld/image_processing.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, SALT-NLP/PopupAttack when it was checked","code_sha256":"1f6e5c9e49651728","code_sha256_prefix":"1f6e5c9e49651728","mcp_get_code":{"code_sha256":"1f6e5c9e49651728"}},{"arxiv_id":"2406.08979","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-software-development-through","title":"Multi-Agent Collaboration via Cross-Team Orchestration","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4d1f890c8c601e86","code_sha256_prefix":"4d1f890c8c601e86","mcp_get_code":{"code_sha256":"4d1f890c8c601e86"}},{"arxiv_id":"2312.17025","arxiv_id_is_arxiv":true,"paper":"/paper/experiential-co-learning-of-software","title":"Experiential Co-Learning of Software-Developing Agents","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4d1f890c8c601e86","code_sha256_prefix":"4d1f890c8c601e86","mcp_get_code":{"code_sha256":"4d1f890c8c601e86"}},{"arxiv_id":"2307.07924","arxiv_id_is_arxiv":true,"paper":"/paper/communicative-agents-for-software-development","title":"ChatDev: Communicative Agents for Software Development","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/chatdev","path":"entity/configs/base.py","file_url":"https://github.com/openbmb/chatdev/blob/HEAD/entity/configs/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d1f890c8c601e86","code_sha256_prefix":"4d1f890c8c601e86","mcp_get_code":{"code_sha256":"4d1f890c8c601e86"}},{"arxiv_id":"2109.15310","arxiv_id_is_arxiv":true,"paper":"/paper/width-based-planning-and-active-learning-for","title":"Is Policy Learning Overrated?: Width-Based Planning and Active Learning for Atari","date":"2021-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/atari-active-learning","path":"aggregate_pandas.py","file_url":"https://github.com/ibm/atari-active-learning/blob/HEAD/aggregate_pandas.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":"27bbcdf74d4cdba3","code_sha256_prefix":"27bbcdf74d4cdba3","mcp_get_code":{"code_sha256":"27bbcdf74d4cdba3"}},{"arxiv_id":"2005.10374","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-super-resolution-for-downscaling","title":"Stochastic Super-Resolution for Downscaling Time-Evolving Atmospheric Fields with a Generative Adversarial Network","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jleinonen/downscaling-rnn-gan","path":"dsrnngan/meta.py","file_url":"https://github.com/jleinonen/downscaling-rnn-gan/blob/HEAD/dsrnngan/meta.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":"0397bd2d5a36751a","code_sha256_prefix":"0397bd2d5a36751a","mcp_get_code":{"code_sha256":"0397bd2d5a36751a"}},{"arxiv_id":"2025.findings-acl.1277","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.1277","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tobymao/sqlglot","path":"sqlglot/helper.py","file_url":"https://github.com/tobymao/sqlglot/blob/HEAD/sqlglot/helper.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":"e46af1f89198fa71","code_sha256_prefix":"e46af1f89198fa71","mcp_get_code":{"code_sha256":"e46af1f89198fa71"}}],"record_sha256":"aadac1a7605def3fbf8844b0d9f5c8bf010d974947b91eb5a697b918fd56727a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}