{"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-dataset","entry":"get_dataset","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":285,"n_papers_ran":42,"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":292,"n_samples_ran":44,"n_samples_fingerprinted":1,"n_places":310,"n_places_pointer_only":105,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":11,"ran_fixture":0,"ran":33,"unverified":248},"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.20134","paper":"/paper/arxiv-2608-20134","title":"Feature Evolution and Migration during Vision Transformer Training *","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"joonasrooben/VIT-Feature-Evolution-and-Migration","path":"src/dataloader.py","file_url":"https://github.com/joonasrooben/VIT-Feature-Evolution-and-Migration/blob/HEAD/src/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2b5371d8b8a155db","mcp_get_code":{"code_sha256":"2b5371d8b8a155db"}},{"arxiv_id":"2608.08646","paper":"/paper/arxiv-2608-08646","title":"Multi-Relational Knowledge Graph Enhanced Embedding for Trajectory-User Linking ⋆","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"superior-DL/MakeTUL","path":"loaddataset.py","file_url":"https://github.com/superior-DL/MakeTUL/blob/HEAD/loaddataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7680c122ee8c3cf4","mcp_get_code":{"code_sha256":"7680c122ee8c3cf4"}},{"arxiv_id":"2607.22722","paper":"/paper/arxiv-2607-22722","title":"A New Kind of Adversarial Example: Measuring the Human-Model Gap, and Its Relationship to OOD Detection","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"alikayyam/NKE_attack","path":"nke/data.py","file_url":"https://github.com/alikayyam/NKE_attack/blob/HEAD/nke/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca186e19df2331a7","mcp_get_code":{"code_sha256":"ca186e19df2331a7"}},{"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":"utils/dataset.py","file_url":"https://github.com/Ludvins/2023-ICLR-DVIP/blob/HEAD/utils/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":"323c373e0a928fe7","mcp_get_code":{"code_sha256":"323c373e0a928fe7"}},{"arxiv_id":"2606.10284","paper":"/paper/arxiv-2606-10284","title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nerdslab/bgrl","path":"bgrl/data.py","file_url":"https://github.com/nerdslab/bgrl/blob/HEAD/bgrl/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":"8021d44d3b828d80","mcp_get_code":{"code_sha256":"8021d44d3b828d80"}},{"arxiv_id":"2605.27990","paper":"/paper/arxiv-2605-27990","title":"Geometry-Correct Diffusion Posterior Sampling with Denoiser-Pullback Curvature Guidance and Manifold-Aligned Damping","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Seunghyeok0715/CLAMP","path":"data.py","file_url":"https://github.com/Seunghyeok0715/CLAMP/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f5ce1a27c831a63","mcp_get_code":{"code_sha256":"5f5ce1a27c831a63"}},{"arxiv_id":"2605.24417","paper":"/paper/arxiv-2605-24417","title":"LLMTabBench: Evaluating LLMs on Binary Tabular Classification From Zero to Few Shots","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"sb-ai-lab/llm4tab","path":"feat-llm/utils.py","file_url":"https://github.com/sb-ai-lab/llm4tab/blob/HEAD/feat-llm/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df10de99ea66b55c","mcp_get_code":{"code_sha256":"df10de99ea66b55c"}},{"arxiv_id":"2605.15488","paper":"/paper/arxiv-2605-15488","title":"SurvivalPFN: Amortizing Survival Prediction via In-Context Bayesian Inference","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TeaPearce/Censored_Quantile_Regression_NN","path":"01_code/datasets.py","file_url":"https://github.com/TeaPearce/Censored_Quantile_Regression_NN/blob/HEAD/01_code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3aeb675f6185d8fd","mcp_get_code":{"code_sha256":"3aeb675f6185d8fd"}},{"arxiv_id":"2604.16593","paper":"/paper/arxiv-2604-16593","title":"Revisiting a Pain in the Neck: A Semantic Reasoning Benchmark for Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"dair-iitd/pronci","path":"few_shot.py","file_url":"https://github.com/dair-iitd/pronci/blob/HEAD/few_shot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5291e51c44dff916","mcp_get_code":{"code_sha256":"5291e51c44dff916"}},{"arxiv_id":"2603.24209","paper":"/paper/arxiv-2603-24209","title":"HEART-PFL: Stable Personalized Federated Learning under Heterogeneity with Hierarchical Directional Alignment and Adversarial Knowledge Transfer","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"danny0628/HEART-PFL","path":"datasets/prepare_data.py","file_url":"https://github.com/danny0628/HEART-PFL/blob/HEAD/datasets/prepare_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6fcb5d0981f1717c","mcp_get_code":{"code_sha256":"6fcb5d0981f1717c"}},{"arxiv_id":"2602.07697","paper":"/paper/arxiv-2602-07697","title":"On the Infinite Width and Depth Limits of Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"thebuckleylab/jpc","path":"experiments/datasets.py","file_url":"https://github.com/thebuckleylab/jpc/blob/HEAD/experiments/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e61273ea16c86adc","mcp_get_code":{"code_sha256":"e61273ea16c86adc"}},{"arxiv_id":"2601.21426","paper":"/paper/arxiv-2601-21426","title":"MultiModal Fine-tuning with Synthetic Captions","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"s-enmt/MMFT","path":"utils/dataset_utils.py","file_url":"https://github.com/s-enmt/MMFT/blob/HEAD/utils/dataset_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f79228f9a6e405b9","mcp_get_code":{"code_sha256":"f79228f9a6e405b9"}},{"arxiv_id":"2601.19232","paper":"/paper/arxiv-2601-19232","title":"Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"A4Bio/RDesign","path":"utils.py","file_url":"https://github.com/A4Bio/RDesign/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":"cc6feb6abcd5e321","mcp_get_code":{"code_sha256":"cc6feb6abcd5e321"}},{"arxiv_id":"2601.17927","paper":"/paper/arxiv-2601-17927","title":"RemEdit: Efficient Diffusion Editing with Riemannian Geometry","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"eashanadhikarla/RemEdit","path":"src/datasets/data_utils.py","file_url":"https://github.com/eashanadhikarla/RemEdit/blob/HEAD/src/datasets/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f2838be34005412","mcp_get_code":{"code_sha256":"4f2838be34005412"}},{"arxiv_id":"2601.06429","paper":"/paper/arxiv-2601-06429","title":"A Unified Shape-Aware Foundation Model for Time Series Classification","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"qianlima-lab/UniShape","path":"datapre/dataloader.py","file_url":"https://github.com/qianlima-lab/UniShape/blob/HEAD/datapre/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05aabd3ba7656342","mcp_get_code":{"code_sha256":"05aabd3ba7656342"}},{"arxiv_id":"2512.10359","paper":"/paper/arxiv-2512-10359","title":"Tool-Augmented Spatiotemporal Reasoning for Streamlining Video Question Answering Task","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"fansunqi/VideoTool","path":"dataset.py","file_url":"https://github.com/fansunqi/VideoTool/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":"42677134b9a94956","mcp_get_code":{"code_sha256":"42677134b9a94956"}},{"arxiv_id":"2511.17399","paper":"/paper/arxiv-2511-17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"changwk1001/stable-coreset","path":"mydatasets/datasets.py","file_url":"https://github.com/changwk1001/stable-coreset/blob/HEAD/mydatasets/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"81a95f056e855f73","mcp_get_code":{"code_sha256":"81a95f056e855f73"}},{"arxiv_id":"2511.07819","paper":"/paper/arxiv-2511-07819","title":"Human Motion Synthesis in 3D Scenes via Unified Scene Semantic Occupancy","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"jingyugong/SSOMotion","path":"data_loaders/get_data.py","file_url":"https://github.com/jingyugong/SSOMotion/blob/HEAD/data_loaders/get_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77c210df70056d6a","mcp_get_code":{"code_sha256":"77c210df70056d6a"}},{"arxiv_id":"2510.01650","paper":"/paper/arxiv-2510-01650","title":"The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"log-postech/elsa","path":"lib/data.py","file_url":"https://github.com/log-postech/elsa/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"94fc9d5b353d22d8","mcp_get_code":{"code_sha256":"94fc9d5b353d22d8"}},{"arxiv_id":"2509.26455","paper":"/paper/arxiv-2509-26455","title":"Stylos: Multi-View 3D Stylization with Single-Forward Gaussian Splatting","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"HanzhouLiu/Stylos","path":"ArtScore/datasets.py","file_url":"https://github.com/HanzhouLiu/Stylos/blob/HEAD/ArtScore/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d5d557a6527bcde","mcp_get_code":{"code_sha256":"7d5d557a6527bcde"}},{"arxiv_id":"2509.23871","paper":"/paper/arxiv-2509-23871","title":"Taught Well Learned Ill: Towards Distillation-conditional Backdoor Attack","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"WhitolfChen/SCAR","path":"core/datasets.py","file_url":"https://github.com/WhitolfChen/SCAR/blob/HEAD/core/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9847c58f5ec1a14a","mcp_get_code":{"code_sha256":"9847c58f5ec1a14a"}},{"arxiv_id":"2508.02045","paper":"/paper/arxiv-2508-02045","title":"HARNESSING TEMPORAL DATABASES FOR SYSTEMATIC EVALUATION OF FACTUAL TIME-SENSITIVE QUESTION-ANSWERING IN LLMS","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"ssoy0701/tdbench","path":"src/utils/utils_dataset.py","file_url":"https://github.com/ssoy0701/tdbench/blob/HEAD/src/utils/utils_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cdc350278d47af10","mcp_get_code":{"code_sha256":"cdc350278d47af10"}},{"arxiv_id":"2507.22699","paper":null,"title":"arXiv:2507.22699","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"dvttran/nsft","path":"nsft/datasets/base_dataset.py","file_url":"https://github.com/dvttran/nsft/blob/HEAD/nsft/datasets/base_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"26413552c14bf452","mcp_get_code":{"code_sha256":"26413552c14bf452"}},{"arxiv_id":"2506.12618","paper":"/paper/openunlearning-accelerating-llm-unlearning","title":"OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics","date":"2025-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/open-unlearning","path":"community/methods/AltPO/generate.py","file_url":"https://github.com/locuslab/open-unlearning/blob/HEAD/community/methods/AltPO/generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78733604aac3e99e","mcp_get_code":{"code_sha256":"78733604aac3e99e"}},{"arxiv_id":"2506.09952","paper":"/paper/unipre3d-unified-pre-training-of-3d-point-1","title":"UniPre3D: Unified Pre-training of 3D Point Cloud Models with Cross-Modal Gaussian Splatting","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangzy22/UniPre3D","path":"dataset/dataset_factory.py","file_url":"https://github.com/wangzy22/UniPre3D/blob/HEAD/dataset/dataset_factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a4d9c3b67d30c83","mcp_get_code":{"code_sha256":"2a4d9c3b67d30c83"}},{"arxiv_id":"2504.02199","paper":"/paper/esc-erasing-space-concept-for-knowledge","title":"ESC: Erasing Space Concept for Knowledge Deletion","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-VGI/ESC","path":"unlearn.py","file_url":"https://github.com/KU-VGI/ESC/blob/HEAD/unlearn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"99c85c380ca6c5cf","mcp_get_code":{"code_sha256":"99c85c380ca6c5cf"}},{"arxiv_id":"2503.03519","paper":"/paper/do-imagenet-trained-models-learn-shortcuts","title":"Do ImageNet-trained models learn shortcuts? The impact of frequency shortcuts on generalization","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/hfss","path":"hfss/LSI.py","file_url":"https://github.com/nis-research/hfss/blob/HEAD/hfss/LSI.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afd66aeb8288064b","mcp_get_code":{"code_sha256":"afd66aeb8288064b"}},{"arxiv_id":"2502.18364","paper":"/paper/art-anonymous-region-transformer-for-variable","title":"ART: Anonymous Region Transformer for Variable Multi-Layer Transparent Image Generation","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/art-msra","path":"layout_planner/training/datasets/layoutnew_dataset.py","file_url":"https://github.com/microsoft/art-msra/blob/HEAD/layout_planner/training/datasets/layoutnew_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a4f7b082e40ac6b","mcp_get_code":{"code_sha256":"7a4f7b082e40ac6b"}},{"arxiv_id":"2502.06884","paper":"/paper/learning-conformal-abstention-policies-for","title":"Learning Conformal Abstention Policies for Adaptive Risk Management in Large Language and Vision-Language Models","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sinatayebati/vlm-uncertainty","path":"data_utils/utils.py","file_url":"https://github.com/sinatayebati/vlm-uncertainty/blob/HEAD/data_utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e203cb8767712bd","mcp_get_code":{"code_sha256":"9e203cb8767712bd"}},{"arxiv_id":"2501.19403","paper":"/paper/redefining-machine-unlearning-a-conformal","title":"Redefining Machine Unlearning: A Conformal Prediction-Motivated Approach","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TIML-Group/Conformal-Prediction-Unlearning","path":"utils.py","file_url":"https://github.com/TIML-Group/Conformal-Prediction-Unlearning/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":"3ea50daa1a9dcd36","mcp_get_code":{"code_sha256":"3ea50daa1a9dcd36"}},{"arxiv_id":"2501.00912","paper":"/paper/autopresent-designing-structured-visuals-from","title":"AutoPresent: Designing Structured Visuals from Scratch","date":"2025-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"para-lost/AutoPresent","path":"autopresent/generate.py","file_url":"https://github.com/para-lost/AutoPresent/blob/HEAD/autopresent/generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f7728e4bafebc1b","mcp_get_code":{"code_sha256":"6f7728e4bafebc1b"}},{"arxiv_id":"2412.09945","paper":"/paper/going-beyond-feature-similarity-effective","title":"Going Beyond Feature Similarity: Effective Dataset Distillation based on Class-Aware Conditional Mutual Information","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ndhg1213/CMIDD","path":"DC-DSA-DM/utils.py","file_url":"https://github.com/ndhg1213/CMIDD/blob/HEAD/DC-DSA-DM/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2bccb1da81dcb4b1","mcp_get_code":{"code_sha256":"2bccb1da81dcb4b1"}},{"arxiv_id":"2412.06769","paper":"/paper/training-large-language-models-to-reason-in-a","title":"Training Large Language Models to Reason in a Continuous Latent Space","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/coconut","path":"dataset.py","file_url":"https://github.com/facebookresearch/coconut/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":"9a9792caf435580c","mcp_get_code":{"code_sha256":"9a9792caf435580c"}},{"arxiv_id":"2411.18463","paper":"/paper/hotspot-driven-peptide-design-via-multi","title":"Hotspot-Driven Peptide Design via Multi-Fragment Autoregressive Extension","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ced3-han/PepHAR","path":"datasets/_base.py","file_url":"https://github.com/Ced3-han/PepHAR/blob/HEAD/datasets/_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12a234a1ea67a141","mcp_get_code":{"code_sha256":"12a234a1ea67a141"}},{"arxiv_id":"2411.03038","paper":"/paper/can-transformers-smell-like-humans","title":"Can Transformers Smell Like Humans?","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Farzaneh-Taleb/transformer-olfactory-alignment","path":"Notebooks/finetune_multitask.py","file_url":"https://github.com/Farzaneh-Taleb/transformer-olfactory-alignment/blob/HEAD/Notebooks/finetune_multitask.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c1b334cc3c822dcf","mcp_get_code":{"code_sha256":"c1b334cc3c822dcf"}},{"arxiv_id":"2411.00899","paper":"/paper/certified-robustness-for-deep-equilibrium-1","title":"Certified Robustness for Deep Equilibrium Models via Serialized Random Smoothing","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeizhiGao/Serialized-Randomized-Smoothing","path":"SRS/code/datasets.py","file_url":"https://github.com/WeizhiGao/Serialized-Randomized-Smoothing/blob/HEAD/SRS/code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"667ac97f3d05bca6","mcp_get_code":{"code_sha256":"667ac97f3d05bca6"}},{"arxiv_id":"2410.18926","paper":"/paper/lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejaasaari/lorann-experiments","path":"ann_benchmarks/datasets.py","file_url":"https://github.com/ejaasaari/lorann-experiments/blob/HEAD/ann_benchmarks/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1832a37264ff8488","mcp_get_code":{"code_sha256":"1832a37264ff8488"}},{"arxiv_id":"2410.11582","paper":"/paper/on-the-fly-modulation-for-balanced-multimodal","title":"On-the-fly Modulation for Balanced Multimodal Learning","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gewu-lab/bml_tpami2024","path":"code/dataset/KS.py","file_url":"https://github.com/gewu-lab/bml_tpami2024/blob/HEAD/code/dataset/KS.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19e90f5f7bc19258","mcp_get_code":{"code_sha256":"19e90f5f7bc19258"}},{"arxiv_id":"2410.10683","paper":"/paper/sampa-sharpness-aware-minimization","title":"SAMPa: Sharpness-aware Minimization Parallelized","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/SAMPa","path":"get_dataset.py","file_url":"https://github.com/LIONS-EPFL/SAMPa/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":"caf601cac7f2ec8c","mcp_get_code":{"code_sha256":"caf601cac7f2ec8c"}},{"arxiv_id":"2410.10139","paper":"/paper/mmie-massive-multimodal-interleaved","title":"MMIE: Massive Multimodal Interleaved Comprehension Benchmark for Large Vision-Language Models","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lillianwei-h/MMIE","path":"dataset.py","file_url":"https://github.com/Lillianwei-h/MMIE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab8edcc986390a01","mcp_get_code":{"code_sha256":"ab8edcc986390a01"}},{"arxiv_id":"2410.07369","paper":"/paper/an-undetectable-watermark-for-generative","title":"An Undetectable Watermark for Generative Image Models","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XuandongZhao/PRC-Watermark","path":"src/optim_utils.py","file_url":"https://github.com/XuandongZhao/PRC-Watermark/blob/HEAD/src/optim_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9be86cc4996244ae","mcp_get_code":{"code_sha256":"9be86cc4996244ae"}},{"arxiv_id":"2410.03983","paper":"/paper/metricx-24-the-google-submission-to-the-wmt","title":"MetricX-24: The Google Submission to the WMT 2024 Metrics Shared Task","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/metricx","path":"metricx23/predict.py","file_url":"https://github.com/google-research/metricx/blob/HEAD/metricx23/predict.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":"96776db63f1e0113","mcp_get_code":{"code_sha256":"96776db63f1e0113"}},{"arxiv_id":"2410.03983","paper":"/paper/metricx-24-the-google-submission-to-the-wmt","title":"MetricX-24: The Google Submission to the WMT 2024 Metrics Shared Task","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/metricx","path":"metricx24/predict.py","file_url":"https://github.com/google-research/metricx/blob/HEAD/metricx24/predict.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":"0298705924fae843","mcp_get_code":{"code_sha256":"0298705924fae843"}},{"arxiv_id":"2410.02847","paper":"/paper/deep-signature-characterization-of-large","title":"Deep Signature: Characterization of Large-Scale Molecular Dynamics","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WonderSeven/Deep-Signature","path":"engine/inits.py","file_url":"https://github.com/WonderSeven/Deep-Signature/blob/HEAD/engine/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ff3fa2ecdecd93b","mcp_get_code":{"code_sha256":"3ff3fa2ecdecd93b"}},{"arxiv_id":"2410.02116","paper":"/paper/dataset-distillation-via-knowledge","title":"Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigml-cs-ucla/mkdt","path":"distill.py","file_url":"https://github.com/bigml-cs-ucla/mkdt/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"250c62662efd531e","mcp_get_code":{"code_sha256":"250c62662efd531e"}},{"arxiv_id":"2410.00393","paper":"/paper/revisiting-essential-and-nonessential","title":"Revisiting Essential and Nonessential Settings of Evidential Deep Learning","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengyuanchen21/re-edl","path":"code_classical/dataset.py","file_url":"https://github.com/mengyuanchen21/re-edl/blob/HEAD/code_classical/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a08eba5fbc8e46bb","mcp_get_code":{"code_sha256":"a08eba5fbc8e46bb"}},{"arxiv_id":"2409.19732","paper":"/paper/unified-gradient-based-machine-unlearning","title":"Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clear-nus/selective-amnesia","path":"ddpm/train_classifier.py","file_url":"https://github.com/clear-nus/selective-amnesia/blob/HEAD/ddpm/train_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"403a67ad5e70ec17","mcp_get_code":{"code_sha256":"403a67ad5e70ec17"}},{"arxiv_id":"2409.16670","paper":"/paper/graphlora-structure-aware-contrastive-low","title":"GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allminerlab/graphlora","path":"util.py","file_url":"https://github.com/allminerlab/graphlora/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8645cbcfdf4f1b0c","mcp_get_code":{"code_sha256":"8645cbcfdf4f1b0c"}},{"arxiv_id":"2409.13652","paper":"/paper/oats-outlier-aware-pruning-through-sparse-and","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephenqz/oats","path":"data_utils.py","file_url":"https://github.com/stephenqz/oats/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e17212c620812e4","mcp_get_code":{"code_sha256":"8e17212c620812e4"}},{"arxiv_id":"2409.13474","paper":"/paper/alternate-preference-optimization-for","title":"Alternate Preference Optimization for Unlearning Factual Knowledge in Large Language Models","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molereddy/Alternate-Preference-Optimization","path":"generate.py","file_url":"https://github.com/molereddy/Alternate-Preference-Optimization/blob/HEAD/generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78733604aac3e99e","mcp_get_code":{"code_sha256":"78733604aac3e99e"}},{"arxiv_id":"2409.10956","paper":"/paper/versatile-incremental-learning-towards-class","title":"Versatile Incremental Learning: Towards Class and Domain-Agnostic Incremental Learning","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khu-agi/vil","path":"datasets.py","file_url":"https://github.com/khu-agi/vil/blob/HEAD/datasets.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":"e138f1f9a877a6d3","mcp_get_code":{"code_sha256":"e138f1f9a877a6d3"}},{"arxiv_id":"2408.13036","paper":"/paper/s4d-streaming-4d-real-world-reconstruction","title":"S4D: Streaming 4D Real-World Reconstruction with Gaussians and 3D Control Points","date":"2024-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hebing-sjtu/S4D","path":"utils/data_preprocess.py","file_url":"https://github.com/hebing-sjtu/S4D/blob/HEAD/utils/data_preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d809e72b03c8d6a4","mcp_get_code":{"code_sha256":"d809e72b03c8d6a4"}},{"arxiv_id":"2408.11804","paper":"/paper/approaching-deep-learning-through-the","title":"Approaching Deep Learning through the Spectral Dynamics of Weights","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyunis/spectral_dynamics","path":"language_modeling/dataset.py","file_url":"https://github.com/dyunis/spectral_dynamics/blob/HEAD/language_modeling/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c9887b6cb835a29","mcp_get_code":{"code_sha256":"7c9887b6cb835a29"}},{"arxiv_id":"2408.09121","paper":"/paper/selective-prompt-anchoring-for-code","title":"Selective Prompt Anchoring for Code Generation","date":"2024-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magic-YuanTian/Selective-Prompt-Anchoring","path":"obsolete/obsolete/SPA_tune.py","file_url":"https://github.com/magic-YuanTian/Selective-Prompt-Anchoring/blob/HEAD/obsolete/obsolete/SPA_tune.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":"556744211a325503","mcp_get_code":{"code_sha256":"556744211a325503"}},{"arxiv_id":"2408.05087","paper":"/paper/bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cloudy1225/blnn","path":"bgrl/data.py","file_url":"https://github.com/cloudy1225/blnn/blob/HEAD/bgrl/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":"8021d44d3b828d80","mcp_get_code":{"code_sha256":"8021d44d3b828d80"}},{"arxiv_id":"2407.14245","paper":"/paper/dataset-distillation-by-automatic-training","title":"Dataset Distillation by Automatic Training Trajectories","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NiaLiu/ATT","path":"utils_baseline.py","file_url":"https://github.com/NiaLiu/ATT/blob/HEAD/utils_baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7804242e9d4e89ec","mcp_get_code":{"code_sha256":"7804242e9d4e89ec"}},{"arxiv_id":"2407.12200","paper":"/paper/this-probably-looks-exactly-like-that-an","title":"This Probably Looks Exactly Like That: An Invertible Prototypical Network","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craymichael/ProtoFlow","path":"protoflow/datasets.py","file_url":"https://github.com/craymichael/ProtoFlow/blob/HEAD/protoflow/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"code_sha256_prefix":"a30a1acd1c8065d4","mcp_get_code":{"code_sha256":"a30a1acd1c8065d4"}},{"arxiv_id":"2407.11867","paper":"/paper/single-layer-single-gradient-unlearning","title":"Unlearning Targeted Information via Single Layer Unlearning Gradient","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSIPlab/SLUG","path":"src/vlm_util.py","file_url":"https://github.com/CSIPlab/SLUG/blob/HEAD/src/vlm_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c983d4ac81c95e2","mcp_get_code":{"code_sha256":"0c983d4ac81c95e2"}},{"arxiv_id":"2407.10833","paper":"/paper/moe-diffir-task-customized-diffusion-priors","title":"MoE-DiffIR: Task-customized Diffusion Priors for Universal Compressed Image Restoration","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Justin-Tan/high-fidelity-generative-compression","path":"src/helpers/datasets.py","file_url":"https://github.com/Justin-Tan/high-fidelity-generative-compression/blob/HEAD/src/helpers/datasets.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":"4bde06f8d5798cfa","mcp_get_code":{"code_sha256":"4bde06f8d5798cfa"}},{"arxiv_id":"2407.10490","paper":"/paper/learning-dynamics-of-llm-finetuning","title":"Learning Dynamics of LLM Finetuning","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshua-ren/learning_dynamics_llm","path":"src/preference_datasets.py","file_url":"https://github.com/joshua-ren/learning_dynamics_llm/blob/HEAD/src/preference_datasets.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":"8fa0d07c713b5722","mcp_get_code":{"code_sha256":"8fa0d07c713b5722"}},{"arxiv_id":"2407.09014","paper":"/paper/compact-compressing-retrieved-documents","title":"CompAct: Compressing Retrieved Documents Actively for Question Answering","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmis-lab/CompAct","path":"utils.py","file_url":"https://github.com/dmis-lab/CompAct/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09b933c4a5249e81","mcp_get_code":{"code_sha256":"09b933c4a5249e81"}},{"arxiv_id":"2407.07084","paper":"/paper/stabilized-proximal-point-methods-for","title":"Stabilized Proximal-Point Methods for Federated Optimization","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlolab/s-dane","path":"src/datasets.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cfac3c404e669f4e","mcp_get_code":{"code_sha256":"cfac3c404e669f4e"}},{"arxiv_id":"2407.05342","paper":"/paper/mind-the-interference-retaining-pre-trained","title":"Mind the Interference: Retaining Pre-trained Knowledge in Parameter Efficient Continual Learning of Vision-Language Models","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lloongx/diki","path":"DIKI/datasets.py","file_url":"https://github.com/lloongx/diki/blob/HEAD/DIKI/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3fd5b3a0c63d826c","mcp_get_code":{"code_sha256":"3fd5b3a0c63d826c"}},{"arxiv_id":"2407.01521","paper":"/paper/improving-diffusion-inverse-problem-solving","title":"Improving Diffusion Inverse Problem Solving with Decoupled Noise Annealing","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangbingliang2019/DAPS","path":"data.py","file_url":"https://github.com/zhangbingliang2019/DAPS/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f5ce1a27c831a63","mcp_get_code":{"code_sha256":"5f5ce1a27c831a63"}},{"arxiv_id":"2407.01624","paper":"/paper/guided-trajectory-generation-with-diffusion","title":"Guided Trajectory Generation with Diffusion Models for Offline Model-based Optimization","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbsxodud-11/gtg","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/dbsxodud-11/gtg/blob/HEAD/diffuser/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b688f0cd038f65e","mcp_get_code":{"code_sha256":"6b688f0cd038f65e"}},{"arxiv_id":"2406.19215","paper":"/paper/seakr-self-aware-knowledge-retrieval-for","title":"SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/seakr","path":"SEAKR/dataset.py","file_url":"https://github.com/thu-keg/seakr/blob/HEAD/SEAKR/dataset.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":"c39d142cd9d5522d","mcp_get_code":{"code_sha256":"c39d142cd9d5522d"}},{"arxiv_id":"2406.16201","paper":"/paper/blind-baselines-beat-membership-inference","title":"Blind Baselines Beat Membership Inference Attacks for Foundation Models","date":"2024-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-spylab/Blind-MIA","path":"utils.py","file_url":"https://github.com/ethz-spylab/Blind-MIA/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":"348d8ac9dcf63733","mcp_get_code":{"code_sha256":"348d8ac9dcf63733"}},{"arxiv_id":"2406.15664","paper":"/paper/flat-posterior-does-matter-for-bayesian","title":"Flat Posterior Does Matter For Bayesian Model Averaging","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlai-yonsei/sa-bma","path":"utils/utils.py","file_url":"https://github.com/mlai-yonsei/sa-bma/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"db4ee3d0d6d174db","mcp_get_code":{"code_sha256":"db4ee3d0d6d174db"}},{"arxiv_id":"2406.15267","paper":"/paper/evaluating-diversity-in-automatic-poetry","title":"Evaluating Diversity in Automatic Poetry Generation","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hgroener/diversity_in_poetry_generation","path":"diversity-in-poetry-generation/helper_functions.py","file_url":"https://github.com/hgroener/diversity_in_poetry_generation/blob/HEAD/diversity-in-poetry-generation/helper_functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"873b466167adf60b","mcp_get_code":{"code_sha256":"873b466167adf60b"}},{"arxiv_id":"2406.14898","paper":"/paper/safely-learning-with-private-data-a-federated","title":"Safely Learning with Private Data: A Federated Learning Framework for Large Language Model","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAP-LLM/SplitFedLLM","path":"Fed-Llama-module/get_dataloader.py","file_url":"https://github.com/TAP-LLM/SplitFedLLM/blob/HEAD/Fed-Llama-module/get_dataloader.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":"bbadfd71e6cb762a","mcp_get_code":{"code_sha256":"bbadfd71e6cb762a"}},{"arxiv_id":"2406.14898","paper":"/paper/safely-learning-with-private-data-a-federated","title":"Safely Learning with Private Data: A Federated Learning Framework for Large Language Model","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAP-LLM/SplitFedLLM","path":"Fed-Llama-module/get_dataloader_no_pad.py","file_url":"https://github.com/TAP-LLM/SplitFedLLM/blob/HEAD/Fed-Llama-module/get_dataloader_no_pad.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":"d3c04ccf9dc3326e","mcp_get_code":{"code_sha256":"d3c04ccf9dc3326e"}},{"arxiv_id":"2406.10594","paper":"/paper/blockpruner-fine-grained-pruning-for-large","title":"BlockPruner: Fine-grained Pruning for Large Language Models","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrGGLS/BlockPruner","path":"utils.py","file_url":"https://github.com/MrGGLS/BlockPruner/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":"d4c8796ef8d53b49","mcp_get_code":{"code_sha256":"d4c8796ef8d53b49"}},{"arxiv_id":"2406.07302","paper":"/paper/bertaqa-how-much-do-language-models-know","title":"BertaQA: How Much Do Language Models Know About Local Culture?","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juletx/bertaqa","path":"translate/translate_dataset_few_shot.py","file_url":"https://github.com/juletx/bertaqa/blob/HEAD/translate/translate_dataset_few_shot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e859752b12f6b7b5","mcp_get_code":{"code_sha256":"e859752b12f6b7b5"}},{"arxiv_id":"2406.07302","paper":"/paper/bertaqa-how-much-do-language-models-know","title":"BertaQA: How Much Do Language Models Know About Local Culture?","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juletx/bertaqa","path":"translate/translate_dataset_madlad.py","file_url":"https://github.com/juletx/bertaqa/blob/HEAD/translate/translate_dataset_madlad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2be3ed4b02dce2bf","mcp_get_code":{"code_sha256":"2be3ed4b02dce2bf"}},{"arxiv_id":"2406.05948","paper":"/paper/chain-of-scrutiny-detecting-backdoor-attacks","title":"Chain-of-Scrutiny: Detecting Backdoor Attacks for Large Language Models","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixi1994/CoS","path":"utils.py","file_url":"https://github.com/lixi1994/CoS/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a969ef50423f246","mcp_get_code":{"code_sha256":"9a969ef50423f246"}},{"arxiv_id":"2406.03872","paper":"/paper/blsp-emo-towards-empathetic-large-speech","title":"BLSP-Emo: Towards Empathetic Large Speech-Language Models","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwang621/blsp-emo","path":"emotion_text_generation.py","file_url":"https://github.com/cwang621/blsp-emo/blob/HEAD/emotion_text_generation.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":"dbbd427d8be0e03a","mcp_get_code":{"code_sha256":"dbbd427d8be0e03a"}},{"arxiv_id":"2406.03793","paper":"/paper/low-rank-similarity-mining-for-multimodal","title":"Low-Rank Similarity Mining for Multimodal Dataset Distillation","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silicx/LoRS_Distill","path":"src/utils.py","file_url":"https://github.com/silicx/LoRS_Distill/blob/HEAD/src/utils.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":"2a69179a8e3a05a4","mcp_get_code":{"code_sha256":"2a69179a8e3a05a4"}},{"arxiv_id":"2406.03158","paper":"/paper/css-contrastive-semantic-similarity-for","title":"CSS: Contrastive Semantic Similarity for Uncertainty Quantification of LLMs","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aoshuang92/css_uq_llms","path":"UQ-CSS/dataeval/nq_open.py","file_url":"https://github.com/aoshuang92/css_uq_llms/blob/HEAD/UQ-CSS/dataeval/nq_open.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4046d4dc3282ea6c","mcp_get_code":{"code_sha256":"4046d4dc3282ea6c"}},{"arxiv_id":"2406.03158","paper":"/paper/css-contrastive-semantic-similarity-for","title":"CSS: Contrastive Semantic Similarity for Uncertainty Quantification of LLMs","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aoshuang92/css_uq_llms","path":"UQ-CSS/dataeval/triviaqa.py","file_url":"https://github.com/aoshuang92/css_uq_llms/blob/HEAD/UQ-CSS/dataeval/triviaqa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ded65a0007a6b079","mcp_get_code":{"code_sha256":"ded65a0007a6b079"}},{"arxiv_id":"2406.02645","paper":"/paper/astral-training-physics-informed-neural","title":"Astral: training physics-informed neural networks with error majorants","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4gnskq5g2s-collab/Astral","path":"datasets/magnetostatics.py","file_url":"https://github.com/4gnskq5g2s-collab/Astral/blob/HEAD/datasets/magnetostatics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"code_sha256_prefix":"3d70b75be6df62eb","mcp_get_code":{"code_sha256":"3d70b75be6df62eb"}},{"arxiv_id":"2406.02309","paper":"/paper/effects-of-exponential-gaussian-distribution","title":"Effects of Exponential Gaussian Distribution on (Double Sampling) Randomized Smoothing","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdano1/eg-on-smoothing","path":"datasets.py","file_url":"https://github.com/tdano1/eg-on-smoothing/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ebd680ff3d6e442b","mcp_get_code":{"code_sha256":"ebd680ff3d6e442b"}},{"arxiv_id":"2406.02066","paper":"/paper/preference-optimization-for-molecule","title":"Preference Optimization for Molecule Synthesis with Conditional Residual Energy-based Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SongtaoLiu0823/CREBM","path":"Forward_model/forward_preprocess.py","file_url":"https://github.com/SongtaoLiu0823/CREBM/blob/HEAD/Forward_model/forward_preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eff77b1103611612","mcp_get_code":{"code_sha256":"eff77b1103611612"}},{"arxiv_id":"2406.18561","paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e29d3dc3ccef05d1","mcp_get_code":{"code_sha256":"e29d3dc3ccef05d1"}},{"arxiv_id":"2405.17476","paper":"/paper/how-to-leverage-diverse-demonstrations-in","title":"How to Leverage Diverse Demonstrations in Offline Imitation Learning","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liziniu/ISWBC","path":"mujoco/dataset_utils.py","file_url":"https://github.com/liziniu/ISWBC/blob/HEAD/mujoco/dataset_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f013924cbc909a48","mcp_get_code":{"code_sha256":"f013924cbc909a48"}},{"arxiv_id":"2405.15182","paper":"/paper/rflpa-a-robust-federated-learning-framework","title":"RFLPA: A Robust Federated Learning Framework against Poisoning Attacks with Secure Aggregation","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NusIoraPrivacy/RFLPA","path":"utils/data_utils.py","file_url":"https://github.com/NusIoraPrivacy/RFLPA/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2b8318c9b2f3a840","mcp_get_code":{"code_sha256":"2b8318c9b2f3a840"}},{"arxiv_id":"2405.14790","paper":"/paper/didi-diffusion-guided-diversity-for-offline","title":"DIDI: Diffusion-Guided Diversity for Offline Behavioral Generation","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huey0528/icml24didi","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/huey0528/icml24didi/blob/HEAD/diffuser/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b688f0cd038f65e","mcp_get_code":{"code_sha256":"6b688f0cd038f65e"}},{"arxiv_id":"2405.14124","paper":"/paper/mixture-of-experts-meets-prompt-based","title":"Mixture of Experts Meets Prompt-Based Continual Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Minhchuyentoancbn/MoE_PromptCL","path":"datasets.py","file_url":"https://github.com/Minhchuyentoancbn/MoE_PromptCL/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":"f8e1687c33938e06","mcp_get_code":{"code_sha256":"f8e1687c33938e06"}},{"arxiv_id":"2405.12591","paper":"/paper/unlocking-data-free-low-bit-quantization-with","title":"Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lpyhdzx/DecoQuant_code","path":"icl/icl_dataset_loading.py","file_url":"https://github.com/lpyhdzx/DecoQuant_code/blob/HEAD/icl/icl_dataset_loading.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"062aa2adf5c6b989","mcp_get_code":{"code_sha256":"062aa2adf5c6b989"}},{"arxiv_id":"2405.11966","paper":"/paper/multiple-choice-questions-are-efficient-and","title":"Multiple-Choice Questions are Efficient and Robust LLM Evaluators","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geralt-targaryen/mc-evaluation","path":"dataset_mc.py","file_url":"https://github.com/geralt-targaryen/mc-evaluation/blob/HEAD/dataset_mc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e525717c83bf96cd","mcp_get_code":{"code_sha256":"e525717c83bf96cd"}},{"arxiv_id":"2405.09882","paper":"/paper/diffam-diffusion-based-adversarial-makeup","title":"DiffAM: Diffusion-based Adversarial Makeup Transfer for Facial Privacy Protection","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HansSunY/DiffAM","path":"datasets/data_utils.py","file_url":"https://github.com/HansSunY/DiffAM/blob/HEAD/datasets/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"414cb905a4aa4afe","mcp_get_code":{"code_sha256":"414cb905a4aa4afe"}},{"arxiv_id":"2405.01762","paper":"/paper/eig-search-generating-edge-induced-subgraphs","title":"EiG-Search: Generating Edge-Induced Subgraphs for GNN Explanation in Linear Time","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sluxsr/EiG-Search","path":"Utils/datasets.py","file_url":"https://github.com/sluxsr/EiG-Search/blob/HEAD/Utils/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2d824f63900d439b","mcp_get_code":{"code_sha256":"2d824f63900d439b"}},{"arxiv_id":"2404.19382","paper":"/paper/probing-unlearned-diffusion-models-a","title":"Probing Unlearned Diffusion Models: A Transferable Adversarial Attack Perspective","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hxxdtd/pund","path":"src/attackers/utils/datasets.py","file_url":"https://github.com/hxxdtd/pund/blob/HEAD/src/attackers/utils/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4261419af604243","mcp_get_code":{"code_sha256":"d4261419af604243"}},{"arxiv_id":"2404.15247","paper":"/paper/xft-unlocking-the-power-of-code-instruction","title":"XFT: Unlocking the Power of Code Instruction Tuning by Simply Merging Upcycled Mixture-of-Experts","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ise-uiuc/xft","path":"experiments/collect_seed_documents.py","file_url":"https://github.com/ise-uiuc/xft/blob/HEAD/experiments/collect_seed_documents.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":"2157c279da567204","mcp_get_code":{"code_sha256":"2157c279da567204"}},{"arxiv_id":"2404.10934","paper":"/paper/shears-unstructured-sparsity-with-neural-low","title":"Shears: Unstructured Sparsity with Neural Low-rank Adapter Search","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IntelLabs/Hardware-Aware-Automated-Machine-Learning","path":"Mamba-Shedder/utils.py","file_url":"https://github.com/IntelLabs/Hardware-Aware-Automated-Machine-Learning/blob/HEAD/Mamba-Shedder/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"243565ed1729f7a2","mcp_get_code":{"code_sha256":"243565ed1729f7a2"}},{"arxiv_id":"2404.10346","paper":"/paper/self-explore-to-avoid-the-pit-improving-the","title":"Self-Explore: Enhancing Mathematical Reasoning in Language Models with Fine-grained Rewards","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hbin0701/Self-Explore","path":"dpo/prepare_dataset.py","file_url":"https://github.com/hbin0701/Self-Explore/blob/HEAD/dpo/prepare_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"48f4dfa28740b7de","mcp_get_code":{"code_sha256":"48f4dfa28740b7de"}},{"arxiv_id":"2404.09491","paper":"/paper/large-language-models-can-automatically","title":"Large Language Models Can Automatically Engineer Features for Few-Shot Tabular Learning","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sungwon-Han/FeatLLM","path":"utils.py","file_url":"https://github.com/Sungwon-Han/FeatLLM/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b72a05150d47901e","mcp_get_code":{"code_sha256":"b72a05150d47901e"}},{"arxiv_id":"2404.00563","paper":"/paper/exploiting-inter-sample-and-inter-feature","title":"Exploiting Inter-sample and Inter-feature Relations in Dataset Distillation","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VincenDen/IID","path":"DM+ours/utils.py","file_url":"https://github.com/VincenDen/IID/blob/HEAD/DM%2Bours/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}},{"arxiv_id":"2404.00563","paper":"/paper/exploiting-inter-sample-and-inter-feature","title":"Exploiting Inter-sample and Inter-feature Relations in Dataset Distillation","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VincenDen/IID","path":"IDM+ours/dc_utils.py","file_url":"https://github.com/VincenDen/IID/blob/HEAD/IDM%2Bours/dc_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b08d76e23b09de8","mcp_get_code":{"code_sha256":"3b08d76e23b09de8"}},{"arxiv_id":"2403.17259","paper":"/paper/diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntkien1904/dmns","path":"data_process.py","file_url":"https://github.com/ntkien1904/dmns/blob/HEAD/data_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8809d11195f7db74","mcp_get_code":{"code_sha256":"8809d11195f7db74"}},{"arxiv_id":"2403.13249","paper":"/paper/a-unified-and-general-framework-for-continual","title":"A Unified and General Framework for Continual Learning","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/cl-refresh-learning","path":"models/rpc.py","file_url":"https://github.com/joey-wang123/cl-refresh-learning/blob/HEAD/models/rpc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac2160d3abca95cb","mcp_get_code":{"code_sha256":"ac2160d3abca95cb"}},{"arxiv_id":"2403.11882","paper":"/paper/regennet-towards-human-action-reaction","title":"ReGenNet: Towards Human Action-Reaction Synthesis","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangxuy/ReGenNet","path":"data_loaders/get_data.py","file_url":"https://github.com/liangxuy/ReGenNet/blob/HEAD/data_loaders/get_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4311f38d177d875b","mcp_get_code":{"code_sha256":"4311f38d177d875b"}},{"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":"libs_m/ct/runnables/run_utils.py","file_url":"https://github.com/samholt/ode-discovery-for-longitudinal-heterogeneous-treatment-effects-inference/blob/HEAD/libs_m/ct/runnables/run_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f5266a8e125a9f4","mcp_get_code":{"code_sha256":"4f5266a8e125a9f4"}},{"arxiv_id":"2403.06768","paper":"/paper/xb-maml-learning-expandable-basis-parameters","title":"XB-MAML: Learning Expandable Basis Parameters for Effective Meta-Learning with Wide Task Coverage","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnjaejunlee95/xb-maml","path":"datasets/get_dataset.py","file_url":"https://github.com/johnjaejunlee95/xb-maml/blob/HEAD/datasets/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":"5cb3b09c4155225e","mcp_get_code":{"code_sha256":"5cb3b09c4155225e"}},{"arxiv_id":"2403.06668","paper":"/paper/peeraid-improving-adversarial-distillation","title":"PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutor","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaewonalive/peeraid","path":"datasets/datasets.py","file_url":"https://github.com/jaewonalive/peeraid/blob/HEAD/datasets/datasets.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":"504291361960acd9","mcp_get_code":{"code_sha256":"504291361960acd9"}},{"arxiv_id":"2403.02689","paper":"/paper/deep-common-feature-mining-for-efficient","title":"Deep Common Feature Mining for Efficient Video Semantic Segmentation","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buaahugegun/dcfm","path":"datasets/cityscapes.py","file_url":"https://github.com/buaahugegun/dcfm/blob/HEAD/datasets/cityscapes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"913db018c110c536","mcp_get_code":{"code_sha256":"913db018c110c536"}},{"arxiv_id":"2403.02689","paper":"/paper/deep-common-feature-mining-for-efficient","title":"Deep Common Feature Mining for Efficient Video Semantic Segmentation","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buaahugegun/dcfm","path":"datasets/camvid.py","file_url":"https://github.com/buaahugegun/dcfm/blob/HEAD/datasets/camvid.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"10c47a89aaf107b7","mcp_get_code":{"code_sha256":"10c47a89aaf107b7"}},{"arxiv_id":"2403.02689","paper":"/paper/deep-common-feature-mining-for-efficient","title":"Deep Common Feature Mining for Efficient Video Semantic Segmentation","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buaahugegun/dcfm","path":"datasets/vspw.py","file_url":"https://github.com/buaahugegun/dcfm/blob/HEAD/datasets/vspw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf289ce14602f49c","mcp_get_code":{"code_sha256":"bf289ce14602f49c"}},{"arxiv_id":"2403.01101","paper":"/paper/feature-alignment-rethinking-efficient-active","title":"Feature Alignment: Rethinking Efficient Active Learning via Proxy in the Context of Pre-trained Models","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZiTingW/asvp","path":"dataset_model.py","file_url":"https://github.com/ZiTingW/asvp/blob/HEAD/dataset_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e23617191c77742","mcp_get_code":{"code_sha256":"9e23617191c77742"}},{"arxiv_id":"2403.00999","paper":"/paper/distributional-dataset-distillation-with","title":"Distributional Dataset Distillation with Subtask Decomposition","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnytqin/d3","path":"utils.py","file_url":"https://github.com/sunnytqin/d3/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"95ba2cb15ce11fa9","mcp_get_code":{"code_sha256":"95ba2cb15ce11fa9"}},{"arxiv_id":"2402.18846","paper":"/paper/multi-fidelity-residual-neural-processes-for","title":"Multi-Fidelity Residual Neural Processes for Scalable Surrogate Modeling","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/mfrnp","path":"lib/utils.py","file_url":"https://github.com/rose-stl-lab/mfrnp/blob/HEAD/lib/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fac4b8f5a66f6148","mcp_get_code":{"code_sha256":"fac4b8f5a66f6148"}},{"arxiv_id":"2402.17497","paper":"/paper/rear-a-relevance-aware-retrieval-augmented","title":"REAR: A Relevance-Aware Retrieval-Augmented Framework for Open-Domain Question Answering","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/REAR","path":"rear/src/dataset.py","file_url":"https://github.com/RUCAIBox/REAR/blob/HEAD/rear/src/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f8e1820fdc2e76b","mcp_get_code":{"code_sha256":"9f8e1820fdc2e76b"}},{"arxiv_id":"2402.15509","paper":"/paper/seamless-human-motion-composition-with","title":"Seamless Human Motion Composition with Blended Positional Encodings","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BarqueroGerman/FlowMDM","path":"data_loaders/get_data.py","file_url":"https://github.com/BarqueroGerman/FlowMDM/blob/HEAD/data_loaders/get_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"ac9ef5c0598455fa","mcp_get_code":{"code_sha256":"ac9ef5c0598455fa"}},{"arxiv_id":"2402.14418","paper":"/paper/uncertainty-aware-evaluation-for-vision","title":"Uncertainty-Aware Evaluation for Vision-Language Models","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ensec-ai/vlm-uncertainty-bench","path":"data_utils/utils.py","file_url":"https://github.com/ensec-ai/vlm-uncertainty-bench/blob/HEAD/data_utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e203cb8767712bd","mcp_get_code":{"code_sha256":"9e203cb8767712bd"}},{"arxiv_id":"2402.13425","paper":"/paper/investigating-the-histogram-loss-in","title":"Investigating the Histogram Loss in Regression","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marthawhite/histogram_loss","path":"atari_prediction/RL_dataset.py","file_url":"https://github.com/marthawhite/histogram_loss/blob/HEAD/atari_prediction/RL_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79cc6a1c8c188fda","mcp_get_code":{"code_sha256":"79cc6a1c8c188fda"}},{"arxiv_id":"2402.13007","paper":"/paper/improve-cross-architecture-generalization-on","title":"Improve Cross-Architecture Generalization on Dataset Distillation","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"distill-generalization-group/distill-generalization","path":"src/utils.py","file_url":"https://github.com/distill-generalization-group/distill-generalization/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}},{"arxiv_id":"2402.12052","paper":"/paper/small-models-big-insights-leveraging-slim","title":"Small Models, Big Insights: Leveraging Slim Proxy Models To Decide When and What to Retrieve for LLMs","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plageon/slimplm","path":"user_intent/finetune_llm.py","file_url":"https://github.com/plageon/slimplm/blob/HEAD/user_intent/finetune_llm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a49b2e989e8da871","mcp_get_code":{"code_sha256":"a49b2e989e8da871"}},{"arxiv_id":"2402.10193","paper":"/paper/bitdelta-your-fine-tune-may-only-be-worth-one","title":"BitDelta: Your Fine-Tune May Only Be Worth One Bit","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FasterDecoding/BitDelta","path":"bitdelta/data.py","file_url":"https://github.com/FasterDecoding/BitDelta/blob/HEAD/bitdelta/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":"3ab4b98edc5243cf","mcp_get_code":{"code_sha256":"3ab4b98edc5243cf"}},{"arxiv_id":"2402.09711","paper":"/paper/node-duplication-improves-cold-start-link","title":"Node Duplication Improves Cold-start Link Prediction","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/nodedup","path":"utils.py","file_url":"https://github.com/snap-research/nodedup/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"11862e6f26533aa2","mcp_get_code":{"code_sha256":"11862e6f26533aa2"}},{"arxiv_id":"2402.05585","paper":"/paper/neural-functional-a-posteriori-error","title":"Neural functional a posteriori error estimates","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"VLSF/UQNO","path":"datasets/PiNN_datasets/Anisotropic_diffusion.py","file_url":"https://github.com/VLSF/UQNO/blob/HEAD/datasets/PiNN_datasets/Anisotropic_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"code_sha256_prefix":"fdb0ab19e82b1306","mcp_get_code":{"code_sha256":"fdb0ab19e82b1306"}},{"arxiv_id":"2402.03325","paper":"/paper/connect-later-improving-fine-tuning-for","title":"Connect Later: Improving Fine-tuning for Robustness with Targeted Augmentations","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"helenqu/connect-later","path":"connect_later/pretrain.py","file_url":"https://github.com/helenqu/connect-later/blob/HEAD/connect_later/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8339f116bb89252e","mcp_get_code":{"code_sha256":"8339f116bb89252e"}},{"arxiv_id":"2401.15545","paper":"/paper/ppm-automated-generation-of-diverse","title":"PPM: Automated Generation of Diverse Programming Problems for Benchmarking Code Generation Models","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seekingdream/ppm","path":"utils.py","file_url":"https://github.com/seekingdream/ppm/blob/HEAD/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":"c05ca4aa52060818","mcp_get_code":{"code_sha256":"c05ca4aa52060818"}},{"arxiv_id":"2401.14404","paper":"/paper/deconstructing-denoising-diffusion-models-for","title":"Deconstructing Denoising Diffusion Models for Self-Supervised Learning","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futurexiang/ddae","path":"datasets.py","file_url":"https://github.com/futurexiang/ddae/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d06602608a4c8b82","mcp_get_code":{"code_sha256":"d06602608a4c8b82"}},{"arxiv_id":"2401.09787","paper":"/paper/querying-easily-flip-flopped-samples-for-deep","title":"Querying Easily Flip-flopped Samples for Deep Active Learning","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipcng00/ldm-s","path":"utils.py","file_url":"https://github.com/ipcng00/ldm-s/blob/HEAD/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":"7b278cc6639a5f0f","mcp_get_code":{"code_sha256":"7b278cc6639a5f0f"}},{"arxiv_id":"2401.07091","paper":"/paper/optimization-of-inter-group-criteria-for-1","title":"Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints","date":"2024-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmurtinho/sizeconstrainedspacing","path":"get_datasets.py","file_url":"https://github.com/lmurtinho/sizeconstrainedspacing/blob/HEAD/get_datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c62a4f3fa4a95892","mcp_get_code":{"code_sha256":"c62a4f3fa4a95892"}},{"arxiv_id":"2401.05224","paper":"/paper/do-vision-and-language-encoders-represent-the","title":"Do Vision and Language Encoders Represent the World Similarly?","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayug/0-shot-llm-vision","path":"get_embeds.py","file_url":"https://github.com/mayug/0-shot-llm-vision/blob/HEAD/get_embeds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f40c7670988619a9","mcp_get_code":{"code_sha256":"f40c7670988619a9"}},{"arxiv_id":"2401.03253","paper":"/paper/large-language-models-as-visual-cross-domain","title":"VLLaVO: Mitigating Visual Gap through LLMs","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LL-a-VO/VLLaVO","path":"script/finetune_llama.py","file_url":"https://github.com/LL-a-VO/VLLaVO/blob/HEAD/script/finetune_llama.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"20b4c3e3fe9a2903","mcp_get_code":{"code_sha256":"20b4c3e3fe9a2903"}},{"arxiv_id":"2401.03140","paper":"/paper/fair-sampling-in-diffusion-models-through","title":"Fair Sampling in Diffusion Models through Switching Mechanism","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uzn36/attributeswitching","path":"data.py","file_url":"https://github.com/uzn36/attributeswitching/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c9ac5b0c1a4e7ba8","mcp_get_code":{"code_sha256":"c9ac5b0c1a4e7ba8"}},{"arxiv_id":"2312.14334","paper":"/paper/dp-adambc-your-dp-adam-is-actually-dp-sgd","title":"DP-AdamBC: Your DP-Adam Is Actually DP-SGD (Unless You Apply Bias Correction)","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-systopia/DP-AdamBC","path":"GNN/dataset_readers.py","file_url":"https://github.com/ubc-systopia/DP-AdamBC/blob/HEAD/GNN/dataset_readers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"121952d8992f6d6c","mcp_get_code":{"code_sha256":"121952d8992f6d6c"}},{"arxiv_id":"2312.13150","paper":"/paper/splatter-image-ultra-fast-single-view-3d","title":"Splatter Image: Ultra-Fast Single-View 3D Reconstruction","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szymanowiczs/splatter-image","path":"datasets/dataset_factory.py","file_url":"https://github.com/szymanowiczs/splatter-image/blob/HEAD/datasets/dataset_factory.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":"b5a916135f9af643","mcp_get_code":{"code_sha256":"b5a916135f9af643"}},{"arxiv_id":"2312.08912","paper":"/paper/dataset-distillation-via-adversarial","title":"Dataset Distillation via Adversarial Prediction Matching","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mchen725/DD_APM","path":"model_train/utils_train.py","file_url":"https://github.com/mchen725/DD_APM/blob/HEAD/model_train/utils_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d4fd7dddaa5832f7","mcp_get_code":{"code_sha256":"d4fd7dddaa5832f7"}},{"arxiv_id":"2312.08912","paper":"/paper/dataset-distillation-via-adversarial","title":"Dataset Distillation via Adversarial Prediction Matching","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mchen725/DD_APM","path":"utils.py","file_url":"https://github.com/mchen725/DD_APM/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":"08f5583a762e7e3f","mcp_get_code":{"code_sha256":"08f5583a762e7e3f"}},{"arxiv_id":"2312.05994","paper":"/paper/mir-ref-a-representation-evaluation-framework","title":"mir_ref: A Representation Evaluation Framework for Music Information Retrieval Tasks","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrispla/mir_ref","path":"mir_ref/datasets/dataset.py","file_url":"https://github.com/chrispla/mir_ref/blob/HEAD/mir_ref/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":"165e653904b5d4bf","mcp_get_code":{"code_sha256":"165e653904b5d4bf"}},{"arxiv_id":"2312.04511","paper":"/paper/an-llm-compiler-for-parallel-function-calling","title":"An LLM Compiler for Parallel Function Calling","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SqueezeAILab/LLMCompiler","path":"run_llm_compiler.py","file_url":"https://github.com/SqueezeAILab/LLMCompiler/blob/HEAD/run_llm_compiler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"043822c772e52ed3","mcp_get_code":{"code_sha256":"043822c772e52ed3"}},{"arxiv_id":"2312.01648","paper":"/paper/characterizing-large-language-model-geometry","title":"Characterizing Large Language Model Geometry Helps Solve Toxicity Detection and Generation","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"randallbalestriero/splinellm","path":"data_utils.py","file_url":"https://github.com/randallbalestriero/splinellm/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"edb3dc8a5aa98bf3","mcp_get_code":{"code_sha256":"edb3dc8a5aa98bf3"}},{"arxiv_id":"2312.00761","paper":"/paper/deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangamesh-kodge/class_forgetting","path":"utils.py","file_url":"https://github.com/sangamesh-kodge/class_forgetting/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":"8b15af7b68969b28","mcp_get_code":{"code_sha256":"8b15af7b68969b28"}},{"arxiv_id":"2311.16086","paper":"/paper/mast-model-agnostic-sparsified-training","title":"MAST: Model-Agnostic Sparsified Training","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstmish/opt_methods","path":"optmethods/datasets/utils.py","file_url":"https://github.com/konstmish/opt_methods/blob/HEAD/optmethods/datasets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cd5ec08dd0ca1a0","mcp_get_code":{"code_sha256":"5cd5ec08dd0ca1a0"}},{"arxiv_id":"2311.13718","paper":"/paper/a-unified-approach-to-count-based-weakly","title":"A Unified Approach to Count-Based Weakly-Supervised Learning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucla-starai/countloss","path":"PU/helper.py","file_url":"https://github.com/ucla-starai/countloss/blob/HEAD/PU/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"da1592b4d04a4a80","mcp_get_code":{"code_sha256":"da1592b4d04a4a80"}},{"arxiv_id":"2311.10908","paper":"/paper/equivariant-neural-operator-learning-with-1","title":"Equivariant Neural Operator Learning with Graphon Convolution","date":"2023-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ccr-cheng/infgcn-pytorch","path":"datasets/_base.py","file_url":"https://github.com/ccr-cheng/infgcn-pytorch/blob/HEAD/datasets/_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2aecf36589a80032","mcp_get_code":{"code_sha256":"2aecf36589a80032"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_BioBART_HQS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_BioBART_HQS.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":"1e2ebb819a8fa6f4","mcp_get_code":{"code_sha256":"1e2ebb819a8fa6f4"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_mt5_MDS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_mt5_MDS.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":"aefc015a9e203048","mcp_get_code":{"code_sha256":"aefc015a9e203048"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_pega_HQS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_pega_HQS.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":"0ba05c51d5e75fa5","mcp_get_code":{"code_sha256":"0ba05c51d5e75fa5"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_bart_HQS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_bart_HQS.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":"5b2b3cf5fa2ba68e","mcp_get_code":{"code_sha256":"5b2b3cf5fa2ba68e"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_pega_RRS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_pega_RRS.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":"0720dc4ed40173aa","mcp_get_code":{"code_sha256":"0720dc4ed40173aa"}},{"arxiv_id":"2311.02271","paper":"/paper/famesumm-investigating-and-improving","title":"FaMeSumm: Investigating and Improving Faithfulness of Medical Summarization","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/FaMeSumm","path":"train_t5_HQS.py","file_url":"https://github.com/psunlpgroup/FaMeSumm/blob/HEAD/train_t5_HQS.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":"b88daf37a564369f","mcp_get_code":{"code_sha256":"b88daf37a564369f"}},{"arxiv_id":"2311.01331","paper":"/paper/offline-imitation-from-observation-via-primal","title":"Offline Imitation from Observation via Primal Wasserstein State Occupancy Matching","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiYan289/PW-DICE","path":"PWDICE_continuous/dataset.py","file_url":"https://github.com/KaiYan289/PW-DICE/blob/HEAD/PWDICE_continuous/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2b68a6cee77f95fb","mcp_get_code":{"code_sha256":"2b68a6cee77f95fb"}},{"arxiv_id":"2310.20587","paper":"/paper/unleashing-the-power-of-pre-trained-language","title":"Unleashing the Power of Pre-trained Language Models for Offline Reinforcement Learning","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"srzer/LaMo-2023","path":"experiment-atari/get_nlp_datasets.py","file_url":"https://github.com/srzer/LaMo-2023/blob/HEAD/experiment-atari/get_nlp_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a42366e534210e01","mcp_get_code":{"code_sha256":"a42366e534210e01"}},{"arxiv_id":"2310.19906","paper":"/paper/interpretable-prototype-based-graph-1","title":"Interpretable Prototype-based Graph Information Bottleneck","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sang-woo-seo/pgib","path":"models/train_gnns.py","file_url":"https://github.com/sang-woo-seo/pgib/blob/HEAD/models/train_gnns.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"08d682ad45ea4a1a","mcp_get_code":{"code_sha256":"08d682ad45ea4a1a"}},{"arxiv_id":"2310.13888","paper":"/paper/towards-a-general-framework-for-continual","title":"Towards a General Framework for Continual Learning with Pre-training","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/HiDe-Prompt","path":"datasets.py","file_url":"https://github.com/thu-ml/HiDe-Prompt/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":"f8e1687c33938e06","mcp_get_code":{"code_sha256":"f8e1687c33938e06"}},{"arxiv_id":"2310.10807","paper":"/paper/regularization-properties-of-adversarially-1","title":"Regularization properties of adversarially-trained linear regression","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antonior92/advtrain-linreg","path":"datasets.py","file_url":"https://github.com/antonior92/advtrain-linreg/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a90f732312ff406","mcp_get_code":{"code_sha256":"6a90f732312ff406"}},{"arxiv_id":"2310.10266","paper":"/paper/generative-calibration-for-in-context","title":"Generative Calibration for In-context Learning","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changmenseng/generative_calibration","path":"src/dataset.py","file_url":"https://github.com/changmenseng/generative_calibration/blob/HEAD/src/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d5584bc76ca4467","mcp_get_code":{"code_sha256":"5d5584bc76ca4467"}},{"arxiv_id":"2310.07855","paper":"/paper/cribo-self-supervised-learning-via-cross","title":"CrIBo: Self-Supervised Learning via Cross-Image Object-Level Bootstrapping","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tileb1/CrIBo","path":"cribo_utils/datasets.py","file_url":"https://github.com/tileb1/CrIBo/blob/HEAD/cribo_utils/datasets.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":"926a150d0fa15e5a","mcp_get_code":{"code_sha256":"926a150d0fa15e5a"}},{"arxiv_id":"2310.04604","paper":"/paper/privit-vision-transformers-for-fast-private","title":"PriViT: Vision Transformers for Fast Private Inference","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dice-lab/privit","path":"src/dataset.py","file_url":"https://github.com/nyu-dice-lab/privit/blob/HEAD/src/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fc61a40cf68e5911","mcp_get_code":{"code_sha256":"fc61a40cf68e5911"}},{"arxiv_id":"2310.03295","paper":"/paper/can-pre-trained-models-assist-in-dataset","title":"Can pre-trained models assist in dataset distillation?","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaolu-zjut/ddinterpreter","path":"methods/DC_DSA_DM/utils.py","file_url":"https://github.com/yaolu-zjut/ddinterpreter/blob/HEAD/methods/DC_DSA_DM/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}},{"arxiv_id":"2310.03295","paper":"/paper/can-pre-trained-models-assist-in-dataset","title":"Can pre-trained models assist in dataset distillation?","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaolu-zjut/ddinterpreter","path":"utils_clom/Dataloader.py","file_url":"https://github.com/yaolu-zjut/ddinterpreter/blob/HEAD/utils_clom/Dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d6e228049010aa8c","mcp_get_code":{"code_sha256":"d6e228049010aa8c"}},{"arxiv_id":"2310.02093","paper":"/paper/stochastic-gradient-descent-with","title":"Stochastic Gradient Descent with Preconditioned Polyak Step-size","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fxrshed/scaledsps","path":"datasets.py","file_url":"https://github.com/fxrshed/scaledsps/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ef944e03deab32b1","mcp_get_code":{"code_sha256":"ef944e03deab32b1"}},{"arxiv_id":"2310.01542","paper":"/paper/fusing-models-with-complementary-expertise","title":"Fusing Models with Complementary Expertise","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/FoE-ICLR2024","path":"cifar10_non_iid_local_gate.py","file_url":"https://github.com/hwang595/FoE-ICLR2024/blob/HEAD/cifar10_non_iid_local_gate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"311f493ff29f959c","mcp_get_code":{"code_sha256":"311f493ff29f959c"}},{"arxiv_id":"2310.00105","paper":"/paper/latent-space-symmetry-discovery","title":"Latent Space Symmetry Discovery","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiankeyang/laligan","path":"src/utils.py","file_url":"https://github.com/jiankeyang/laligan/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de0fee302f192a6e","mcp_get_code":{"code_sha256":"de0fee302f192a6e"}},{"arxiv_id":"2310.00093","paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4fa3d915bca9fa98","mcp_get_code":{"code_sha256":"4fa3d915bca9fa98"}},{"arxiv_id":"2309.15048","paper":"/paper/class-incremental-learning-via-likelihood","title":"Class Incremental Learning via Likelihood Ratio Based Task Prediction","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhaowei1/tpl","path":"dataloader/data.py","file_url":"https://github.com/linhaowei1/tpl/blob/HEAD/dataloader/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d790f905cbf1f5d2","mcp_get_code":{"code_sha256":"d790f905cbf1f5d2"}},{"arxiv_id":"2309.14062","paper":"/paper/fecam-exploiting-the-heterogeneity-of-class-1","title":"FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipamgoswami/fecam","path":"FeCAM_vit_imagenet-r.py","file_url":"https://github.com/dipamgoswami/fecam/blob/HEAD/FeCAM_vit_imagenet-r.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5c8f70797dc3539","mcp_get_code":{"code_sha256":"f5c8f70797dc3539"}},{"arxiv_id":"2309.11028","paper":"/paper/the-topology-and-geometry-of-neural","title":"The Topology and Geometry of Neural Representations","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"doerlbh/topologicalrsa","path":"utils_analysis.py","file_url":"https://github.com/doerlbh/topologicalrsa/blob/HEAD/utils_analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"486bb0f2d8ee647c","mcp_get_code":{"code_sha256":"486bb0f2d8ee647c"}},{"arxiv_id":"2309.03244","paper":"/paper/egic-enhanced-low-bit-rate-generative-image","title":"EGIC: Enhanced Low-Bit-Rate Generative Image Compression Guided by Semantic Segmentation","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikolai10/egic","path":"src/eval_utils.py","file_url":"https://github.com/nikolai10/egic/blob/HEAD/src/eval_utils.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":"0c31d64965cd5f7c","mcp_get_code":{"code_sha256":"0c31d64965cd5f7c"}},{"arxiv_id":"2309.02160","paper":"/paper/bias-propagation-in-federated-learning","title":"Bias Propagation in Federated Learning","date":"2023-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"privacytrustlab/bias_in_FL","path":"save_information.py","file_url":"https://github.com/privacytrustlab/bias_in_FL/blob/HEAD/save_information.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"52fd482d17be998c","mcp_get_code":{"code_sha256":"52fd482d17be998c"}},{"arxiv_id":"2309.00916","paper":"/paper/blsp-bootstrapping-language-speech-pre-1","title":"BLSP: Bootstrapping Language-Speech Pre-training via Behavior Alignment of Continuation Writing","date":"2023-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwang621/blsp","path":"data_process/asr_text_generation.py","file_url":"https://github.com/cwang621/blsp/blob/HEAD/data_process/asr_text_generation.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":"115dd5cd6546803f","mcp_get_code":{"code_sha256":"115dd5cd6546803f"}},{"arxiv_id":"2308.15197","paper":"/paper/where-would-i-go-next-large-language-models","title":"Where Would I Go Next? Large Language Models as Human Mobility Predictors","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlwang233/llm-mob","path":"llm-mob.py","file_url":"https://github.com/xlwang233/llm-mob/blob/HEAD/llm-mob.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1fc272083b812526","mcp_get_code":{"code_sha256":"1fc272083b812526"}},{"arxiv_id":"2308.15074","paper":"/paper/exploring-model-transferability-through-the","title":"Exploring Model Transferability through the Lens of Potential Energy","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixiaotong97/ped","path":"get_dataloader.py","file_url":"https://github.com/lixiaotong97/ped/blob/HEAD/get_dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ae46af1e0d92d6f3","mcp_get_code":{"code_sha256":"ae46af1e0d92d6f3"}},{"arxiv_id":"2308.14333","paper":"/paper/diffsmooth-certifiably-robust-learning-via","title":"DiffSmooth: Certifiably Robust Learning via Diffusion Models and Local Smoothing","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"javyduck/diffsmooth","path":"datasets.py","file_url":"https://github.com/javyduck/diffsmooth/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"10346a83b21277d7","mcp_get_code":{"code_sha256":"10346a83b21277d7"}},{"arxiv_id":"2308.10278","paper":"/paper/characterchat-learning-towards-conversational","title":"CharacterChat: Learning towards Conversational AI with Personalized Social Support","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morecry/characterchat","path":"model/BERT/util.py","file_url":"https://github.com/morecry/characterchat/blob/HEAD/model/BERT/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d25feb67172fcaf","mcp_get_code":{"code_sha256":"5d25feb67172fcaf"}},{"arxiv_id":"2308.09663","paper":"/paper/gigamae-generalizable-graph-masked","title":"GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent Space Reconstruction","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sycny/gigamae","path":"datasets.py","file_url":"https://github.com/sycny/gigamae/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be622abe7c2c1836","mcp_get_code":{"code_sha256":"be622abe7c2c1836"}},{"arxiv_id":"2308.09610","paper":"/paper/on-the-effectiveness-of-layernorm-tuning-for","title":"On the Effectiveness of LayerNorm Tuning for Continual Learning in Vision Transformers","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdemin16/continual-layernorm-tuning","path":"couple/datasets.py","file_url":"https://github.com/tdemin16/continual-layernorm-tuning/blob/HEAD/couple/datasets.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":"b507dddcf36a89ad","mcp_get_code":{"code_sha256":"b507dddcf36a89ad"}},{"arxiv_id":"2308.01223","paper":"/paper/do-multilingual-language-models-think-better","title":"Do Multilingual Language Models Think Better in English?","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juletx/self-translate","path":"translate/evaluation/evaluate_translations.py","file_url":"https://github.com/juletx/self-translate/blob/HEAD/translate/evaluation/evaluate_translations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e8a271f7130594a","mcp_get_code":{"code_sha256":"5e8a271f7130594a"}},{"arxiv_id":"2307.15157","paper":"/paper/r-lpips-an-adversarially-robust-perceptual","title":"R-LPIPS: An Adversarially Robust Perceptual Similarity Metric","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saraghazanfari/r-lpips","path":"util/imagenet_dataset.py","file_url":"https://github.com/saraghazanfari/r-lpips/blob/HEAD/util/imagenet_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"3f70b5d0ae386e75","mcp_get_code":{"code_sha256":"3f70b5d0ae386e75"}},{"arxiv_id":"2307.09742","paper":"/paper/improved-distribution-matching-for-dataset-1","title":"Improved Distribution Matching for Dataset Condensation","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uitrbn/idm","path":"dc_utils.py","file_url":"https://github.com/uitrbn/idm/blob/HEAD/dc_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b08d76e23b09de8","mcp_get_code":{"code_sha256":"3b08d76e23b09de8"}},{"arxiv_id":"2307.09742","paper":"/paper/improved-distribution-matching-for-dataset-1","title":"Improved Distribution Matching for Dataset Condensation","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uitrbn/idm","path":"utils.py","file_url":"https://github.com/uitrbn/idm/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":"ea39b3f2172e9072","mcp_get_code":{"code_sha256":"ea39b3f2172e9072"}},{"arxiv_id":"2307.09520","paper":"/paper/adversarial-bayesian-augmentation-for-single","title":"Adversarial Bayesian Augmentation for Single-Source Domain Generalization","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengcheng/ABA","path":"lib/datasets/data_helper.py","file_url":"https://github.com/shengcheng/ABA/blob/HEAD/lib/datasets/data_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"39f9fa02ce767511","mcp_get_code":{"code_sha256":"39f9fa02ce767511"}},{"arxiv_id":"2307.09476","paper":"/paper/overthinking-the-truth-understanding-how","title":"Overthinking the Truth: Understanding how Language Models Process False Demonstrations","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dannyallover/overthinking_the_truth","path":"dev/prefixes.py","file_url":"https://github.com/dannyallover/overthinking_the_truth/blob/HEAD/dev/prefixes.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a0acd62bd43241e","mcp_get_code":{"code_sha256":"4a0acd62bd43241e"}},{"arxiv_id":"2307.05862","paper":"/paper/ecosystem-level-analysis-of-deployed-machine","title":"Ecosystem-level Analysis of Deployed Machine Learning Reveals Homogeneous Outcomes","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lchen001/HAPI","path":"hapi/dataset.py","file_url":"https://github.com/lchen001/HAPI/blob/HEAD/hapi/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":"40c879908f4d9b4e","mcp_get_code":{"code_sha256":"40c879908f4d9b4e"}},{"arxiv_id":"2306.13924","paper":"/paper/structuring-representation-geometry-with","title":"Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharut/care","path":"cifar10_cifar100_stl10/dataset.py","file_url":"https://github.com/sharut/care/blob/HEAD/cifar10_cifar100_stl10/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d94ccf3eb7d9607","mcp_get_code":{"code_sha256":"6d94ccf3eb7d9607"}},{"arxiv_id":"2306.13651","paper":"/paper/bring-your-own-data-self-supervised","title":"Bring Your Own Data! Self-Supervised Evaluation for Large Language Models","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neelsjain/byod","path":"BYOD/utils/hf_utils.py","file_url":"https://github.com/neelsjain/byod/blob/HEAD/BYOD/utils/hf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6745c66fbab09884","mcp_get_code":{"code_sha256":"6745c66fbab09884"}},{"arxiv_id":"2306.06955","paper":"/paper/a-brief-review-of-hypernetworks-in-deep","title":"A Brief Review of Hypernetworks in Deep Learning","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmdvinodjmd/HyperITE","path":"src/load_model_data.py","file_url":"https://github.com/jmdvinodjmd/HyperITE/blob/HEAD/src/load_model_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1d1253359cda097","mcp_get_code":{"code_sha256":"e1d1253359cda097"}},{"arxiv_id":"2305.18459","paper":"/paper/diffusion-model-is-an-effective-planner-and-1","title":"Diffusion Model is an Effective Planner and Data Synthesizer for Multi-Task Reinforcement Learning","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinnerhrhe/MTDiff","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/tinnerhrhe/MTDiff/blob/HEAD/diffuser/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b688f0cd038f65e","mcp_get_code":{"code_sha256":"6b688f0cd038f65e"}},{"arxiv_id":"2305.18381","paper":"/paper/distill-gold-from-massive-ores-efficient","title":"Distill Gold from Massive Ores: Bi-level Data Pruning towards Efficient Dataset Distillation","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silicx/goldfromores","path":"DatasetCondensation/utils.py","file_url":"https://github.com/silicx/goldfromores/blob/HEAD/DatasetCondensation/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}},{"arxiv_id":"2305.17330","paper":"/paper/madiff-offline-multi-agent-learning-with","title":"MADiff: Offline Multi-agent Learning with Diffusion Models","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbzhu99/madiff","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/zbzhu99/madiff/blob/HEAD/diffuser/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3faeb3b26f50eb5b","mcp_get_code":{"code_sha256":"3faeb3b26f50eb5b"}},{"arxiv_id":"2305.15174","paper":"/paper/simultaneous-identification-of-models-and","title":"Simultaneous identification of models and parameters of scientific simulators","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/simulation_based_model_inference","path":"sbmi/data_handling.py","file_url":"https://github.com/mackelab/simulation_based_model_inference/blob/HEAD/sbmi/data_handling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd4606d7e0a61b05","mcp_get_code":{"code_sha256":"dd4606d7e0a61b05"}},{"arxiv_id":"2305.12191","paper":"/paper/pointwise-mutual-information-based-metric-and","title":"Pointwise Mutual Information Based Metric and Decoding Strategy for Faithful Generation in Document Grounded Dialogs","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ynandwan/pmi-faith","path":"faithful-decode/models/dataset.py","file_url":"https://github.com/ynandwan/pmi-faith/blob/HEAD/faithful-decode/models/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":"856adbd7f6afcfa6","mcp_get_code":{"code_sha256":"856adbd7f6afcfa6"}},{"arxiv_id":"2305.04658","paper":"/paper/csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanchen-hust/csgcl","path":"src/dataset.py","file_url":"https://github.com/hanchen-hust/csgcl/blob/HEAD/src/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07b7797f4172c759","mcp_get_code":{"code_sha256":"07b7797f4172c759"}},{"arxiv_id":"2305.02164","paper":"/paper/nonparametric-generative-modeling-with","title":"Nonparametric Generative Modeling with Conditional Sliced-Wasserstein Flows","date":"2023-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duchao0726/conditionial-swf","path":"dataset.py","file_url":"https://github.com/duchao0726/conditionial-swf/blob/HEAD/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":"cb0a360ad67bc30e","mcp_get_code":{"code_sha256":"cb0a360ad67bc30e"}},{"arxiv_id":"2304.14377","paper":"/paper/co-slam-joint-coordinate-and-sparse","title":"Co-SLAM: Joint Coordinate and Sparse Parametric Encodings for Neural Real-Time SLAM","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HengyiWang/Co-SLAM","path":"datasets/dataset.py","file_url":"https://github.com/HengyiWang/Co-SLAM/blob/HEAD/datasets/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":"ccf2f5dc6113e1a3","mcp_get_code":{"code_sha256":"ccf2f5dc6113e1a3"}},{"arxiv_id":"2303.13245","paper":"/paper/croc-cross-view-online-clustering-for-dense","title":"CrOC: Cross-View Online Clustering for Dense Visual Representation Learning","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stegmuel/CrOC","path":"croc_utils/datasets.py","file_url":"https://github.com/stegmuel/CrOC/blob/HEAD/croc_utils/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beef3584d62ffde9","mcp_get_code":{"code_sha256":"beef3584d62ffde9"}},{"arxiv_id":"2303.11278","paper":"/paper/constructing-bayesian-pseudo-coresets-using","title":"Bayesian Pseudo-Coresets via Contrastive Divergence","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"backpropagator/bpc-cd","path":"utils.py","file_url":"https://github.com/backpropagator/bpc-cd/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":"76b4f14c90d64ecc","mcp_get_code":{"code_sha256":"76b4f14c90d64ecc"}},{"arxiv_id":"2303.07551","paper":"/paper/merging-decision-transformers-weight","title":"Merging Decision Transformers: Weight Averaging for Forming Multi-Task Policies","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daniellawson9999/merging-decision-transformers","path":"decision-transformer/experiment_multi.py","file_url":"https://github.com/daniellawson9999/merging-decision-transformers/blob/HEAD/decision-transformer/experiment_multi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0ebd221e411b411","mcp_get_code":{"code_sha256":"e0ebd221e411b411"}},{"arxiv_id":"2303.02045","paper":"/paper/uncertainty-estimation-by-fisher-information","title":"Uncertainty Estimation by Fisher Information-based Evidential Deep Learning","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danruod/iedl","path":"code_classical/dataset.py","file_url":"https://github.com/danruod/iedl/blob/HEAD/code_classical/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa86f3fc986f6913","mcp_get_code":{"code_sha256":"aa86f3fc986f6913"}},{"arxiv_id":"2302.03791","paper":"/paper/how-to-trust-your-diffusion-model-a-convex","title":"How to Trust Your Diffusion Model: A Convex Optimization Approach to Conformal Risk Control","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sulam-group/k-rcps","path":"experiments/dataset.py","file_url":"https://github.com/sulam-group/k-rcps/blob/HEAD/experiments/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"115f187875e9fdef","mcp_get_code":{"code_sha256":"115f187875e9fdef"}},{"arxiv_id":"2302.01068","paper":"/paper/fed-gloss-dp-federated-global-learning-using","title":"FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a514514772/fedlap-dp","path":"utils/misc.py","file_url":"https://github.com/a514514772/fedlap-dp/blob/HEAD/utils/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5211c024ed09fb69","mcp_get_code":{"code_sha256":"5211c024ed09fb69"}},{"arxiv_id":"2301.13816","paper":"/paper/execution-based-code-generation-using-deep","title":"Execution-based Code Generation using Deep Reinforcement Learning","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reddy-lab-code-research/PPOCoder","path":"rl_run.py","file_url":"https://github.com/reddy-lab-code-research/PPOCoder/blob/HEAD/rl_run.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":"b599a1e89442bcb7","mcp_get_code":{"code_sha256":"b599a1e89442bcb7"}},{"arxiv_id":"2301.03028","paper":"/paper/generative-time-series-forecasting-with","title":"Generative Time Series Forecasting with Diffusion, Denoise, and Disentanglement","date":"2023-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paddlepaddle/paddlespatial","path":"paddlespatial/modelzoo/road_representation/util.py","file_url":"https://github.com/paddlepaddle/paddlespatial/blob/HEAD/paddlespatial/modelzoo/road_representation/util.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":"6ceeb8c4a0f9c09d","mcp_get_code":{"code_sha256":"6ceeb8c4a0f9c09d"}},{"arxiv_id":"2301.01197","paper":"/paper/backdoor-attacks-against-dataset-distillation","title":"Backdoor Attacks Against Dataset Distillation","date":"2023-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyugeng/baadd","path":"DC/utils.py","file_url":"https://github.com/liuyugeng/baadd/blob/HEAD/DC/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":"d7bb9b31f21b0b51","mcp_get_code":{"code_sha256":"d7bb9b31f21b0b51"}},{"arxiv_id":"2212.09000","paper":"/paper/confidence-aware-training-of-smoothed-1","title":"Confidence-aware Training of Smoothed Classifiers for Certified Robustness","date":"2022-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alinlab/smoothing-catrs","path":"code/datasets.py","file_url":"https://github.com/alinlab/smoothing-catrs/blob/HEAD/code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a021efe12dc7d06","mcp_get_code":{"code_sha256":"8a021efe12dc7d06"}},{"arxiv_id":"2212.02374","paper":"/paper/understanding-the-relationship-between-over","title":"On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networks","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhonygiraldo/sjlr","path":"load_data/data.py","file_url":"https://github.com/jhonygiraldo/sjlr/blob/HEAD/load_data/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d2845200b34fc758","mcp_get_code":{"code_sha256":"d2845200b34fc758"}},{"arxiv_id":"2211.11208","paper":"/paper/next3d-generative-neural-texture","title":"Next3D: Generative Neural Texture Rasterization for 3D-Aware Head Avatars","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrTornado24/FENeRF","path":"datasets.py","file_url":"https://github.com/MrTornado24/FENeRF/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":"df709247c665b337","mcp_get_code":{"code_sha256":"df709247c665b337"}},{"arxiv_id":"2211.10586","paper":"/paper/scaling-up-dataset-distillation-to-imagenet","title":"Scaling Up Dataset Distillation to ImageNet-1K with Constant Memory","date":"2022-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justincui03/tesla","path":"utils.py","file_url":"https://github.com/justincui03/tesla/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":"78d8802dd664e3f7","mcp_get_code":{"code_sha256":"78d8802dd664e3f7"}},{"arxiv_id":"2211.05836","paper":"/paper/strong-lensing-parameter-estimation-on-ground","title":"Strong Lensing Parameter Estimation on Ground-Based Imaging Data Using Simulation-Based Inference","date":null,"month_inferred_from_arxiv_id":"2022-11","title_source":"archive","repo":"deepskies/deepsleep","path":"src/utils.py","file_url":"https://github.com/deepskies/deepsleep/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"784c9ed879a67fa8","mcp_get_code":{"code_sha256":"784c9ed879a67fa8"}},{"arxiv_id":"2211.04446","paper":"/paper/private-set-generation-with-discriminative","title":"Private Set Generation with Discriminative Information","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/Private-Set","path":"utils/misc.py","file_url":"https://github.com/DingfanChen/Private-Set/blob/HEAD/utils/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5211c024ed09fb69","mcp_get_code":{"code_sha256":"5211c024ed09fb69"}},{"arxiv_id":"2211.00680","paper":"/paper/on-the-detection-of-synthetic-images","title":"On the detection of synthetic images generated by diffusion models","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grip-unina/dmimagedetection","path":"training_code/utils/dataset.py","file_url":"https://github.com/grip-unina/dmimagedetection/blob/HEAD/training_code/utils/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":"96beb5997283006e","mcp_get_code":{"code_sha256":"96beb5997283006e"}},{"arxiv_id":"2210.16774","paper":"/paper/dataset-distillation-via-factorization","title":"Dataset Distillation via Factorization","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huage001/datasetfactorization","path":"utils.py","file_url":"https://github.com/huage001/datasetfactorization/blob/HEAD/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":"830bab09ca31d483","mcp_get_code":{"code_sha256":"830bab09ca31d483"}},{"arxiv_id":"2210.16242","paper":"/paper/fairness-certificates-for-differentially","title":"Differential Privacy has Bounded Impact on Fairness in Classification","date":"2022-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmangold/fairness-privacy","path":"load_dataset.py","file_url":"https://github.com/pmangold/fairness-privacy/blob/HEAD/load_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f271da624e89b35","mcp_get_code":{"code_sha256":"5f271da624e89b35"}},{"arxiv_id":"2210.06704","paper":"/paper/collider-a-robust-training-framework-for","title":"COLLIDER: A Robust Training Framework for Backdoor Data","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/collider","path":"data_aux.py","file_url":"https://github.com/hmdolatabadi/collider/blob/HEAD/data_aux.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3768614c02d02313","mcp_get_code":{"code_sha256":"3768614c02d02313"}},{"arxiv_id":"2209.03917","paper":"/paper/exploring-target-representations-for-masked","title":"Exploring Target Representations for Masked Autoencoders","date":"2022-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxingbin/dbot","path":"analysis/analysis.py","file_url":"https://github.com/liuxingbin/dbot/blob/HEAD/analysis/analysis.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":"481536e2fedc4873","mcp_get_code":{"code_sha256":"481536e2fedc4873"}},{"arxiv_id":"2208.10822","paper":"/paper/multimodal-across-domains-gaze-target","title":"Multimodal Across Domains Gaze Target Detection","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francescotonini/multimodal-across-domains-gaze-target-detection","path":"datasets/build.py","file_url":"https://github.com/francescotonini/multimodal-across-domains-gaze-target-detection/blob/HEAD/datasets/build.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c31b33dd2dcd201","mcp_get_code":{"code_sha256":"5c31b33dd2dcd201"}},{"arxiv_id":"2208.10330","paper":"/paper/deep-coarse-grained-potentials-via-relative","title":"Deep Coarse-grained Potentials via Relative Entropy Minimization","date":null,"month_inferred_from_arxiv_id":"2022-08","title_source":"archive","repo":"tummfm/relative-entropy","path":"chemtrain/data_processing.py","file_url":"https://github.com/tummfm/relative-entropy/blob/HEAD/chemtrain/data_processing.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":"c463d5ca2b2d5160","mcp_get_code":{"code_sha256":"c463d5ca2b2d5160"}},{"arxiv_id":"2207.09684","paper":"/paper/on-the-versatile-uses-of-partial-distance","title":"On the Versatile Uses of Partial Distance Correlation in Deep Learning","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenxingjian/partial_distance_correlation","path":"Partial_Distance_Correlation/main_pDC_models.py","file_url":"https://github.com/zhenxingjian/partial_distance_correlation/blob/HEAD/Partial_Distance_Correlation/main_pDC_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e7b15eb05cf47df","mcp_get_code":{"code_sha256":"9e7b15eb05cf47df"}},{"arxiv_id":"2206.13190","paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/cifar10_dataset.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/cifar10_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46db664ebd350aa3","mcp_get_code":{"code_sha256":"46db664ebd350aa3"}},{"arxiv_id":"2206.13190","paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/femnist_dataset.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/femnist_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02e3e53196e5871e","mcp_get_code":{"code_sha256":"02e3e53196e5871e"}},{"arxiv_id":"2206.13190","paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/mnist_dataset.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/mnist_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e34e4f12bbf9cb40","mcp_get_code":{"code_sha256":"e34e4f12bbf9cb40"}},{"arxiv_id":"2206.13190","paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/sent140_dataset.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/sent140_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f9fb06d152c383a","mcp_get_code":{"code_sha256":"3f9fb06d152c383a"}},{"arxiv_id":"2206.13190","paper":"/paper/an-empirical-study-of-personalized-federated","title":"An Empirical Study of Personalized Federated Learning","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onizukalab/fedbench","path":"code/utils/shakespeare_dataset.py","file_url":"https://github.com/onizukalab/fedbench/blob/HEAD/code/utils/shakespeare_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad7ba8392208f3dd","mcp_get_code":{"code_sha256":"ad7ba8392208f3dd"}},{"arxiv_id":"2206.12680","paper":"/paper/topology-aware-generalization-of","title":"Topology-aware Generalization of Decentralized SGD","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/generalization-of-dsgd","path":"gpu_work.py","file_url":"https://github.com/raiden-zhu/generalization-of-dsgd/blob/HEAD/gpu_work.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"685e6a1f0a9518b3","mcp_get_code":{"code_sha256":"685e6a1f0a9518b3"}},{"arxiv_id":"2206.10550","paper":"/paper/certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blaisedelattre/bridging_the_gap_rs","path":"code/datasets.py","file_url":"https://github.com/blaisedelattre/bridging_the_gap_rs/blob/HEAD/code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04c56ca301f7731e","mcp_get_code":{"code_sha256":"04c56ca301f7731e"}},{"arxiv_id":"2205.13954","paper":"/paper/geometer-graph-few-shot-class-incremental","title":"Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobinLu1209/Geometer","path":"utils_metric.py","file_url":"https://github.com/RobinLu1209/Geometer/blob/HEAD/utils_metric.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":"547b95d33b116b5b","mcp_get_code":{"code_sha256":"547b95d33b116b5b"}},{"arxiv_id":"2205.13543","paper":"/paper/revealing-the-dark-secrets-of-masked-image","title":"Revealing the Dark Secrets of Masked Image Modeling","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SwinTransformer/MIM-Depth-Estimation","path":"dataset/base_dataset.py","file_url":"https://github.com/SwinTransformer/MIM-Depth-Estimation/blob/HEAD/dataset/base_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1828822ff8e88962","mcp_get_code":{"code_sha256":"1828822ff8e88962"}},{"arxiv_id":"2205.02825","paper":"/paper/dual-octree-graph-networks-for-learning","title":"Dual Octree Graph Networks for Learning Adaptive Volumetric Shape Representations","date":"2022-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/DualOctreeGNN","path":"builder.py","file_url":"https://github.com/microsoft/DualOctreeGNN/blob/HEAD/builder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c25326e1402ace33","mcp_get_code":{"code_sha256":"c25326e1402ace33"}},{"arxiv_id":"2204.07513","paper":"/paper/synthesizing-informative-training-samples","title":"Synthesizing Informative Training Samples with GAN","date":"2022-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VICO-UoE/DatasetCondensation","path":"utils.py","file_url":"https://github.com/VICO-UoE/DatasetCondensation/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":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}},{"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":"94fefe5771a39978","mcp_get_code":{"code_sha256":"94fefe5771a39978"}},{"arxiv_id":"2203.02104","paper":"/paper/interactive-image-synthesis-with-panoptic","title":"Interactive Image Synthesis with Panoptic Layout Generation","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wb-finalking/PLGAN","path":"train_cal2i.py","file_url":"https://github.com/wb-finalking/PLGAN/blob/HEAD/train_cal2i.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":"c41b6e9f09907a9c","mcp_get_code":{"code_sha256":"c41b6e9f09907a9c"}},{"arxiv_id":"2203.01531","paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"af2d19355b2e2b4b","mcp_get_code":{"code_sha256":"af2d19355b2e2b4b"}},{"arxiv_id":"2202.01338","paper":"/paper/regression-transformer-concurrent-conditional","title":"Regression Transformer: Concurrent sequence regression and generation for molecular language modeling","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/regression-transformer","path":"terminator/datasets.py","file_url":"https://github.com/ibm/regression-transformer/blob/HEAD/terminator/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24afafc0ea6c786a","mcp_get_code":{"code_sha256":"24afafc0ea6c786a"}},{"arxiv_id":"2202.00035","paper":"/paper/learning-fair-representations-via-rate","title":"Learning Fair Representations via Rate-Distortion Maximization","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/farm","path":"src/constrained/constrained-single.py","file_url":"https://github.com/brcsomnath/farm/blob/HEAD/src/constrained/constrained-single.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fb09141828e509d0","mcp_get_code":{"code_sha256":"fb09141828e509d0"}},{"arxiv_id":"2112.11628","paper":"/paper/skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/skipnode","path":"utils/dataset.py","file_url":"https://github.com/weiganglu/skipnode/blob/HEAD/utils/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ebae84a1ad7dfa50","mcp_get_code":{"code_sha256":"ebae84a1ad7dfa50"}},{"arxiv_id":"2112.11594","paper":"/paper/gcod-graph-convolutional-network-acceleration","title":"GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rice-eic/gcod","path":"datasets.py","file_url":"https://github.com/rice-eic/gcod/blob/HEAD/datasets.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":"5c1912386ea62651","mcp_get_code":{"code_sha256":"5c1912386ea62651"}},{"arxiv_id":"2112.11450","paper":"/paper/max-margin-contrastive-learning","title":"Max-Margin Contrastive Learning","date":"2021-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anshulbshah/MMCL","path":"CIFAR100/utils.py","file_url":"https://github.com/anshulbshah/MMCL/blob/HEAD/CIFAR100/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b30248ddcadc9b7","mcp_get_code":{"code_sha256":"0b30248ddcadc9b7"}},{"arxiv_id":"2112.08654","paper":"/paper/learning-to-prompt-for-continual-learning-1","title":"Learning to Prompt for Continual Learning","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JH-LEE-KR/l2p-pytorch","path":"datasets.py","file_url":"https://github.com/JH-LEE-KR/l2p-pytorch/blob/HEAD/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"f32616c3ff9585fa","mcp_get_code":{"code_sha256":"f32616c3ff9585fa"}},{"arxiv_id":"2111.08184","paper":"/paper/air-2-for-interaction-prediction","title":"$AIR^2$ for Interaction Prediction","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"david9dragon9/air","path":"dataset.py","file_url":"https://github.com/david9dragon9/air/blob/HEAD/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":"bb26ab6633379878","mcp_get_code":{"code_sha256":"bb26ab6633379878"}},{"arxiv_id":"2111.06628","paper":"/paper/learning-to-break-deep-perceptual-hashing-the","title":"Learning to Break Deep Perceptual Hashing: The Use Case NeuralHash","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/Learning-to-Break-Deep-Perceptual-Hashing","path":"adv3_robustness_check.py","file_url":"https://github.com/ml-research/Learning-to-Break-Deep-Perceptual-Hashing/blob/HEAD/adv3_robustness_check.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02b8a2e5f0aa5da2","mcp_get_code":{"code_sha256":"02b8a2e5f0aa5da2"}},{"arxiv_id":"2111.04316","paper":"/paper/sega-semantic-guided-attention-on-visual","title":"SEGA: Semantic Guided Attention on Visual Prototype for Few-Shot Learning","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martayang/sega","path":"testcode.py","file_url":"https://github.com/martayang/sega/blob/HEAD/testcode.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50e8bcc64ea44002","mcp_get_code":{"code_sha256":"50e8bcc64ea44002"}},{"arxiv_id":"2111.04316","paper":"/paper/sega-semantic-guided-attention-on-visual","title":"SEGA: Semantic Guided Attention on Visual Prototype for Few-Shot Learning","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martayang/sega","path":"traincode.py","file_url":"https://github.com/martayang/sega/blob/HEAD/traincode.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31f209be17e127f2","mcp_get_code":{"code_sha256":"31f209be17e127f2"}},{"arxiv_id":"2111.02447","paper":"/paper/on-the-frequency-bias-of-generative-models","title":"On the Frequency Bias of Generative Models","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/frequency_bias","path":"dataset.py","file_url":"https://github.com/autonomousvision/frequency_bias/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":"7da1d78ca8317443","mcp_get_code":{"code_sha256":"7da1d78ca8317443"}},{"arxiv_id":"2111.00969","paper":"/paper/generative-occupancy-fields-for-3d-surface","title":"Generative Occupancy Fields for 3D Surface-Aware Image Synthesis","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheldontsui/gof_neurips2021","path":"datasets.py","file_url":"https://github.com/sheldontsui/gof_neurips2021/blob/HEAD/datasets.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":"5d4213f664c985e6","mcp_get_code":{"code_sha256":"5d4213f664c985e6"}},{"arxiv_id":"2110.15678","paper":"/paper/a-shading-guided-generative-implicit-model","title":"A Shading-Guided Generative Implicit Model for Shape-Accurate 3D-Aware Image Synthesis","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingangpan/shadegan","path":"datasets.py","file_url":"https://github.com/xingangpan/shadegan/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":"df709247c665b337","mcp_get_code":{"code_sha256":"df709247c665b337"}},{"arxiv_id":"2110.14807","paper":"/paper/l2ight-enabling-on-chip-learning-for-optical","title":"L2ight: Enabling On-Chip Learning for Optical Neural Networks via Efficient in-situ Subspace Optimization","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeremiemelo/l2ight","path":"core/dataset.py","file_url":"https://github.com/jeremiemelo/l2ight/blob/HEAD/core/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"6cb750bf8abb7674","mcp_get_code":{"code_sha256":"6cb750bf8abb7674"}},{"arxiv_id":"2110.09788","paper":"/paper/cips-3d-a-3d-aware-generator-of-gans-based-on","title":"CIPS-3D: A 3D-Aware Generator of GANs Based on Conditionally-Independent Pixel Synthesis","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterouZh/CIPS-3D","path":"piGAN_lib/datasets.py","file_url":"https://github.com/PeterouZh/CIPS-3D/blob/HEAD/piGAN_lib/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5d4213f664c985e6","mcp_get_code":{"code_sha256":"5d4213f664c985e6"}},{"arxiv_id":"2110.04545","paper":"/paper/towards-data-free-domain-generalization","title":"Towards Data-Free Domain Generalization","date":"2021-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokunChen245/DFDG","path":"dfdg/training/train_student_syn_img.py","file_url":"https://github.com/HaokunChen245/DFDG/blob/HEAD/dfdg/training/train_student_syn_img.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":"18be128efd090a2d","mcp_get_code":{"code_sha256":"18be128efd090a2d"}},{"arxiv_id":"2109.11990","paper":"/paper/optimization-based-causal-estimation-from","title":"Optimization-based Causal Estimation from Heterogenous Environments","date":"2021-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingzhang-yin/coco","path":"src/exp_animal/dataset.py","file_url":"https://github.com/mingzhang-yin/coco/blob/HEAD/src/exp_animal/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a78439d89cf64d26","mcp_get_code":{"code_sha256":"a78439d89cf64d26"}},{"arxiv_id":"2108.11556","paper":"/paper/latent-space-energy-based-model-of-symbol","title":"Latent Space Energy-Based Model of Symbol-Vector Coupling for Text Generation and Classification","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bpucla/ibebm","path":"semi_sup_classification.py","file_url":"https://github.com/bpucla/ibebm/blob/HEAD/semi_sup_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6cfdafd16fd49637","mcp_get_code":{"code_sha256":"6cfdafd16fd49637"}},{"arxiv_id":"2108.07927","paper":"/paper/fed-tgan-federated-learning-framework-for","title":"Fed-TGAN: Federated Learning Framework for Synthesizing Tabular Data","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smduan/Fed-TDA","path":"fedavg/datasets.py","file_url":"https://github.com/smduan/Fed-TDA/blob/HEAD/fedavg/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b59e926532eac625","mcp_get_code":{"code_sha256":"b59e926532eac625"}},{"arxiv_id":"2107.08024","paper":"/paper/port-hamiltonian-neural-networks-for-learning","title":"Port-Hamiltonian Neural Networks for Learning Explicit Time-Dependent Dynamical Systems","date":"2021-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaandesai1/PortHNN","path":"data_builder.py","file_url":"https://github.com/shaandesai1/PortHNN/blob/HEAD/data_builder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93f5d5e94a41c0ef","mcp_get_code":{"code_sha256":"93f5d5e94a41c0ef"}},{"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":"maxencenoble/tree-diffusion-schrodinger-bridge","path":"bridge/runners/ipf.py","file_url":"https://github.com/maxencenoble/tree-diffusion-schrodinger-bridge/blob/HEAD/bridge/runners/ipf.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":"446d5ae9b2d8c92a","mcp_get_code":{"code_sha256":"446d5ae9b2d8c92a"}},{"arxiv_id":"2105.14951","paper":"/paper/snips-solving-noisy-inverse-problems","title":"SNIPS: Solving Noisy Inverse Problems Stochastically","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bahjat-kawar/snips_torch","path":"runners/ncsn_runner.py","file_url":"https://github.com/bahjat-kawar/snips_torch/blob/HEAD/runners/ncsn_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44c4f505b4f07dde","mcp_get_code":{"code_sha256":"44c4f505b4f07dde"}},{"arxiv_id":"2105.12049","paper":"/paper/honest-but-curious-nets-sensitive-attributes","title":"Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputs","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmalekzadeh/honest-but-curious-nets","path":"hbcnets/datasets.py","file_url":"https://github.com/mmalekzadeh/honest-but-curious-nets/blob/HEAD/hbcnets/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b08d3288e7055fa","mcp_get_code":{"code_sha256":"6b08d3288e7055fa"}},{"arxiv_id":"2104.06405","paper":"/paper/barf-bundle-adjusting-neural-radiance-fields","title":"BARF: Bundle-Adjusting Neural Radiance Fields","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MQ66/gnerf","path":"dataset/dataloader.py","file_url":"https://github.com/MQ66/gnerf/blob/HEAD/dataset/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3824193054538982","mcp_get_code":{"code_sha256":"3824193054538982"}},{"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":"158319c989d5f654","mcp_get_code":{"code_sha256":"158319c989d5f654"}},{"arxiv_id":"2011.13377","paper":"/paper/how-well-do-self-supervised-models-transfer","title":"How Well Do Self-Supervised Models Transfer?","date":"2020-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusericsson/ssl-transfer","path":"linear.py","file_url":"https://github.com/linusericsson/ssl-transfer/blob/HEAD/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f379d81ff970e3a","mcp_get_code":{"code_sha256":"9f379d81ff970e3a"}},{"arxiv_id":"2010.14495","paper":"/paper/are-wider-nets-better-given-the-same-number-1","title":"Are wider nets better given the same number of parameters?","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/wide-sparse-nets","path":"ResNet18/get_data.py","file_url":"https://github.com/google-research/wide-sparse-nets/blob/HEAD/ResNet18/get_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":"b27040a777264735","mcp_get_code":{"code_sha256":"b27040a777264735"}},{"arxiv_id":"2010.12230","paper":"/paper/coping-with-label-shift-via-distributionally-1","title":"Coping with Label Shift via Distributionally Robust Optimisation","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShahryarBQ/DRO","path":"src/ml_utils.py","file_url":"https://github.com/ShahryarBQ/DRO/blob/HEAD/src/ml_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce64f7753cbd4d5c","mcp_get_code":{"code_sha256":"ce64f7753cbd4d5c"}},{"arxiv_id":"2010.05563","paper":"/paper/graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","path":"graph-classfication/datasets.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"447832767a387876","mcp_get_code":{"code_sha256":"447832767a387876"}},{"arxiv_id":"2007.12625","paper":"/paper/accelerated-stochastic-gradient-free-and","title":"Accelerated Stochastic Gradient-free and Projection-free Methods","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TLMichael/Acc-SZOFW","path":"app/datasets.py","file_url":"https://github.com/TLMichael/Acc-SZOFW/blob/HEAD/app/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1d79112efd58522","mcp_get_code":{"code_sha256":"b1d79112efd58522"}},{"arxiv_id":"2006.13916","paper":"/paper/off-dynamics-reinforcement-learning-training","title":"Off-Dynamics Reinforcement Learning: Training for Transfer with Domain Classifiers","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pauldaoudi/food","path":"agents/algos_utils/darc_utils/networks_manager.py","file_url":"https://github.com/pauldaoudi/food/blob/HEAD/agents/algos_utils/darc_utils/networks_manager.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":"c49250e1563ad2cd","mcp_get_code":{"code_sha256":"c49250e1563ad2cd"}},{"arxiv_id":"2006.12847","paper":"/paper/real-time-speech-enhancement-in-the-waveform","title":"Real Time Speech Enhancement in the Waveform Domain","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/denoiser","path":"denoiser/enhance.py","file_url":"https://github.com/facebookresearch/denoiser/blob/HEAD/denoiser/enhance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"764208d203a0b06f","mcp_get_code":{"code_sha256":"764208d203a0b06f"}},{"arxiv_id":"2006.05988","paper":"/paper/random-reshuffling-simple-analysis-with-vast","title":"Random Reshuffling: Simple Analysis with Vast Improvements","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstmish/random_reshuffling","path":"datasets/utils.py","file_url":"https://github.com/konstmish/random_reshuffling/blob/HEAD/datasets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a358c02b10d447","mcp_get_code":{"code_sha256":"93a358c02b10d447"}},{"arxiv_id":"2006.05553","paper":"/paper/neural-methods-for-point-wise-dependency","title":"Neural Methods for Point-wise Dependency Estimation","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaohungt/Pointwise_Dependency_Neural_Estimation","path":"RepreLearn_Deep/datasets.py","file_url":"https://github.com/yaohungt/Pointwise_Dependency_Neural_Estimation/blob/HEAD/RepreLearn_Deep/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44031b849f6409b6","mcp_get_code":{"code_sha256":"44031b849f6409b6"}},{"arxiv_id":"2006.04062","paper":"/paper/consistency-regularization-for-certified","title":"Consistency Regularization for Certified Robustness of Smoothed Classifiers","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jh-jeong/smoothing-consistency","path":"code/datasets.py","file_url":"https://github.com/jh-jeong/smoothing-consistency/blob/HEAD/code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"009cb123eeb4af07","mcp_get_code":{"code_sha256":"009cb123eeb4af07"}},{"arxiv_id":"2004.13688","paper":"/paper/vign-variational-integrator-graph-networks","title":"Variational Integrator Graph Networks for Learning Energy Conserving Dynamical Systems","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaandesai1/VIGN","path":"data_builder.py","file_url":"https://github.com/shaandesai1/VIGN/blob/HEAD/data_builder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65214ed444514ea8","mcp_get_code":{"code_sha256":"65214ed444514ea8"}},{"arxiv_id":"2004.01888","paper":"/paper/a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FlorentijnD/FairMOT","path":"src/lib/datasets/dataset_factory.py","file_url":"https://github.com/FlorentijnD/FairMOT/blob/HEAD/src/lib/datasets/dataset_factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"541ce6c4361d61d6","mcp_get_code":{"code_sha256":"541ce6c4361d61d6"}},{"arxiv_id":"2003.09758","paper":"/paper/arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luh-dbs/mate","path":"src/base.py","file_url":"https://github.com/luh-dbs/mate/blob/HEAD/src/base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c040f8231e5068e5","mcp_get_code":{"code_sha256":"c040f8231e5068e5"}},{"arxiv_id":"2003.03564","paper":"/paper/ternary-compression-for-communication","title":"Ternary Compression for Communication-Efficient Federated Learning","date":"2020-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VeritasXu/Ternary-Federated","path":"utils/data_utils.py","file_url":"https://github.com/VeritasXu/Ternary-Federated/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31499f814edb01ee","mcp_get_code":{"code_sha256":"31499f814edb01ee"}},{"arxiv_id":"2002.03517","paper":"/paper/random-smoothing-might-be-unable-to-certify","title":"Random Smoothing Might be Unable to Certify $\\ell_\\infty$ Robustness for High-Dimensional Images","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongyanz/TRADES-smoothing","path":"code/datasets.py","file_url":"https://github.com/hongyanz/TRADES-smoothing/blob/HEAD/code/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12e58502150705d6","mcp_get_code":{"code_sha256":"12e58502150705d6"}},{"arxiv_id":"2002.00163","paper":"/paper/bridging-text-and-video-a-universal","title":"Bridging Text and Video: A Universal Multimodal Transformer for Video-Audio Scene-Aware Dialog","date":"2020-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/DSTC8-AVSD","path":"dataset.py","file_url":"https://github.com/ictnlp/DSTC8-AVSD/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":"91592b72681a74a3","mcp_get_code":{"code_sha256":"91592b72681a74a3"}},{"arxiv_id":"2001.00705","paper":"/paper/fractional-skipping-towards-finer-grained","title":"Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference","date":"2020-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/haq-release","path":"lib/utils/data_utils.py","file_url":"https://github.com/mit-han-lab/haq-release/blob/HEAD/lib/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"850e0644d35c1376","mcp_get_code":{"code_sha256":"850e0644d35c1376"}},{"arxiv_id":"1911.05485","paper":"/paper/diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"klicperajo/gdc","path":"data.py","file_url":"https://github.com/klicperajo/gdc/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80bcc0c354de813f","mcp_get_code":{"code_sha256":"80bcc0c354de813f"}},{"arxiv_id":"1910.01523","paper":"/paper/rnas-architecture-ranking-for-powerful","title":"ReNAS:Relativistic Evaluation of Neural Architecture Search","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoshingshing/ReNAS","path":"renas.py","file_url":"https://github.com/xiaoshingshing/ReNAS/blob/HEAD/renas.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"a9680e2d00e1eca3","mcp_get_code":{"code_sha256":"a9680e2d00e1eca3"}},{"arxiv_id":"1909.07425","paper":"/paper/a-characteristic-function-approach-to-deep","title":"A Characteristic Function Approach to Deep Implicit Generative Modeling","date":"2019-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crslab/OCFGAN","path":"src/datasets.py","file_url":"https://github.com/crslab/OCFGAN/blob/HEAD/src/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"82c582e06818012f","mcp_get_code":{"code_sha256":"82c582e06818012f"}},{"arxiv_id":"1909.06356","paper":"/paper/addressing-semantic-drift-in-question","title":"Addressing Semantic Drift in Question Generation for Semi-Supervised Question Answering","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhangShiyue/QGforQA","path":"LIB/utils.py","file_url":"https://github.com/ZhangShiyue/QGforQA/blob/HEAD/LIB/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d542375d94644b96","mcp_get_code":{"code_sha256":"d542375d94644b96"}},{"arxiv_id":"1908.02983","paper":"/paper/pseudo-labeling-and-confirmation-bias-in-deep","title":"Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learning","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricArazo/PseudoLabeling","path":"miniImagenet/dataset/miniImagenet.py","file_url":"https://github.com/EricArazo/PseudoLabeling/blob/HEAD/miniImagenet/dataset/miniImagenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4661a82d063bed57","mcp_get_code":{"code_sha256":"4661a82d063bed57"}},{"arxiv_id":"1908.02983","paper":"/paper/pseudo-labeling-and-confirmation-bias-in-deep","title":"Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learning","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricArazo/PseudoLabeling","path":"cifar10/dataset/cifar10.py","file_url":"https://github.com/EricArazo/PseudoLabeling/blob/HEAD/cifar10/dataset/cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b62cd8faeeedbd4","mcp_get_code":{"code_sha256":"5b62cd8faeeedbd4"}},{"arxiv_id":"1908.02983","paper":"/paper/pseudo-labeling-and-confirmation-bias-in-deep","title":"Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learning","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricArazo/PseudoLabeling","path":"cifar100/dataset/cifar100.py","file_url":"https://github.com/EricArazo/PseudoLabeling/blob/HEAD/cifar100/dataset/cifar100.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79e2d9d3eaeb6f7f","mcp_get_code":{"code_sha256":"79e2d9d3eaeb6f7f"}},{"arxiv_id":"1906.06804","paper":"/paper/three-dimensional-fourier-scattering","title":"Three-Dimensional Fourier Scattering Transform and Classification of Hyperspectral Images","date":"2019-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilyakava/tfST","path":"data.py","file_url":"https://github.com/ilyakava/tfST/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06efe229327f81e9","mcp_get_code":{"code_sha256":"06efe229327f81e9"}},{"arxiv_id":"1906.06532","paper":"/paper/attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tiger101010/DAEGC","path":"DAEGC/utils.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"849248c0666eb6f8","mcp_get_code":{"code_sha256":"849248c0666eb6f8"}},{"arxiv_id":"1906.05890","paper":"/paper/gradient-descent-maximizes-the-margin-of","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vfleaking/max-margin","path":"core.py","file_url":"https://github.com/vfleaking/max-margin/blob/HEAD/core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f8ed3dffc6db264","mcp_get_code":{"code_sha256":"9f8ed3dffc6db264"}},{"arxiv_id":"1904.12848","paper":"/paper/unsupervised-data-augmentation-1","title":"Unsupervised Data Augmentation for Consistency Training","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/uda","path":"image/data.py","file_url":"https://github.com/google-research/uda/blob/HEAD/image/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":"b417179a5b5e0e14","mcp_get_code":{"code_sha256":"b417179a5b5e0e14"}},{"arxiv_id":"1904.07734","paper":"/paper/three-scenarios-for-continual-learning","title":"Three scenarios for continual learning","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangTianduo/lifelong-learning-3-cases","path":"data.py","file_url":"https://github.com/WangTianduo/lifelong-learning-3-cases/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5d42513905f6442","mcp_get_code":{"code_sha256":"a5d42513905f6442"}},{"arxiv_id":"1904.03955","paper":"/paper/kervolutional-neural-networks","title":"Kervolutional Neural Networks","date":"2019-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuch37/Kerception","path":"datasets.py","file_url":"https://github.com/liuch37/Kerception/blob/HEAD/datasets.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":"55bf9668694fc780","mcp_get_code":{"code_sha256":"55bf9668694fc780"}},{"arxiv_id":"1812.06499","paper":"/paper/xy-network-for-nuclear-segmentation-in-multi","title":"HoVer-Net: Simultaneous Segmentation and Classification of Nuclei in Multi-Tissue Histology Images","date":"2018-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vqdang/xy_net","path":"dataset.py","file_url":"https://github.com/vqdang/xy_net/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":"b729fa83165b312b","mcp_get_code":{"code_sha256":"b729fa83165b312b"}},{"arxiv_id":"1812.00332","paper":"/paper/proxylessnas-direct-neural-architecture","title":"ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/haq","path":"lib/utils/data_utils.py","file_url":"https://github.com/mit-han-lab/haq/blob/HEAD/lib/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"850e0644d35c1376","mcp_get_code":{"code_sha256":"850e0644d35c1376"}},{"arxiv_id":"1810.02309","paper":"/paper/learning-compressed-transforms-with-low","title":"Learning Compressed Transforms with Low Displacement Rank","date":"2018-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/structured-nets","path":"pytorch/dataset.py","file_url":"https://github.com/HazyResearch/structured-nets/blob/HEAD/pytorch/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":"caeffaa5677b8ac4","mcp_get_code":{"code_sha256":"caeffaa5677b8ac4"}},{"arxiv_id":"1810.00861","paper":"/paper/proxquant-quantized-neural-networks-via","title":"ProxQuant: Quantized Neural Networks via Proximal Operators","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenbai01/ProxQuant","path":"data.py","file_url":"https://github.com/allenbai01/ProxQuant/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b6b395f11bd2a5e","mcp_get_code":{"code_sha256":"3b6b395f11bd2a5e"}},{"arxiv_id":"1810.00162","paper":"/paper/nice-noise-injection-and-clamping-estimation","title":"NICE: Noise Injection and Clamping Estimation for Neural Network Quantization","date":"2018-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lancer555/NICE","path":"data.py","file_url":"https://github.com/Lancer555/NICE/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"05f6e3f087c87014","mcp_get_code":{"code_sha256":"05f6e3f087c87014"}},{"arxiv_id":"1807.05614","paper":"/paper/ann-benchmarks-a-benchmarking-tool-for","title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","date":"2018-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erikbern/ann-benchmarks","path":"ann_benchmarks/datasets.py","file_url":"https://github.com/erikbern/ann-benchmarks/blob/HEAD/ann_benchmarks/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"311bb1de5567138a","mcp_get_code":{"code_sha256":"311bb1de5567138a"}},{"arxiv_id":"1805.11046","paper":"/paper/scalable-methods-for-8-bit-training-of-neural","title":"Scalable Methods for 8-bit Training of Neural Networks","date":"2018-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eladhoffer/quantized.pytorch","path":"data.py","file_url":"https://github.com/eladhoffer/quantized.pytorch/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cde16b7e9575ccb9","mcp_get_code":{"code_sha256":"cde16b7e9575ccb9"}},{"arxiv_id":"1805.07898","paper":"/paper/smoothout-smoothing-out-sharp-minima-to","title":"SmoothOut: Smoothing Out Sharp Minima to Improve Generalization in Deep Learning","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenwei202/smoothout","path":"data.py","file_url":"https://github.com/wenwei202/smoothout/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c02e8307733c548e","mcp_get_code":{"code_sha256":"c02e8307733c548e"}},{"arxiv_id":"1803.01814","paper":"/paper/norm-matters-efficient-and-accurate","title":"Norm matters: efficient and accurate normalization schemes in deep networks","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eladhoffer/norm_matters","path":"data.py","file_url":"https://github.com/eladhoffer/norm_matters/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a0707b8a218cccb4","mcp_get_code":{"code_sha256":"a0707b8a218cccb4"}},{"arxiv_id":"1603.09320","paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"javaCJ/HNSW_explain","path":"benchmarks/benchmark_script.py","file_url":"https://github.com/javaCJ/HNSW_explain/blob/HEAD/benchmarks/benchmark_script.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":"00fd55582acb50eb","mcp_get_code":{"code_sha256":"00fd55582acb50eb"}},{"arxiv_id":"1603.09320","paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"javaCJ/HNSW_explain","path":"benchmarks/youtube_reproduce.py","file_url":"https://github.com/javaCJ/HNSW_explain/blob/HEAD/benchmarks/youtube_reproduce.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":"e835d9076670deaf","mcp_get_code":{"code_sha256":"e835d9076670deaf"}},{"arxiv_id":"1603.09320","paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oddconcepts/n2o","path":"benchmarks/benchmark_script.py","file_url":"https://github.com/oddconcepts/n2o/blob/HEAD/benchmarks/benchmark_script.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":"642902330718ba50","mcp_get_code":{"code_sha256":"642902330718ba50"}},{"arxiv_id":"1603.01547","paper":"/paper/text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"libertatis/mrc-cbt","path":"util.py","file_url":"https://github.com/libertatis/mrc-cbt/blob/HEAD/util.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":"1ea08aaae7fd9f80","mcp_get_code":{"code_sha256":"1ea08aaae7fd9f80"}},{"arxiv_id":"1512.00843","paper":"/paper/protein-secondary-structure-prediction-using-2","title":"Protein secondary structure prediction using deep convolutional neural fields","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LucaAngioloni/ProteinSecondaryStructure-CNN","path":"dataset.py","file_url":"https://github.com/LucaAngioloni/ProteinSecondaryStructure-CNN/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":"6ea8777574a79cc8","mcp_get_code":{"code_sha256":"6ea8777574a79cc8"}},{"arxiv_id":"1508.06615","paper":"/paper/character-aware-neural-language-models","title":"Character-Aware Neural Language Models","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NLPLearn/QANet","path":"util.py","file_url":"https://github.com/NLPLearn/QANet/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ea08aaae7fd9f80","mcp_get_code":{"code_sha256":"1ea08aaae7fd9f80"}},{"arxiv_id":"1307.0414","paper":"/paper/challenges-in-representation-learning-a","title":"Challenges in Representation Learning: A report on three machine learning contests","date":"2013-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phamquiluan/ResidualMaskingNetwork","path":"legacy/main_affectnet.py","file_url":"https://github.com/phamquiluan/ResidualMaskingNetwork/blob/HEAD/legacy/main_affectnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20e1d2a545b31c12","mcp_get_code":{"code_sha256":"20e1d2a545b31c12"}},{"arxiv_id":"aaai_33972","paper":null,"title":"arXiv:aaai_33972","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sangamesh-kodge/SAP","path":"demo_spiral.py","file_url":"https://github.com/sangamesh-kodge/SAP/blob/HEAD/demo_spiral.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":"e969309a21a6d5ca","mcp_get_code":{"code_sha256":"e969309a21a6d5ca"}},{"arxiv_id":"aaai_33972","paper":null,"title":"arXiv:aaai_33972","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sangamesh-kodge/SAP","path":"utils.py","file_url":"https://github.com/sangamesh-kodge/SAP/blob/HEAD/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":"5f6e7cee2efbd51c","mcp_get_code":{"code_sha256":"5f6e7cee2efbd51c"}},{"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/benchmark/data.py","file_url":"https://github.com/grodino/QuRD/blob/HEAD/qurd/benchmark/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"64f5afea3cb39cf7","mcp_get_code":{"code_sha256":"64f5afea3cb39cf7"}},{"arxiv_id":"aaai_26259","paper":null,"title":"arXiv:aaai_26259","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"stxupengyu/LSFA","path":"transfer/transfer_data.py","file_url":"https://github.com/stxupengyu/LSFA/blob/HEAD/transfer/transfer_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d289eb4a341f665a","mcp_get_code":{"code_sha256":"d289eb4a341f665a"}},{"arxiv_id":"aaai_25383","paper":null,"title":"arXiv:aaai_25383","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PRIS-CV/Bi-FRN","path":"datasets/dataloaders.py","file_url":"https://github.com/PRIS-CV/Bi-FRN/blob/HEAD/datasets/dataloaders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9600a14e01270c4c","mcp_get_code":{"code_sha256":"9600a14e01270c4c"}},{"arxiv_id":"Xu_Boosting_Image_Quality_Assessment_through_Efficient_Transformer_Adaptation_with_Local_CVPR_2024_paper","paper":null,"title":"arXiv:Xu_Boosting_Image_Quality_Assessment_through_Efficient_Transformer_Adaptation_with_Local_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NeosXu/LoDa","path":"src/dataset/dataloader.py","file_url":"https://github.com/NeosXu/LoDa/blob/HEAD/src/dataset/dataloader.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":"92a9335c1baa7658","mcp_get_code":{"code_sha256":"92a9335c1baa7658"}},{"arxiv_id":"Lu_FedHCA2_Towards_Hetero-Client_Federated_Multi-Task_Learning_CVPR_2024_paper","paper":null,"title":"arXiv:Lu_FedHCA2_Towards_Hetero-Client_Federated_Multi-Task_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"innovator-zero/FedHCA2","path":"datasets/custom_dataset.py","file_url":"https://github.com/innovator-zero/FedHCA2/blob/HEAD/datasets/custom_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d072cb85d627cf2","mcp_get_code":{"code_sha256":"6d072cb85d627cf2"}},{"arxiv_id":"2025.findings-acl.150","paper":null,"title":"arXiv:2025.findings-acl.150","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Ymm-cll/NetSafe","path":"methods.py","file_url":"https://github.com/Ymm-cll/NetSafe/blob/HEAD/methods.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68dfa92555a15bb5","mcp_get_code":{"code_sha256":"68dfa92555a15bb5"}},{"arxiv_id":"2024.findings-emnlp.407","paper":null,"title":"arXiv:2024.findings-emnlp.407","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"amayuelas/multi-agent-attack","path":"multiagent_debate/dataloader.py","file_url":"https://github.com/amayuelas/multi-agent-attack/blob/HEAD/multiagent_debate/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ddc1c7e01b4d6316","mcp_get_code":{"code_sha256":"ddc1c7e01b4d6316"}},{"arxiv_id":"2023.findings-emnlp.427","paper":null,"title":"arXiv:2023.findings-emnlp.427","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"whyNLP/Conic10K","path":"src/data.py","file_url":"https://github.com/whyNLP/Conic10K/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43a2cfc66ca1fad9","mcp_get_code":{"code_sha256":"43a2cfc66ca1fad9"}},{"arxiv_id":"2021.findings-emnlp.386","paper":null,"title":"arXiv:2021.findings-emnlp.386","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lbe0613/GCC","path":"pretrain/run_pretrain.py","file_url":"https://github.com/lbe0613/GCC/blob/HEAD/pretrain/run_pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be0fd8ec480df29b","mcp_get_code":{"code_sha256":"be0fd8ec480df29b"}},{"arxiv_id":"2021.emnlp-main.482","paper":null,"title":"arXiv:2021.emnlp-main.482","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"parasj/contracode","path":"representjs/hugging_face/run_language_modeling.py","file_url":"https://github.com/parasj/contracode/blob/HEAD/representjs/hugging_face/run_language_modeling.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":"d8768691edecabed","mcp_get_code":{"code_sha256":"d8768691edecabed"}},{"arxiv_id":"136830480","paper":null,"title":"arXiv:136830480","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fanhanwei/BOCR","path":"lib/data.py","file_url":"https://github.com/fanhanwei/BOCR/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"53af36b4ed2456bc","mcp_get_code":{"code_sha256":"53af36b4ed2456bc"}},{"arxiv_id":"03030","paper":null,"title":"arXiv:03030","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"silicx/GoldFromOres-BiLP","path":"DatasetCondensation/utils.py","file_url":"https://github.com/silicx/GoldFromOres-BiLP/blob/HEAD/DatasetCondensation/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ede4e38dc61074f","mcp_get_code":{"code_sha256":"4ede4e38dc61074f"}}]}