{"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/l2","entry":"l2","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":19,"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":19,"n_samples_ran":9,"n_samples_fingerprinted":7,"n_places":38,"n_places_pointer_only":7,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":2,"ran":1,"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":"2609.00411","paper":"/paper/arxiv-2609-00411","title":"Unmasking Face Embeddings: Reading, Rendering and Naming with Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Fizza-Rubab/unmasking-face-embeddings","path":"experiments/eval_naming.py","file_url":"https://github.com/Fizza-Rubab/unmasking-face-embeddings/blob/HEAD/experiments/eval_naming.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b9bc4d88c2c9c67d","mcp_get_code":{"code_sha256":"b9bc4d88c2c9c67d"}},{"arxiv_id":"2603.28572","paper":"/paper/arxiv-2603-28572","title":"Unrestrained Simplex Denoising for Discrete Data A Non-Markovian Approach Applied to Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cvignac/DiGress","path":"src/analysis/dist_helper.py","file_url":"https://github.com/cvignac/DiGress/blob/HEAD/src/analysis/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2603.20283","paper":"/paper/arxiv-2603-20283","title":"FastPFRec: A Fast Personalized Federated Recommendation with Secure Sharing ⋆","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yanzhenxing123/FastPFRec","path":"util/algorithm.py","file_url":"https://github.com/yanzhenxing123/FastPFRec/blob/HEAD/util/algorithm.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":"04b615bf51851196","mcp_get_code":{"code_sha256":"04b615bf51851196"}},{"arxiv_id":"2506.03355","paper":"/paper/robustness-in-both-domains-clip-needs-a","title":"Robustness in Both Domains: CLIP Needs a Robust Text Encoder","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/LEAF","path":"src/robust_vlm/train/adversarial_training_clip.py","file_url":"https://github.com/LIONS-EPFL/LEAF/blob/HEAD/src/robust_vlm/train/adversarial_training_clip.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":"caea55e9eda399d6","mcp_get_code":{"code_sha256":"caea55e9eda399d6"}},{"arxiv_id":"2506.02557","paper":null,"title":"arXiv:2506.02557","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"peterant330/KUEA","path":"train/align_training_clip.py","file_url":"https://github.com/peterant330/KUEA/blob/HEAD/train/align_training_clip.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":"df3d5eb6fd2523a1","mcp_get_code":{"code_sha256":"df3d5eb6fd2523a1"}},{"arxiv_id":"2502.02415","paper":"/paper/towards-fast-graph-generation-via","title":"Towards Fast Graph Generation via Autoregressive Noisy Filtration Modeling","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borgwardtlab/anfm","path":"anfm/evaluation/dist_helper.py","file_url":"https://github.com/borgwardtlab/anfm/blob/HEAD/anfm/evaluation/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2412.12974","paper":"/paper/attentive-eraser-unleashing-diffusion-model-s","title":"Attentive Eraser: Unleashing Diffusion Model's Object Removal Potential via Self-Attention Redirection Guidance","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonym0u3/attentiveeraser","path":"evaluation/lpips.py","file_url":"https://github.com/anonym0u3/attentiveeraser/blob/HEAD/evaluation/lpips.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":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2411.06757","paper":"/paper/lush-nerf-lighting-up-and-sharpening-nerfs","title":"LuSh-NeRF: Lighting up and Sharpening NeRFs for Low-light Scenes","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quzefan/LuSh-NeRF","path":"lpips/lpips.py","file_url":"https://github.com/quzefan/LuSh-NeRF/blob/HEAD/lpips/lpips.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2410.04263","paper":"/paper/defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelmlmadeira/DeFoG","path":"src/analysis/dist_helper.py","file_url":"https://github.com/manuelmlmadeira/DeFoG/blob/HEAD/src/analysis/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2406.17341","paper":"/paper/generative-modelling-of-structurally","title":"Generative Modelling of Structurally Constrained Graphs","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelmlmadeira/ConStruct","path":"ConStruct/analysis/dist_helper.py","file_url":"https://github.com/manuelmlmadeira/ConStruct/blob/HEAD/ConStruct/analysis/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2405.11416","paper":"/paper/discrete-state-continuous-time-diffusion-for","title":"Discrete-state Continuous-time Diffusion for Graph Generation","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pricexu/disco","path":"dist_helper.py","file_url":"https://github.com/pricexu/disco/blob/HEAD/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2405.04342","paper":"/paper/the-curse-of-diversity-in-ensemble-based","title":"The Curse of Diversity in Ensemble-Based Exploration","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/ensemble-rl-discrete","path":"ensemble_rl/metric_utils.py","file_url":"https://github.com/zhixuan-lin/ensemble-rl-discrete/blob/HEAD/ensemble_rl/metric_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ebd5c538050adfc","mcp_get_code":{"code_sha256":"9ebd5c538050adfc"}},{"arxiv_id":"2405.00287","paper":"/paper/stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/scone","path":"util/algorithm.py","file_url":"https://github.com/jeongwhanchoi/scone/blob/HEAD/util/algorithm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04b615bf51851196","mcp_get_code":{"code_sha256":"04b615bf51851196"}},{"arxiv_id":"2403.04926","paper":"/paper/bags-blur-agnostic-gaussian-splatting-through","title":"BAGS: Blur Agnostic Gaussian Splatting through Multi-Scale Kernel Modeling","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snldmt/bags","path":"lpips/lpips.py","file_url":"https://github.com/snldmt/bags/blob/HEAD/lpips/lpips.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":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2403.04287","paper":"/paper/dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"me-sonandme/DGR","path":"util/algorithm.py","file_url":"https://github.com/me-sonandme/DGR/blob/HEAD/util/algorithm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"04b615bf51851196","mcp_get_code":{"code_sha256":"04b615bf51851196"}},{"arxiv_id":"2401.01527","paper":"/paper/poisoning-attacks-against-recommender-systems","title":"Poisoning Attacks against Recommender Systems: A Survey","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderwzw/arlib","path":"util/algorithm.py","file_url":"https://github.com/coderwzw/arlib/blob/HEAD/util/algorithm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0f3d840cf39a09fa","mcp_get_code":{"code_sha256":"0f3d840cf39a09fa"}},{"arxiv_id":"2312.17397","paper":"/paper/classifier-free-graph-diffusion-for-molecular","title":"Classifier-free graph diffusion for molecular property targeting","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asduffo/freegress","path":"src/analysis/dist_helper.py","file_url":"https://github.com/asduffo/freegress/blob/HEAD/src/analysis/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2311.02142","paper":"/paper/sparse-training-of-discrete-diffusion-models","title":"Sparse Training of Discrete Diffusion Models for Graph Generation","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qym7/sparsediff","path":"sparse_diffusion/analysis/dist_helper.py","file_url":"https://github.com/qym7/sparsediff/blob/HEAD/sparse_diffusion/analysis/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2306.07618","paper":"/paper/hyperbolic-graph-diffusion-model-for-molecule","title":"Hyperbolic Graph Diffusion Model","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lf-wen/hgdm","path":"evaluation/mmd.py","file_url":"https://github.com/lf-wen/hgdm/blob/HEAD/evaluation/mmd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2305.19337","paper":"/paper/higen-hierarchical-graph-generative-networks","title":"HiGen: Hierarchical Graph Generative Networks","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karami-m/higen_main","path":"utils/dist_helper.py","file_url":"https://github.com/karami-m/higen_main/blob/HEAD/utils/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2305.16610","paper":"/paper/a-slingshot-approach-to-learning-in-monotone","title":"Adaptively Perturbed Mirror Descent for Learning in Games","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyberagentailab/adaptively-perturbed-md","path":"algorithms/apmd.py","file_url":"https://github.com/cyberagentailab/adaptively-perturbed-md/blob/HEAD/algorithms/apmd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e55543715e4ecbab","mcp_get_code":{"code_sha256":"e55543715e4ecbab"}},{"arxiv_id":"2211.12853","paper":"/paper/bad-nerf-bundle-adjusted-deblur-neural","title":"BAD-NeRF: Bundle Adjusted Deblur Neural Radiance Fields","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WU-CVGL/BAD-NeRF","path":"lpips/lpips.py","file_url":"https://github.com/WU-CVGL/BAD-NeRF/blob/HEAD/lpips/lpips.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2211.12046","paper":"/paper/deblurred-neural-radiance-field-with-physical","title":"DP-NeRF: Deblurred Neural Radiance Field with Physical Scene Priors","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dogyoonlee/dp-nerf","path":"lpips/lpips.py","file_url":"https://github.com/dogyoonlee/dp-nerf/blob/HEAD/lpips/lpips.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2204.01613","paper":"/paper/spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarolisMart/SPECTRE","path":"util/dist_helper.py","file_url":"https://github.com/KarolisMart/SPECTRE/blob/HEAD/util/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"2111.14292","paper":"/paper/deblur-nerf-neural-radiance-fields-from","title":"Deblur-NeRF: Neural Radiance Fields from Blurry Images","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limacv/Deblur-NeRF","path":"lpips/lpips.py","file_url":"https://github.com/limacv/Deblur-NeRF/blob/HEAD/lpips/lpips.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"2111.02338","paper":"/paper/drop-swap-and-generate-a-self-supervised","title":"Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activity","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nerdslab/SwapVAE","path":"vae_kits/model.py","file_url":"https://github.com/nerdslab/SwapVAE/blob/HEAD/vae_kits/model.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":"105143705bcb63c8","mcp_get_code":{"code_sha256":"105143705bcb63c8"}},{"arxiv_id":"2104.07586","paper":"/paper/see-through-gradients-image-batch-recovery","title":"See through Gradients: Image Batch Recovery via GradInversion","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Koukyosyumei/AIJack","path":"src/aijack/attack/inversion/gradientinversion.py","file_url":"https://github.com/Koukyosyumei/AIJack/blob/HEAD/src/aijack/attack/inversion/gradientinversion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e66bd74de6c3b8c6","mcp_get_code":{"code_sha256":"e66bd74de6c3b8c6"}},{"arxiv_id":"2012.00714","paper":"/paper/debiasing-evaluations-that-are-biased-by","title":"Debiasing Evaluations That are Biased by Evaluations","date":"2020-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingyanw/outcome-induced-debiasing","path":"simulation.py","file_url":"https://github.com/jingyanw/outcome-induced-debiasing/blob/HEAD/simulation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ba36435d57119b6","mcp_get_code":{"code_sha256":"6ba36435d57119b6"}},{"arxiv_id":"2007.05233","paper":"/paper/continual-adaptation-for-deep-stereo","title":"Continual Adaptation for Deep Stereo","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Real-time-self-adaptive-deep-stereo","path":"Losses/loss_factory.py","file_url":"https://github.com/CVLAB-Unibo/Real-time-self-adaptive-deep-stereo/blob/HEAD/Losses/loss_factory.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":"554090648d5d1688","mcp_get_code":{"code_sha256":"554090648d5d1688"}},{"arxiv_id":"2004.13166","paper":"/paper/a-disentangling-invertible-interpretation","title":"A Disentangling Invertible Interpretation Network for Explaining Latent Representations","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/iin","path":"iin/losses/ae.py","file_url":"https://github.com/CompVis/iin/blob/HEAD/iin/losses/ae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4d2ab2a1446f3762","mcp_get_code":{"code_sha256":"4d2ab2a1446f3762"}},{"arxiv_id":"2002.09219","paper":"/paper/stochastic-latent-residual-video-prediction-1","title":"Stochastic Latent Residual Video Prediction","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edouardelasalles/srvp","path":"metrics/lpips/loss.py","file_url":"https://github.com/edouardelasalles/srvp/blob/HEAD/metrics/lpips/loss.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":"cebd4a767f96722b","mcp_get_code":{"code_sha256":"cebd4a767f96722b"}},{"arxiv_id":"1911.08265","paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DHDev0/Muzero","path":"muzero_model.py","file_url":"https://github.com/DHDev0/Muzero/blob/HEAD/muzero_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"130559f2af719d4c","mcp_get_code":{"code_sha256":"130559f2af719d4c"}},{"arxiv_id":"1910.00760","paper":"/paper/efficient-graph-generation-with-graph","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrjconan/GRAN","path":"utils/dist_helper.py","file_url":"https://github.com/lrjconan/GRAN/blob/HEAD/utils/dist_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"039fc6561a9516bc","mcp_get_code":{"code_sha256":"039fc6561a9516bc"}},{"arxiv_id":"1904.08980","paper":"/paper/exploring-the-limitations-of-behavior-cloning","title":"Exploring the Limitations of Behavior Cloning for Autonomous Driving","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipecode/coiltraine","path":"network/loss.py","file_url":"https://github.com/felipecode/coiltraine/blob/HEAD/network/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"55241c7aaf9ca5a1","mcp_get_code":{"code_sha256":"55241c7aaf9ca5a1"}},{"arxiv_id":"1904.02957","paper":"/paper/learning-to-adapt-for-stereo","title":"Learning to Adapt for Stereo","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Learning2AdaptForStereo","path":"Losses/loss_factory.py","file_url":"https://github.com/CVLAB-Unibo/Learning2AdaptForStereo/blob/HEAD/Losses/loss_factory.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":"554090648d5d1688","mcp_get_code":{"code_sha256":"554090648d5d1688"}},{"arxiv_id":"1809.00794","paper":"/paper/texar-a-modularized-versatile-and-extensible-1","title":"Texar: A Modularized, Versatile, and Extensible Toolkit for Text Generation","date":"2018-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asyml/texar-pytorch","path":"texar/torch/core/regularizers.py","file_url":"https://github.com/asyml/texar-pytorch/blob/HEAD/texar/torch/core/regularizers.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":"504c4f1f2d5dd1ad","mcp_get_code":{"code_sha256":"504c4f1f2d5dd1ad"}},{"arxiv_id":"1805.02628","paper":"/paper/prada-protecting-against-dnn-model-stealing","title":"PRADA: Protecting against DNN Model Stealing Attacks","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"SSGAalto/prada-protecting-against-dnn-model-stealing-attacks","path":"src/growing_set_ops.py","file_url":"https://github.com/SSGAalto/prada-protecting-against-dnn-model-stealing-attacks/blob/HEAD/src/growing_set_ops.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":"feb066ccc764c959","mcp_get_code":{"code_sha256":"feb066ccc764c959"}},{"arxiv_id":"aaai_33848","paper":null,"title":"arXiv:aaai_33848","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"grodino/QuRD","path":"qurd/fingerprint/distance.py","file_url":"https://github.com/grodino/QuRD/blob/HEAD/qurd/fingerprint/distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8554698e4c9e2b5c","mcp_get_code":{"code_sha256":"8554698e4c9e2b5c"}}]}