{"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/compute-gae","entry":"compute_gae","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"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":1,"ran_fixture":1,"ran":4,"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":"2601.17563","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17563","title":"Towards Generalisable Imitation Learning Through Conditioned Transition Estimation and Online Behaviour Alignment","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NathanGavenski/UfO","path":"utils/utils.py","file_url":"https://github.com/NathanGavenski/UfO/blob/HEAD/utils/utils.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, NathanGavenski/UfO when it was checked","code_sha256":"ac490b99b2e1f91d","code_sha256_prefix":"ac490b99b2e1f91d","mcp_get_code":{"code_sha256":"ac490b99b2e1f91d"}},{"arxiv_id":"2511.21848","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-21848","title":"Massively Parallel Imitation Learning of Mouse Forelimb Musculoskeletal Reaching Dynamics","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"talmolab/track-mjx","path":"track_mjx/agent/ff_ppo/losses.py","file_url":"https://github.com/talmolab/track-mjx/blob/HEAD/track_mjx/agent/ff_ppo/losses.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":"edd567b15d0b6be9","code_sha256_prefix":"edd567b15d0b6be9","mcp_get_code":{"code_sha256":"edd567b15d0b6be9"}},{"arxiv_id":"2402.12284","arxiv_id_is_arxiv":true,"paper":"/paper/refining-minimax-regret-for-unsupervised","title":"Refining Minimax Regret for Unsupervised Environment Design","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michael-beukman/remidi","path":"lib/common/ppo.py","file_url":"https://github.com/michael-beukman/remidi/blob/HEAD/lib/common/ppo.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, michael-beukman/remidi when it was checked","code_sha256":"f20aa0108a055874","code_sha256_prefix":"f20aa0108a055874","mcp_get_code":{"code_sha256":"f20aa0108a055874"}},{"arxiv_id":"2311.11385","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-reinforcement-learning-with-1","title":"Multi-Task Reinforcement Learning with Mixture of Orthogonal Experts","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AhmedMagdyHendawy/MOORE","path":"moore/algorithms/actor_critic/deep_actor_critic/mtppo.py","file_url":"https://github.com/AhmedMagdyHendawy/MOORE/blob/HEAD/moore/algorithms/actor_critic/deep_actor_critic/mtppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f099922845e9053f","code_sha256_prefix":"f099922845e9053f","mcp_get_code":{"code_sha256":"f099922845e9053f"}},{"arxiv_id":"2212.02098","arxiv_id_is_arxiv":true,"paper":"/paper/a-machine-with-short-term-episodic-and","title":"A Machine with Short-Term, Episodic, and Semantic Memory Systems","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humemai/agent-room-env-v1","path":"agent/ppo/utils.py","file_url":"https://github.com/humemai/agent-room-env-v1/blob/HEAD/agent/ppo/utils.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":"095f68d3628f0df1","code_sha256_prefix":"095f68d3628f0df1","mcp_get_code":{"code_sha256":"095f68d3628f0df1"}},{"arxiv_id":"2202.04332","arxiv_id_is_arxiv":true,"paper":"/paper/imitation-learning-by-state-only-distribution","title":"Imitation Learning by State-Only Distribution Matching","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FeMa42/soil-tdm","path":"gym_exp_data.py","file_url":"https://github.com/FeMa42/soil-tdm/blob/HEAD/gym_exp_data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39dd7febc8e9fb8f","code_sha256_prefix":"39dd7febc8e9fb8f","mcp_get_code":{"code_sha256":"39dd7febc8e9fb8f"}}],"record_sha256":"75f13a2a2a0815f70695ab206b167f479bb447175fdf75825bba35a43f173082","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}