{"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/progress","entry":"progress","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"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":"2410.12409","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-the-barriers-of-language-agents-in","title":"Revealing the Barriers of Language Agents in Planning","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsaest/Agent-Planning-Analysis","path":"code/captum/captum/_utils/progress.py","file_url":"https://github.com/hsaest/Agent-Planning-Analysis/blob/HEAD/code/captum/captum/_utils/progress.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, hsaest/Agent-Planning-Analysis when it was checked","code_sha256":"7dde11be93a92ca2","code_sha256_prefix":"7dde11be93a92ca2","mcp_get_code":{"code_sha256":"7dde11be93a92ca2"}},{"arxiv_id":"2304.11327","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-feature-learning-1","title":"Understanding and Improving Feature Learning for Out-of-Distribution Generalization","date":"2023-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/captum","path":"captum/_utils/progress.py","file_url":"https://github.com/pytorch/captum/blob/HEAD/captum/_utils/progress.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from hsaest/Agent-Planning-Analysis, and GitHub detected no licence in that repository when it was checked","code_sha256":"7dde11be93a92ca2","code_sha256_prefix":"7dde11be93a92ca2","mcp_get_code":{"code_sha256":"7dde11be93a92ca2"}},{"arxiv_id":"2211.04591","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-follow-instructions-in-text-based","title":"Learning to Follow Instructions in Text-Based Games","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathieutuli/ltl-gata","path":"src/ltl/progression.py","file_url":"https://github.com/mathieutuli/ltl-gata/blob/HEAD/src/ltl/progression.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mathieutuli/ltl-gata when it was checked","code_sha256":"3757b426ea6fb8ba","code_sha256_prefix":"3757b426ea6fb8ba","mcp_get_code":{"code_sha256":"3757b426ea6fb8ba"}},{"arxiv_id":"2102.06858","arxiv_id_is_arxiv":true,"paper":"/paper/ltl2action-generalizing-ltl-instructions-for","title":"LTL2Action: Generalizing LTL Instructions for Multi-Task RL","date":"2021-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LTL2Action/LTL2Action","path":"src/ltl_progression.py","file_url":"https://github.com/LTL2Action/LTL2Action/blob/HEAD/src/ltl_progression.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":"225ebd2e12756d09","code_sha256_prefix":"225ebd2e12756d09","mcp_get_code":{"code_sha256":"225ebd2e12756d09"}},{"arxiv_id":"2010.12697","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-saturation-effects-in","title":"Investigating Saturation Effects in Integrated Gradients","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vivekmig/captum-1","path":"captum/_utils/progress.py","file_url":"https://github.com/vivekmig/captum-1/blob/HEAD/captum/_utils/progress.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5ae855abd4ca8d","code_sha256_prefix":"be5ae855abd4ca8d","mcp_get_code":{"code_sha256":"be5ae855abd4ca8d"}},{"arxiv_id":"1611.01989","arxiv_id_is_arxiv":true,"paper":"/paper/deepcoder-learning-to-write-programs","title":"DeepCoder: Learning to Write Programs","date":"2016-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lcary/io-generation","path":"iogen/iogen.py","file_url":"https://github.com/lcary/io-generation/blob/HEAD/iogen/iogen.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, lcary/io-generation when it was checked","code_sha256":"c8528013d546438b","code_sha256_prefix":"c8528013d546438b","mcp_get_code":{"code_sha256":"c8528013d546438b"}}],"record_sha256":"805a730e369e33a110cd1e175ca0f44e7d1a4bd3c8a26fe8c804ed26bde74180","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}