{"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/trajectory","entry":"Trajectory","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":7,"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":7,"n_samples_ran":6,"n_samples_constructed":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"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":0,"ran_fixture":0,"ran":6,"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":"2607.25236","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-25236","title":"VisualPatchWorld: Code World Models as Latent Structured Representations for Planning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HKBU-KnowComp/VisualPatchWorld","path":"src/visualpatchworld/structure_induction.py","file_url":"https://github.com/HKBU-KnowComp/VisualPatchWorld/blob/HEAD/src/visualpatchworld/structure_induction.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":"cec67a4407d01cf3","code_sha256_prefix":"cec67a4407d01cf3","mcp_get_code":{"code_sha256":"cec67a4407d01cf3"}},{"arxiv_id":"2607.12523","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-12523","title":"OOD-RL-Bench: A Benchmark Framework for Out-of-Distribution Detection in Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ood-rl-bench/ood-rl-bench","path":"ood_rl_bench/core/benchmark.py","file_url":"https://github.com/ood-rl-bench/ood-rl-bench/blob/HEAD/ood_rl_bench/core/benchmark.py","status":"ran","verification_level":1,"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":"f89ed0a99412feb7","code_sha256_prefix":"f89ed0a99412feb7","mcp_get_code":{"code_sha256":"f89ed0a99412feb7"}},{"arxiv_id":"2606.24428","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-24428","title":"Escaping the Self-Confirmation Trap: An Execute-Distill-Verify Paradigm for Agentic Experience Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"shidingz/EDV","path":"src/edv/pipeline.py","file_url":"https://github.com/shidingz/EDV/blob/HEAD/src/edv/pipeline.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":"d14951a6ebdfc386","code_sha256_prefix":"d14951a6ebdfc386","mcp_get_code":{"code_sha256":"d14951a6ebdfc386"}},{"arxiv_id":"2605.20477","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20477","title":"Training Language Agents to Learn from Experience","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yuvalshalev1/MetaGym","path":"metagym/reflector.py","file_url":"https://github.com/yuvalshalev1/MetaGym/blob/HEAD/metagym/reflector.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, yuvalshalev1/MetaGym when it was checked","code_sha256":"bf26921e5bdab948","code_sha256_prefix":"bf26921e5bdab948","mcp_get_code":{"code_sha256":"bf26921e5bdab948"}},{"arxiv_id":"2603.10281","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10281","title":"Taming Score-Based Denoisers in ADMM: A Convergent Plug-and-Play Framework","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"rajeshshrestha/ACDC","path":"sampler/admm.py","file_url":"https://github.com/rajeshshrestha/ACDC/blob/HEAD/sampler/admm.py","status":"ran","verification_level":1,"contract_check":null,"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, rajeshshrestha/ACDC when it was checked","code_sha256":"cbb1ec81863b2b8d","code_sha256_prefix":"cbb1ec81863b2b8d","mcp_get_code":{"code_sha256":"cbb1ec81863b2b8d"}},{"arxiv_id":"2301.11741","arxiv_id_is_arxiv":true,"paper":"/paper/outcome-directed-reinforcement-learning-by","title":"Outcome-directed Reinforcement Learning by Uncertainty & Temporal Distance-Aware Curriculum Goal Generation","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stilwell-Git/Hindsight-Goal-Generation","path":"learner/hgg.py","file_url":"https://github.com/Stilwell-Git/Hindsight-Goal-Generation/blob/HEAD/learner/hgg.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":"ec05bcb0275bbf31","code_sha256_prefix":"ec05bcb0275bbf31","mcp_get_code":{"code_sha256":"ec05bcb0275bbf31"}},{"arxiv_id":"2103.11505","arxiv_id_is_arxiv":true,"paper":"/paper/policy-guided-heuristic-search-with","title":"Policy-Guided Heuristic Search with Guarantees","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"levilelis/h-levin","path":"src/search/bfs_levin.py","file_url":"https://github.com/levilelis/h-levin/blob/HEAD/src/search/bfs_levin.py","status":"ran","verification_level":1,"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":"e01b4a263dc8f0c8","code_sha256_prefix":"e01b4a263dc8f0c8","mcp_get_code":{"code_sha256":"e01b4a263dc8f0c8"}}],"record_sha256":"3d6b4a46416d71f8f6a5d5e1f665a8de018882f4ab07455a83fc4ca700619ddb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}