{"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/linear-schedule","entry":"linear_schedule","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":26,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":20,"n_papers_ran_instrument_only":5,"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":18,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":14,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":26,"n_places_pointer_only":10,"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":7,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":7,"unverified":1},"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":"2609.13044","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13044","title":"Robust Policy Optimization via Adversarial Importance Sampling","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"AmineAndam04/advrl","path":"advrl/utils/nets.py","file_url":"https://github.com/AmineAndam04/advrl/blob/HEAD/advrl/utils/nets.py","status":"ran","verification_level":1,"contract_check":null,"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, AmineAndam04/advrl when it was checked","code_sha256":"a8c11ad133a716b4","code_sha256_prefix":"a8c11ad133a716b4","mcp_get_code":{"code_sha256":"a8c11ad133a716b4"}},{"arxiv_id":"2510.18828","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-18828","title":"Actor-Free Continuous Control via Structurally Maximizable Q-Functions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"USC-Lira/Q3C","path":"q3c/utils/learning_rate_schedulers.py","file_url":"https://github.com/USC-Lira/Q3C/blob/HEAD/q3c/utils/learning_rate_schedulers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6be8838e3058ad9c","code_sha256_prefix":"6be8838e3058ad9c","mcp_get_code":{"code_sha256":"6be8838e3058ad9c"}},{"arxiv_id":"2508.20294","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-20294","title":"Dynamics-Aligned Latent Imagination in Contextual World Models for Zero-Shot Generalization","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"frankroeder/DALI","path":"contextual_mbrl/baseline/model.py","file_url":"https://github.com/frankroeder/DALI/blob/HEAD/contextual_mbrl/baseline/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2df73e2474aca4ca","code_sha256_prefix":"2df73e2474aca4ca","mcp_get_code":{"code_sha256":"2df73e2474aca4ca"}},{"arxiv_id":"2507.09391","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.09391","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"peterpaohuang/ncgn","path":"src/schedules.py","file_url":"https://github.com/peterpaohuang/ncgn/blob/HEAD/src/schedules.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":"9929f56bc45fb62a","code_sha256_prefix":"9929f56bc45fb62a","mcp_get_code":{"code_sha256":"9929f56bc45fb62a"}},{"arxiv_id":"2501.02087","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-cvar-leveraging-static-spectral-risk","title":"Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement Learning","date":"2025-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}},{"arxiv_id":"2410.22388","arxiv_id_is_arxiv":true,"paper":"/paper/et-flow-equivariant-flow-matching-for","title":"ET-Flow: Equivariant Flow-Matching for Molecular Conformer Generation","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenoynikhil/ETFlow","path":"etflow/models/utils.py","file_url":"https://github.com/shenoynikhil/ETFlow/blob/HEAD/etflow/models/utils.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":"21f5c6553e54587f","code_sha256_prefix":"21f5c6553e54587f","mcp_get_code":{"code_sha256":"21f5c6553e54587f"}},{"arxiv_id":"2410.14606","arxiv_id_is_arxiv":true,"paper":"/paper/streaming-deep-reinforcement-learning-finally","title":"Streaming Deep Reinforcement Learning Finally Works","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohmdelsayed/streaming-drl","path":"stream_q.py","file_url":"https://github.com/mohmdelsayed/streaming-drl/blob/HEAD/stream_q.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mohmdelsayed/streaming-drl when it was checked","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}},{"arxiv_id":"2407.05789","arxiv_id_is_arxiv":true,"paper":"/paper/candid-dac-leveraging-coupled-action","title":"CANDID DAC: Leveraging Coupled Action Dimensions with Importance Differences in DAC","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philippbordne/candiddac","path":"src/candid_dac/utils/utils.py","file_url":"https://github.com/philippbordne/candiddac/blob/HEAD/src/candid_dac/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4e136849a4251a","code_sha256_prefix":"3b4e136849a4251a","mcp_get_code":{"code_sha256":"3b4e136849a4251a"}},{"arxiv_id":"2403.10967","arxiv_id_is_arxiv":true,"paper":"/paper/dreaming-of-many-worlds-learning-contextual","title":"Dreaming of Many Worlds: Learning Contextual World Models Aids Zero-Shot Generalization","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sai-prasanna/dreaming_of_many_worlds","path":"contextual_mbrl/baseline/model.py","file_url":"https://github.com/sai-prasanna/dreaming_of_many_worlds/blob/HEAD/contextual_mbrl/baseline/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2df73e2474aca4ca","code_sha256_prefix":"2df73e2474aca4ca","mcp_get_code":{"code_sha256":"2df73e2474aca4ca"}},{"arxiv_id":"2312.06348","arxiv_id_is_arxiv":true,"paper":"/paper/diffail-diffusion-adversarial-imitation","title":"DiffAIL: Diffusion Adversarial Imitation Learning","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-group-sdu/diffail","path":"rlkit/core/train_util.py","file_url":"https://github.com/ml-group-sdu/diffail/blob/HEAD/rlkit/core/train_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ml-group-sdu/diffail when it was checked","code_sha256":"6287f9aeab092560","code_sha256_prefix":"6287f9aeab092560","mcp_get_code":{"code_sha256":"6287f9aeab092560"}},{"arxiv_id":"2310.16828","arxiv_id_is_arxiv":true,"paper":"/paper/td-mpc2-scalable-robust-world-models-for","title":"TD-MPC2: Scalable, Robust World Models for Continuous Control","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicklashansen/tdmpc","path":"src/algorithm/tdmpc.py","file_url":"https://github.com/nicklashansen/tdmpc/blob/HEAD/src/algorithm/tdmpc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a9a459391fd3de7","code_sha256_prefix":"2a9a459391fd3de7","mcp_get_code":{"code_sha256":"2a9a459391fd3de7"}},{"arxiv_id":"2309.16984","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-models-as-a-rich-and-efficient","title":"Consistency Models as a Rich and Efficient Policy Class for Reinforcement Learning","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}},{"arxiv_id":"2306.00975","arxiv_id_is_arxiv":true,"paper":"/paper/active-vision-reinforcement-learning-under","title":"Active Vision Reinforcement Learning under Limited Visual Observability","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elicassion/sugarl","path":"agent/dqn_atari_sugarl.py","file_url":"https://github.com/elicassion/sugarl/blob/HEAD/agent/dqn_atari_sugarl.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, elicassion/sugarl when it was checked","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}},{"arxiv_id":"2303.08888","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-segmentation-with-conditional","title":"Stochastic Segmentation with Conditional Categorical Diffusion Models","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larsdoorenbos/ccdm-stochastic-segmentation","path":"ddpm/models/diffusion_denoising.py","file_url":"https://github.com/larsdoorenbos/ccdm-stochastic-segmentation/blob/HEAD/ddpm/models/diffusion_denoising.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0bbe78920342bfbb","code_sha256_prefix":"0bbe78920342bfbb","mcp_get_code":{"code_sha256":"0bbe78920342bfbb"}},{"arxiv_id":"2210.10195","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-reinforcement-learning-using","title":"Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peidehuang/gradient","path":"helpers/utils.py","file_url":"https://github.com/peidehuang/gradient/blob/HEAD/helpers/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7d7285fe24c34a81","code_sha256_prefix":"7d7285fe24c34a81","mcp_get_code":{"code_sha256":"7d7285fe24c34a81"}},{"arxiv_id":"2112.03636","arxiv_id_is_arxiv":true,"paper":"/paper/godot-reinforcement-learning-agents","title":"Godot Reinforcement Learning Agents","date":"2021-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4cee71b4d9b5a737","code_sha256_prefix":"4cee71b4d9b5a737","mcp_get_code":{"code_sha256":"4cee71b4d9b5a737"}},{"arxiv_id":"2111.08819","arxiv_id_is_arxiv":true,"paper":"/paper/cleanrl-high-quality-single-file","title":"CleanRL: High-quality Single-file Implementations of Deep Reinforcement Learning Algorithms","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}},{"arxiv_id":"2111.03026","arxiv_id_is_arxiv":true,"paper":"/paper/b-pref-benchmarking-preference-based","title":"B-Pref: Benchmarking Preference-Based Reinforcement Learning","date":"2021-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rll-research/B-Pref","path":"train_PPO.py","file_url":"https://github.com/rll-research/B-Pref/blob/HEAD/train_PPO.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":"ad4e19d5ac571c31","code_sha256_prefix":"ad4e19d5ac571c31","mcp_get_code":{"code_sha256":"ad4e19d5ac571c31"}},{"arxiv_id":"2106.05091","arxiv_id_is_arxiv":true,"paper":"/paper/pebble-feedback-efficient-interactive","title":"PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rll-research/bpref","path":"train_PPO.py","file_url":"https://github.com/rll-research/bpref/blob/HEAD/train_PPO.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":"ad4e19d5ac571c31","code_sha256_prefix":"ad4e19d5ac571c31","mcp_get_code":{"code_sha256":"ad4e19d5ac571c31"}},{"arxiv_id":"2105.09452","arxiv_id_is_arxiv":true,"paper":"/paper/minimum-delay-adaptation-in-non-stationary","title":"Minimum-Delay Adaptation in Non-Stationary Reinforcement Learning via Online High-Confidence Change-Point Detection","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LucasAlegre/mbcd","path":"mbcd/utils/util.py","file_url":"https://github.com/LucasAlegre/mbcd/blob/HEAD/mbcd/utils/util.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":"adae040054a625aa","code_sha256_prefix":"adae040054a625aa","mcp_get_code":{"code_sha256":"adae040054a625aa"}},{"arxiv_id":"2104.06031","arxiv_id_is_arxiv":true,"paper":"/paper/global-transport-for-fluid-reconstruction","title":"Global Transport for Fluid Reconstruction with Learned Self-Supervision","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/Global-Flow-Transport","path":"phitest/render/optimization.py","file_url":"https://github.com/tum-pbs/Global-Flow-Transport/blob/HEAD/phitest/render/optimization.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62e39ce4ebceebc9","code_sha256_prefix":"62e39ce4ebceebc9","mcp_get_code":{"code_sha256":"62e39ce4ebceebc9"}},{"arxiv_id":"2103.01955","arxiv_id_is_arxiv":true,"paper":"/paper/the-surprising-effectiveness-of-mappo-in","title":"The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Games","date":"2021-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emerge-lab/nocturne_lab","path":"experiments/hr_rl/run_hr_ppo_cli.py","file_url":"https://github.com/emerge-lab/nocturne_lab/blob/HEAD/experiments/hr_rl/run_hr_ppo_cli.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cee71b4d9b5a737","code_sha256_prefix":"4cee71b4d9b5a737","mcp_get_code":{"code_sha256":"4cee71b4d9b5a737"}},{"arxiv_id":"2007.15255","arxiv_id_is_arxiv":true,"paper":"/paper/instance-selection-for-gans","title":"Instance Selection for GANs","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/3dgp","path":"src/training/loss.py","file_url":"https://github.com/snap-research/3dgp/blob/HEAD/src/training/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, snap-research/3dgp when it was checked","code_sha256":"97c1685bb8978f57","code_sha256_prefix":"97c1685bb8978f57","mcp_get_code":{"code_sha256":"97c1685bb8978f57"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiwarylab/DDPM_REMD","path":"denoising_diffusion_pytorch/denoising_diffusion_pytorch.py","file_url":"https://github.com/tiwarylab/DDPM_REMD/blob/HEAD/denoising_diffusion_pytorch/denoising_diffusion_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb41bf2d4dec5aee","code_sha256_prefix":"cb41bf2d4dec5aee","mcp_get_code":{"code_sha256":"cb41bf2d4dec5aee"}},{"arxiv_id":"1909.01492","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-verified-robustness-to-symbol","title":"Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/interval-bound-propagation","path":"interval_bound_propagation/src/utils.py","file_url":"https://github.com/deepmind/interval-bound-propagation/blob/HEAD/interval_bound_propagation/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a60e232adbec82fd","code_sha256_prefix":"a60e232adbec82fd","mcp_get_code":{"code_sha256":"a60e232adbec82fd"}},{"arxiv_id":"1710.02298","arxiv_id_is_arxiv":true,"paper":"/paper/rainbow-combining-improvements-in-deep","title":"Rainbow: Combining Improvements in Deep Reinforcement Learning","date":"2017-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4c60d8998b722013","code_sha256_prefix":"4c60d8998b722013","mcp_get_code":{"code_sha256":"4c60d8998b722013"}}],"record_sha256":"43dc0cd0801bc1f0b1c491a388a3e8823025ac5da02051e971af7894e9131e80","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}