{"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/get-datasets","entry":"get_datasets","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":49,"n_papers_ran":10,"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":52,"n_samples_ran":8,"n_samples_fingerprinted":1,"n_places":54,"n_places_pointer_only":19,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":4,"unverified":44},"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":"2607.23649","paper":"/paper/arxiv-2607-23649","title":"DP-IVON-Gradsq: Differentially Private Squared-Gradient Improved Variational Online Newton","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"NourJamoussi/DP-IVON-Gradsq","path":"utils/data.py","file_url":"https://github.com/NourJamoussi/DP-IVON-Gradsq/blob/HEAD/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d5b479ea9239b322","mcp_get_code":{"code_sha256":"d5b479ea9239b322"}},{"arxiv_id":"2606.25347","paper":"/paper/arxiv-2606-25347","title":"Geometry-Anchored Transport Framework for Exemplar-Free Class-Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"HXuSz11/GATF_ECCV2026","path":"src/datasets/data_loader.py","file_url":"https://github.com/HXuSz11/GATF_ECCV2026/blob/HEAD/src/datasets/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"70324fba45fbab66","mcp_get_code":{"code_sha256":"70324fba45fbab66"}},{"arxiv_id":"2605.11975","paper":"/paper/arxiv-2605-11975","title":"Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"milanganai/milanganai.github.io","path":"NeurIPS2023/code/utils/plot.py","file_url":"https://github.com/milanganai/milanganai.github.io/blob/HEAD/NeurIPS2023/code/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e642bb98eca55069","mcp_get_code":{"code_sha256":"e642bb98eca55069"}},{"arxiv_id":"2510.22897","paper":"/paper/arxiv-2510-22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"structlearning/neural-subm-design-space","path":"subgraph_matching/dataset.py","file_url":"https://github.com/structlearning/neural-subm-design-space/blob/HEAD/subgraph_matching/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"120db67dbd20f0a2","mcp_get_code":{"code_sha256":"120db67dbd20f0a2"}},{"arxiv_id":"2503.07890","paper":"/paper/can-generative-geospatial-diffusion-models","title":"Can Generative Geospatial Diffusion Models Excel as Discriminative Geospatial Foundation Models?","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yurujaja/SatDiFuser","path":"datasets/utils.py","file_url":"https://github.com/yurujaja/SatDiFuser/blob/HEAD/datasets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5b44e5acce4c8e5c","mcp_get_code":{"code_sha256":"5b44e5acce4c8e5c"}},{"arxiv_id":"2502.18274","paper":"/paper/citrus-leveraging-expert-cognitive-pathways","title":"Citrus: Leveraging Expert Cognitive Pathways in a Medical Language Model for Advanced Medical Decision Support","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jdh-algo/Citrus","path":"model_train/alignment/data.py","file_url":"https://github.com/jdh-algo/Citrus/blob/HEAD/model_train/alignment/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6fa7941fd9b5c0a9","mcp_get_code":{"code_sha256":"6fa7941fd9b5c0a9"}},{"arxiv_id":"2412.11521","paper":"/paper/on-the-ability-of-deep-networks-to-learn","title":"On the Ability of Deep Networks to Learn Symmetries from Data: A Neural Kernel Theory","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrea-perin/gpsymm","path":"fig1_data.py","file_url":"https://github.com/andrea-perin/gpsymm/blob/HEAD/fig1_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4be11eaa4df4a60d","mcp_get_code":{"code_sha256":"4be11eaa4df4a60d"}},{"arxiv_id":"2412.11521","paper":"/paper/on-the-ability-of-deep-networks-to-learn","title":"On the Ability of Deep Networks to Learn Symmetries from Data: A Neural Kernel Theory","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrea-perin/gpsymm","path":"groktest.py","file_url":"https://github.com/andrea-perin/gpsymm/blob/HEAD/groktest.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"36d6f4ac12d38853","mcp_get_code":{"code_sha256":"36d6f4ac12d38853"}},{"arxiv_id":"2410.10093","paper":"/paper/how-to-leverage-demonstration-data-in","title":"How to Leverage Demonstration Data in Alignment for Large Language Model? A Self-Imitation Learning Perspective","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/GSIL","path":"gsil/alignment/data.py","file_url":"https://github.com/tengxiao1/GSIL/blob/HEAD/gsil/alignment/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"26a8955ec17591c5","mcp_get_code":{"code_sha256":"26a8955ec17591c5"}},{"arxiv_id":"2407.20928","paper":"/paper/uniprocessor-a-text-induced-unified-low-level","title":"UniProcessor: A Text-induced Unified Low-level Image Processor","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intmegroup/uniprocessor","path":"ir_data_air/get_datasets.py","file_url":"https://github.com/intmegroup/uniprocessor/blob/HEAD/ir_data_air/get_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4ddcc0ad18e2790","mcp_get_code":{"code_sha256":"e4ddcc0ad18e2790"}},{"arxiv_id":"2407.10831","paper":"/paper/temporal-event-stereo-via-joint-learning-with","title":"Temporal Event Stereo via Joint Learning with Stereoscopic Flow","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mickeykang16/temporaleventstereo","path":"dataloader/dsceDataset.py","file_url":"https://github.com/mickeykang16/temporaleventstereo/blob/HEAD/dataloader/dsceDataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"adff203ed32cd918","mcp_get_code":{"code_sha256":"adff203ed32cd918"}},{"arxiv_id":"2407.07841","paper":"/paper/benchmarking-embedding-aggregation-methods-in","title":"Benchmarking Embedding Aggregation Methods in Computational Pathology: A Clinical Data Perspective","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuchs-lab-public/cpath_sabenchmark","path":"code/datasets.py","file_url":"https://github.com/fuchs-lab-public/cpath_sabenchmark/blob/HEAD/code/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7369ee82c228b370","mcp_get_code":{"code_sha256":"7369ee82c228b370"}},{"arxiv_id":"2407.11007","paper":"/paper/panacea-a-foundation-model-for-clinical-trial","title":"Panacea: A foundation model for clinical trial search, summarization, design, and recruitment","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linjc16/panacea","path":"alignment/data.py","file_url":"https://github.com/linjc16/panacea/blob/HEAD/alignment/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e25074d0d5f34d66","mcp_get_code":{"code_sha256":"e25074d0d5f34d66"}},{"arxiv_id":"2405.16681","paper":"/paper/triple-preference-optimization-achieving","title":"Triple Preference Optimization: Achieving Better Alignment with Less Data in a Single Step Optimization","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sahsaeedi/triple-preference-optimization","path":"utils/data.py","file_url":"https://github.com/sahsaeedi/triple-preference-optimization/blob/HEAD/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"312e65ff5e48081e","mcp_get_code":{"code_sha256":"312e65ff5e48081e"}},{"arxiv_id":"2405.03000","paper":"/paper/medadapter-efficient-test-time-adaptation-of","title":"MedAdapter: Efficient Test-Time Adaptation of Large Language Models towards Medical Reasoning","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wshi83/MedAdapter","path":"reward_model/orm/orm_guide.py","file_url":"https://github.com/wshi83/MedAdapter/blob/HEAD/reward_model/orm/orm_guide.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee2a47559197dba0","mcp_get_code":{"code_sha256":"ee2a47559197dba0"}},{"arxiv_id":"2404.16212","paper":"/paper/an-analysis-of-recent-advances-in-deepfake","title":"An Analysis of Recent Advances in Deepfake Image Detection in an Evolving Threat Landscape","date":"2024-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"secml-lab-vt/EvolvingThreat-DeepfakeImageDetect","path":"surrogatemodels/train_clipresnet.py","file_url":"https://github.com/secml-lab-vt/EvolvingThreat-DeepfakeImageDetect/blob/HEAD/surrogatemodels/train_clipresnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78ba2682add5c298","mcp_get_code":{"code_sha256":"78ba2682add5c298"}},{"arxiv_id":"2404.00357","paper":"/paper/revisiting-random-weight-perturbation-for","title":"Revisiting Random Weight Perturbation for Efficiently Improving Generalization","date":"2024-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nblt/marwp","path":"utils.py","file_url":"https://github.com/nblt/marwp/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"18eb18597060e5f8","mcp_get_code":{"code_sha256":"18eb18597060e5f8"}},{"arxiv_id":"2403.06233","paper":"/paper/finding-visual-saliency-in-continuous-spike","title":"Finding Visual Saliency in Continuous Spike Stream","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BIT-Vision/SVS","path":"datasets/dataset.py","file_url":"https://github.com/BIT-Vision/SVS/blob/HEAD/datasets/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a82c9310f46b74cb","mcp_get_code":{"code_sha256":"a82c9310f46b74cb"}},{"arxiv_id":"2403.04086","paper":"/paper/automated-multi-task-learning-for-joint","title":"Automated Multi-Task Learning for Joint Disease Prediction on Electronic Health Records","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SH-Src/AutoDP","path":"utils/ehr_dataset.py","file_url":"https://github.com/SH-Src/AutoDP/blob/HEAD/utils/ehr_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a7facc355b59543","mcp_get_code":{"code_sha256":"0a7facc355b59543"}},{"arxiv_id":"2402.18865","paper":"/paper/analyzing-and-reducing-catastrophic","title":"Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuning","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"which47/llmcl","path":"get_dataset.py","file_url":"https://github.com/which47/llmcl/blob/HEAD/get_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d90e6d4a6e725608","mcp_get_code":{"code_sha256":"d90e6d4a6e725608"}},{"arxiv_id":"2312.15685","paper":"/paper/what-makes-good-data-for-alignment-a","title":"What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuning","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nlp/deita","path":"src/deita/alignment/train_scorers.py","file_url":"https://github.com/hkust-nlp/deita/blob/HEAD/src/deita/alignment/train_scorers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e0e89efde423abfd","mcp_get_code":{"code_sha256":"e0e89efde423abfd"}},{"arxiv_id":"2310.13230","paper":"/paper/absolute-policy-optimization","title":"Absolute Policy Optimization","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-control-lab/absolute-policy-optimization","path":"rl_lib/utils/plot.py","file_url":"https://github.com/intelligent-control-lab/absolute-policy-optimization/blob/HEAD/rl_lib/utils/plot.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f788e504c431ef6b","mcp_get_code":{"code_sha256":"f788e504c431ef6b"}},{"arxiv_id":"2308.00279","paper":"/paper/robust-positive-unlabeled-learning-via-noise","title":"Robust Positive-Unlabeled Learning via Noise Negative Sample Self-correction","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woriazzc/robust-pu","path":"utils.py","file_url":"https://github.com/woriazzc/robust-pu/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50359d1b37d86c4a","mcp_get_code":{"code_sha256":"50359d1b37d86c4a"}},{"arxiv_id":"2307.01533","paper":"/paper/unsupervised-video-anomaly-detection-with","title":"Unsupervised Video Anomaly Detection with Diffusion Models Conditioned on Compact Motion Representations","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anilosmantur/conditioned_video_anomaly_diffusion","path":"train_ano.py","file_url":"https://github.com/anilosmantur/conditioned_video_anomaly_diffusion/blob/HEAD/train_ano.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7ab491e780c48512","mcp_get_code":{"code_sha256":"7ab491e780c48512"}},{"arxiv_id":"2305.18512","paper":"/paper/a-rainbow-in-deep-network-black-boxes","title":"A Rainbow in Deep Network Black Boxes","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"florentinguth/rainbow","path":"datasets.py","file_url":"https://github.com/florentinguth/rainbow/blob/HEAD/datasets.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":"e6fb903521a8cee4","mcp_get_code":{"code_sha256":"e6fb903521a8cee4"}},{"arxiv_id":"2303.03320","paper":"/paper/learning-to-backdoor-federated-learning","title":"Learning to Backdoor Federated Learning","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HengerLi/RLBackdoorFL","path":"DataProcess.py","file_url":"https://github.com/HengerLi/RLBackdoorFL/blob/HEAD/DataProcess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97022c949a88944d","mcp_get_code":{"code_sha256":"97022c949a88944d"}},{"arxiv_id":"2207.13916","paper":"/paper/a-novel-data-augmentation-technique-for-out","title":"A Novel Data Augmentation Technique for Out-of-Distribution Sample Detection using Compounded Corruptions","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnc-ood/cnc_ood","path":"datasets/cifar10.py","file_url":"https://github.com/cnc-ood/cnc_ood/blob/HEAD/datasets/cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd7eb4a19cf6344a","mcp_get_code":{"code_sha256":"fd7eb4a19cf6344a"}},{"arxiv_id":"2207.13916","paper":"/paper/a-novel-data-augmentation-technique-for-out","title":"A Novel Data Augmentation Technique for Out-of-Distribution Sample Detection using Compounded Corruptions","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnc-ood/cnc_ood","path":"datasets/cifar100.py","file_url":"https://github.com/cnc-ood/cnc_ood/blob/HEAD/datasets/cifar100.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b018c7f90d510364","mcp_get_code":{"code_sha256":"b018c7f90d510364"}},{"arxiv_id":"2207.13916","paper":"/paper/a-novel-data-augmentation-technique-for-out","title":"A Novel Data Augmentation Technique for Out-of-Distribution Sample Detection using Compounded Corruptions","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnc-ood/cnc_ood","path":"datasets/svhn.py","file_url":"https://github.com/cnc-ood/cnc_ood/blob/HEAD/datasets/svhn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"edd840936d027c2e","mcp_get_code":{"code_sha256":"edd840936d027c2e"}},{"arxiv_id":"2207.02797","paper":"/paper/the-intrinsic-manifolds-of-radiological","title":"The Intrinsic Manifolds of Radiological Images and their Role in Deep Learning","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazurowski-lab/radiologyintrinsicmanifolds","path":"src/dataset.py","file_url":"https://github.com/mazurowski-lab/radiologyintrinsicmanifolds/blob/HEAD/src/dataset.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":"9f4f6cd21bbc7037","mcp_get_code":{"code_sha256":"9f4f6cd21bbc7037"}},{"arxiv_id":"2203.13834","paper":"/paper/a-stitch-in-time-saves-nine-a-train-time","title":"A Stitch in Time Saves Nine: A Train-Time Regularizing Loss for Improved Neural Network Calibration","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdca-loss/mdca-calibration","path":"datasets/imagenet.py","file_url":"https://github.com/mdca-loss/mdca-calibration/blob/HEAD/datasets/imagenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f077346ebc45ed1b","mcp_get_code":{"code_sha256":"f077346ebc45ed1b"}},{"arxiv_id":"2203.08063","paper":"/paper/motionclip-exposing-human-motion-generation","title":"MotionCLIP: Exposing Human Motion Generation to CLIP Space","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guytevet/motionclip","path":"src/datasets/get_dataset.py","file_url":"https://github.com/guytevet/motionclip/blob/HEAD/src/datasets/get_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a0130412b541041","mcp_get_code":{"code_sha256":"4a0130412b541041"}},{"arxiv_id":"2111.14838","paper":"/paper/evaluating-privacy-preserving-machine","title":"Evaluating Privacy-Preserving Machine Learning in Critical Infrastructures: A Case Study on Time-Series Classification","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DominiqueMercier/PPML-TSA","path":"src/modules/ucr_loader.py","file_url":"https://github.com/DominiqueMercier/PPML-TSA/blob/HEAD/src/modules/ucr_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70634cdff58ce5b5","mcp_get_code":{"code_sha256":"70634cdff58ce5b5"}},{"arxiv_id":"2108.11939","paper":"/paper/understanding-and-accelerating-neural","title":"Understanding and Accelerating Neural Architecture Search with Training-Free and Theory-Grounded Metrics","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/tegnas","path":"lib/datasets/get_dataset_with_transform.py","file_url":"https://github.com/vita-group/tegnas/blob/HEAD/lib/datasets/get_dataset_with_transform.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e886699e0b7d7466","mcp_get_code":{"code_sha256":"e886699e0b7d7466"}},{"arxiv_id":"2106.11930","paper":"/paper/on-the-importance-of-cross-task-features-for","title":"On the importance of cross-task features for class-incremental learning","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlbinSou/cross_task_cil","path":"src/datasets/data_loader.py","file_url":"https://github.com/AlbinSou/cross_task_cil/blob/HEAD/src/datasets/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2125ab30557c552f","mcp_get_code":{"code_sha256":"2125ab30557c552f"}},{"arxiv_id":"2106.09110","paper":"/paper/safe-reinforcement-learning-using-advantage","title":"Safe Reinforcement Learning Using Advantage-Based Intervention","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nolanwagener/safe_rl","path":"safe_rl/utils/plot.py","file_url":"https://github.com/nolanwagener/safe_rl/blob/HEAD/safe_rl/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":"ed35dafc1e97db0c","mcp_get_code":{"code_sha256":"ed35dafc1e97db0c"}},{"arxiv_id":"2106.07207","paper":"/paper/straight-to-the-gradient-learning-to-use-1","title":"Straight to the Gradient: Learning to Use Novel Tokens for Neural Text Generation","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnlimn/scalegrad","path":"custom/gpt2/run_gpt2.py","file_url":"https://github.com/shawnlimn/scalegrad/blob/HEAD/custom/gpt2/run_gpt2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"041742ed31858d0f","mcp_get_code":{"code_sha256":"041742ed31858d0f"}},{"arxiv_id":"2106.01357","paper":"/paper/diffusion-schrodinger-bridge-with","title":"Diffusion Schrödinger Bridge with Applications to Score-Based Generative Modeling","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JTT94/diffusion_schrodinger_bridge","path":"bridge/runners/ipf.py","file_url":"https://github.com/JTT94/diffusion_schrodinger_bridge/blob/HEAD/bridge/runners/ipf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"047f2e89ba81227d","mcp_get_code":{"code_sha256":"047f2e89ba81227d"}},{"arxiv_id":"2104.05670","paper":"/paper/action-conditioned-3d-human-motion-synthesis","title":"Action-Conditioned 3D Human Motion Synthesis with Transformer VAE","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mathux/ACTOR","path":"src/datasets/get_dataset.py","file_url":"https://github.com/Mathux/ACTOR/blob/HEAD/src/datasets/get_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d2ad5c70d553a15","mcp_get_code":{"code_sha256":"6d2ad5c70d553a15"}},{"arxiv_id":"2010.07092","paper":"/paper/data-augmentation-for-meta-learning-1","title":"Data Augmentation for Meta-Learning","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenkunNi/MetaAug","path":"train_maxup.py","file_url":"https://github.com/RenkunNi/MetaAug/blob/HEAD/train_maxup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8cdcf45b23a7ccd2","mcp_get_code":{"code_sha256":"8cdcf45b23a7ccd2"}},{"arxiv_id":"2008.06520","paper":"/paper/learning-gradient-fields-for-shape-generation","title":"Learning Gradient Fields for Shape Generation","date":"2020-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuojinCai/ShapeGF","path":"datasets/pointflow_datasets.py","file_url":"https://github.com/RuojinCai/ShapeGF/blob/HEAD/datasets/pointflow_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fcd60648a66ec115","mcp_get_code":{"code_sha256":"fcd60648a66ec115"}},{"arxiv_id":"2007.15951","paper":"/paper/an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uchidalab/time_series_augmentation","path":"utils/input_data.py","file_url":"https://github.com/uchidalab/time_series_augmentation/blob/HEAD/utils/input_data.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":"e381033c0b9d40ec","mcp_get_code":{"code_sha256":"e381033c0b9d40ec"}},{"arxiv_id":"2006.07442","paper":"/paper/self-imitation-learning-via-generalized-lower","title":"Self-Imitation Learning via Generalized Lower Bound Q-learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/spinningup","path":"spinup/utils/plot.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e642bb98eca55069","mcp_get_code":{"code_sha256":"e642bb98eca55069"}},{"arxiv_id":"1912.03458","paper":"/paper/dynamic-convolution-attention-over","title":"Dynamic Convolution: Attention over Convolution Kernels","date":"2019-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prstrive/CondConv-tensorflow","path":"dataset.py","file_url":"https://github.com/prstrive/CondConv-tensorflow/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9cfc6fd89dbb714","mcp_get_code":{"code_sha256":"f9cfc6fd89dbb714"}},{"arxiv_id":"1910.11162","paper":"/paper/u-time-a-fully-convolutional-network-for-time","title":"U-Time: A Fully Convolutional Network for Time Series Segmentation Applied to Sleep Staging","date":"2019-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"perslev/U-Time","path":"utime/bin/predict.py","file_url":"https://github.com/perslev/U-Time/blob/HEAD/utime/bin/predict.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e8ad77ed6d59f9c2","mcp_get_code":{"code_sha256":"e8ad77ed6d59f9c2"}},{"arxiv_id":"1909.12255","paper":"/paper/harnessing-structures-for-value-based","title":"Harnessing Structures for Value-Based Planning and Reinforcement Learning","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YyzHarry/SV-RL","path":"sv_rl/plot.py","file_url":"https://github.com/YyzHarry/SV-RL/blob/HEAD/sv_rl/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f379c7706eb8801","mcp_get_code":{"code_sha256":"8f379c7706eb8801"}},{"arxiv_id":"1908.09006","paper":"/paper/large-scale-organization-and-inference-of-an","title":"Large Scale Organization and Inference of an Imagery Dataset for Public Safety","date":"2019-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LADI-Dataset/ladi-overview","path":"training/config_dataset.py","file_url":"https://github.com/LADI-Dataset/ladi-overview/blob/HEAD/training/config_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42c4f691d6a4bb77","mcp_get_code":{"code_sha256":"42c4f691d6a4bb77"}},{"arxiv_id":"1906.12320","paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevenygd/PointFlow","path":"datasets.py","file_url":"https://github.com/stevenygd/PointFlow/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5197b33d0222d257","mcp_get_code":{"code_sha256":"5197b33d0222d257"}},{"arxiv_id":"1906.12320","paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmum/LoCondA","path":"datasets/pointflow.py","file_url":"https://github.com/gmum/LoCondA/blob/HEAD/datasets/pointflow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf133ca0a1a7d7e5","mcp_get_code":{"code_sha256":"bf133ca0a1a7d7e5"}},{"arxiv_id":"1906.12320","paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rg321/pointFlow_exp","path":"datasets.py","file_url":"https://github.com/rg321/pointFlow_exp/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f63c0ca7dfab72f","mcp_get_code":{"code_sha256":"5f63c0ca7dfab72f"}},{"arxiv_id":"1906.01930","paper":"/paper/approximate-inference-turns-deep-networks","title":"Approximate Inference Turns Deep Networks into Gaussian Processes","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"team-approx-bayes/dnn2gp","path":"marglik.py","file_url":"https://github.com/team-approx-bayes/dnn2gp/blob/HEAD/marglik.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"356d4801d921017f","mcp_get_code":{"code_sha256":"356d4801d921017f"}},{"arxiv_id":"1812.02690","paper":"/paper/provably-efficient-maximum-entropy","title":"Provably Efficient Maximum Entropy Exploration","date":"2018-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abbyvansoest/maxent","path":"plot.py","file_url":"https://github.com/abbyvansoest/maxent/blob/HEAD/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ece9caed5d8cff07","mcp_get_code":{"code_sha256":"ece9caed5d8cff07"}},{"arxiv_id":"1802.09477","paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robintyh1/icml2021-pengqlambda","path":"spinup/utils/plot.py","file_url":"https://github.com/robintyh1/icml2021-pengqlambda/blob/HEAD/spinup/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e642bb98eca55069","mcp_get_code":{"code_sha256":"e642bb98eca55069"}},{"arxiv_id":"2024.findings-acl.708","paper":null,"title":"arXiv:2024.findings-acl.708","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"process-cxr/AGR","path":"retriever_utils.py","file_url":"https://github.com/process-cxr/AGR/blob/HEAD/retriever_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1840e16e501abdc9","mcp_get_code":{"code_sha256":"1840e16e501abdc9"}}]}