{"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/var","entry":"var","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":16,"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":10,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":16,"n_places_pointer_only":8,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":6},"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":"2509.25411","paper":"/paper/arxiv-2509-25411","title":"Boolean Satisfiability via Imitation Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zewei-Zhang/ImitSAT","path":"ImitSAT/ImitSAT_MiniSAT.py","file_url":"https://github.com/zewei-Zhang/ImitSAT/blob/HEAD/ImitSAT/ImitSAT_MiniSAT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"2898dcdb0ade85f9","mcp_get_code":{"code_sha256":"2898dcdb0ade85f9"}},{"arxiv_id":"2408.00211","paper":"/paper/penzai-treescope-a-toolkit-for-interpreting","title":"Penzai + Treescope: A Toolkit for Interpreting, Visualizing, and Editing Models As Data","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/penzai","path":"penzai/core/shapecheck.py","file_url":"https://github.com/google-deepmind/penzai/blob/HEAD/penzai/core/shapecheck.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":"c716cd4fc3d93251","mcp_get_code":{"code_sha256":"c716cd4fc3d93251"}},{"arxiv_id":"2401.09870","paper":"/paper/reconciling-spatial-and-temporal-abstractions","title":"Reconciling Spatial and Temporal Abstractions for Goal Representation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosynus-lix/STAR","path":"star/agents.py","file_url":"https://github.com/cosynus-lix/STAR/blob/HEAD/star/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6509922bd56726e6","mcp_get_code":{"code_sha256":"6509922bd56726e6"}},{"arxiv_id":"2307.16212","paper":"/paper/robust-multi-agent-reinforcement-learning-3","title":"Robust Multi-Agent Reinforcement Learning with State Uncertainty","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sihongho/robust_marl_with_state_uncertainty","path":"RMA-AC/maddpg/common/tf_util.py","file_url":"https://github.com/sihongho/robust_marl_with_state_uncertainty/blob/HEAD/RMA-AC/maddpg/common/tf_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"598184a2689d36d0","mcp_get_code":{"code_sha256":"598184a2689d36d0"}},{"arxiv_id":"2212.02705","paper":"/paper/what-is-the-solution-for-state-adversarial","title":"What is the Solution for State-Adversarial Multi-Agent Reinforcement Learning?","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"susanbao/rmarl_code","path":"rmarl/maddpg/common/tf_util.py","file_url":"https://github.com/susanbao/rmarl_code/blob/HEAD/rmarl/maddpg/common/tf_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"598184a2689d36d0","mcp_get_code":{"code_sha256":"598184a2689d36d0"}},{"arxiv_id":"2201.07788","paper":"/paper/condor-self-supervised-canonicalization-of-3d","title":"ConDor: Self-Supervised Canonicalization of 3D Pose for Partial Shapes","date":"2022-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brown-ivl/ConDor","path":"ConDor/evaluators/train_pointnet_cls2.py","file_url":"https://github.com/brown-ivl/ConDor/blob/HEAD/ConDor/evaluators/train_pointnet_cls2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9fb46aab78071109","mcp_get_code":{"code_sha256":"9fb46aab78071109"}},{"arxiv_id":"2110.13625","paper":"/paper/landmark-guided-subgoal-generation-in","title":"Landmark-Guided Subgoal Generation in Hierarchical Reinforcement Learning","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junsu-kim97/HIGL","path":"higl/higl.py","file_url":"https://github.com/junsu-kim97/HIGL/blob/HEAD/higl/higl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6509922bd56726e6","mcp_get_code":{"code_sha256":"6509922bd56726e6"}},{"arxiv_id":"2105.06022","paper":"/paper/principled-exploration-via-optimistic","title":"Principled Exploration via Optimistic Bootstrapping and Backward Induction","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rrmenon10/Bootstrapped-DQN","path":"baselines/common/tf_util.py","file_url":"https://github.com/rrmenon10/Bootstrapped-DQN/blob/HEAD/baselines/common/tf_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9071c058ed8fc811","mcp_get_code":{"code_sha256":"9071c058ed8fc811"}},{"arxiv_id":"2006.11485","paper":"/paper/generating-adjacency-constrained-subgoals-in","title":"Generating Adjacency-Constrained Subgoals in Hierarchical Reinforcement Learning","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"6509922bd56726e6","mcp_get_code":{"code_sha256":"6509922bd56726e6"}},{"arxiv_id":"1811.04968","paper":"/paper/pennylane-automatic-differentiation-of-hybrid","title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","date":"2018-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyHong/Pennylane-repl","path":"pennylane/measure.py","file_url":"https://github.com/rickyHong/Pennylane-repl/blob/HEAD/pennylane/measure.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":"5d9e2fb1c244a165","mcp_get_code":{"code_sha256":"5d9e2fb1c244a165"}},{"arxiv_id":"1803.00933","paper":"/paper/distributed-prioritized-experience-replay","title":"Distributed Prioritized Experience Replay","date":"2018-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/ape-x","path":"tf_util.py","file_url":"https://github.com/uber-research/ape-x/blob/HEAD/tf_util.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":"9071c058ed8fc811","mcp_get_code":{"code_sha256":"9071c058ed8fc811"}},{"arxiv_id":"1710.11424","paper":"/paper/regret-minimization-for-partially-observable","title":"Regret Minimization for Partially Observable Deep Reinforcement Learning","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterhj/arm-pytorch","path":"policyopt/autodiff.py","file_url":"https://github.com/peterhj/arm-pytorch/blob/HEAD/policyopt/autodiff.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e743432999d47714","mcp_get_code":{"code_sha256":"e743432999d47714"}},{"arxiv_id":"1710.00814","paper":"/paper/detecting-adversarial-attacks-on-neural","title":"Detecting Adversarial Attacks on Neural Network Policies with Visual Foresight","date":"2017-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yenchenlin/rl-attack-detection","path":"baselines/common/tf_util.py","file_url":"https://github.com/yenchenlin/rl-attack-detection/blob/HEAD/baselines/common/tf_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9071c058ed8fc811","mcp_get_code":{"code_sha256":"9071c058ed8fc811"}},{"arxiv_id":"1706.02275","paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baoqianwang/iros22_darl1n","path":"maddpg_o/maddpg_local/trainer/maddpg.py","file_url":"https://github.com/baoqianwang/iros22_darl1n/blob/HEAD/maddpg_o/maddpg_local/trainer/maddpg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"598184a2689d36d0","mcp_get_code":{"code_sha256":"598184a2689d36d0"}},{"arxiv_id":"1703.06953","paper":"/paper/multi-style-generative-network-for-real-time","title":"Multi-style Generative Network for Real-time Transfer","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghang1989/PyTorch-Multi-Style-Transfer","path":"experiments/net.py","file_url":"https://github.com/zhanghang1989/PyTorch-Multi-Style-Transfer/blob/HEAD/experiments/net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e837b13c9b1af4be","mcp_get_code":{"code_sha256":"e837b13c9b1af4be"}},{"arxiv_id":"2024.findings-emnlp.667","paper":null,"title":"arXiv:2024.findings-emnlp.667","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cjdrake/pyeda","path":"pyeda/boolalg/boolfunc.py","file_url":"https://github.com/cjdrake/pyeda/blob/HEAD/pyeda/boolalg/boolfunc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"6d3c55b231689c8a","mcp_get_code":{"code_sha256":"6d3c55b231689c8a"}}]}