{"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/moving-average","entry":"moving_average","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":46,"n_papers_ran":32,"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":23,"n_samples_fingerprinted":21,"n_places":47,"n_places_pointer_only":20,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":5,"ran_fixture":5,"ran":12,"unverified":13},"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":"2601.01653","paper":"/paper/arxiv-2601-01653","title":"Learning Resilient Elections with Adversarial GNNs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"MarkHaoxiang/geometric-governance","path":"src/geometric_governance/gen_appendix_welfare_plots.py","file_url":"https://github.com/MarkHaoxiang/geometric-governance/blob/HEAD/src/geometric_governance/gen_appendix_welfare_plots.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d5b7d53f7190f6e5","mcp_get_code":{"code_sha256":"d5b7d53f7190f6e5"}},{"arxiv_id":"2601.01653","paper":"/paper/arxiv-2601-01653","title":"Learning Resilient Elections with Adversarial GNNs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"MarkHaoxiang/geometric-governance","path":"src/geometric_governance/gen_welfare_loss_plots.py","file_url":"https://github.com/MarkHaoxiang/geometric-governance/blob/HEAD/src/geometric_governance/gen_welfare_loss_plots.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7cdbeddbcee4e727","mcp_get_code":{"code_sha256":"7cdbeddbcee4e727"}},{"arxiv_id":"2511.03197","paper":"/paper/arxiv-2511-03197","title":"A Probabilistic U-Net Approach to Downscaling Climate Simulations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"MaryamAlipourH/prob-unet-climate-downscaling","path":"src/prob_unet_utils.py","file_url":"https://github.com/MaryamAlipourH/prob-unet-climate-downscaling/blob/HEAD/src/prob_unet_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"265136f0d46b4448","mcp_get_code":{"code_sha256":"265136f0d46b4448"}},{"arxiv_id":"2412.07808","paper":"/paper/boosting-alignment-for-post-unlearning-text","title":"Boosting Alignment for Post-Unlearning Text-to-Image Generative Models","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reds-lab/restricted_gradient_diversity_unlearning","path":"SD/train-scripts/gradient_ascent.py","file_url":"https://github.com/reds-lab/restricted_gradient_diversity_unlearning/blob/HEAD/SD/train-scripts/gradient_ascent.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":"f398bc270e4f4ffe","mcp_get_code":{"code_sha256":"f398bc270e4f4ffe"}},{"arxiv_id":"2411.03820","paper":"/paper/beyond-the-rainbow-high-performance-deep","title":"Beyond The Rainbow: High Performance Deep Reinforcement Learning on a Desktop PC","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VIPTankz/BTR","path":"Analytic.py","file_url":"https://github.com/VIPTankz/BTR/blob/HEAD/Analytic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b47df527aff11259","mcp_get_code":{"code_sha256":"b47df527aff11259"}},{"arxiv_id":"2411.01006","paper":"/paper/abstracted-shapes-as-tokens-a-generalizable","title":"Abstracted Shapes as Tokens -- A Generalizable and Interpretable Model for Time-series Classification","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunshiwen/vqshape","path":"vqshape/model.py","file_url":"https://github.com/yunshiwen/vqshape/blob/HEAD/vqshape/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ba464786de3ce24","mcp_get_code":{"code_sha256":"9ba464786de3ce24"}},{"arxiv_id":"2410.20886","paper":"/paper/codes-benchmarking-coupled-ode-surrogates","title":"CODES: Benchmarking Coupled ODE Surrogates","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robin-janssen/codes-benchmark","path":"codes/tune/evaluate_study.py","file_url":"https://github.com/robin-janssen/codes-benchmark/blob/HEAD/codes/tune/evaluate_study.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"264301fb71e3aa32","mcp_get_code":{"code_sha256":"264301fb71e3aa32"}},{"arxiv_id":"2410.17897","paper":"/paper/value-residual-learning-for-alleviating","title":"Value Residual Learning For Alleviating Attention Concentration In Transformers","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zcchill/Value-Residual-Learning","path":"analyze/plot_relative_loss.py","file_url":"https://github.com/Zcchill/Value-Residual-Learning/blob/HEAD/analyze/plot_relative_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01bbee0c31a1d848","mcp_get_code":{"code_sha256":"01bbee0c31a1d848"}},{"arxiv_id":"2409.02606","paper":null,"title":"arXiv:2409.02606","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":null,"repo":"princetonlips/neural_fdm","path":"src/neural_fdm/plotting.py","file_url":"https://github.com/princetonlips/neural_fdm/blob/HEAD/src/neural_fdm/plotting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ea158d2b25ecaa2","mcp_get_code":{"code_sha256":"8ea158d2b25ecaa2"}},{"arxiv_id":"2407.11277","paper":"/paper/target-conversation-extraction-source","title":"Target conversation extraction: Source separation using turn-taking dynamics","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chentuochao/target-conversation-extraction","path":"convert_AMI2Libri.py","file_url":"https://github.com/chentuochao/target-conversation-extraction/blob/HEAD/convert_AMI2Libri.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"032038059574b300","mcp_get_code":{"code_sha256":"032038059574b300"}},{"arxiv_id":"2406.14498","paper":"/paper/llasa-large-multimodal-agent-for-human","title":"LLaSA: A Multimodal LLM for Human Activity Analysis Through Wearable and Smartphone Sensors","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bashlab/llasa","path":"llasa_v2_data_generation.py","file_url":"https://github.com/bashlab/llasa/blob/HEAD/llasa_v2_data_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d61fbe22e6693ed","mcp_get_code":{"code_sha256":"5d61fbe22e6693ed"}},{"arxiv_id":"2406.12241","paper":"/paper/more-efficient-randomized-exploration-for","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panxulab/lsvi-ase","path":"atari_results/plot_atari_individual.py","file_url":"https://github.com/panxulab/lsvi-ase/blob/HEAD/atari_results/plot_atari_individual.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b956e8eaded5fc36","mcp_get_code":{"code_sha256":"b956e8eaded5fc36"}},{"arxiv_id":"2406.11370","paper":"/paper/fairer-preferences-elicit-improved-human","title":"Fairer Preferences Elicit Improved Human-Aligned Large Language Model Judgments","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"9edbea252c4a2b7e","mcp_get_code":{"code_sha256":"9edbea252c4a2b7e"}},{"arxiv_id":"2406.04815","paper":"/paper/skill-aware-mutual-information-optimisation","title":"Skill-aware Mutual Information Optimisation for Generalisation in Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uoe-agents/SaMI","path":"logger.py","file_url":"https://github.com/uoe-agents/SaMI/blob/HEAD/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"984ea32677f90d4b","mcp_get_code":{"code_sha256":"984ea32677f90d4b"}},{"arxiv_id":"2405.18654","paper":"/paper/mitigating-object-hallucination-via-data","title":"Data-augmented phrase-level alignment for mitigating object hallucination","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pritamqu/HALVA","path":"llava/train/train_halva.py","file_url":"https://github.com/pritamqu/HALVA/blob/HEAD/llava/train/train_halva.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b9b7f2c9ec6c036","mcp_get_code":{"code_sha256":"4b9b7f2c9ec6c036"}},{"arxiv_id":"2405.00664","paper":"/paper/is-bigger-edit-batch-size-always-better-an","title":"Is Bigger Edit Batch Size Always Better? -- An Empirical Study on Model Editing with Llama-3","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scalable-model-editing/unified-model-editing","path":"current_edit_scores.py","file_url":"https://github.com/scalable-model-editing/unified-model-editing/blob/HEAD/current_edit_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a33727392194b2c","mcp_get_code":{"code_sha256":"6a33727392194b2c"}},{"arxiv_id":"2404.15274","paper":"/paper/metric-guided-image-reconstruction-bounds-via","title":"Metric-Guided Conformal Bounds for Probabilistic Image Reconstruction","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthewyccheung/conformal-metric","path":"bias/weather.py","file_url":"https://github.com/matthewyccheung/conformal-metric/blob/HEAD/bias/weather.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5d00a43ff917bc1","mcp_get_code":{"code_sha256":"a5d00a43ff917bc1"}},{"arxiv_id":"2404.10728","paper":"/paper/randomized-exploration-in-cooperative-multi","title":"Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panxulab/MARL-CoopTS","path":"Utils/plotter.py","file_url":"https://github.com/panxulab/MARL-CoopTS/blob/HEAD/Utils/plotter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b34dcb9354b0216","mcp_get_code":{"code_sha256":"4b34dcb9354b0216"}},{"arxiv_id":"2404.03637","paper":"/paper/sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/dt4ier","path":"rl_utils.py","file_url":"https://github.com/applied-machine-learning-lab/dt4ier/blob/HEAD/rl_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"326fd6b469512950","mcp_get_code":{"code_sha256":"326fd6b469512950"}},{"arxiv_id":"2403.16950","paper":"/paper/aligning-with-human-judgement-the-role-of","title":"Aligning with Human Judgement: The Role of Pairwise Preference in Large Language Model Evaluators","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/pairs","path":"pairs/pairs_ranking.py","file_url":"https://github.com/cambridgeltl/pairs/blob/HEAD/pairs/pairs_ranking.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9edbea252c4a2b7e","mcp_get_code":{"code_sha256":"9edbea252c4a2b7e"}},{"arxiv_id":"2403.10766","paper":"/paper/ode-discovery-for-longitudinal-heterogeneous","title":"ODE Discovery for Longitudinal Heterogeneous Treatment Effects Inference","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samholt/ode-discovery-for-longitudinal-heterogeneous-treatment-effects-inference","path":"utils/results_utils.py","file_url":"https://github.com/samholt/ode-discovery-for-longitudinal-heterogeneous-treatment-effects-inference/blob/HEAD/utils/results_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dfb9d0f97fc99892","mcp_get_code":{"code_sha256":"dfb9d0f97fc99892"}},{"arxiv_id":"2403.07175","paper":"/paper/rebuilding-rome-resolving-model-collapse","title":"Rebuilding ROME : Resolving Model Collapse during Sequential Model Editing","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scalable-model-editing/rebuilding-rome","path":"experiments/current_edit_scores.py","file_url":"https://github.com/scalable-model-editing/rebuilding-rome/blob/HEAD/experiments/current_edit_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a33727392194b2c","mcp_get_code":{"code_sha256":"6a33727392194b2c"}},{"arxiv_id":"2402.11846","paper":"/paper/unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWu321/EraseDiff","path":"sd/train_scripts/erasediff.py","file_url":"https://github.com/JingWu321/EraseDiff/blob/HEAD/sd/train_scripts/erasediff.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":"f398bc270e4f4ffe","mcp_get_code":{"code_sha256":"f398bc270e4f4ffe"}},{"arxiv_id":"2402.04161","paper":"/paper/attention-with-markov-a-framework-for","title":"Attention with Markov: A Framework for Principled Analysis of Transformers via Markov Chains","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bond1995/Markov","path":"Markov-LLM-depth/figures/loss.py","file_url":"https://github.com/Bond1995/Markov/blob/HEAD/Markov-LLM-depth/figures/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"97862e6fa3bd1759","mcp_get_code":{"code_sha256":"97862e6fa3bd1759"}},{"arxiv_id":"2401.07453","paper":"/paper/model-editing-at-scale-leads-to-gradual-and","title":"Model Editing at Scale leads to Gradual and Catastrophic Forgetting","date":"2024-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scalable-model-editing/gradual-catastrophic-forgetting","path":"downstream_eval/current_edit_scores.py","file_url":"https://github.com/scalable-model-editing/gradual-catastrophic-forgetting/blob/HEAD/downstream_eval/current_edit_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a33727392194b2c","mcp_get_code":{"code_sha256":"6a33727392194b2c"}},{"arxiv_id":"2401.05779","paper":"/paper/erasediff-erasing-data-influence-in-diffusion","title":"Erasing Undesirable Influence in Diffusion Models","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingwu321/erasediff","path":"sd/train_scripts/erasediff.py","file_url":"https://github.com/jingwu321/erasediff/blob/HEAD/sd/train_scripts/erasediff.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":"f398bc270e4f4ffe","mcp_get_code":{"code_sha256":"f398bc270e4f4ffe"}},{"arxiv_id":"2308.07272","paper":"/paper/dialogue-for-prompting-a-policy-gradient","title":"Dialogue for Prompting: a Policy-Gradient-Based Discrete Prompt Generation for Few-shot Learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czx-li/DP2O","path":"Utils.py","file_url":"https://github.com/czx-li/DP2O/blob/HEAD/Utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"326fd6b469512950","mcp_get_code":{"code_sha256":"326fd6b469512950"}},{"arxiv_id":"2305.10686","paper":"/paper/rmssinger-realistic-music-score-based-singing","title":"RMSSinger: Realistic-Music-Score based Singing Voice Synthesis","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tonnetonne814/SiFi-VITS2-44100-Ja","path":"train_SVS_synthesizer.py","file_url":"https://github.com/tonnetonne814/SiFi-VITS2-44100-Ja/blob/HEAD/train_SVS_synthesizer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"33374877ef882af3","mcp_get_code":{"code_sha256":"33374877ef882af3"}},{"arxiv_id":"2302.11893","paper":"/paper/a-framework-for-benchmarking-class-out-of-1","title":"A framework for benchmarking class-out-of-distribution detection and its application to ImageNet","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdabbah/COOD_benchmarking","path":"utils/confidence_functions.py","file_url":"https://github.com/mdabbah/COOD_benchmarking/blob/HEAD/utils/confidence_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b9c97a558f872a5e","mcp_get_code":{"code_sha256":"b9c97a558f872a5e"}},{"arxiv_id":"2205.10868","paper":"/paper/memory-efficient-reinforcement-learning-with","title":"Memory-efficient Reinforcement Learning with Value-based Knowledge Consolidation","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qlan3/MeDQN","path":"plot.py","file_url":"https://github.com/qlan3/MeDQN/blob/HEAD/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b956e8eaded5fc36","mcp_get_code":{"code_sha256":"b956e8eaded5fc36"}},{"arxiv_id":"2205.03146","paper":"/paper/clip-clop-clip-guided-collage-and","title":"CLIP-CLOP: CLIP-Guided Collage and Photomontage","date":"2022-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/arnheim","path":"arnheim_3/src/training.py","file_url":"https://github.com/deepmind/arnheim/blob/HEAD/arnheim_3/src/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f398bc270e4f4ffe","mcp_get_code":{"code_sha256":"f398bc270e4f4ffe"}},{"arxiv_id":"2202.00512","paper":"/paper/progressive-distillation-for-fast-sampling-of-1","title":"Progressive Distillation for Fast Sampling of Diffusion Models","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hramchenko/diffusion_distiller","path":"train_utils.py","file_url":"https://github.com/Hramchenko/diffusion_distiller/blob/HEAD/train_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2dae0e9618d089f2","mcp_get_code":{"code_sha256":"2dae0e9618d089f2"}},{"arxiv_id":"2112.09081","paper":"/paper/crossloc-scalable-aerial-localization","title":"CrossLoc: Scalable Aerial Localization Assisted by Multimodal Synthetic Data","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"topo-epfl/crossloc","path":"visualize.py","file_url":"https://github.com/topo-epfl/crossloc/blob/HEAD/visualize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9086ad3c68ab634","mcp_get_code":{"code_sha256":"f9086ad3c68ab634"}},{"arxiv_id":"2105.13345","paper":"/paper/adversarial-intrinsic-motivation-for","title":"Adversarial Intrinsic Motivation for Reinforcement Learning","date":"2021-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iDurugkar/adversarial-intrinsic-motivation","path":"utils/plot.py","file_url":"https://github.com/iDurugkar/adversarial-intrinsic-motivation/blob/HEAD/utils/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c1cd91be28d7d5b","mcp_get_code":{"code_sha256":"3c1cd91be28d7d5b"}},{"arxiv_id":"2010.15920","paper":"/paper/recovery-rl-safe-reinforcement-learning-with","title":"Recovery RL: Safe Reinforcement Learning with Learned Recovery Zones","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abalakrishna123/recovery-rl","path":"plotting/plot_runs.py","file_url":"https://github.com/abalakrishna123/recovery-rl/blob/HEAD/plotting/plot_runs.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":"b2c43b2ab933053b","mcp_get_code":{"code_sha256":"b2c43b2ab933053b"}},{"arxiv_id":"2003.00952","paper":"/paper/bayesian-neural-networks-with-maximum-mean","title":"Bayesian Neural Networks With Maximum Mean Discrepancy Regularization","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/MMD-Bayesian-Neural-Network","path":"classification_plots.py","file_url":"https://github.com/ispamm/MMD-Bayesian-Neural-Network/blob/HEAD/classification_plots.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f96e85c88a63fab","mcp_get_code":{"code_sha256":"3f96e85c88a63fab"}},{"arxiv_id":"1905.05380","paper":"/paper/control-regularization-for-reduced-variance","title":"Control Regularization for Reduced Variance Reinforcement Learning","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rcheng805/CORE-RL","path":"car/ddpg/add_ddpg.py","file_url":"https://github.com/rcheng805/CORE-RL/blob/HEAD/car/ddpg/add_ddpg.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":"f398bc270e4f4ffe","mcp_get_code":{"code_sha256":"f398bc270e4f4ffe"}},{"arxiv_id":"1903.03096","paper":"/paper/meta-dataset-a-dataset-of-datasets-for","title":"Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examples","date":"2019-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nobody-1617/deta","path":"meta_dataset/analysis/select_best_model.py","file_url":"https://github.com/nobody-1617/deta/blob/HEAD/meta_dataset/analysis/select_best_model.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":"9ff47b55c732dbfd","mcp_get_code":{"code_sha256":"9ff47b55c732dbfd"}},{"arxiv_id":"1809.02925","paper":"/paper/discriminator-actor-critic-addressing-sample","title":"Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learning","date":"2018-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illidanlab/opolo-code","path":"opolo-baselines/run/plot-mujoco.py","file_url":"https://github.com/illidanlab/opolo-code/blob/HEAD/opolo-baselines/run/plot-mujoco.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"106059bc9f33b5a6","mcp_get_code":{"code_sha256":"106059bc9f33b5a6"}},{"arxiv_id":"1804.05394","paper":"/paper/deep-optimal-stopping","title":"Deep optimal stopping","date":null,"month_inferred_from_arxiv_id":"2018-04","title_source":"archive","repo":"leokan92/optimal-stopping-cnn","path":"plotting_results.py","file_url":"https://github.com/leokan92/optimal-stopping-cnn/blob/HEAD/plotting_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"265136f0d46b4448","mcp_get_code":{"code_sha256":"265136f0d46b4448"}},{"arxiv_id":"1705.08926","paper":"/paper/counterfactual-multi-agent-policy-gradients","title":"Counterfactual Multi-Agent Policy Gradients","date":"2017-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matteokarldonati/Counterfactual-Multi-Agent-Policy-Gradients","path":"training_loop.py","file_url":"https://github.com/matteokarldonati/Counterfactual-Multi-Agent-Policy-Gradients/blob/HEAD/training_loop.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":"86c01369f50fdee8","mcp_get_code":{"code_sha256":"86c01369f50fdee8"}},{"arxiv_id":"1701.07875","paper":"/paper/wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Wasserstein_GAN/wgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Wasserstein_GAN/wgan.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":"8b7e4c7f96e7694c","mcp_get_code":{"code_sha256":"8b7e4c7f96e7694c"}},{"arxiv_id":"1605.00003","paper":"/paper/predicting-the-direction-of-stock-market","title":"Predicting the direction of stock market prices using random forest","date":"2016-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmartinezheras/reproduce-stock-market-direction-random-forests","path":"pandas_techinal_indicators.py","file_url":"https://github.com/jmartinezheras/reproduce-stock-market-direction-random-forests/blob/HEAD/pandas_techinal_indicators.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"21dceafc22f8e569","mcp_get_code":{"code_sha256":"21dceafc22f8e569"}},{"arxiv_id":"1412.6980","paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sj-Amani/Practical_Behavioral_Cloning","path":"left_right_driving_data_preprocessing.py","file_url":"https://github.com/Sj-Amani/Practical_Behavioral_Cloning/blob/HEAD/left_right_driving_data_preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"755b233b6180c3d0","mcp_get_code":{"code_sha256":"755b233b6180c3d0"}},{"arxiv_id":"1309.0238","paper":"/paper/api-design-for-machine-learning-software","title":"API design for machine learning software: experiences from the scikit-learn project","date":"2013-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pdghawk/systrade","path":"systrade/models/indicators.py","file_url":"https://github.com/pdghawk/systrade/blob/HEAD/systrade/models/indicators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"c7321580fd61a74c","mcp_get_code":{"code_sha256":"c7321580fd61a74c"}},{"arxiv_id":"1205.4839","paper":"/paper/off-policy-actor-critic","title":"Off-Policy Actor-Critic","date":"2012-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DevSlem/OfflineRL","path":"src/util.py","file_url":"https://github.com/DevSlem/OfflineRL/blob/HEAD/src/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67268c574955946c","mcp_get_code":{"code_sha256":"67268c574955946c"}},{"arxiv_id":"aaai_20764","paper":null,"title":"arXiv:aaai_20764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Giseung-Park/BlockSeq","path":"code_off_policy/plotter.py","file_url":"https://github.com/Giseung-Park/BlockSeq/blob/HEAD/code_off_policy/plotter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"265136f0d46b4448","mcp_get_code":{"code_sha256":"265136f0d46b4448"}}]}