Home › Code › combined_shape

combined_shape

Syntologyentry name in harvested coderead from the graph 2026-09-24

combined_shape appears in the code Syntology harvested for 16 papers, as 3 distinct code bodies found in 16 places (a place is one code body under one paper). At least one of them ran in 15 of the papers; 0 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 combined_shape 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 2 of the 3 distinct code bodies named combined_shape; 1 is unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
0ran · fixture could not drive it
0ran
1unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 5 of the 16 places are 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 “fixture could not drive it” 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.

Papers

16 papers shown of 16, 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 2 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning added by Syntology 2026-05 (from id) milanganai/milanganai.github.io/NeurIPS2023/code/core_respo.py 57542f87e248db45 ran · our draft was wrong no licence file found · pointer only
Plan2Cleanse: Test-Time Backdoor Defense via Monte-Carlo Planning in Deep Reinforcement Learning added by Syntology 2026-05 (from id) rl-bandits-lab/RL-Backdoor/backdoor_attack/multiagent_competition/fast_failing/train/ppo_core.py 57542f87e248db45 ran · our draft was wrong GPL-3.0 (copyleft) · pointer only
Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning 29 Jan 2025 hmishfaq/lsac/lsac.py 6d24f19c56e16f4a ran · honoured contract MIT (permissive)
Learning to Control Autonomous Fleets from Observation via Offline Reinforcement Learning 28 Feb 2023 identical code first harvested elsewhere 57542f87e248db45 ran · our draft was wrong licence of this copy not recorded
ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints 2 Feb 2023 openai/safety-starter-agents/safe_rl/pg/utils.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Model-based Safe Deep Reinforcement Learning via a Constrained Proximal Policy Optimization Algorithm 14 Oct 2022 akjayant/mbppol/src/core.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Efficient Reward Poisoning Attacks on Online Deep Reinforcement Learning 30 May 2022 yinglunxu/reward_poisoning_attack_drl/src/all_class.py 57542f87e248db45 ran · our draft was wrong no licence file found · pointer only
Hit and Lead Discovery with Explorative RL and Fragment-based Molecule Generation 4 Oct 2021 AITRICS/FREED/core_motif.py 57542f87e248db45 ran · our draft was wrong Apache-2.0 (permissive)
Stackelberg Actor-Critic: Game-Theoretic Reinforcement Learning Algorithms 25 Sep 2021 leozhengzly/stackelberg-actor-critic-algos/spinup/algos/pytorch/ddpg/core.py 57542f87e248db45 ran · our draft was wrong MIT recorded; this copy not marked cleared · pointer only
Safe Deep Reinforcement Learning for Multi-Agent Systems with Continuous Action Spaces 9 Aug 2021 zisikons/deep-rl/core/DDPG.py c8c447e6d29472c4 unverified MIT (permissive)
Safe Reinforcement Learning Using Advantage-Based Intervention 16 Jun 2021 nolanwagener/safe_rl/safe_rl/algos/cppo/core.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Deep Reinforcement Learning with Population-Coded Spiking Neural Network for Continuous Control 19 Oct 2020 combra-lab/pop-spiking-deep-rl/popsan_drl/popsan_sac/core_cuda.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Self-Imitation Learning via Generalized Lower Bound Q-learning 12 Jun 2020 openai/spinningup/spinup/algos/pytorch/ddpg/core.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Reward-Conditioned Policies 31 Dec 2019 TrentBrick/RewardConditionedUDRL/utils/buffer.py 57542f87e248db45 ran · our draft was wrong MIT (permissive)
Stacked Capsule Autoencoders 17 Jun 2019 KohavTal/SCAE_Project/torch_scae/general_utils.py 57542f87e248db45 ran · our draft was wrong Apache-2.0 (permissive)
arXiv:aaai_35251 Teddy298/continualworld-ppo/continualworld/ppo/core.py 57542f87e248db45 ran · our draft was wrong 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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