Home › Code › soft_clamp

soft_clamp

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

soft_clamp appears in the code Syntology harvested for 14 papers, as 13 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 14 papers, 14 with a sample that ran: 7 with a run with no instrument failure, 7 where every run was a failure of Syntology's instrument. 9 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named soft_clamp do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 13 distinct code bodies named soft_clamp: 13 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
5ran · our draft was wrong
1ran; the contract check could not run
7ran
0unverified
9fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 16 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

14 papers shown of 14, newest first; 16 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 3 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Regularized Offline Policy Optimization with Posterior Hybrid Bayesian Belief added by Syntology 2026-06 (from id) HQ-Lin/PhyB/submodule/dynamics_ensemble.py a5b0936424b3d7ee ran · our draft was wrong fingerprinted MIT (permissive)
Iskra: A System for Inverse Geometry Processing added by Syntology 2026-02 (from id) anadodik/iskra/iskra/mollifiers.py ad719793a133ac0b ran MIT (permissive)
Long-Horizon Model-Based Offline Reinforcement Learning Without Explicit Conservatism added by Syntology 2025-12 (from id) twni2016/neubay/offline_world/modules.py f92e635d667b3a0c ran MIT (permissive)
Lorentz Local Canonicalization: How to Make Any Network Lorentz-Equivariant 26 May 2025 heidelberg-hepml/lloca/lloca/framesnet/equi_frames.py 487d397c3b78bbc5 ran · our draft was wrong fingerprinted MIT (permissive)
Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling 14 Apr 2025 m1balcerak/EnergyMatching/experiments/cifar10/network_transformer_vit.py c6da4dca737892c0 ran fingerprinted MIT (permissive)
Bayes Adaptive Monte Carlo Tree Search for Offline Model-based Reinforcement Learning 15 Oct 2024 lucascjysdl/offline-rl-kit/offlinerlkit/modules/dynamics_module.py 28a7078c4101fc7f ran fingerprinted MIT (permissive)
Bayes Adaptive Monte Carlo Tree Search for Offline Model-based Reinforcement Learning 15 Oct 2024 lucascjysdl/offline-rl-kit/offlinerlkit/nets/rnn.py 57081580e9d6a5f3 ran · our draft was wrong fingerprinted MIT (permissive)
Divide-and-Conquer Predictive Coding: a structured Bayesian inference algorithm 11 Aug 2024 esennesh/dcpc_paper/utils/thirdparty.py bf7d23ff7a8f9748 ran fingerprinted MIT (permissive)
DiffPhyCon: A Generative Approach to Control Complex Physical Systems 9 Jul 2024 AI4Science-WestlakeU/diffphycon/baselines/BC_burgers/net.py c8dc65736e6bef1e ran; the contract check could not run (RAISES) MIT (permissive)
Any-step Dynamics Model Improves Future Predictions for Online and Offline Reinforcement Learning 27 May 2024 HxLyn3/ADMPO/dynamics/arm_dynamics.py 57081580e9d6a5f3 ran · our draft was wrong fingerprinted MIT (permissive)
Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization 6 Nov 2023 Lei-Kun/Uni-O4/net.py c8dc65736e6bef1e ran; the contract check could not run (RAISES) MIT (permissive)
Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization 6 Nov 2023 Lei-Kun/Uni-O4/ppo_finetune/net.py 109c5738b44665bb ran MIT (permissive)
Behavior Proximal Policy Optimization 22 Feb 2023 dragon-zhuang/bppo/net.py c8dc65736e6bef1e ran; the contract check could not run (RAISES) MIT (permissive)
S2P: State-conditioned Image Synthesis for Data Augmentation in Offline Reinforcement Learning 30 Sep 2022 dsshim0125/s2p/gaussian_ensemble.py 3b4df5488a40f1ca ran fingerprinted MIT (permissive)
Robust Simulation-Based Inference in Cosmology with Bayesian Neural Networks 18 Jul 2022 pablo-lemos/cosmoswag/cosmoswag/swag.py 93128a850e9011b3 ran · our draft was wrong fingerprinted no licence file found · pointer only
NVAE: A Deep Hierarchical Variational Autoencoder 8 Jul 2020 SerezD/NVAE-from-scratch/src/model.py 081e9e26fd1942f7 ran · our draft was wrong fingerprinted MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections