{"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/soft-clamp","entry":"soft_clamp","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":7,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":9,"n_places":16,"n_places_pointer_only":1,"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":5,"ran_fixture":1,"ran":7,"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":"2606.00680","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00680","title":"Regularized Offline Policy Optimization with Posterior Hybrid Bayesian Belief","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"HQ-Lin/PhyB","path":"submodule/dynamics_ensemble.py","file_url":"https://github.com/HQ-Lin/PhyB/blob/HEAD/submodule/dynamics_ensemble.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5b0936424b3d7ee","code_sha256_prefix":"a5b0936424b3d7ee","mcp_get_code":{"code_sha256":"a5b0936424b3d7ee"}},{"arxiv_id":"2602.12105","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12105","title":"Iskra: A System for Inverse Geometry Processing","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"anadodik/iskra","path":"iskra/mollifiers.py","file_url":"https://github.com/anadodik/iskra/blob/HEAD/iskra/mollifiers.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":"ad719793a133ac0b","code_sha256_prefix":"ad719793a133ac0b","mcp_get_code":{"code_sha256":"ad719793a133ac0b"}},{"arxiv_id":"2512.04341","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-04341","title":"Long-Horizon Model-Based Offline Reinforcement Learning Without Explicit Conservatism","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"twni2016/neubay","path":"offline_world/modules.py","file_url":"https://github.com/twni2016/neubay/blob/HEAD/offline_world/modules.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":"f92e635d667b3a0c","code_sha256_prefix":"f92e635d667b3a0c","mcp_get_code":{"code_sha256":"f92e635d667b3a0c"}},{"arxiv_id":"2505.20280","arxiv_id_is_arxiv":true,"paper":"/paper/lorentz-local-canonicalization-how-to-make","title":"Lorentz Local Canonicalization: How to Make Any Network Lorentz-Equivariant","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heidelberg-hepml/lloca","path":"lloca/framesnet/equi_frames.py","file_url":"https://github.com/heidelberg-hepml/lloca/blob/HEAD/lloca/framesnet/equi_frames.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"487d397c3b78bbc5","code_sha256_prefix":"487d397c3b78bbc5","mcp_get_code":{"code_sha256":"487d397c3b78bbc5"}},{"arxiv_id":"2504.10612","arxiv_id_is_arxiv":true,"paper":"/paper/energy-matching-unifying-flow-matching-and","title":"Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m1balcerak/EnergyMatching","path":"experiments/cifar10/network_transformer_vit.py","file_url":"https://github.com/m1balcerak/EnergyMatching/blob/HEAD/experiments/cifar10/network_transformer_vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6da4dca737892c0","code_sha256_prefix":"c6da4dca737892c0","mcp_get_code":{"code_sha256":"c6da4dca737892c0"}},{"arxiv_id":"2410.11234","arxiv_id_is_arxiv":true,"paper":"/paper/bayes-adaptive-monte-carlo-tree-search-for","title":"Bayes Adaptive Monte Carlo Tree Search for Offline Model-based Reinforcement Learning","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucascjysdl/offline-rl-kit","path":"offlinerlkit/modules/dynamics_module.py","file_url":"https://github.com/lucascjysdl/offline-rl-kit/blob/HEAD/offlinerlkit/modules/dynamics_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28a7078c4101fc7f","code_sha256_prefix":"28a7078c4101fc7f","mcp_get_code":{"code_sha256":"28a7078c4101fc7f"}},{"arxiv_id":"2410.11234","arxiv_id_is_arxiv":true,"paper":"/paper/bayes-adaptive-monte-carlo-tree-search-for","title":"Bayes Adaptive Monte Carlo Tree Search for Offline Model-based Reinforcement Learning","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucascjysdl/offline-rl-kit","path":"offlinerlkit/nets/rnn.py","file_url":"https://github.com/lucascjysdl/offline-rl-kit/blob/HEAD/offlinerlkit/nets/rnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57081580e9d6a5f3","code_sha256_prefix":"57081580e9d6a5f3","mcp_get_code":{"code_sha256":"57081580e9d6a5f3"}},{"arxiv_id":"2408.05834","arxiv_id_is_arxiv":true,"paper":"/paper/divide-and-conquer-predictive-coding-a","title":"Divide-and-Conquer Predictive Coding: a structured Bayesian inference algorithm","date":"2024-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esennesh/dcpc_paper","path":"utils/thirdparty.py","file_url":"https://github.com/esennesh/dcpc_paper/blob/HEAD/utils/thirdparty.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf7d23ff7a8f9748","code_sha256_prefix":"bf7d23ff7a8f9748","mcp_get_code":{"code_sha256":"bf7d23ff7a8f9748"}},{"arxiv_id":"2407.06494","arxiv_id_is_arxiv":true,"paper":"/paper/a-generative-approach-to-control-complex","title":"DiffPhyCon: A Generative Approach to Control Complex Physical Systems","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Science-WestlakeU/diffphycon","path":"baselines/BC_burgers/net.py","file_url":"https://github.com/AI4Science-WestlakeU/diffphycon/blob/HEAD/baselines/BC_burgers/net.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8dc65736e6bef1e","code_sha256_prefix":"c8dc65736e6bef1e","mcp_get_code":{"code_sha256":"c8dc65736e6bef1e"}},{"arxiv_id":"2405.17031","arxiv_id_is_arxiv":true,"paper":"/paper/any-step-dynamics-model-improves-future","title":"Any-step Dynamics Model Improves Future Predictions for Online and Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HxLyn3/ADMPO","path":"dynamics/arm_dynamics.py","file_url":"https://github.com/HxLyn3/ADMPO/blob/HEAD/dynamics/arm_dynamics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57081580e9d6a5f3","code_sha256_prefix":"57081580e9d6a5f3","mcp_get_code":{"code_sha256":"57081580e9d6a5f3"}},{"arxiv_id":"2311.03351","arxiv_id_is_arxiv":true,"paper":"/paper/uni-o4-unifying-online-and-offline-deep","title":"Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lei-Kun/Uni-O4","path":"net.py","file_url":"https://github.com/Lei-Kun/Uni-O4/blob/HEAD/net.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8dc65736e6bef1e","code_sha256_prefix":"c8dc65736e6bef1e","mcp_get_code":{"code_sha256":"c8dc65736e6bef1e"}},{"arxiv_id":"2311.03351","arxiv_id_is_arxiv":true,"paper":"/paper/uni-o4-unifying-online-and-offline-deep","title":"Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lei-Kun/Uni-O4","path":"ppo_finetune/net.py","file_url":"https://github.com/Lei-Kun/Uni-O4/blob/HEAD/ppo_finetune/net.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":"109c5738b44665bb","code_sha256_prefix":"109c5738b44665bb","mcp_get_code":{"code_sha256":"109c5738b44665bb"}},{"arxiv_id":"2302.11312","arxiv_id_is_arxiv":true,"paper":"/paper/behavior-proximal-policy-optimization","title":"Behavior Proximal Policy Optimization","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dragon-zhuang/bppo","path":"net.py","file_url":"https://github.com/dragon-zhuang/bppo/blob/HEAD/net.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8dc65736e6bef1e","code_sha256_prefix":"c8dc65736e6bef1e","mcp_get_code":{"code_sha256":"c8dc65736e6bef1e"}},{"arxiv_id":"2209.15256","arxiv_id_is_arxiv":true,"paper":"/paper/s2p-state-conditioned-image-synthesis-for","title":"S2P: State-conditioned Image Synthesis for Data Augmentation in Offline Reinforcement Learning","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsshim0125/s2p","path":"gaussian_ensemble.py","file_url":"https://github.com/dsshim0125/s2p/blob/HEAD/gaussian_ensemble.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4df5488a40f1ca","code_sha256_prefix":"3b4df5488a40f1ca","mcp_get_code":{"code_sha256":"3b4df5488a40f1ca"}},{"arxiv_id":"2207.08435","arxiv_id_is_arxiv":true,"paper":"/paper/robust-simulation-based-inference-in","title":"Robust Simulation-Based Inference in Cosmology with Bayesian Neural Networks","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pablo-lemos/cosmoswag","path":"cosmoswag/swag.py","file_url":"https://github.com/pablo-lemos/cosmoswag/blob/HEAD/cosmoswag/swag.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pablo-lemos/cosmoswag when it was checked","code_sha256":"93128a850e9011b3","code_sha256_prefix":"93128a850e9011b3","mcp_get_code":{"code_sha256":"93128a850e9011b3"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SerezD/NVAE-from-scratch","path":"src/model.py","file_url":"https://github.com/SerezD/NVAE-from-scratch/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"081e9e26fd1942f7","code_sha256_prefix":"081e9e26fd1942f7","mcp_get_code":{"code_sha256":"081e9e26fd1942f7"}}],"record_sha256":"a5a8f6594741f14acb1a93bf71d0e2c4f56c01a4b4262ba4f7e44d25a4603534","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}