{"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/one-hot","entry":"one_hot","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":150,"n_papers_ran":84,"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":111,"n_samples_ran":47,"n_samples_fingerprinted":14,"n_places":152,"n_places_pointer_only":47,"by_status":{"ran_honours":5,"ran_violates":0,"ran_draft_wrong":17,"ran_fixture":10,"ran":15,"unverified":64},"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.13628","paper":"/paper/arxiv-2608-13628","title":"Robust Dual-Model Collaborative Random Vector Functional Link Network","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"mtanveer1/KRPRVFL","path":"RVFL.py","file_url":"https://github.com/mtanveer1/KRPRVFL/blob/HEAD/RVFL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed89c1bf08d9071b","mcp_get_code":{"code_sha256":"ed89c1bf08d9071b"}},{"arxiv_id":"2605.14654","paper":"/paper/arxiv-2605-14654","title":"Beyond Instance-Level Self-Supervision in 3D Multi-Modal Medical Imaging","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Ashespt/TACO","path":"pretrain/TACO/losses/coderating.py","file_url":"https://github.com/Ashespt/TACO/blob/HEAD/pretrain/TACO/losses/coderating.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f0709ca52def958c","mcp_get_code":{"code_sha256":"f0709ca52def958c"}},{"arxiv_id":"2605.11764","paper":"/paper/arxiv-2605-11764","title":"Decomposing the Generalization Gap in PROTAC Activity Prediction: Variance Attribution and the Inter-Laboratory Ceiling","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ThorKlm/PROTAC-Bench","path":"baselines/gnn_baselines.py","file_url":"https://github.com/ThorKlm/PROTAC-Bench/blob/HEAD/baselines/gnn_baselines.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8141e1d925395b8d","mcp_get_code":{"code_sha256":"8141e1d925395b8d"}},{"arxiv_id":"2605.07886","paper":"/paper/arxiv-2605-07886","title":"Characterizing and Correcting Effective Target Shift in Online Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hiratani-Lab/target_correction","path":"ConvNTK/data.py","file_url":"https://github.com/Hiratani-Lab/target_correction/blob/HEAD/ConvNTK/data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60fb650d6d546a2c","mcp_get_code":{"code_sha256":"60fb650d6d546a2c"}},{"arxiv_id":"2602.17947","paper":"/paper/arxiv-2602-17947","title":"Understanding the Generalization of Bilevel Programming in Hyperparameter Optimization: A Tale of Bias-Variance Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"kjunelee/MetaOptNet","path":"models/classification_heads.py","file_url":"https://github.com/kjunelee/MetaOptNet/blob/HEAD/models/classification_heads.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"2506.19997","paper":"/paper/traced-transition-aware-regret-approximation","title":"TRACED: Transition-aware Regret Approximation with Co-learnability for Environment Design","date":"2025-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cho-Geonwoo/TRACED","path":"models/common.py","file_url":"https://github.com/Cho-Geonwoo/TRACED/blob/HEAD/models/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"60463321ab6527df","mcp_get_code":{"code_sha256":"60463321ab6527df"}},{"arxiv_id":"2502.06556","paper":"/paper/projecttest-a-project-level-llm-unit-test","title":"ProjectTest: A Project-level LLM Unit Test Generation Benchmark and Impact of Error Fixing Mechanisms","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibowang214/projecttest","path":"ProjectTest/Python/main/keras_preprocessing.py","file_url":"https://github.com/yibowang214/projecttest/blob/HEAD/ProjectTest/Python/main/keras_preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f1600f856db0ca4","mcp_get_code":{"code_sha256":"8f1600f856db0ca4"}},{"arxiv_id":"2410.11502","paper":"/paper/offline-model-based-optimization-by-learning","title":"Offline Model-Based Optimization by Learning to Rank","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brandontrabucco/design-bench","path":"design_bench/datasets/discrete_dataset.py","file_url":"https://github.com/brandontrabucco/design-bench/blob/HEAD/design_bench/datasets/discrete_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9254b9a1999e5ab9","mcp_get_code":{"code_sha256":"9254b9a1999e5ab9"}},{"arxiv_id":"2410.10744","paper":"/paper/adversarially-robust-out-of-distribution","title":"Adversarially Robust Out-of-Distribution Detection Using Lyapunov-Stabilized Embeddings","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdaptiveMotorControlLab/AROS","path":"aros_node/utils.py","file_url":"https://github.com/AdaptiveMotorControlLab/AROS/blob/HEAD/aros_node/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"64975423655410b6","mcp_get_code":{"code_sha256":"64975423655410b6"}},{"arxiv_id":"2410.01086","paper":"/paper/an-introduction-to-deep-survival-analysis","title":"An Introduction to Deep Survival Analysis Models for Predicting Time-to-Event Outcomes","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgehc/survival-intro","path":"survival_kernets/models.py","file_url":"https://github.com/georgehc/survival-intro/blob/HEAD/survival_kernets/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"d87ff0ee47cb77cd","mcp_get_code":{"code_sha256":"d87ff0ee47cb77cd"}},{"arxiv_id":"2409.16407","paper":"/paper/towards-representation-learning-for-weighting","title":"Towards Representation Learning for Weighting Problems in Design-Based Causal Inference","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oscarclivio/representations_weighting","path":"src/datasets.py","file_url":"https://github.com/oscarclivio/representations_weighting/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":"514e2ce79c7b07f6","mcp_get_code":{"code_sha256":"514e2ce79c7b07f6"}},{"arxiv_id":"2406.16422","paper":"/paper/exploring-cross-domain-few-shot","title":"Exploring Cross-Domain Few-Shot Classification via Frequency-Aware Prompting","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkez/fap_cdfsc","path":"functions.py","file_url":"https://github.com/tinkez/fap_cdfsc/blob/HEAD/functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"2406.10012","paper":"/paper/characterizing-out-of-distribution","title":"Characterizing out-of-distribution generalization of neural networks: application to the disordered Su-Schrieffer-Heeger model","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"kcybinski/interpreting_nns_for_topological_phases_of_matter","path":"src/thermometer_encoding.py","file_url":"https://github.com/kcybinski/interpreting_nns_for_topological_phases_of_matter/blob/HEAD/src/thermometer_encoding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63052d81412770ae","mcp_get_code":{"code_sha256":"63052d81412770ae"}},{"arxiv_id":"2404.19620","paper":"/paper/be-aware-of-the-neighborhood-effect-modeling","title":"Be Aware of the Neighborhood Effect: Modeling Selection Bias under Interference","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoxuanli-pku/iclr24-interference","path":"real-world/matrix_factorization.py","file_url":"https://github.com/haoxuanli-pku/iclr24-interference/blob/HEAD/real-world/matrix_factorization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4fe5b26db1726dd8","mcp_get_code":{"code_sha256":"4fe5b26db1726dd8"}},{"arxiv_id":"2404.19596","paper":"/paper/debiased-collaborative-filtering-with-kernel","title":"Debiased Collaborative Filtering with Kernel-Based Causal Balancing","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoxuanli-pku/ICLR24-Kernel-Balancing","path":"baselines.py","file_url":"https://github.com/haoxuanli-pku/ICLR24-Kernel-Balancing/blob/HEAD/baselines.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4fe5b26db1726dd8","mcp_get_code":{"code_sha256":"4fe5b26db1726dd8"}},{"arxiv_id":"2404.14076","paper":"/paper/noise-contrastive-estimation-with-soft","title":"Towards noise contrastive estimation with soft targets for conditional models","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlmanngroup/soft-target-infonce","path":"util/transforms.py","file_url":"https://github.com/uhlmanngroup/soft-target-infonce/blob/HEAD/util/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6caffa789f1bdabe","mcp_get_code":{"code_sha256":"6caffa789f1bdabe"}},{"arxiv_id":"2403.09977","paper":"/paper/efficientvmamba-atrous-selective-scan-for","title":"EfficientVMamba: Atrous Selective Scan for Light Weight Visual Mamba","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terrypei/efficientvmamba","path":"classification/lib/dataset/mixup.py","file_url":"https://github.com/terrypei/efficientvmamba/blob/HEAD/classification/lib/dataset/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2403.07576","paper":"/paper/fpt-fine-grained-prompt-tuning-for-parameter","title":"Fine-grained Prompt Tuning: A Parameter and Memory Efficient Transfer Learning Method for High-resolution Medical Image Classification","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yijinhuang/fpt","path":"utils/func.py","file_url":"https://github.com/yijinhuang/fpt/blob/HEAD/utils/func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d31a0b594825c787","mcp_get_code":{"code_sha256":"d31a0b594825c787"}},{"arxiv_id":"2403.07030","paper":"/paper/aug-kd-anchor-based-mixup-generation-for-out","title":"AuG-KD: Anchor-Based Mixup Generation for Out-of-Domain Knowledge Distillation","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ishikura-a/aug-kd","path":"models/anchor_net.py","file_url":"https://github.com/ishikura-a/aug-kd/blob/HEAD/models/anchor_net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fed03b1dc42d16c4","mcp_get_code":{"code_sha256":"fed03b1dc42d16c4"}},{"arxiv_id":"2403.00567","paper":"/paper/flatten-long-range-loss-landscapes-for-cross","title":"Flatten Long-Range Loss Landscapes for Cross-Domain Few-Shot Learning","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/flor","path":"utils.py","file_url":"https://github.com/zoilsen/flor/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":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"2402.17300","paper":"/paper/voco-a-simple-yet-effective-volume","title":"VoCo: A Simple-yet-Effective Volume Contrastive Learning Framework for 3D Medical Image Analysis","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luffy03/voco","path":"Finetune/Amos/inferers.py","file_url":"https://github.com/luffy03/voco/blob/HEAD/Finetune/Amos/inferers.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":"adfc9b95c4e65682","mcp_get_code":{"code_sha256":"adfc9b95c4e65682"}},{"arxiv_id":"2402.16077","paper":"/paper/equivariant-frames-and-the-impossibility-of","title":"Equivariant Frames and the Impossibility of Continuous Canonicalization","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jwsiegel2510/sn-invariant-weighted-frames","path":"point_cloud_mnist_classifier.py","file_url":"https://github.com/jwsiegel2510/sn-invariant-weighted-frames/blob/HEAD/point_cloud_mnist_classifier.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60fb650d6d546a2c","mcp_get_code":{"code_sha256":"60fb650d6d546a2c"}},{"arxiv_id":"2402.04005","paper":"/paper/bayesian-uncertainty-for-gradient-aggregation","title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssi-research/bayesagg_mtl","path":"experiments/CIFAR_MTL/data.py","file_url":"https://github.com/ssi-research/bayesagg_mtl/blob/HEAD/experiments/CIFAR_MTL/data.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":"2ded4a4604e0c9fa","mcp_get_code":{"code_sha256":"2ded4a4604e0c9fa"}},{"arxiv_id":"2401.14876","paper":"/paper/cross-space-adaptive-filter-integrating-graph","title":"Cross-Space Adaptive Filter: Integrating Graph Topology and Node Attributes for Alleviating the Over-smoothing Problem","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangzichun/cross-space-adaptive-filter","path":"pygcn/utils.py","file_url":"https://github.com/huangzichun/cross-space-adaptive-filter/blob/HEAD/pygcn/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"792407788ecdb51e","mcp_get_code":{"code_sha256":"792407788ecdb51e"}},{"arxiv_id":"2401.03497","paper":"/paper/eat-self-supervised-pre-training-with","title":"EAT: Self-Supervised Pre-Training with Efficient Audio Transformer","date":"2024-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwx-worst-one/eat","path":"utils/mixup.py","file_url":"https://github.com/cwx-worst-one/eat/blob/HEAD/utils/mixup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6caffa789f1bdabe","mcp_get_code":{"code_sha256":"6caffa789f1bdabe"}},{"arxiv_id":"2312.04484","paper":"/paper/frnet-frustum-range-networks-for-scalable","title":"FRNet: Frustum-Range Networks for Scalable LiDAR Segmentation","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xiangxu-0103/FRNet","path":"frnet/models/losses/boundary_loss.py","file_url":"https://github.com/Xiangxu-0103/FRNet/blob/HEAD/frnet/models/losses/boundary_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3dd5e5e1db226e90","mcp_get_code":{"code_sha256":"3dd5e5e1db226e90"}},{"arxiv_id":"2312.03126","paper":"/paper/learning-curricula-in-open-ended-worlds","title":"Learning Curricula in Open-Ended Worlds","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/dcd","path":"models/common.py","file_url":"https://github.com/facebookresearch/dcd/blob/HEAD/models/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60463321ab6527df","mcp_get_code":{"code_sha256":"60463321ab6527df"}},{"arxiv_id":"2312.00194","paper":"/paper/robust-concept-erasure-via-kernelized-rate-1","title":"Robust Concept Erasure via Kernelized Rate-Distortion Maximization","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/KRaM","path":"src/loss.py","file_url":"https://github.com/brcsomnath/KRaM/blob/HEAD/src/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62dfecd92146a155","mcp_get_code":{"code_sha256":"62dfecd92146a155"}},{"arxiv_id":"2311.03747","paper":"/paper/sbcformer-lightweight-network-capable-of-full","title":"SBCFormer: Lightweight Network Capable of Full-size ImageNet Classification at 1 FPS on Single Board Computers","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyonglu/sbcformer","path":"mixup.py","file_url":"https://github.com/xyonglu/sbcformer/blob/HEAD/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2310.18773","paper":"/paper/cityrefer-geography-aware-3d-visual-grounding","title":"CityRefer: Geography-aware 3D Visual Grounding Dataset on City-scale Point Cloud Data","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atr-dbi/cityrefer","path":"lib/dataset.py","file_url":"https://github.com/atr-dbi/cityrefer/blob/HEAD/lib/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a2c7b9d59143510","mcp_get_code":{"code_sha256":"6a2c7b9d59143510"}},{"arxiv_id":"2310.17914","paper":"/paper/3d-aware-visual-question-answering-about-1","title":"3D-Aware Visual Question Answering about Parts, Poses and Occlusions","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingruiwang/3d-aware-vqa","path":"PO3D-VQA/6D_pose_estimator/align_objects_parts_prob.py","file_url":"https://github.com/xingruiwang/3d-aware-vqa/blob/HEAD/PO3D-VQA/6D_pose_estimator/align_objects_parts_prob.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57f66e40396ced61","mcp_get_code":{"code_sha256":"57f66e40396ced61"}},{"arxiv_id":"2310.04361","paper":"/paper/exploiting-transformer-activation-sparsity","title":"Exploiting Activation Sparsity with Dense to Dynamic-k Mixture-of-Experts Conversion","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bartwojcik/d2dmoe","path":"utils.py","file_url":"https://github.com/bartwojcik/d2dmoe/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6caffa789f1bdabe","mcp_get_code":{"code_sha256":"6caffa789f1bdabe"}},{"arxiv_id":"2308.04549","paper":"/paper/prune-spatio-temporal-tokens-by-semantic","title":"Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mark12ding/sta","path":"mixup.py","file_url":"https://github.com/mark12ding/sta/blob/HEAD/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2308.03306","paper":"/paper/implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/dignn","path":"nodeclassification/linkx_dataset.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/nodeclassification/linkx_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"259d4544dc760378","mcp_get_code":{"code_sha256":"259d4544dc760378"}},{"arxiv_id":"2307.06947","paper":"/paper/video-focalnets-spatio-temporal-focal","title":"Video-FocalNets: Spatio-Temporal Focal Modulation for Video Action Recognition","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talalwasim/video-focalnets","path":"datasets/blending.py","file_url":"https://github.com/talalwasim/video-focalnets/blob/HEAD/datasets/blending.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2307.02227","paper":"/paper/mae-dfer-efficient-masked-autoencoder-for","title":"MAE-DFER: Efficient Masked Autoencoder for Self-supervised Dynamic Facial Expression Recognition","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunlicai/mae-dfer","path":"mixup.py","file_url":"https://github.com/sunlicai/mae-dfer/blob/HEAD/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2306.02664","paper":"/paper/structure-free-graph-condensation-from-large","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Amanda-Zheng/SFGC","path":"metagtt_inductive_adj_identity.py","file_url":"https://github.com/Amanda-Zheng/SFGC/blob/HEAD/metagtt_inductive_adj_identity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f49468c140bc342f","mcp_get_code":{"code_sha256":"f49468c140bc342f"}},{"arxiv_id":"2305.12129","paper":"/paper/lifting-the-curse-of-capacity-gap-in","title":"Lifting the Curse of Capacity Gap in Distilling Language Models","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"genezc/minimoe","path":"modules/modeling_moebert_gate.py","file_url":"https://github.com/genezc/minimoe/blob/HEAD/modules/modeling_moebert_gate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"882d0552fedc5aa1","mcp_get_code":{"code_sha256":"882d0552fedc5aa1"}},{"arxiv_id":"2305.02507","paper":"/paper/stimulative-training-go-beyond-the","title":"Stimulative Training++: Go Beyond The Performance Limits of Residual Networks","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunshine-ye/nips22-st","path":"mixup.py","file_url":"https://github.com/sunshine-ye/nips22-st/blob/HEAD/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2304.12043","paper":"/paper/mixpro-data-augmentation-with-maskmix-and","title":"MixPro: Data Augmentation with MaskMix and Progressive Attention Labeling for Vision Transformer","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fistyee/mixpro","path":"utils.py","file_url":"https://github.com/fistyee/mixpro/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2303.12799","paper":"/paper/time-series-as-images-vision-transformer-for-1","title":"Time Series as Images: Vision Transformer for Irregularly Sampled Time Series","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"e5da4e4200323899","mcp_get_code":{"code_sha256":"e5da4e4200323899"}},{"arxiv_id":"2301.03580","paper":"/paper/designing-bert-for-convolutional-networks","title":"Designing BERT for Convolutional Networks: Sparse and Hierarchical Masked Modeling","date":"2023-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyu-tian/spark","path":"downstream_imagenet/mixup.py","file_url":"https://github.com/keyu-tian/spark/blob/HEAD/downstream_imagenet/mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2212.06595","paper":"/paper/oamixer-object-aware-mixing-layer-for-vision","title":"OAMixer: Object-aware Mixing Layer for Vision Transformers","date":"2022-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alinlab/OAMixer","path":"utils.py","file_url":"https://github.com/alinlab/OAMixer/blob/HEAD/utils.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":"c91ca77cd9c1882e","mcp_get_code":{"code_sha256":"c91ca77cd9c1882e"}},{"arxiv_id":"2212.04450","paper":"/paper/gauche-a-library-for-gaussian-processes-in-1","title":"GAUCHE: A Library for Gaussian Processes in Chemistry","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leojklarner/gauche","path":"gauche/representations/fingerprints.py","file_url":"https://github.com/leojklarner/gauche/blob/HEAD/gauche/representations/fingerprints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27570ebcbb961e1c","mcp_get_code":{"code_sha256":"27570ebcbb961e1c"}},{"arxiv_id":"2212.03640","paper":"/paper/fine-tuned-clip-models-are-efficient-video","title":"Fine-tuned CLIP Models are Efficient Video Learners","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muzairkhattak/vifi-clip","path":"datasets/blending.py","file_url":"https://github.com/muzairkhattak/vifi-clip/blob/HEAD/datasets/blending.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2212.00776","paper":"/paper/resformer-scaling-vits-with-multi-resolution","title":"ResFormer: Scaling ViTs with Multi-Resolution Training","date":"2022-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruitian12/resformer","path":"image_classification/mix.py","file_url":"https://github.com/ruitian12/resformer/blob/HEAD/image_classification/mix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2211.14666","paper":"/paper/synergies-between-disentanglement-and","title":"Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning","date":"2022-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tristandeleu/synergies-disentanglement-sparsity","path":"metaoptnet/models/classification_heads.py","file_url":"https://github.com/tristandeleu/synergies-disentanglement-sparsity/blob/HEAD/metaoptnet/models/classification_heads.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6db52403976aa70c","mcp_get_code":{"code_sha256":"6db52403976aa70c"}},{"arxiv_id":"2211.09259","paper":"/paper/the-missing-indicator-method-from-low-to-high","title":"The Missing Indicator Method: From Low to High Dimensions","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvanness354/missing_indicator_method","path":"mimic_benchmark_scripts/make_processed_los_data.py","file_url":"https://github.com/mvanness354/missing_indicator_method/blob/HEAD/mimic_benchmark_scripts/make_processed_los_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":"1191f6dfc22f1ffd","mcp_get_code":{"code_sha256":"1191f6dfc22f1ffd"}},{"arxiv_id":"2211.06550","paper":"/paper/tapas-a-toolbox-for-adversarial-privacy","title":"TAPAS: a Toolbox for Adversarial Privacy Auditing of Synthetic Data","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alan-turing-institute/privacy-sdg-toolbox","path":"tapas/generators/generator.py","file_url":"https://github.com/alan-turing-institute/privacy-sdg-toolbox/blob/HEAD/tapas/generators/generator.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2670d9fdfc6b603","mcp_get_code":{"code_sha256":"e2670d9fdfc6b603"}},{"arxiv_id":"2210.12067","paper":"/paper/efficient-dataset-distillation-using-random","title":"Efficient Dataset Distillation Using Random Feature Approximation","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yolky/RFAD","path":"utils.py","file_url":"https://github.com/yolky/RFAD/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"defd9ff9cbe131da","mcp_get_code":{"code_sha256":"defd9ff9cbe131da"}},{"arxiv_id":"2209.00530","paper":"/paper/holomorphic-equilibrium-propagation-computes","title":"Holomorphic Equilibrium Propagation Computes Exact Gradients Through Finite Size Oscillations","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Laborieux-Axel/holomorphic_eqprop","path":"utils/data.py","file_url":"https://github.com/Laborieux-Axel/holomorphic_eqprop/blob/HEAD/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38f2f3d1795ca431","mcp_get_code":{"code_sha256":"38f2f3d1795ca431"}},{"arxiv_id":"2208.10930","paper":"/paper/fs-ban-born-again-networks-for-domain","title":"FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/Born-Again-FS","path":"baseline_model/utils.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"2207.11685","paper":"/paper/kernel-relative-prototype-spectral-filtering","title":"Kernel Relative-prototype Spectral Filtering for Few-shot Learning","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"2206.11254","paper":"/paper/langevin-monte-carlo-for-contextual-bandits","title":"Langevin Monte Carlo for Contextual Bandits","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devzhk/lmcts","path":"run_cifar.py","file_url":"https://github.com/devzhk/lmcts/blob/HEAD/run_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c875d9cdc27a6719","mcp_get_code":{"code_sha256":"c875d9cdc27a6719"}},{"arxiv_id":"2204.09179","paper":"/paper/on-the-representation-collapse-of-sparse","title":"On the Representation Collapse of Sparse Mixture of Experts","date":"2022-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/torchscale","path":"torchscale/component/xmoe/routing.py","file_url":"https://github.com/microsoft/torchscale/blob/HEAD/torchscale/component/xmoe/routing.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d133667851a7737","mcp_get_code":{"code_sha256":"9d133667851a7737"}},{"arxiv_id":"2203.06345","paper":"/paper/the-principle-of-diversity-training-stronger","title":"The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/Diverse-ViT","path":"mix.py","file_url":"https://github.com/VITA-Group/Diverse-ViT/blob/HEAD/mix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1e046d46f0b9ca0","mcp_get_code":{"code_sha256":"a1e046d46f0b9ca0"}},{"arxiv_id":"2203.05880","paper":"/paper/multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssgood/mmgl","path":"MMGL_inductive/utils.py","file_url":"https://github.com/ssgood/mmgl/blob/HEAD/MMGL_inductive/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46cf6f1ad6a4824f","mcp_get_code":{"code_sha256":"46cf6f1ad6a4824f"}},{"arxiv_id":"2203.05126","paper":"/paper/pactran-pac-bayesian-metrics-for-estimating","title":"PACTran: PAC-Bayesian Metrics for Estimating the Transferability of Pretrained Models to Classification Tasks","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pactran_metrics","path":"compute_metrics.py","file_url":"https://github.com/google-research/pactran_metrics/blob/HEAD/compute_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"edfd7151645e07b8","mcp_get_code":{"code_sha256":"edfd7151645e07b8"}},{"arxiv_id":"2202.08450","paper":"/paper/design-bench-benchmarks-for-data-driven-1","title":"Design-Bench: Benchmarks for Data-Driven Offline Model-Based Optimization","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rail-berkeley/design-bench","path":"design_bench/datasets/discrete_dataset.py","file_url":"https://github.com/rail-berkeley/design-bench/blob/HEAD/design_bench/datasets/discrete_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9254b9a1999e5ab9","mcp_get_code":{"code_sha256":"9254b9a1999e5ab9"}},{"arxiv_id":"2202.07476","paper":"/paper/mgcvae-multi-objective-inverse-design-via","title":"MGCVAE: Multi-objective Inverse Design via Molecular Graph Conditional Variational Autoencoder","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mhlee216/mgcvae","path":"code/mgcvae.py","file_url":"https://github.com/mhlee216/mgcvae/blob/HEAD/code/mgcvae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8cfd0918586268a8","mcp_get_code":{"code_sha256":"8cfd0918586268a8"}},{"arxiv_id":"2202.00666","paper":"/paper/typical-decoding-for-natural-language","title":"Locally Typical Sampling","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HomebrewNLP/HomebrewNLP-Jax","path":"inference.py","file_url":"https://github.com/HomebrewNLP/HomebrewNLP-Jax/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"e11d769ad67f0934","mcp_get_code":{"code_sha256":"e11d769ad67f0934"}},{"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/utils/loss.py","file_url":"https://github.com/brcsomnath/farm/blob/HEAD/src/utils/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"62dfecd92146a155","mcp_get_code":{"code_sha256":"62dfecd92146a155"}},{"arxiv_id":"2201.12414","paper":"/paper/any-variational-autoencoder-can-do-arbitrary","title":"Posterior Matching for Arbitrary Conditioning","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/dm-haiku","path":"haiku/_src/basic.py","file_url":"https://github.com/deepmind/dm-haiku/blob/HEAD/haiku/_src/basic.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":"f6f51ced321b0151","mcp_get_code":{"code_sha256":"f6f51ced321b0151"}},{"arxiv_id":"2111.06377","paper":"/paper/masked-autoencoders-are-scalable-vision","title":"Masked Autoencoders Are Scalable Vision Learners","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/mae","path":"src/datasets/mixup.py","file_url":"https://github.com/yangyucheng000/mae/blob/HEAD/src/datasets/mixup.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":"500863dca85164af","mcp_get_code":{"code_sha256":"500863dca85164af"}},{"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":"models/classification_heads.py","file_url":"https://github.com/martayang/sega/blob/HEAD/models/classification_heads.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"2110.12976","paper":"/paper/stable-neural-ode-with-lyapunov-stable","title":"Stable Neural ODE with Lyapunov-Stable Equilibrium Points for Defending Against Adversarial Attacks","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangqiyu/sodef","path":"trades_r/sodef_eval_ode.py","file_url":"https://github.com/kangqiyu/sodef/blob/HEAD/trades_r/sodef_eval_ode.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"64975423655410b6","mcp_get_code":{"code_sha256":"64975423655410b6"}},{"arxiv_id":"2110.05357","paper":"/paper/graph-guided-network-for-irregularly-sampled-1","title":"Graph-Guided Network for Irregularly Sampled Multivariate Time Series","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/Raindrop","path":"code/Raindrop.py","file_url":"https://github.com/mims-harvard/Raindrop/blob/HEAD/code/Raindrop.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5da4e4200323899","mcp_get_code":{"code_sha256":"e5da4e4200323899"}},{"arxiv_id":"2110.00970","paper":"/paper/semantic-guided-zero-shot-learning-for-low","title":"Semantic-Guided Zero-Shot Learning for Low-Light Image/Video Enhancement","date":"2021-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenZheng2000/Semantic-Guided-Low-Light-Image-Enhancement","path":"modeling/fpn.py","file_url":"https://github.com/ShenZheng2000/Semantic-Guided-Low-Light-Image-Enhancement/blob/HEAD/modeling/fpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7aea909c128d085","mcp_get_code":{"code_sha256":"c7aea909c128d085"}},{"arxiv_id":"2109.14449","paper":"/paper/one-loss-for-all-deep-hashing-with-a-single","title":"One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamwoh/orthohash","path":"utils/datasets.py","file_url":"https://github.com/kamwoh/orthohash/blob/HEAD/utils/datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d2b1a5f7c60e27b5","mcp_get_code":{"code_sha256":"d2b1a5f7c60e27b5"}},{"arxiv_id":"2109.07438","paper":"/paper/camul-calibrated-and-accurate-multi-view-time","title":"CAMul: Calibrated and Accurate Multi-view Time-Series Forecasting","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/camul","path":"train_covid.py","file_url":"https://github.com/adityalab/camul/blob/HEAD/train_covid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b195a6b88d4bd87","mcp_get_code":{"code_sha256":"8b195a6b88d4bd87"}},{"arxiv_id":"2109.03508","paper":"/paper/repnas-searching-for-efficient-re","title":"RepNAS: Searching for Efficient Re-parameterizing Blocks","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bestfleer/RepNAS","path":"utils/Mixup.py","file_url":"https://github.com/bestfleer/RepNAS/blob/HEAD/utils/Mixup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"2108.09112","paper":"/paper/continual-learning-for-image-based-camera","title":"Continual Learning for Image-Based Camera Localization","date":"2021-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltovision/cl_hscnet","path":"models/hscnet.py","file_url":"https://github.com/aaltovision/cl_hscnet/blob/HEAD/models/hscnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3dea70a376daefdf","mcp_get_code":{"code_sha256":"3dea70a376daefdf"}},{"arxiv_id":"2107.07075","paper":"/paper/deep-learning-on-a-data-diet-finding","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mansheej/data_diet","path":"data_diet/data.py","file_url":"https://github.com/mansheej/data_diet/blob/HEAD/data_diet/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":"f8f057d94b1824fe","mcp_get_code":{"code_sha256":"f8f057d94b1824fe"}},{"arxiv_id":"2106.05150","paper":"/paper/scaling-up-graph-neural-networks-via-graph","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening","path":"APPNP/utils.py","file_url":"https://github.com/szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening/blob/HEAD/APPNP/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"03c0ec68ff746fc6","mcp_get_code":{"code_sha256":"03c0ec68ff746fc6"}},{"arxiv_id":"2106.04379","paper":"/paper/learning-markov-state-abstractions-for-deep","title":"Learning Markov State Abstractions for Deep Reinforcement Learning","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camall3n/markov-state-abstractions","path":"markov_abstr/gridworld/models/nnutils.py","file_url":"https://github.com/camall3n/markov-state-abstractions/blob/HEAD/markov_abstr/gridworld/models/nnutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5d06710de8ac5fbd","mcp_get_code":{"code_sha256":"5d06710de8ac5fbd"}},{"arxiv_id":"2106.03904","paper":"/paper/when-in-doubt-neural-non-parametric","title":"When in Doubt: Neural Non-Parametric Uncertainty Quantification for Epidemic Forecasting","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/epifnp","path":"train_ili.py","file_url":"https://github.com/adityalab/epifnp/blob/HEAD/train_ili.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5a22adb6b1bdc7e","mcp_get_code":{"code_sha256":"a5a22adb6b1bdc7e"}},{"arxiv_id":"2105.13889","paper":"/paper/equilibrium-and-non-equilibrium-regimes-in","title":"Equilibrium and non-Equilibrium regimes in the learning of Restricted Boltzmann Machines","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AurelienDecelle/TorchRBM","path":"rbm/custom_fn.py","file_url":"https://github.com/AurelienDecelle/TorchRBM/blob/HEAD/rbm/custom_fn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f2786712ec765b2c","mcp_get_code":{"code_sha256":"f2786712ec765b2c"}},{"arxiv_id":"2105.12848","paper":"/paper/bertifying-the-hidden-markov-model-for-multi","title":"BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yinghao-Li/CHMM-ALT","path":"data_constr/src/util.py","file_url":"https://github.com/Yinghao-Li/CHMM-ALT/blob/HEAD/data_constr/src/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":"94f946467c015b2d","mcp_get_code":{"code_sha256":"94f946467c015b2d"}},{"arxiv_id":"2104.03501","paper":"/paper/deepi2p-image-to-point-cloud-registration-via","title":"DeepI2P: Image-to-Point Cloud Registration via Deep Classification","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijx10/DeepI2P","path":"models/focal_loss.py","file_url":"https://github.com/lijx10/DeepI2P/blob/HEAD/models/focal_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2311207780694810","mcp_get_code":{"code_sha256":"2311207780694810"}},{"arxiv_id":"2103.13701","paper":"/paper/ecinn-efficient-counterfactuals-from","title":"ECINN: Efficient Counterfactuals from Invertible Neural Networks","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fhvilshoj/ecinn","path":"counterfactual/cf_utils.py","file_url":"https://github.com/fhvilshoj/ecinn/blob/HEAD/counterfactual/cf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb78cf906deee8f7","mcp_get_code":{"code_sha256":"eb78cf906deee8f7"}},{"arxiv_id":"2103.13413","paper":"/paper/vision-transformers-for-dense-prediction","title":"Vision Transformers for Dense Prediction","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mszpc/3d_dense","path":"3d_densenet/src/common.py","file_url":"https://github.com/mszpc/3d_dense/blob/HEAD/3d_densenet/src/common.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":"c3d563ce6492d0a5","mcp_get_code":{"code_sha256":"c3d563ce6492d0a5"}},{"arxiv_id":"2101.12378","paper":"/paper/nemo-neural-mesh-models-of-contrastive-1","title":"NeMo: Neural Mesh Models of Contrastive Features for Robust 3D Pose Estimation","date":"2021-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Angtian/NeMo","path":"code/models/FeatureBanks.py","file_url":"https://github.com/Angtian/NeMo/blob/HEAD/code/models/FeatureBanks.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a67d611e7bd0a54f","mcp_get_code":{"code_sha256":"a67d611e7bd0a54f"}},{"arxiv_id":"2010.12035","paper":"/paper/keep-your-eyes-on-the-lane-attention-guided","title":"Keep your Eyes on the Lane: Real-time Attention-guided Lane Detection","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucastabelini/LaneATT","path":"lib/focal_loss.py","file_url":"https://github.com/lucastabelini/LaneATT/blob/HEAD/lib/focal_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7460dd375c3ae41","mcp_get_code":{"code_sha256":"c7460dd375c3ae41"}},{"arxiv_id":"2010.07092","paper":"/paper/data-augmentation-for-meta-learning-1","title":"Data Augmentation for Meta-Learning","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renkunni/metaaug","path":"train_aug.py","file_url":"https://github.com/renkunni/metaaug/blob/HEAD/train_aug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"2010.02986","paper":"/paper/compositional-demographic-word-embeddings","title":"Compositional Demographic Word Embeddings","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/awd-lstm-lm","path":"pointer.py","file_url":"https://github.com/salesforce/awd-lstm-lm/blob/HEAD/pointer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d38f82da04a3f93e","mcp_get_code":{"code_sha256":"d38f82da04a3f93e"}},{"arxiv_id":"2010.00352","paper":"/paper/meta-consolidation-for-continual-learning","title":"Meta-Consolidation for Continual Learning","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JosephKJ/merlin","path":"lib/consolidate.py","file_url":"https://github.com/JosephKJ/merlin/blob/HEAD/lib/consolidate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8431f92b5e9cab82","mcp_get_code":{"code_sha256":"8431f92b5e9cab82"}},{"arxiv_id":"2009.04960","paper":"/paper/prototype-completion-with-primitive-knowledge","title":"Prototype Completion with Primitive Knowledge for Few-Shot Learning","date":"2020-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangbq-research/Prototype_Completion_for_FSL","path":"models/classification_heads.py","file_url":"https://github.com/zhangbq-research/Prototype_Completion_for_FSL/blob/HEAD/models/classification_heads.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"2009.02623","paper":"/paper/information-theoretic-counterfactual-learning","title":"Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedback","date":"2020-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanWangZf/CVIB-Rec","path":"matrix_factorization.py","file_url":"https://github.com/RyanWangZf/CVIB-Rec/blob/HEAD/matrix_factorization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4fe5b26db1726dd8","mcp_get_code":{"code_sha256":"4fe5b26db1726dd8"}},{"arxiv_id":"2008.10858","paper":"/paper/lowfer-low-rank-bilinear-pooling-for-link","title":"LowFER: Low-rank Bilinear Pooling for Link Prediction","date":"2020-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suamin/lowfer","path":"scripts/toy_example.py","file_url":"https://github.com/suamin/lowfer/blob/HEAD/scripts/toy_example.py","status":"unverified","verification_level":0,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab2a2912ef928b40","mcp_get_code":{"code_sha256":"ab2a2912ef928b40"}},{"arxiv_id":"2008.03703","paper":"/paper/what-neural-networks-memorize-and-why","title":"What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/heldout-influence-estimation","path":"mnist-example/mnist_infl_mem.py","file_url":"https://github.com/google-research/heldout-influence-estimation/blob/HEAD/mnist-example/mnist_infl_mem.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":"a8f998b9ec355770","mcp_get_code":{"code_sha256":"a8f998b9ec355770"}},{"arxiv_id":"2007.10637","paper":"/paper/distributed-memory-based-self-supervised","title":"Distributed Associative Memory Network with Memory Refreshing Loss","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taewonpark/DAM","path":"model/DAM/util.py","file_url":"https://github.com/taewonpark/DAM/blob/HEAD/model/DAM/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb2b8d997f4e7238","mcp_get_code":{"code_sha256":"eb2b8d997f4e7238"}},{"arxiv_id":"2007.09601","paper":"/paper/hypersolvers-toward-fast-continuous-depth","title":"Hypersolvers: Toward Fast Continuous-Depth Models","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DiffEqML/diffeqml-research","path":"neural-hybrid-automata/src/nn.py","file_url":"https://github.com/DiffEqML/diffeqml-research/blob/HEAD/neural-hybrid-automata/src/nn.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":"c6a6548ef8385b9a","mcp_get_code":{"code_sha256":"c6a6548ef8385b9a"}},{"arxiv_id":"2007.03898","paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/NVAE","path":"model.py","file_url":"https://github.com/NVlabs/NVAE/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b95bc8179cca09d6","mcp_get_code":{"code_sha256":"b95bc8179cca09d6"}},{"arxiv_id":"2007.02924","paper":"/paper/int-an-inequality-benchmark-for-evaluating","title":"INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertqjiang/INT","path":"int_environment/algos/thm_env.py","file_url":"https://github.com/albertqjiang/INT/blob/HEAD/int_environment/algos/thm_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d760315462516b6b","mcp_get_code":{"code_sha256":"d760315462516b6b"}},{"arxiv_id":"2007.02924","paper":"/paper/int-an-inequality-benchmark-for-evaluating","title":"INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertqjiang/INT","path":"int_environment/algos/lib/ops.py","file_url":"https://github.com/albertqjiang/INT/blob/HEAD/int_environment/algos/lib/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a36605330ae69c8d","mcp_get_code":{"code_sha256":"a36605330ae69c8d"}},{"arxiv_id":"2006.05205","paper":"/paper/on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tech-srl/bottleneck","path":"common.py","file_url":"https://github.com/tech-srl/bottleneck/blob/HEAD/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3cbabc677bbc4e31","mcp_get_code":{"code_sha256":"3cbabc677bbc4e31"}},{"arxiv_id":"2006.05077","paper":"/paper/sekd-self-evolving-keypoint-detection-and","title":"SEKD: Self-Evolving Keypoint Detection and Description","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliyun/Self-Evolving-Keypoint-Demo","path":"loss/loss_focal.py","file_url":"https://github.com/aliyun/Self-Evolving-Keypoint-Demo/blob/HEAD/loss/loss_focal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"7b7e414e3d968b19","mcp_get_code":{"code_sha256":"7b7e414e3d968b19"}},{"arxiv_id":"2004.10934","paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeegonJin/yolov1","path":"yolov1.py","file_url":"https://github.com/HeegonJin/yolov1/blob/HEAD/yolov1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"76c3b477a498bbae","mcp_get_code":{"code_sha256":"76c3b477a498bbae"}},{"arxiv_id":"2004.05805","paper":"/paper/unsupervised-few-shot-learning-via","title":"Diversity Helps: Unsupervised Few-shot Learning via Distribution Shift-based Data Augmentation","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WonderSeven/ULDA","path":"network/net_tools.py","file_url":"https://github.com/WonderSeven/ULDA/blob/HEAD/network/net_tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1ac0078149b3155","mcp_get_code":{"code_sha256":"f1ac0078149b3155"}},{"arxiv_id":"2003.12815","paper":"/paper/efficient-domain-generalization-via-common","title":"Efficient Domain Generalization via Common-Specific Low-Rank Decomposition","date":"2020-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vihari/csd","path":"pacs/train_csd.py","file_url":"https://github.com/vihari/csd/blob/HEAD/pacs/train_csd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ded0bf1e1b21f399","mcp_get_code":{"code_sha256":"ded0bf1e1b21f399"}},{"arxiv_id":"2002.09579","paper":"/paper/robustness-to-programmable-string","title":"Robustness to Programmable String Transformations via Augmented Abstract Training","date":"2020-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ForeverZyh/A3T","path":"a3t/diffai/components.py","file_url":"https://github.com/ForeverZyh/A3T/blob/HEAD/a3t/diffai/components.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfd82e9e809aad36","mcp_get_code":{"code_sha256":"bfd82e9e809aad36"}},{"arxiv_id":"2002.01690","paper":"/paper/entropy-minimization-vs-diversity","title":"Entropy Minimization vs. Diversity Maximization for Domain Adaptation","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-NERC-NUPT/MEDM","path":"MEDM_VisDA_Res50.py","file_url":"https://github.com/AI-NERC-NUPT/MEDM/blob/HEAD/MEDM_VisDA_Res50.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a50f333caba99b0a","mcp_get_code":{"code_sha256":"a50f333caba99b0a"}},{"arxiv_id":"1912.10917","paper":"/paper/fasterseg-searching-for-faster-real-time-1","title":"FasterSeg: Searching for Faster Real-time Semantic Segmentation","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/FasterSeg","path":"search/loss.py","file_url":"https://github.com/TAMU-VITA/FasterSeg/blob/HEAD/search/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75fbeebf4d62eccd","mcp_get_code":{"code_sha256":"75fbeebf4d62eccd"}},{"arxiv_id":"1912.09363","paper":"/paper/temporal-fusion-transformers-for","title":"Temporal Fusion Transformers for Interpretable Multi-horizon Time Series Forecasting","date":"2019-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiamMaclean216/Temporal-Fusion-Transformer","path":"data.py","file_url":"https://github.com/LiamMaclean216/Temporal-Fusion-Transformer/blob/HEAD/data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e9f6b9b785a1b6a","mcp_get_code":{"code_sha256":"7e9f6b9b785a1b6a"}},{"arxiv_id":"1912.07200","paper":"/paper/a-new-benchmark-for-evaluation-of-cross","title":"A Broader Study of Cross-Domain Few-Shot Learning","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/cdfsl-benchmark","path":"utils.py","file_url":"https://github.com/IBM/cdfsl-benchmark/blob/HEAD/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":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"1911.05630","paper":"/paper/exploiting-gan-internal-capacity-for-high","title":"Exploiting GAN Internal Capacity for High-Quality Reconstruction of Natural Images","date":"2019-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CIFASIS/exploiting-gan-internal-capacity","path":"inversion.py","file_url":"https://github.com/CIFASIS/exploiting-gan-internal-capacity/blob/HEAD/inversion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36bc4cbab4bc2b1e","mcp_get_code":{"code_sha256":"36bc4cbab4bc2b1e"}},{"arxiv_id":"1910.12358","paper":"/paper/dual-iv-a-single-stage-instrumental-variable","title":"Dual Instrumental Variable Regression","date":"2019-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krikamol/DualIV-NeurIPS2020","path":"DeepGMM/data_generator.py","file_url":"https://github.com/krikamol/DualIV-NeurIPS2020/blob/HEAD/DeepGMM/data_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee0f306effd61f2d","mcp_get_code":{"code_sha256":"ee0f306effd61f2d"}},{"arxiv_id":"1910.05513","paper":"/paper/on-robustness-of-neural-ordinary-differential","title":"On Robustness of Neural Ordinary Differential Equations","date":"2019-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanshuYAN/TisODE","path":"attack_mnist/main_tisode.py","file_url":"https://github.com/HanshuYAN/TisODE/blob/HEAD/attack_mnist/main_tisode.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"64975423655410b6","mcp_get_code":{"code_sha256":"64975423655410b6"}},{"arxiv_id":"1909.13576","paper":"/paper/chameleon-learning-model-initializations","title":"Chameleon: Learning Model Initializations Across Tasks With Different Schemas","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"radrumond/Chameleon","path":"code/Chameleon.py","file_url":"https://github.com/radrumond/Chameleon/blob/HEAD/code/Chameleon.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a339d2ecbff5999d","mcp_get_code":{"code_sha256":"a339d2ecbff5999d"}},{"arxiv_id":"1908.05724","paper":"/paper/semi-supervised-semantic-segmentation-with","title":"Semi-Supervised Semantic Segmentation with High- and Low-level Consistency","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"3d0fa6038b78822c","mcp_get_code":{"code_sha256":"3d0fa6038b78822c"}},{"arxiv_id":"1907.13359","paper":"/paper/deep-neural-network-hyperparameter","title":"Deep Neural Network Hyperparameter Optimization with Orthogonal Array Tuning","date":"2019-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangzhang1015/OATM","path":"src/cnn_model.py","file_url":"https://github.com/xiangzhang1015/OATM/blob/HEAD/src/cnn_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"af1cb734a3dcf23e","mcp_get_code":{"code_sha256":"af1cb734a3dcf23e"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"defd9ff9cbe131da","mcp_get_code":{"code_sha256":"defd9ff9cbe131da"}},{"arxiv_id":"1906.02944","paper":"/paper/learning-classifier-synthesis-for-generalized","title":"Learning Adaptive Classifiers Synthesis for Generalized Few-Shot Learning","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sha-Lab/CASTLE","path":"model/utils.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b36707a4929e1b6","mcp_get_code":{"code_sha256":"1b36707a4929e1b6"}},{"arxiv_id":"1906.00562","paper":"/paper/190600562","title":"Learning to Self-Train for Semi-Supervised Few-Shot Classification","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinzheli1217/learning-to-self-train","path":"code_for_LTTL/misc.py","file_url":"https://github.com/xinzheli1217/learning-to-self-train/blob/HEAD/code_for_LTTL/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b51e4e33126edd2","mcp_get_code":{"code_sha256":"7b51e4e33126edd2"}},{"arxiv_id":"1905.11881","paper":"/paper/analysis-of-gradient-clipping-and-adaptive","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingzhaoZhang/why-clipping-accelerates","path":"pointer.py","file_url":"https://github.com/JingzhaoZhang/why-clipping-accelerates/blob/HEAD/pointer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d38f82da04a3f93e","mcp_get_code":{"code_sha256":"d38f82da04a3f93e"}},{"arxiv_id":"1905.11871","paper":"/paper/miss-tools-and-mr-fruit-emergent","title":"Miss Tools and Mr Fruit: Emergent communication in agents learning about object affordances","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/fruit-tools-game","path":"utils.py","file_url":"https://github.com/facebookresearch/fruit-tools-game/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"0c64ac267107a5dc","mcp_get_code":{"code_sha256":"0c64ac267107a5dc"}},{"arxiv_id":"1905.06368","paper":"/paper/190506368","title":"Collaborative Global-Local Networks for Memory-Efficient Segmentation of Ultra-High Resolution Images","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenwydj/ultra_high_resolution_segmentation","path":"utils/loss.py","file_url":"https://github.com/chenwydj/ultra_high_resolution_segmentation/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75fbeebf4d62eccd","mcp_get_code":{"code_sha256":"75fbeebf4d62eccd"}},{"arxiv_id":"1904.13000","paper":"/paper/adversarial-training-and-robustness-for","title":"Adversarial Training and Robustness for Multiple Perturbations","date":"2019-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftramer/MultiRobustness","path":"eval_ch.py","file_url":"https://github.com/ftramer/MultiRobustness/blob/HEAD/eval_ch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a20026ff6ff35da","mcp_get_code":{"code_sha256":"6a20026ff6ff35da"}},{"arxiv_id":"1904.11088","paper":"/paper/d-vae-a-variational-autoencoder-for-directed","title":"D-VAE: A Variational Autoencoder for Directed Acyclic Graphs","date":"2019-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/D-VAE","path":"util.py","file_url":"https://github.com/muhanzhang/D-VAE/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":"7aa8d3508c19b8f6","mcp_get_code":{"code_sha256":"7aa8d3508c19b8f6"}},{"arxiv_id":"1902.08570","paper":"/paper/particlenet-jet-tagging-via-particle-clouds","title":"ParticleNet: Jet Tagging via Particle Clouds","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqucms/weaver-core","path":"weaver/nn/loss/focal.py","file_url":"https://github.com/hqucms/weaver-core/blob/HEAD/weaver/nn/loss/focal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5daf197a89a09cce","mcp_get_code":{"code_sha256":"5daf197a89a09cce"}},{"arxiv_id":"1902.03368","paper":"/paper/skin-lesion-analysis-toward-melanoma-1","title":"Skin Lesion Analysis Toward Melanoma Detection 2018: A Challenge Hosted by the International Skin Imaging Collaboration (ISIC)","date":"2019-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Woodman718/FixCaps","path":"Module/HAM10000/utils.py","file_url":"https://github.com/Woodman718/FixCaps/blob/HEAD/Module/HAM10000/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f613c916edc5a87c","mcp_get_code":{"code_sha256":"f613c916edc5a87c"}},{"arxiv_id":"1901.08164","paper":"/paper/decoupled-greedy-learning-of-cnns","title":"Decoupled Greedy Learning of CNNs","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenium/DGL","path":"dni_comparisons/cifar_cnn_dni.py","file_url":"https://github.com/eugenium/DGL/blob/HEAD/dni_comparisons/cifar_cnn_dni.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"148b238d5ad66615","mcp_get_code":{"code_sha256":"148b238d5ad66615"}},{"arxiv_id":"1901.05335","paper":"/paper/a-review-of-single-source-unsupervised-domain","title":"A review of domain adaptation without target labels","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmkouw/libTLDA","path":"libtlda/util.py","file_url":"https://github.com/wmkouw/libTLDA/blob/HEAD/libtlda/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46ecfaae155d1041","mcp_get_code":{"code_sha256":"46ecfaae155d1041"}},{"arxiv_id":"1811.11165","paper":"/paper/label-noise-robust-generative-adversarial","title":"Label-Noise Robust Generative Adversarial Networks","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"takuhirok/CP-GAN","path":"utils/util.py","file_url":"https://github.com/takuhirok/CP-GAN/blob/HEAD/utils/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6617ad16e119142a","mcp_get_code":{"code_sha256":"6617ad16e119142a"}},{"arxiv_id":"1811.09794","paper":"/paper/three-dimensionally-embedded-graph","title":"Three-Dimensionally Embedded Graph Convolutional Network (3DGCN) for Molecule Interpretation","date":"2018-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackmints/3DGCN","path":"model/dataset.py","file_url":"https://github.com/blackmints/3DGCN/blob/HEAD/model/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c73ea90eb6570b31","mcp_get_code":{"code_sha256":"c73ea90eb6570b31"}},{"arxiv_id":"1811.00210","paper":"/paper/online-planner-selection-with-graph-neural","title":"Online Planner Selection with Graph Neural Networks and Adaptive Scheduling","date":"2018-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matenure/GNN_planner","path":"utils.py","file_url":"https://github.com/matenure/GNN_planner/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"691de0fe5c31090c","mcp_get_code":{"code_sha256":"691de0fe5c31090c"}},{"arxiv_id":"1808.07593","paper":"/paper/caveats-for-information-bottleneck-in","title":"Caveats for information bottleneck in deterministic scenarios","date":"2018-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"artemyk/ibcurve","path":"rundata.py","file_url":"https://github.com/artemyk/ibcurve/blob/HEAD/rundata.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e222c7d8f6af3765","mcp_get_code":{"code_sha256":"e222c7d8f6af3765"}},{"arxiv_id":"1808.00897","paper":"/paper/bisenet-bilateral-segmentation-network-for","title":"BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentation","date":"2018-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ycszen/TorchSeg","path":"furnace/seg_opr/seg_oprs.py","file_url":"https://github.com/ycszen/TorchSeg/blob/HEAD/furnace/seg_opr/seg_oprs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce0cd041399bf007","mcp_get_code":{"code_sha256":"ce0cd041399bf007"}},{"arxiv_id":"1806.00807","paper":"/paper/learning-semantic-sentence-embeddings-using-1","title":"Learning Semantic Sentence Embeddings using Sequential Pair-wise Discriminator","date":"2018-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dev-chauhan/PQG-pytorch","path":"misc/utils.py","file_url":"https://github.com/dev-chauhan/PQG-pytorch/blob/HEAD/misc/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa2c3c11f48386d7","mcp_get_code":{"code_sha256":"aa2c3c11f48386d7"}},{"arxiv_id":"1805.04623","paper":"/paper/sharp-nearby-fuzzy-far-away-how-neural","title":"Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"urvashik/lm-context-analysis","path":"pointer.py","file_url":"https://github.com/urvashik/lm-context-analysis/blob/HEAD/pointer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d38f82da04a3f93e","mcp_get_code":{"code_sha256":"d38f82da04a3f93e"}},{"arxiv_id":"1803.08240","paper":"/paper/an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtheMathmo/lookahead-lstm","path":"pointer.py","file_url":"https://github.com/AtheMathmo/lookahead-lstm/blob/HEAD/pointer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d38f82da04a3f93e","mcp_get_code":{"code_sha256":"d38f82da04a3f93e"}},{"arxiv_id":"1711.03953","paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkcr/overlap-ml","path":"awd/pointer.py","file_url":"https://github.com/nkcr/overlap-ml/blob/HEAD/awd/pointer.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":"8cfc87c86a68ccf9","mcp_get_code":{"code_sha256":"8cfc87c86a68ccf9"}},{"arxiv_id":"1708.02182","paper":"/paper/regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Asteur/RERITES-AvgWeightDescentLSTM-PoetryGeneration","path":"pointer.py","file_url":"https://github.com/Asteur/RERITES-AvgWeightDescentLSTM-PoetryGeneration/blob/HEAD/pointer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d38f82da04a3f93e","mcp_get_code":{"code_sha256":"d38f82da04a3f93e"}},{"arxiv_id":"1703.03717","paper":"/paper/right-for-the-right-reasons-training","title":"Right for the Right Reasons: Training Differentiable Models by Constraining their Explanations","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtak/rrr","path":"rrr/multilayer_perceptron.py","file_url":"https://github.com/dtak/rrr/blob/HEAD/rrr/multilayer_perceptron.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fff341b836aa49d0","mcp_get_code":{"code_sha256":"fff341b836aa49d0"}},{"arxiv_id":"1703.03717","paper":"/paper/right-for-the-right-reasons-training","title":"Right for the Right Reasons: Training Differentiable Models by Constraining their Explanations","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtak/rrr","path":"rrr/tensorflow_perceptron.py","file_url":"https://github.com/dtak/rrr/blob/HEAD/rrr/tensorflow_perceptron.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d144728084cadb8c","mcp_get_code":{"code_sha256":"d144728084cadb8c"}},{"arxiv_id":"1703.01780","paper":"/paper/mean-teachers-are-better-role-models-weight","title":"Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results","date":"2017-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sud0301/semisup-semseg","path":"train_s4GAN.py","file_url":"https://github.com/sud0301/semisup-semseg/blob/HEAD/train_s4GAN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3d0fa6038b78822c","mcp_get_code":{"code_sha256":"3d0fa6038b78822c"}},{"arxiv_id":"1703.01253","paper":"/paper/machine-learning-on-sequential-data-using-a","title":"Machine Learning on Sequential Data Using a Recurrent Weighted Average","date":"2017-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theSage21/torchcircus","path":"rwa/classifying_artificial_grammar.py","file_url":"https://github.com/theSage21/torchcircus/blob/HEAD/rwa/classifying_artificial_grammar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"62dfaf949c7a6e17","mcp_get_code":{"code_sha256":"62dfaf949c7a6e17"}},{"arxiv_id":"1702.03814","paper":"/paper/bilateral-multi-perspective-matching-for","title":"Bilateral Multi-Perspective Matching for Natural Language Sentences","date":"2017-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MariBax/Paraphrase-Identification","path":"BIMPM/bimpm.py","file_url":"https://github.com/MariBax/Paraphrase-Identification/blob/HEAD/BIMPM/bimpm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2a55d25a0b171082","mcp_get_code":{"code_sha256":"2a55d25a0b171082"}},{"arxiv_id":"1605.02971","paper":"/paper/structured-receptive-fields-in-cnns","title":"Structured Receptive Fields in CNNs","date":"2016-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhjacobsen/RFNN","path":"theano-rfnn/mnist_loader.py","file_url":"https://github.com/jhjacobsen/RFNN/blob/HEAD/theano-rfnn/mnist_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b51dff9353a0c6e8","mcp_get_code":{"code_sha256":"b51dff9353a0c6e8"}},{"arxiv_id":"1601.06733","paper":"/paper/long-short-term-memory-networks-for-machine","title":"Long Short-Term Memory-Networks for Machine Reading","date":"2016-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oneil512/lstmn","path":"lstmn.py","file_url":"https://github.com/oneil512/lstmn/blob/HEAD/lstmn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"89aa40952e6cd567","mcp_get_code":{"code_sha256":"89aa40952e6cd567"}},{"arxiv_id":"1509.09292","paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SystemicCypher/Neural-Molecule-Fingerprints","path":"src/neuralPrint.py","file_url":"https://github.com/SystemicCypher/Neural-Molecule-Fingerprints/blob/HEAD/src/neuralPrint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"15e6bd230285960d","mcp_get_code":{"code_sha256":"15e6bd230285960d"}},{"arxiv_id":"1506.02078","paper":"/paper/visualizing-and-understanding-recurrent","title":"Visualizing and Understanding Recurrent Networks","date":"2015-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chatha-Sphere/script-monkey","path":"helpers.py","file_url":"https://github.com/Chatha-Sphere/script-monkey/blob/HEAD/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"cf92679c97ec2eaf","mcp_get_code":{"code_sha256":"cf92679c97ec2eaf"}},{"arxiv_id":"1412.6572","paper":"/paper/explaining-and-harnessing-adversarial","title":"Explaining and Harnessing Adversarial Examples","date":"2014-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BendeguzToth/Fun-with-ConvNets","path":"project/utils.py","file_url":"https://github.com/BendeguzToth/Fun-with-ConvNets/blob/HEAD/project/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df76aed2eb8e5d62","mcp_get_code":{"code_sha256":"df76aed2eb8e5d62"}},{"arxiv_id":"1411.1784","paper":"/paper/conditional-generative-adversarial-nets","title":"Conditional Generative Adversarial Nets","date":"2014-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/cgan","path":"src/dataset.py","file_url":"https://github.com/lyqcom/cgan/blob/HEAD/src/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f34f91a733b1a8da","mcp_get_code":{"code_sha256":"f34f91a733b1a8da"}},{"arxiv_id":"1409.0575","paper":"/paper/imagenet-large-scale-visual-recognition","title":"ImageNet Large Scale Visual Recognition Challenge","date":"2014-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"y2l/meta-transfer-learning-tensorflow","path":"tensorflow/utils/misc.py","file_url":"https://github.com/y2l/meta-transfer-learning-tensorflow/blob/HEAD/tensorflow/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":"a28e2acfd83b29fd","mcp_get_code":{"code_sha256":"a28e2acfd83b29fd"}},{"arxiv_id":"ijcai2025_0115","paper":null,"title":"arXiv:ijcai2025_0115","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Gwxer/Hierarchical-Adapter","path":"datasets/blending.py","file_url":"https://github.com/Gwxer/Hierarchical-Adapter/blob/HEAD/datasets/blending.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4728dc2025227bba","mcp_get_code":{"code_sha256":"4728dc2025227bba"}},{"arxiv_id":"ijcai2020_0377","paper":null,"title":"arXiv:ijcai2020_0377","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"P1nzhuo/Consistent-MetaReg","path":"bilevels/train_cm_miniImageNet.py","file_url":"https://github.com/P1nzhuo/Consistent-MetaReg/blob/HEAD/bilevels/train_cm_miniImageNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6db52403976aa70c","mcp_get_code":{"code_sha256":"6db52403976aa70c"}},{"arxiv_id":"Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","paper":null,"title":"arXiv:Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NWPUZhoufei/FMA","path":"utils.py","file_url":"https://github.com/NWPUZhoufei/FMA/blob/HEAD/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":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"Zhou_Revisiting_Prototypical_Network_for_Cross_Domain_Few-Shot_Learning_CVPR_2023_paper","paper":null,"title":"arXiv:Zhou_Revisiting_Prototypical_Network_for_Cross_Domain_Few-Shot_Learning_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NWPUZhoufei/LDP-Net","path":"utils.py","file_url":"https://github.com/NWPUZhoufei/LDP-Net/blob/HEAD/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":"f1324589fc273593","mcp_get_code":{"code_sha256":"f1324589fc273593"}},{"arxiv_id":"Phoo_Coarsely-Labeled_Data_for_Better_Few-Shot_Transfer_ICCV_2021_paper","paper":null,"title":"arXiv:Phoo_Coarsely-Labeled_Data_for_Better_Few-Shot_Transfer_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cpphoo/PAS","path":"metaOptNet/metaOptNet.py","file_url":"https://github.com/cpphoo/PAS/blob/HEAD/metaOptNet/metaOptNet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c64c35be7f02395","mcp_get_code":{"code_sha256":"7c64c35be7f02395"}},{"arxiv_id":"Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","paper":null,"title":"arXiv:Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"liqiokkk/FCtL","path":"utils/loss.py","file_url":"https://github.com/liqiokkk/FCtL/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75fbeebf4d62eccd","mcp_get_code":{"code_sha256":"75fbeebf4d62eccd"}},{"arxiv_id":"2023.findings-emnlp.517","paper":null,"title":"arXiv:2023.findings-emnlp.517","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jyansir/Text2Tree","path":"htc_baselines/hgclr/model/contrast.py","file_url":"https://github.com/jyansir/Text2Tree/blob/HEAD/htc_baselines/hgclr/model/contrast.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"288a6497283d4ac5","mcp_get_code":{"code_sha256":"288a6497283d4ac5"}}]}