{"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/step","entry":"step","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":32,"n_papers_ran":9,"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":36,"n_samples_ran":10,"n_samples_fingerprinted":4,"n_places":42,"n_places_pointer_only":11,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":6,"unverified":26},"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":"2609.00455","paper":"/paper/arxiv-2609-00455","title":"Towards a Belief-Based World Model for LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"WeiminXiong/MPO","path":"utils/replace_sciworld_score.py","file_url":"https://github.com/WeiminXiong/MPO/blob/HEAD/utils/replace_sciworld_score.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":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2607.12122","paper":"/paper/arxiv-2607-12122","title":"An Agentic AI Scientific Community for Automated Neural Operator Discovery","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"luislootx/AI-SC","path":"nod/code/build_paper.py","file_url":"https://github.com/luislootx/AI-SC/blob/HEAD/nod/code/build_paper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"88d0028a26b9bf43","mcp_get_code":{"code_sha256":"88d0028a26b9bf43"}},{"arxiv_id":"2605.02675","paper":"/paper/arxiv-2605-02675","title":"Online Generalised Predictive Coding","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MLDawn/ODEM","path":"algorithms/E_step.py","file_url":"https://github.com/MLDawn/ODEM/blob/HEAD/algorithms/E_step.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"4a8314d2d7a43740","mcp_get_code":{"code_sha256":"4a8314d2d7a43740"}},{"arxiv_id":"2605.02675","paper":"/paper/arxiv-2605-02675","title":"Online Generalised Predictive Coding","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MLDawn/ODEM","path":"algorithms/M_step.py","file_url":"https://github.com/MLDawn/ODEM/blob/HEAD/algorithms/M_step.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"58975bb1377b81a3","mcp_get_code":{"code_sha256":"58975bb1377b81a3"}},{"arxiv_id":"2604.17252","paper":"/paper/arxiv-2604-17252","title":"Seeing Isn't Believing: Mitigating Belief Inertia via Active Intervention in Embodied Agents","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"WangHanLinHenry/EVU","path":"other_env/eval_agent/utils/replace_sciworld_score.py","file_url":"https://github.com/WangHanLinHenry/EVU/blob/HEAD/other_env/eval_agent/utils/replace_sciworld_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2604.14925","paper":"/paper/arxiv-2604-14925","title":"Improving Sparse Autoencoder with Dynamic Attention","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"qyj-bkjx/Sparsemax-SAE","path":"src/sae_training/sparse_autoencoder.py","file_url":"https://github.com/qyj-bkjx/Sparsemax-SAE/blob/HEAD/src/sae_training/sparse_autoencoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06d421a8db58516e","mcp_get_code":{"code_sha256":"06d421a8db58516e"}},{"arxiv_id":"2509.16564","paper":"/paper/arxiv-2509-16564","title":"MPCG: Multi-Round Persona-Conditioned Generation for Modeling the Evolution of Misinformation with LLMs","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"bcjr1997/MPCG","path":"mpcg/role_playing_misinformation_generation_cuda.py","file_url":"https://github.com/bcjr1997/MPCG/blob/HEAD/mpcg/role_playing_misinformation_generation_cuda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69739ed7c3ef75e9","mcp_get_code":{"code_sha256":"69739ed7c3ef75e9"}},{"arxiv_id":"2506.15755","paper":null,"title":"arXiv:2506.15755","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"wangdaha1/VLMInferSlow","path":"attacks/utils/compute.py","file_url":"https://github.com/wangdaha1/VLMInferSlow/blob/HEAD/attacks/utils/compute.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"30d6096da83fd892","mcp_get_code":{"code_sha256":"30d6096da83fd892"}},{"arxiv_id":"2505.20732","paper":"/paper/spa-rl-reinforcing-llm-agents-via-stepwise","title":"SPA-RL: Reinforcing LLM Agents via Stepwise Progress Attribution","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghanlinhenry/spa-rl-agent","path":"eval_agent/utils/replace_sciworld_score.py","file_url":"https://github.com/wanghanlinhenry/spa-rl-agent/blob/HEAD/eval_agent/utils/replace_sciworld_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2406.14868","paper":"/paper/direct-multi-turn-preference-optimization-for","title":"Direct Multi-Turn Preference Optimization for Language Agents","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swt-user/dmpo","path":"eval_agent/utils/replace_sciworld_score.py","file_url":"https://github.com/swt-user/dmpo/blob/HEAD/eval_agent/utils/replace_sciworld_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2406.11176","paper":"/paper/watch-every-step-llm-agent-learning-via","title":"Watch Every Step! LLM Agent Learning via Iterative Step-Level Process Refinement","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiminxiong/ipr","path":"eval_agent/utils/replace_sciworld_score.py","file_url":"https://github.com/weiminxiong/ipr/blob/HEAD/eval_agent/utils/replace_sciworld_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2403.14606","paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"control_flows/plot_soft_thresholding.py","file_url":"https://github.com/diffprog/code/blob/HEAD/control_flows/plot_soft_thresholding.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":"8bb9ef7b2dd1407c","mcp_get_code":{"code_sha256":"8bb9ef7b2dd1407c"}},{"arxiv_id":"2403.02502","paper":"/paper/trial-and-error-exploration-based-trajectory","title":"Trial and Error: Exploration-Based Trajectory Optimization for LLM Agents","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-song793/eto","path":"eval_agent/utils/replace_sciworld_score.py","file_url":"https://github.com/yifan-song793/eto/blob/HEAD/eval_agent/utils/replace_sciworld_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91b0f8598b261907","mcp_get_code":{"code_sha256":"91b0f8598b261907"}},{"arxiv_id":"2402.03141","paper":"/paper/boosting-long-delayed-reinforcement-learning","title":"Boosting Reinforcement Learning with Strongly Delayed Feedback Through Auxiliary Short Delays","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QingyuanWuNothing/AD-RL","path":"DETERMINISTIC-MDP.py","file_url":"https://github.com/QingyuanWuNothing/AD-RL/blob/HEAD/DETERMINISTIC-MDP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6abe638592f2fc98","mcp_get_code":{"code_sha256":"6abe638592f2fc98"}},{"arxiv_id":"2310.13892","paper":"/paper/specify-robust-causal-representation-from","title":"Specify Robust Causal Representation from Mixed Observations","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymy4323460/cari","path":"codebase/utils.py","file_url":"https://github.com/ymy4323460/cari/blob/HEAD/codebase/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"33f13521765f71e4","mcp_get_code":{"code_sha256":"33f13521765f71e4"}},{"arxiv_id":"2305.07958","paper":"/paper/more-for-less-safe-policy-improvement-with","title":"More for Less: Safe Policy Improvement With Stronger Performance Guarantees","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lava-lab/improved_spi","path":"env_util.py","file_url":"https://github.com/lava-lab/improved_spi/blob/HEAD/env_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00a69808cc4ed02d","mcp_get_code":{"code_sha256":"00a69808cc4ed02d"}},{"arxiv_id":"2302.12827","paper":"/paper/decoupling-human-and-camera-motion-from","title":"Decoupling Human and Camera Motion from Videos in the Wild","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vye16/slahmr","path":"slahmr/humor/humor_model.py","file_url":"https://github.com/vye16/slahmr/blob/HEAD/slahmr/humor/humor_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b42b9ef8a1f5a556","mcp_get_code":{"code_sha256":"b42b9ef8a1f5a556"}},{"arxiv_id":"2211.11435","paper":"/paper/zigzag-universal-sampling-free-uncertainty","title":"ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-epfl/zigzag","path":"exps/toy_regression.py","file_url":"https://github.com/cvlab-epfl/zigzag/blob/HEAD/exps/toy_regression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed7721901f412400","mcp_get_code":{"code_sha256":"ed7721901f412400"}},{"arxiv_id":"2210.06036","paper":"/paper/guaranteed-conservation-of-momentum-for","title":"Guaranteed Conservation of Momentum for Learning Particle-based Fluid Dynamics","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/dmcf","path":"datasets/free_fall_gen.py","file_url":"https://github.com/tum-pbs/dmcf/blob/HEAD/datasets/free_fall_gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40a148b6fb7749bc","mcp_get_code":{"code_sha256":"40a148b6fb7749bc"}},{"arxiv_id":"2205.12141","paper":"/paper/one-pixel-shortcut-on-the-learning-preference","title":"One-Pixel Shortcut: on the Learning Preference of Deep Neural Networks","date":"2022-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cychomatica/one-pixel-shotcut","path":"training.py","file_url":"https://github.com/cychomatica/one-pixel-shotcut/blob/HEAD/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":"6613eec4ec10b472","mcp_get_code":{"code_sha256":"6613eec4ec10b472"}},{"arxiv_id":"2112.00195","paper":"/paper/efficient-online-bayesian-inference-for","title":"Efficient Online Bayesian Inference for Neural Bandits","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probml/bandits","path":"bandits/training.py","file_url":"https://github.com/probml/bandits/blob/HEAD/bandits/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e45667ba74a8413","mcp_get_code":{"code_sha256":"3e45667ba74a8413"}},{"arxiv_id":"2109.03891","paper":"/paper/sornet-spatial-object-centric-representations","title":"SORNet: Spatial Object-Centric Representations for Sequential Manipulation","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wentaoyuan/sornet","path":"train_clevr.py","file_url":"https://github.com/wentaoyuan/sornet/blob/HEAD/train_clevr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70cbeab60da02673","mcp_get_code":{"code_sha256":"70cbeab60da02673"}},{"arxiv_id":"2109.03891","paper":"/paper/sornet-spatial-object-centric-representations","title":"SORNet: Spatial Object-Centric Representations for Sequential Manipulation","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wentaoyuan/sornet","path":"train_leonardo.py","file_url":"https://github.com/wentaoyuan/sornet/blob/HEAD/train_leonardo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"263ba8b7b267c3e4","mcp_get_code":{"code_sha256":"263ba8b7b267c3e4"}},{"arxiv_id":"2109.03891","paper":"/paper/sornet-spatial-object-centric-representations","title":"SORNet: Spatial Object-Centric Representations for Sequential Manipulation","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wentaoyuan/sornet","path":"train_regression.py","file_url":"https://github.com/wentaoyuan/sornet/blob/HEAD/train_regression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"565a7402728223c4","mcp_get_code":{"code_sha256":"565a7402728223c4"}},{"arxiv_id":"2107.04292","paper":"/paper/unire-a-unified-label-space-for-entity","title":"UniRE: A Unified Label Space for Entity Relation Extraction","date":"2021-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Receiling/UniRE","path":"entity_relation_joint_decoder.py","file_url":"https://github.com/Receiling/UniRE/blob/HEAD/entity_relation_joint_decoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7923c42d53550a69","mcp_get_code":{"code_sha256":"7923c42d53550a69"}},{"arxiv_id":"2105.12204","paper":"/paper/safe-value-functions","title":"Safe Value Functions","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheim/vibly","path":"models/daslip.py","file_url":"https://github.com/sheim/vibly/blob/HEAD/models/daslip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8d3bf3ad5f61f6cd","mcp_get_code":{"code_sha256":"8d3bf3ad5f61f6cd"}},{"arxiv_id":"2105.12204","paper":"/paper/safe-value-functions","title":"Safe Value Functions","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheim/vibly","path":"models/nslip.py","file_url":"https://github.com/sheim/vibly/blob/HEAD/models/nslip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2883642f8bbd352a","mcp_get_code":{"code_sha256":"2883642f8bbd352a"}},{"arxiv_id":"2105.12204","paper":"/paper/safe-value-functions","title":"Safe Value Functions","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheim/vibly","path":"models/parslip.py","file_url":"https://github.com/sheim/vibly/blob/HEAD/models/parslip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d0a938a8c361a66a","mcp_get_code":{"code_sha256":"d0a938a8c361a66a"}},{"arxiv_id":"2105.04668","paper":"/paper/humor-3d-human-motion-model-for-robust-pose","title":"HuMoR: 3D Human Motion Model for Robust Pose Estimation","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davrempe/humor","path":"humor/models/humor_model.py","file_url":"https://github.com/davrempe/humor/blob/HEAD/humor/models/humor_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b42b9ef8a1f5a556","mcp_get_code":{"code_sha256":"b42b9ef8a1f5a556"}},{"arxiv_id":"2011.02082","paper":"/paper/deepreach-a-deep-learning-approach-to-high","title":"DeepReach: A Deep Learning Approach to High-Dimensional Reachability","date":"2020-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordasl/hj_reachability","path":"hj_reachability/solver.py","file_url":"https://github.com/stanfordasl/hj_reachability/blob/HEAD/hj_reachability/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b9a0d44189540dc","mcp_get_code":{"code_sha256":"5b9a0d44189540dc"}},{"arxiv_id":"2006.06676","paper":"/paper/training-generative-adversarial-networks-with-2","title":"Training Generative Adversarial Networks with Limited Data","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beresandras/gan-flavours-keras","path":"utils.py","file_url":"https://github.com/beresandras/gan-flavours-keras/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4aa47838d197a6b","mcp_get_code":{"code_sha256":"e4aa47838d197a6b"}},{"arxiv_id":"1911.09464","paper":"/paper/quantization-networks-1","title":"Quantization Networks","date":"2019-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliyun/alibabacloud-quantization-networks","path":"models/quantization.py","file_url":"https://github.com/aliyun/alibabacloud-quantization-networks/blob/HEAD/models/quantization.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":"73faf61923ab6fc6","mcp_get_code":{"code_sha256":"73faf61923ab6fc6"}},{"arxiv_id":"1911.08670","paper":"/paper/mmtm-multimodal-transfer-module-for-cnn","title":"MMTM: Multimodal Transfer Module for CNN Fusion","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haamoon/mmtm","path":"main_mmtm_ntu.py","file_url":"https://github.com/haamoon/mmtm/blob/HEAD/main_mmtm_ntu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5cbdca0600a0fd4","mcp_get_code":{"code_sha256":"f5cbdca0600a0fd4"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/cart_pole.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/cart_pole.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13cccf56f08b0d20","mcp_get_code":{"code_sha256":"13cccf56f08b0d20"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/frozen_lake_1_2_3.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/frozen_lake_1_2_3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c28303defaa68021","mcp_get_code":{"code_sha256":"c28303defaa68021"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/frozen_lake_4_5_6.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/frozen_lake_4_5_6.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe5a29213a5ed23d","mcp_get_code":{"code_sha256":"fe5a29213a5ed23d"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/goal1_or_goal2.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/goal1_or_goal2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6615f68ab5ba1c9b","mcp_get_code":{"code_sha256":"6615f68ab5ba1c9b"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/goal1_then_goal2.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/goal1_then_goal2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d51a7a42f1ec1a1b","mcp_get_code":{"code_sha256":"d51a7a42f1ec1a1b"}},{"arxiv_id":"1909.05304","paper":"/paper/reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grockious/lcrl","path":"src/lcrl/automata/mars_rover_1_3.py","file_url":"https://github.com/grockious/lcrl/blob/HEAD/src/lcrl/automata/mars_rover_1_3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6ec4fbec67ad889","mcp_get_code":{"code_sha256":"c6ec4fbec67ad889"}},{"arxiv_id":"1909.00025","paper":"/paper/meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flennerhag/warpgrad","path":"src/warpgrad/warpgrad/utils.py","file_url":"https://github.com/flennerhag/warpgrad/blob/HEAD/src/warpgrad/warpgrad/utils.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":"953b2b83b9cf396a","mcp_get_code":{"code_sha256":"953b2b83b9cf396a"}},{"arxiv_id":"1603.01417","paper":"/paper/dynamic-memory-networks-for-visual-and","title":"Dynamic Memory Networks for Visual and Textual Question Answering","date":"2016-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edithal-14/DMN-Novelty","path":"dmn.py","file_url":"https://github.com/edithal-14/DMN-Novelty/blob/HEAD/dmn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e87ff604cb0fde70","mcp_get_code":{"code_sha256":"e87ff604cb0fde70"}},{"arxiv_id":"2025.findings-acl.669","paper":null,"title":"arXiv:2025.findings-acl.669","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BradMcDanel/PipeSpec","path":"decoding.py","file_url":"https://github.com/BradMcDanel/PipeSpec/blob/HEAD/decoding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7c896749a123ce5","mcp_get_code":{"code_sha256":"a7c896749a123ce5"}}]}