{"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/create-train-state","entry":"create_train_state","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":6,"n_papers_ran":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":6,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":3},"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":"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3c09bc251881239f","mcp_get_code":{"code_sha256":"3c09bc251881239f"}},{"arxiv_id":"2406.12616","paper":"/paper/learning-diffusion-at-lightspeed","title":"Learning diffusion at lightspeed","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antonioterpin/jkonet-star","path":"models/jkonet_star.py","file_url":"https://github.com/antonioterpin/jkonet-star/blob/HEAD/models/jkonet_star.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9472772bdc7050bb","mcp_get_code":{"code_sha256":"9472772bdc7050bb"}},{"arxiv_id":"2312.14000","paper":"/paper/risk-sensitive-stochastic-optimal-control-as","title":"Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanyas/psoc","path":"psoc/utils.py","file_url":"https://github.com/hanyas/psoc/blob/HEAD/psoc/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2d9db9dc4ba9f46c","mcp_get_code":{"code_sha256":"2d9db9dc4ba9f46c"}},{"arxiv_id":"2312.01456","paper":"/paper/compositional-policy-learning-in-stochastic-1","title":"Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlech26l/neural_martingales","path":"rsm_learner.py","file_url":"https://github.com/mlech26l/neural_martingales/blob/HEAD/rsm_learner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7c3d01d90cd968f","mcp_get_code":{"code_sha256":"c7c3d01d90cd968f"}},{"arxiv_id":"2106.06345","paper":"/paper/jkonet-proximal-optimal-transport-modeling-of","title":"Proximal Optimal Transport Modeling of Population Dynamics","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bunnech/jkonet","path":"jkonet/utils/optim.py","file_url":"https://github.com/bunnech/jkonet/blob/HEAD/jkonet/utils/optim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac6b25b6c65de42b","mcp_get_code":{"code_sha256":"ac6b25b6c65de42b"}},{"arxiv_id":"1812.05905","paper":"/paper/soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patrickhart/jaxdl","path":"jaxdl/utils/commons.py","file_url":"https://github.com/patrickhart/jaxdl/blob/HEAD/jaxdl/utils/commons.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79d78013ca3d7e90","mcp_get_code":{"code_sha256":"79d78013ca3d7e90"}}]}