{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/trainstate","entry":"TrainState","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"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_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":1},"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":"2608.01205","paper":"/paper/arxiv-2608-01205","title":"ReBRAC-v2: The Return of the King","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"JongseongChae/FAC","path":"agents/rebrac.py","file_url":"https://github.com/JongseongChae/FAC/blob/HEAD/agents/rebrac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d59f622bcb0e041b","mcp_get_code":{"code_sha256":"d59f622bcb0e041b"}},{"arxiv_id":"2604.23528","paper":"/paper/arxiv-2604-23528","title":"When PINNs Go Wrong: Pseudo-Time Stepping Against Spurious Solutions","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sifanexisted/jaxpi2","path":"jaxpi/training.py","file_url":"https://github.com/sifanexisted/jaxpi2/blob/HEAD/jaxpi/training.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f1d6af4bda1df3f7","mcp_get_code":{"code_sha256":"f1d6af4bda1df3f7"}},{"arxiv_id":"2510.22512","paper":"/paper/arxiv-2510-22512","title":"Transitive RL: Value Learning via Divide and Conquer","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"aoberai/trl","path":"agents/trl.py","file_url":"https://github.com/aoberai/trl/blob/HEAD/agents/trl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"320b57aeb460d8c6","mcp_get_code":{"code_sha256":"320b57aeb460d8c6"}},{"arxiv_id":"2506.17197","paper":null,"title":"arXiv:2506.17197","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"samuel-howard/Tree_SB_Matching_Barycentres","path":"run_BarycentreDSBM.py","file_url":"https://github.com/samuel-howard/Tree_SB_Matching_Barycentres/blob/HEAD/run_BarycentreDSBM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f885f4a21d9310d7","mcp_get_code":{"code_sha256":"f885f4a21d9310d7"}},{"arxiv_id":"2506.07744","paper":"/paper/graph-assisted-stitching-for-offline","title":"Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learning","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qortmdgh4141/gas","path":"M_utils/agents/gas.py","file_url":"https://github.com/qortmdgh4141/gas/blob/HEAD/M_utils/agents/gas.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e48283b621200f7","mcp_get_code":{"code_sha256":"7e48283b621200f7"}},{"arxiv_id":"2411.07007","paper":"/paper/non-adversarial-inverse-reinforcement","title":"Non-Adversarial Inverse Reinforcement Learning via Successor Feature Matching","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnavkj1995/sfm","path":"agents/sfm_sac.py","file_url":"https://github.com/arnavkj1995/sfm/blob/HEAD/agents/sfm_sac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1b12a121cc9ff6e","mcp_get_code":{"code_sha256":"f1b12a121cc9ff6e"}},{"arxiv_id":"2210.01620","paper":"/paper/sam-as-an-optimal-relaxation-of-bayes","title":"SAM as an Optimal Relaxation of Bayes","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"team-approx-bayes/bayesian-sam","path":"optim.py","file_url":"https://github.com/team-approx-bayes/bayesian-sam/blob/HEAD/optim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"4e6de0ea79aa52b8","mcp_get_code":{"code_sha256":"4e6de0ea79aa52b8"}}]}