{"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/reparameterize","entry":"reparameterize","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":38,"n_papers_ran":27,"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":32,"n_samples_ran":22,"n_samples_fingerprinted":18,"n_places":40,"n_places_pointer_only":19,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":13,"ran_fixture":1,"ran":6,"unverified":10},"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":"2608.16689","paper":"/paper/arxiv-2608-16689","title":"Hide&Seek: Learning to Explain in an End-to-End Differentiable Network","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rajesh-lab/realx","path":"realx.py","file_url":"https://github.com/rajesh-lab/realx/blob/HEAD/realx.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f588900884b4d801","mcp_get_code":{"code_sha256":"f588900884b4d801"}},{"arxiv_id":"2606.13818","paper":"/paper/arxiv-2606-13818","title":"PAC-Chernoff Bounds: Understanding Generalization in the Interpolation Regime","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Ludvins/2023-ICLR-DVIP","path":"src/utils.py","file_url":"https://github.com/Ludvins/2023-ICLR-DVIP/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2a8846306c2df5bf","mcp_get_code":{"code_sha256":"2a8846306c2df5bf"}},{"arxiv_id":"2605.17804","paper":"/paper/arxiv-2605-17804","title":"GenTS: A Comprehensive Benchmark Library for Generative Time Series Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"WillWang1113/GenTS","path":"gents/common/_utils.py","file_url":"https://github.com/WillWang1113/GenTS/blob/HEAD/gents/common/_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dadec7f7cc09688a","mcp_get_code":{"code_sha256":"dadec7f7cc09688a"}},{"arxiv_id":"2605.09400","paper":"/paper/arxiv-2605-09400","title":"D2ACE: Multi-Label Batch Selection Guided by Dual Dynamics and Adaptive Correlation Enhancement","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"iunanyou/D2ACE","path":"model.py","file_url":"https://github.com/iunanyou/D2ACE/blob/HEAD/model.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":"3cd91116c815d020","mcp_get_code":{"code_sha256":"3cd91116c815d020"}},{"arxiv_id":"2603.09288","paper":"/paper/arxiv-2603-09288","title":"Proxy-Guided Measurement Calibration","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"sak-18/proxy-guided-calibration","path":"src/pgmc/vae_models.py","file_url":"https://github.com/sak-18/proxy-guided-calibration/blob/HEAD/src/pgmc/vae_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8425038dea1085de","mcp_get_code":{"code_sha256":"8425038dea1085de"}},{"arxiv_id":"2601.19040","paper":"/paper/arxiv-2601-19040","title":"OATS: Online Data Augmentation for Time Series Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"microsoft/TimeCraft","path":"Diff-MN/models/kovae.py","file_url":"https://github.com/microsoft/TimeCraft/blob/HEAD/Diff-MN/models/kovae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dadec7f7cc09688a","mcp_get_code":{"code_sha256":"dadec7f7cc09688a"}},{"arxiv_id":"2505.21906","paper":"/paper/vision-language-action-model-with-open-world","title":"ChatVLA-2: Vision-Language-Action Model with Open-World Embodied Reasoning from Pretrained Knowledge","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tutujingyugang1/ChatVLA_public","path":"torch_utils.py","file_url":"https://github.com/tutujingyugang1/ChatVLA_public/blob/HEAD/torch_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf0310bb83608134","mcp_get_code":{"code_sha256":"cf0310bb83608134"}},{"arxiv_id":"2503.09496","paper":"/paper/robust-multimodal-survival-prediction-with","title":"Robust Multimodal Survival Prediction with the Latent Differentiation Conditional Variational AutoEncoder","date":"2025-03-12","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":"3cd91116c815d020","mcp_get_code":{"code_sha256":"3cd91116c815d020"}},{"arxiv_id":"2409.12514","paper":"/paper/tinyvla-towards-fast-data-efficient-vision","title":"TinyVLA: Towards Fast, Data-Efficient Vision-Language-Action Models for Robotic Manipulation","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liyaxuanliyaxuan/TinyVLA","path":"torch_utils.py","file_url":"https://github.com/liyaxuanliyaxuan/TinyVLA/blob/HEAD/torch_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf0310bb83608134","mcp_get_code":{"code_sha256":"cf0310bb83608134"}},{"arxiv_id":"2408.14368","paper":"/paper/gr-mg-leveraging-partially-annotated-data-via","title":"GR-MG: Leveraging Partially Annotated Data via Multi-Modal Goal-Conditioned Policy","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/GR-MG","path":"policy/model/model.py","file_url":"https://github.com/bytedance/GR-MG/blob/HEAD/policy/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7546ec17a25b5f91","mcp_get_code":{"code_sha256":"7546ec17a25b5f91"}},{"arxiv_id":"2406.01345","paper":"/paper/bmrs-bayesian-model-reduction-for-structured","title":"BMRS: Bayesian Model Reduction for Structured Pruning","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saintslab/bmrs-structured-pruning","path":"modules/layers.py","file_url":"https://github.com/saintslab/bmrs-structured-pruning/blob/HEAD/modules/layers.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":"d71a61ef4305cdc5","mcp_get_code":{"code_sha256":"d71a61ef4305cdc5"}},{"arxiv_id":"2402.01399","paper":"/paper/a-probabilistic-model-to-explain-self","title":"A Probabilistic Model Behind Self-Supervised Learning","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alicebizeul/simvae","path":"src/model/models.py","file_url":"https://github.com/alicebizeul/simvae/blob/HEAD/src/model/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f02ceba98bd976b0","mcp_get_code":{"code_sha256":"f02ceba98bd976b0"}},{"arxiv_id":"2311.13014","paper":"/paper/neural-graph-control-barrier-functions-guided","title":"Neural Graph Control Barrier Functions Guided Distributed Collision-avoidance Multi-agent Control","date":"2023-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIT-REALM/gcbf-pytorch","path":"gcbf/controller/utils.py","file_url":"https://github.com/MIT-REALM/gcbf-pytorch/blob/HEAD/gcbf/controller/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"53cef5173a4c7f53","mcp_get_code":{"code_sha256":"53cef5173a4c7f53"}},{"arxiv_id":"2310.02619","paper":"/paper/generative-modeling-of-regular-and-irregular","title":"Generative Modeling of Regular and Irregular Time Series Data via Koopman VAEs","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azencot-group/KoVAE","path":"models/kovae.py","file_url":"https://github.com/azencot-group/KoVAE/blob/HEAD/models/kovae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dadec7f7cc09688a","mcp_get_code":{"code_sha256":"dadec7f7cc09688a"}},{"arxiv_id":"2309.02968","paper":"/paper/cr-vae-contrastive-regularization-on","title":"CR-VAE: Contrastive Regularization on Variational Autoencoders for Preventing Posterior Collapse","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ligerfotis/crvae","path":"model/crvae_model.py","file_url":"https://github.com/ligerfotis/crvae/blob/HEAD/model/crvae_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2f6aa7a616eabb09","mcp_get_code":{"code_sha256":"2f6aa7a616eabb09"}},{"arxiv_id":"2307.02973","paper":"/paper/pruning-vs-quantization-which-is-better","title":"Pruning vs Quantization: Which is Better?","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qualcomm-AI-research/pruning-vs-quantization","path":"pruning/pruning_manager.py","file_url":"https://github.com/Qualcomm-AI-research/pruning-vs-quantization/blob/HEAD/pruning/pruning_manager.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"code_sha256_prefix":"876d9a307ee3b496","mcp_get_code":{"code_sha256":"876d9a307ee3b496"}},{"arxiv_id":"2305.15924","paper":"/paper/sample-and-predict-your-latent-modality-free","title":"Sample and Predict Your Latent: Modality-free Sequential Disentanglement via Contrastive Estimation","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"dadec7f7cc09688a","mcp_get_code":{"code_sha256":"dadec7f7cc09688a"}},{"arxiv_id":"2305.13650","paper":"/paper/property-guided-generative-modelling-for","title":"Robust Model-Based Optimization for Challenging Fitness Landscapes","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sabagh1994/pgvae","path":"pgvae/pgvae.py","file_url":"https://github.com/sabagh1994/pgvae/blob/HEAD/pgvae/pgvae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"c28f74f4a6577670","mcp_get_code":{"code_sha256":"c28f74f4a6577670"}},{"arxiv_id":"2206.06720","paper":"/paper/deep-variational-implicit-processes","title":"Deep Variational Implicit Processes","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ludvins/deepvariationalimplicitprocesses","path":"src/dvip.py","file_url":"https://github.com/ludvins/deepvariationalimplicitprocesses/blob/HEAD/src/dvip.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2a8846306c2df5bf","mcp_get_code":{"code_sha256":"2a8846306c2df5bf"}},{"arxiv_id":"2205.03665","paper":"/paper/variational-sparse-coding-with-learned","title":"Variational Sparse Coding with Learned Thresholding","date":"2022-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfallah/manifold-contrastive","path":"src/model/manifold/vi_encoder.py","file_url":"https://github.com/kfallah/manifold-contrastive/blob/HEAD/src/model/manifold/vi_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3522556f6aac7d0a","mcp_get_code":{"code_sha256":"3522556f6aac7d0a"}},{"arxiv_id":"2205.02309","paper":"/paper/towards-robust-and-semantically-organised","title":"Towards Robust and Semantically Organised Latent Representations for Unsupervised Text Style Transfer","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharan21/EPAAE","path":"model.py","file_url":"https://github.com/sharan21/EPAAE/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"447585e6fedec167","mcp_get_code":{"code_sha256":"447585e6fedec167"}},{"arxiv_id":"2201.12179","paper":"/paper/plug-play-attacks-towards-robust-and-flexible","title":"Plug & Play Attacks: Towards Robust and Flexible Model Inversion Attacks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SCccc21/Knowledge-Enriched-DMI","path":"attack.py","file_url":"https://github.com/SCccc21/Knowledge-Enriched-DMI/blob/HEAD/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c7bb63b7354af4f","mcp_get_code":{"code_sha256":"3c7bb63b7354af4f"}},{"arxiv_id":"2112.00976","paper":"/paper/gaussian-mixture-variational-autoencoder-with","title":"Gaussian Mixture Variational Autoencoder with Contrastive Learning for Multi-Label Classification","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junwenbai/c-gmvae","path":"model.py","file_url":"https://github.com/junwenbai/c-gmvae/blob/HEAD/model.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":"3cd91116c815d020","mcp_get_code":{"code_sha256":"3cd91116c815d020"}},{"arxiv_id":"2105.08756","paper":"/paper/pathdreamer-a-world-model-for-indoor","title":"Pathdreamer: A World Model for Indoor Navigation","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pathdreamer","path":"models/point_cloud_models.py","file_url":"https://github.com/google-research/pathdreamer/blob/HEAD/models/point_cloud_models.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":"579dc1e53eab3741","mcp_get_code":{"code_sha256":"579dc1e53eab3741"}},{"arxiv_id":"2102.05714","paper":"/paper/domain-adaptation-in-reinforcement-learning","title":"Domain Adaptation In Reinforcement Learning Via Latent Unified State Representation","date":"2021-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarlXing/LUSR","path":"model.py","file_url":"https://github.com/KarlXing/LUSR/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"588fadd7be65d6de","mcp_get_code":{"code_sha256":"588fadd7be65d6de"}},{"arxiv_id":"2010.02637","paper":"/paper/disentangled-generative-causal-representation-1","title":"Weakly Supervised Disentangled Generative Causal Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwshen51/DEAR","path":"bgm.py","file_url":"https://github.com/xwshen51/DEAR/blob/HEAD/bgm.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":"5b3c8bcd1091cbb0","mcp_get_code":{"code_sha256":"5b3c8bcd1091cbb0"}},{"arxiv_id":"2007.04583","paper":"/paper/graph-convolutional-networks-for-graphs","title":"Graph Convolutional Networks for Graphs Containing Missing Features","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marblet/GCNmf","path":"models/vgae.py","file_url":"https://github.com/marblet/GCNmf/blob/HEAD/models/vgae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8a50e7a9ba5935a","mcp_get_code":{"code_sha256":"d8a50e7a9ba5935a"}},{"arxiv_id":"2006.12226","paper":"/paper/hierarchical-patch-vae-gan-generating-diverse","title":"Hierarchical Patch VAE-GAN: Generating Diverse Videos from a Single Sample","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shirgur/hp-vae-gan","path":"modules/networks_2d.py","file_url":"https://github.com/shirgur/hp-vae-gan/blob/HEAD/modules/networks_2d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ece33dc91eac801","mcp_get_code":{"code_sha256":"7ece33dc91eac801"}},{"arxiv_id":"2006.10102","paper":"/paper/rethinking-semi-supervised-learning-in-vaes","title":"Capturing Label Characteristics in VAEs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mori97/revae","path":"models/mnist.py","file_url":"https://github.com/mori97/revae/blob/HEAD/models/mnist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7b93d9b79b19888","mcp_get_code":{"code_sha256":"d7b93d9b79b19888"}},{"arxiv_id":"1903.07291","paper":"/paper/semantic-image-synthesis-with-spatially","title":"Semantic Image Synthesis with Spatially-Adaptive Normalization","date":"2019-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GrahamRigby/GauGanPlus","path":"Models.py","file_url":"https://github.com/GrahamRigby/GauGanPlus/blob/HEAD/Models.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":"26ebad4d064f2bf8","mcp_get_code":{"code_sha256":"26ebad4d064f2bf8"}},{"arxiv_id":"1804.10469","paper":"/paper/disentangling-factors-of-variation-with-cycle","title":"Disentangling Factors of Variation with Cycle-Consistent Variational Auto-Encoders","date":"2018-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ananyahjha93/cycle-consistent-vae","path":"utils.py","file_url":"https://github.com/ananyahjha93/cycle-consistent-vae/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":"579f5a3676c471b2","mcp_get_code":{"code_sha256":"579f5a3676c471b2"}},{"arxiv_id":"1802.10399","paper":"/paper/compressing-neural-networks-using-the-1","title":"Compressing Neural Networks using the Variational Information Bottleneck","date":"2018-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuchen03/VIBNet","path":"ib_layers.py","file_url":"https://github.com/zhuchen03/VIBNet/blob/HEAD/ib_layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a744358ed458a3a2","mcp_get_code":{"code_sha256":"a744358ed458a3a2"}},{"arxiv_id":"1707.06347","paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmhuy0/SIM-RL","path":"Sources/algo/ppo.py","file_url":"https://github.com/hmhuy0/SIM-RL/blob/HEAD/Sources/algo/ppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b1c9c127240c75d8","mcp_get_code":{"code_sha256":"b1c9c127240c75d8"}},{"arxiv_id":"1707.06347","paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-realm/neuriss","path":"neuriss/rl/ppo.py","file_url":"https://github.com/mit-realm/neuriss/blob/HEAD/neuriss/rl/ppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6741967893f01eac","mcp_get_code":{"code_sha256":"6741967893f01eac"}},{"arxiv_id":"1707.06347","paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ku2482/gail-airl-ppo.pytorch","path":"gail_airl_ppo/algo/ppo.py","file_url":"https://github.com/ku2482/gail-airl-ppo.pytorch/blob/HEAD/gail_airl_ppo/algo/ppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c5e74bc668cf5cc","mcp_get_code":{"code_sha256":"7c5e74bc668cf5cc"}},{"arxiv_id":"1312.6114","paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuHongyang/VAEs","path":"models/VAE.py","file_url":"https://github.com/GuHongyang/VAEs/blob/HEAD/models/VAE.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"40936e16bbb2b6d9","mcp_get_code":{"code_sha256":"40936e16bbb2b6d9"}},{"arxiv_id":"ijcai2025_1031","paper":null,"title":"arXiv:ijcai2025_1031","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yczju/cycseq","path":"models/utils.py","file_url":"https://github.com/yczju/cycseq/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9533a4fd752317b3","mcp_get_code":{"code_sha256":"9533a4fd752317b3"}},{"arxiv_id":"aaai_29913","paper":null,"title":"arXiv:aaai_29913","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"clovaai/TVQ-VAE","path":"document_analysis/model.py","file_url":"https://github.com/clovaai/TVQ-VAE/blob/HEAD/document_analysis/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"447585e6fedec167","mcp_get_code":{"code_sha256":"447585e6fedec167"}},{"arxiv_id":"aaai_29726","paper":null,"title":"arXiv:aaai_29726","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shesshan/CEIB","path":"model_utils.py","file_url":"https://github.com/shesshan/CEIB/blob/HEAD/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a9eab5fbae732c4","mcp_get_code":{"code_sha256":"4a9eab5fbae732c4"}},{"arxiv_id":"aaai_20580","paper":null,"title":"arXiv:aaai_20580","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"6b5d/mmali","path":"models/mmali/factor2.py","file_url":"https://github.com/6b5d/mmali/blob/HEAD/models/mmali/factor2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"efc66d6033ca6f88","mcp_get_code":{"code_sha256":"efc66d6033ca6f88"}}]}