{"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/test","entry":"test","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":377,"n_papers_ran":138,"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":411,"n_samples_ran":142,"n_samples_fingerprinted":3,"n_places":447,"n_places_pointer_only":179,"by_status":{"ran_honours":56,"ran_violates":2,"ran_draft_wrong":28,"ran_fixture":19,"ran":37,"unverified":269},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.01425","paper":"/paper/arxiv-2609-01425","title":"CATeye: Coupled Attribute-Topology Invariance Learning for Voucher Abuse Detection","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Tian0426/CATeye","path":"utils.py","file_url":"https://github.com/Tian0426/CATeye/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"25666e4423367cd6","mcp_get_code":{"code_sha256":"25666e4423367cd6"}},{"arxiv_id":"2608.20801","paper":"/paper/arxiv-2608-20801","title":"Profiling What Matters: Context-Aware Item Profiles from Large-Scale Metadata for LLM Recommenders","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rgbeing/CAIRO","path":"profiler/train_fs.py","file_url":"https://github.com/rgbeing/CAIRO/blob/HEAD/profiler/train_fs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e2a626e5f7cb538f","mcp_get_code":{"code_sha256":"e2a626e5f7cb538f"}},{"arxiv_id":"2607.17653","paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"iamjingli/LFM","path":"train_target.py","file_url":"https://github.com/iamjingli/LFM/blob/HEAD/train_target.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe73cf9445756920","mcp_get_code":{"code_sha256":"fe73cf9445756920"}},{"arxiv_id":"2606.31742","paper":"/paper/arxiv-2606-31742","title":"FedXDS: Leveraging Model Attribution Methods to counteract Data Heterogeneity in Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"MaxH1996/FedXDS","path":"feature_fedxds.py","file_url":"https://github.com/MaxH1996/FedXDS/blob/HEAD/feature_fedxds.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d102b5269b0c1bd","mcp_get_code":{"code_sha256":"6d102b5269b0c1bd"}},{"arxiv_id":"2606.22307","paper":"/paper/arxiv-2606-22307","title":"Enhancing Protein Representation Learning via Manifold Restore Mixing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"KingGugu/MRM","path":"fold.py","file_url":"https://github.com/KingGugu/MRM/blob/HEAD/fold.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":"d2ecaf279dfcaeb0","mcp_get_code":{"code_sha256":"d2ecaf279dfcaeb0"}},{"arxiv_id":"2606.12733","paper":"/paper/arxiv-2606-12733","title":"Let's Ask Gauss: Improved One-Run Privacy Auditing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"stoneboat/dpsgd-auditbench","path":"src/train_dpftrl.py","file_url":"https://github.com/stoneboat/dpsgd-auditbench/blob/HEAD/src/train_dpftrl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c5e4d143133355c3","mcp_get_code":{"code_sha256":"c5e4d143133355c3"}},{"arxiv_id":"2606.07728","paper":"/paper/arxiv-2606-07728","title":"Characterizing the Discrete Geometry of ReLU Networks","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"bl-ake/ICLR-2026","path":"experiments.py","file_url":"https://github.com/bl-ake/ICLR-2026/blob/HEAD/experiments.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ee08aeec9da286c","mcp_get_code":{"code_sha256":"5ee08aeec9da286c"}},{"arxiv_id":"2605.29933","paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/CC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/CC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb2661c1f273dcdf","mcp_get_code":{"code_sha256":"fb2661c1f273dcdf"}},{"arxiv_id":"2605.29933","paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/DIVC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/DIVC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf35aad7d0c5fa37","mcp_get_code":{"code_sha256":"cf35aad7d0c5fa37"}},{"arxiv_id":"2605.29933","paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/PICA.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/PICA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bbb107a05f6eb61","mcp_get_code":{"code_sha256":"5bbb107a05f6eb61"}},{"arxiv_id":"2605.08863","paper":"/paper/arxiv-2605-08863","title":"Max-pooling Network Revisited: Analyzing the Role of Semantic Probability in Multiple Instance Learning for Hallucination Detection","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FUJI1229/Hallucination_Detection","path":"Detection/validate.py","file_url":"https://github.com/FUJI1229/Hallucination_Detection/blob/HEAD/Detection/validate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d031ee05ad849e1","mcp_get_code":{"code_sha256":"9d031ee05ad849e1"}},{"arxiv_id":"2603.24209","paper":"/paper/arxiv-2603-24209","title":"HEART-PFL: Stable Personalized Federated Learning under Heterogeneity with Hierarchical Directional Alignment and Adversarial Knowledge Transfer","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"danny0628/HEART-PFL","path":"aggregation/distillation.py","file_url":"https://github.com/danny0628/HEART-PFL/blob/HEAD/aggregation/distillation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6742d7a324b62056","mcp_get_code":{"code_sha256":"6742d7a324b62056"}},{"arxiv_id":"2602.01139","paper":"/paper/arxiv-2602-01139","title":"-I ∈ R n×n : The Identity matrix; -A ∈ [0, 1] n×n : The Adjacency matrix of G; -D ∈ R n×n : The degree matrix, i.e., a diagonal matrix defined as D ii = ∑ n i=1 a ij ; -A ∈ R n×n : The normalized adjacency matrix of G, i.e., A = D -1/2 AD -1/2 ; -L ∈ R n×n : The Unnormalised Laplacian matrix of G; -Q ∈ R n×n : The Signless Laplacian matrix of G; -L rw ∈ R n×n : The Random-walk Normalised Laplacian of G; vii -L sym ∈ R n×n : The Symmetric Normalised Laplacian matrix of G; -Â ∈ R n×n : The Normalised Adjacency matrix of G; λ 1 (L rw ) : The Equidistribution radius of G; ϱ r (H) : The Normalized Spectral Gap of G; -X G ∈ R n×K , or simply X ∈ R n×K : The node feature matrix of the graph G, obtained by stacking up all x i vectors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Sennadir/GCORN","path":"utils.py","file_url":"https://github.com/Sennadir/GCORN/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fac5c5a475110d7a","mcp_get_code":{"code_sha256":"fac5c5a475110d7a"}},{"arxiv_id":"2601.18938","paper":"/paper/arxiv-2601-18938","title":"FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ssjcode/FSD-CAP","path":"evaluation.py","file_url":"https://github.com/ssjcode/FSD-CAP/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9733b195c5feec38","mcp_get_code":{"code_sha256":"9733b195c5feec38"}},{"arxiv_id":"2601.14154","paper":"/paper/arxiv-2601-14154","title":"LLM Augmented Intervenable Multimodal Adaptor for Post-operative Complication Prediction in Lung Cancer Surgery","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"KNITPhoenix/MIRACLE","path":"inference.py","file_url":"https://github.com/KNITPhoenix/MIRACLE/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"27c7f336efaeddd2","mcp_get_code":{"code_sha256":"27c7f336efaeddd2"}},{"arxiv_id":"2601.03429","paper":"/paper/arxiv-2601-03429","title":"DeepLeak: Privacy Enhancing Hardening of Model Explanations Against Membership Leakage","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"um-dsp/DeepLeak","path":"utils/evaluation.py","file_url":"https://github.com/um-dsp/DeepLeak/blob/HEAD/utils/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bbe52bfffee9e814","mcp_get_code":{"code_sha256":"bbe52bfffee9e814"}},{"arxiv_id":"2512.14395","paper":"/paper/arxiv-2512-14395","title":"Massive Editing for Large Language Models Based on Dynamic Weight Generation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"RodeWayne/MeG-for-Knowledge-Editing","path":"train_neuron.py","file_url":"https://github.com/RodeWayne/MeG-for-Knowledge-Editing/blob/HEAD/train_neuron.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22698492eed06605","mcp_get_code":{"code_sha256":"22698492eed06605"}},{"arxiv_id":"2512.01782","paper":"/paper/arxiv-2512-01782","title":"Dual Randomized Smoothing: Beyond Global Noise Variance","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"eth-sri/Dual-Randomized-Smoothing","path":"code/train_sigma_est.py","file_url":"https://github.com/eth-sri/Dual-Randomized-Smoothing/blob/HEAD/code/train_sigma_est.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c3a00132cc06f4d3","mcp_get_code":{"code_sha256":"c3a00132cc06f4d3"}},{"arxiv_id":"2510.03690","paper":"/paper/arxiv-2510-03690","title":"From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"aliaaz99/moments2models","path":"gmam/encoder.py","file_url":"https://github.com/aliaaz99/moments2models/blob/HEAD/gmam/encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd1a8f0d7dcf46b6","mcp_get_code":{"code_sha256":"cd1a8f0d7dcf46b6"}},{"arxiv_id":"2509.18376","paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_arxiv_gcn.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_arxiv_gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be8f188e22f9fda4","mcp_get_code":{"code_sha256":"be8f188e22f9fda4"}},{"arxiv_id":"2508.07201","paper":"/paper/arxiv-2508-07201","title":"Propagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"CcQunResearch/RAGCL","path":"Main/main(pretrain).py","file_url":"https://github.com/CcQunResearch/RAGCL/blob/HEAD/Main/main%28pretrain%29.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"07c1c9d770c43c9d","mcp_get_code":{"code_sha256":"07c1c9d770c43c9d"}},{"arxiv_id":"2507.03474","paper":"/paper/molecular-machine-learning-using-euler","title":"Molecular Machine Learning Using Euler Characteristic Transforms","date":"2025-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victosdur/ectformoleculelearningtask","path":"utils.py","file_url":"https://github.com/victosdur/ectformoleculelearningtask/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"cf2930b6b0ce6c1c","mcp_get_code":{"code_sha256":"cf2930b6b0ce6c1c"}},{"arxiv_id":"2506.14473","paper":"/paper/foundation-model-insights-and-a-multi-model","title":"Foundation Model Insights and a Multi-Model Approach for Superior Fine-Grained One-shot Subset Selection","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhijingWan/RAM-APL","path":"utils.py","file_url":"https://github.com/ZhijingWan/RAM-APL/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c58f9cd3def9743","mcp_get_code":{"code_sha256":"3c58f9cd3def9743"}},{"arxiv_id":"2506.07549","paper":"/paper/improving-memory-efficiency-for-training-kans","title":"Improving Memory Efficiency for Training KANs via Meta Learning","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murphyzc/metakan","path":"function_fitting/train_hyper.py","file_url":"https://github.com/murphyzc/metakan/blob/HEAD/function_fitting/train_hyper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a688f23d22db1ae","mcp_get_code":{"code_sha256":"8a688f23d22db1ae"}},{"arxiv_id":"2506.07549","paper":"/paper/improving-memory-efficiency-for-training-kans","title":"Improving Memory Efficiency for Training KANs via Meta Learning","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murphyzc/metakan","path":"image_classification/train_meta.py","file_url":"https://github.com/murphyzc/metakan/blob/HEAD/image_classification/train_meta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8eaee068bab1dbe7","mcp_get_code":{"code_sha256":"8eaee068bab1dbe7"}},{"arxiv_id":"2505.23176","paper":"/paper/the-panaceas-for-improving-low-rank","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leopold1423/fedmud-icml25","path":"train/trainer.py","file_url":"https://github.com/leopold1423/fedmud-icml25/blob/HEAD/train/trainer.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":"efd45416873e40d6","mcp_get_code":{"code_sha256":"efd45416873e40d6"}},{"arxiv_id":"2503.04446","paper":"/paper/smtpd-a-new-benchmark-for-temporal-prediction","title":"SMTPD: A New Benchmark for Temporal Prediction of Social Media Popularity","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"zhuwei321/SMTPD","path":"fe.py","file_url":"https://github.com/zhuwei321/SMTPD/blob/HEAD/fe.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":"14b2d03f943acced","mcp_get_code":{"code_sha256":"14b2d03f943acced"}},{"arxiv_id":"2502.09873","paper":"/paper/compression-aware-one-step-diffusion-model","title":"Compression-Aware One-Step Diffusion Model for JPEG Artifact Removal","date":"2025-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jp-guo/CODiff","path":"utils/utils_model.py","file_url":"https://github.com/jp-guo/CODiff/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8afaf26fe2391d00","mcp_get_code":{"code_sha256":"8afaf26fe2391d00"}},{"arxiv_id":"2412.13420","paper":"/paper/botsim-llm-powered-malicious-social-botnet","title":"BotSim: LLM-Powered Malicious Social Botnet Simulation","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"qqqqqqby/botsim","path":"BotSim-24-Exp/Method/GNN-Based/BotRGCN.py","file_url":"https://github.com/qqqqqqby/botsim/blob/HEAD/BotSim-24-Exp/Method/GNN-Based/BotRGCN.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":"10ee4fee0870bb50","mcp_get_code":{"code_sha256":"10ee4fee0870bb50"}},{"arxiv_id":"2412.07106","paper":"/paper/covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfinkelshtein/CoveredForests","path":"utils/trainer.py","file_url":"https://github.com/benfinkelshtein/CoveredForests/blob/HEAD/utils/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c691d4509645b00a","mcp_get_code":{"code_sha256":"c691d4509645b00a"}},{"arxiv_id":"2412.06219","paper":"/paper/data-free-backdoor-attacks","title":"Data Free Backdoor Attacks","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AAAAAAsuka/DataFree_Backdoor_Attacks","path":"handcrafted_backdoor.py","file_url":"https://github.com/AAAAAAsuka/DataFree_Backdoor_Attacks/blob/HEAD/handcrafted_backdoor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7879e76c2a733e4a","mcp_get_code":{"code_sha256":"7879e76c2a733e4a"}},{"arxiv_id":"2411.19513","paper":"/paper/contextgnn-beyond-two-tower-recommendation","title":"ContextGNN: Beyond Two-Tower Recommendation Systems","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kumo-ai/ContextGNN","path":"benchmark/relbench_link_prediction_benchmark.py","file_url":"https://github.com/kumo-ai/ContextGNN/blob/HEAD/benchmark/relbench_link_prediction_benchmark.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7c1cd833b104e40","mcp_get_code":{"code_sha256":"d7c1cd833b104e40"}},{"arxiv_id":"2411.08460","paper":"/paper/trap-mid-trapdoor-based-defense-against-model","title":"Trap-MID: Trapdoor-based Defense against Model Inversion Attacks","date":"2024-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntuaislab/Trap-MID","path":"engine.py","file_url":"https://github.com/ntuaislab/Trap-MID/blob/HEAD/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"26ebe515279a4189","mcp_get_code":{"code_sha256":"26ebe515279a4189"}},{"arxiv_id":"2411.04466","paper":"/paper/enabling-adaptive-agent-training-in-open","title":"Enabling Adaptive Agent Training in Open-Ended Simulators by Targeting Diversity","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DIVA","path":"paper_experiments/malaria/diva/experiment_diva_top10_resnet_new.py","file_url":"https://github.com/AMLab-Amsterdam/DIVA/blob/HEAD/paper_experiments/malaria/diva/experiment_diva_top10_resnet_new.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41ecd72a1b2446e5","mcp_get_code":{"code_sha256":"41ecd72a1b2446e5"}},{"arxiv_id":"2411.03025","paper":"/paper/da-moe-addressing-depth-sensitivity-in-graph","title":"DA-MoE: Addressing Depth-Sensitivity in Graph-Level Analysis through Mixture of Experts","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2411.03025","paper":"/paper/da-moe-addressing-depth-sensitivity-in-graph","title":"DA-MoE: Addressing Depth-Sensitivity in Graph-Level Analysis through Mixture of Experts","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"celin-yao/da-moe","path":"link_prediction/main_link_ddi.py","file_url":"https://github.com/celin-yao/da-moe/blob/HEAD/link_prediction/main_link_ddi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df2960ace0a8870f","mcp_get_code":{"code_sha256":"df2960ace0a8870f"}},{"arxiv_id":"2411.03025","paper":"/paper/da-moe-addressing-depth-sensitivity-in-graph","title":"DA-MoE: Addressing Depth-Sensitivity in Graph-Level Analysis through Mixture of Experts","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"celin-yao/da-moe","path":"graph_classification/train/main_graph.py","file_url":"https://github.com/celin-yao/da-moe/blob/HEAD/graph_classification/train/main_graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2bd54b1565228864","mcp_get_code":{"code_sha256":"2bd54b1565228864"}},{"arxiv_id":"2410.23748","paper":"/paper/exploring-consistency-in-graph","title":"Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networks","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphminddartmouth/graph-consistency","path":"train_dist.py","file_url":"https://github.com/graphminddartmouth/graph-consistency/blob/HEAD/train_dist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3cfa661c8712d805","mcp_get_code":{"code_sha256":"3cfa661c8712d805"}},{"arxiv_id":"2410.23223","paper":"/paper/comal-a-convergent-meta-algorithm-for","title":"COMAL: A Convergent Meta-Algorithm for Aligning LLMs with General Preferences","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/comal","path":"mle.py","file_url":"https://github.com/yale-nlp/comal/blob/HEAD/mle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e8f03c37313f8363","mcp_get_code":{"code_sha256":"e8f03c37313f8363"}},{"arxiv_id":"2410.16954","paper":"/paper/lora-c-parameter-efficient-fine-tuning-of","title":"LoRA-C: Parameter-Efficient Fine-Tuning of Robust CNN for IoT Devices","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"alexyyds2024/lora-C","path":"train_lora.py","file_url":"https://github.com/alexyyds2024/lora-C/blob/HEAD/train_lora.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":"219dfdb155d57f14","mcp_get_code":{"code_sha256":"219dfdb155d57f14"}},{"arxiv_id":"2409.19696","paper":"/paper/vision-language-models-are-strong-noisy-label","title":"Vision-Language Models are Strong Noisy Label Detectors","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HotanLee/DeFT","path":"main_small_loss.py","file_url":"https://github.com/HotanLee/DeFT/blob/HEAD/main_small_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db80cb31193f92b1","mcp_get_code":{"code_sha256":"db80cb31193f92b1"}},{"arxiv_id":"2409.19696","paper":"/paper/vision-language-models-are-strong-noisy-label","title":"Vision-Language Models are Strong Noisy Label Detectors","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HotanLee/DeFT","path":"main_phase1.py","file_url":"https://github.com/HotanLee/DeFT/blob/HEAD/main_phase1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c8a8e3f0b597c1e7","mcp_get_code":{"code_sha256":"c8a8e3f0b597c1e7"}},{"arxiv_id":"2409.17836","paper":"/paper/language-models-as-zero-shot-lossless","title":"Language Models as Zero-shot Lossless Gradient Compressors: Towards General Neural Parameter Prior Models","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hui-po-wang/lm-gc","path":"train_and_collect_grad.py","file_url":"https://github.com/hui-po-wang/lm-gc/blob/HEAD/train_and_collect_grad.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2341b0a9750434aa","mcp_get_code":{"code_sha256":"2341b0a9750434aa"}},{"arxiv_id":"2409.04434","paper":"/paper/accelerating-training-with-neuron-interaction","title":"Accelerating Training with Neuron Interaction and Nowcasting Networks","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samsungsailmontreal/nino","path":"train_vision.py","file_url":"https://github.com/samsungsailmontreal/nino/blob/HEAD/train_vision.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f17a5e0c5f927ac","mcp_get_code":{"code_sha256":"9f17a5e0c5f927ac"}},{"arxiv_id":"2408.03220","paper":"/paper/2408-03220","title":"Masked Random Noise for Communication Efficient Federated Learning","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leopold1423/fedmrn-mm24","path":"train/trainer.py","file_url":"https://github.com/Leopold1423/fedmrn-mm24/blob/HEAD/train/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8671511823d366de","mcp_get_code":{"code_sha256":"8671511823d366de"}},{"arxiv_id":"2408.03215","paper":"/paper/2408-03215","title":"FedBAT: Communication-Efficient Federated Learning via Learnable Binarization","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leopold1423/fedbat-icml24","path":"train/trainer.py","file_url":"https://github.com/leopold1423/fedbat-icml24/blob/HEAD/train/trainer.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":"2e802c7ca8369630","mcp_get_code":{"code_sha256":"2e802c7ca8369630"}},{"arxiv_id":"2407.16674","paper":"/paper/kan-or-mlp-a-fairer-comparison","title":"KAN or MLP: A Fairer Comparison","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/kanbefair","path":"src/train_continual_learning.py","file_url":"https://github.com/yu-rp/kanbefair/blob/HEAD/src/train_continual_learning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"437a9a59c72a2824","mcp_get_code":{"code_sha256":"437a9a59c72a2824"}},{"arxiv_id":"2407.16193","paper":"/paper/cloudfixer-test-time-adaptation-for-3d-point","title":"CloudFixer: Test-Time Adaptation for 3D Point Clouds via Diffusion-Guided Geometric Transformation","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shimazing/CloudFixer","path":"train_classifier.py","file_url":"https://github.com/shimazing/CloudFixer/blob/HEAD/train_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"181c563360b63a31","mcp_get_code":{"code_sha256":"181c563360b63a31"}},{"arxiv_id":"2407.12543","paper":"/paper/abstraction-alignment-comparing-model-and","title":"Abstraction Alignment: Comparing Model-Learned and Human-Encoded Conceptual Relationships","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitvis/abstraction-alignment","path":"util/cifar/cifar_train.py","file_url":"https://github.com/mitvis/abstraction-alignment/blob/HEAD/util/cifar/cifar_train.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2137246c139ab515","mcp_get_code":{"code_sha256":"2137246c139ab515"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_semisupervised/gnn.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_semisupervised/gnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_semisupervised/gnn_da.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_semisupervised/gnn_da.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":"f556b6370898ea98","mcp_get_code":{"code_sha256":"f556b6370898ea98"}},{"arxiv_id":"2407.07841","paper":"/paper/benchmarking-embedding-aggregation-methods-in","title":"Benchmarking Embedding Aggregation Methods in Computational Pathology: A Clinical Data Perspective","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuchs-lab-public/cpath_sabenchmark","path":"code/train_classification_model_report.py","file_url":"https://github.com/fuchs-lab-public/cpath_sabenchmark/blob/HEAD/code/train_classification_model_report.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e88f66866c7ddd7e","mcp_get_code":{"code_sha256":"e88f66866c7ddd7e"}},{"arxiv_id":"2407.07841","paper":"/paper/benchmarking-embedding-aggregation-methods-in","title":"Benchmarking Embedding Aggregation Methods in Computational Pathology: A Clinical Data Perspective","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuchs-lab-public/cpath_sabenchmark","path":"code/train_classification_mccv.py","file_url":"https://github.com/fuchs-lab-public/cpath_sabenchmark/blob/HEAD/code/train_classification_mccv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d958766f3c0b3050","mcp_get_code":{"code_sha256":"d958766f3c0b3050"}},{"arxiv_id":"2407.07457","paper":"/paper/glbench-a-comprehensive-benchmark-for-graph","title":"GLBench: A Comprehensive Benchmark for Graph with Large Language Models","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nineabyss/glbench","path":"models/gnn/mlp.py","file_url":"https://github.com/nineabyss/glbench/blob/HEAD/models/gnn/mlp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"288cb7fe1150b5f3","mcp_get_code":{"code_sha256":"288cb7fe1150b5f3"}},{"arxiv_id":"2407.02068","paper":"/paper/lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akimoto-Cris/LPViT","path":"prune_vit.py","file_url":"https://github.com/Akimoto-Cris/LPViT/blob/HEAD/prune_vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"49e75bdeacd88ac2","mcp_get_code":{"code_sha256":"49e75bdeacd88ac2"}},{"arxiv_id":"2406.18380","paper":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RomanBresson/KAGNN","path":"graph_classification/graph_classification_utils.py","file_url":"https://github.com/RomanBresson/KAGNN/blob/HEAD/graph_classification/graph_classification_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e50ff32e95107f76","mcp_get_code":{"code_sha256":"e50ff32e95107f76"}},{"arxiv_id":"2406.16201","paper":"/paper/blind-baselines-beat-membership-inference","title":"Blind Baselines Beat Membership Inference Attacks for Foundation Models","date":"2024-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-spylab/Blind-MIA","path":"greedy_selection.py","file_url":"https://github.com/ethz-spylab/Blind-MIA/blob/HEAD/greedy_selection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69750e7e1081b702","mcp_get_code":{"code_sha256":"69750e7e1081b702"}},{"arxiv_id":"2406.14673","paper":"/paper/insights-into-llm-long-context-failures-when","title":"Insights into LLM Long-Context Failures: When Transformers Know but Don't Tell","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TaiMingLu/know-dont-tell","path":"code/probe/probe.py","file_url":"https://github.com/TaiMingLu/know-dont-tell/blob/HEAD/code/probe/probe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"100abc954d0cb892","mcp_get_code":{"code_sha256":"100abc954d0cb892"}},{"arxiv_id":"2406.13155","paper":"/paper/convolutional-kolmogorov-arnold-networks","title":"Convolutional Kolmogorov-Arnold Networks","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoniotepsich/convolutional-kans","path":"evaluations.py","file_url":"https://github.com/antoniotepsich/convolutional-kans/blob/HEAD/evaluations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a94b7906c48041ba","mcp_get_code":{"code_sha256":"a94b7906c48041ba"}},{"arxiv_id":"2406.10727","paper":"/paper/text-space-graph-foundation-models","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currytang/tsgfm","path":"fulllink.py","file_url":"https://github.com/currytang/tsgfm/blob/HEAD/fulllink.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c07e3d3c16bd2618","mcp_get_code":{"code_sha256":"c07e3d3c16bd2618"}},{"arxiv_id":"2406.10502","paper":"/paper/candidate-pseudolabel-learning-enhancing","title":"Candidate Pseudolabel Learning: Enhancing Vision-Language Models by Prompt Tuning with Unlabeled Data","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanillaer/cpl-icml2024","path":"LaFTer/LaFTer.py","file_url":"https://github.com/vanillaer/cpl-icml2024/blob/HEAD/LaFTer/LaFTer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"819322964b74fbe7","mcp_get_code":{"code_sha256":"819322964b74fbe7"}},{"arxiv_id":"2406.10310","paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_HitsK.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_HitsK.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f0581e5668ba1873","mcp_get_code":{"code_sha256":"f0581e5668ba1873"}},{"arxiv_id":"2406.10310","paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_HitsK_loader.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_HitsK_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"64d97bf20e2f647a","mcp_get_code":{"code_sha256":"64d97bf20e2f647a"}},{"arxiv_id":"2406.10310","paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_MRR.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_MRR.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b3cabb047d30449","mcp_get_code":{"code_sha256":"8b3cabb047d30449"}},{"arxiv_id":"2406.09870","paper":"/paper/igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/IGL-Bench","path":"IGL_Bench/algorithm/DPGNN/learn.py","file_url":"https://github.com/RingBDStack/IGL-Bench/blob/HEAD/IGL_Bench/algorithm/DPGNN/learn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41233a7e838d93ea","mcp_get_code":{"code_sha256":"41233a7e838d93ea"}},{"arxiv_id":"2406.09353","paper":"/paper/enhancing-domain-adaptation-through-prompt","title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viethoang1512/pga","path":"LA/main_uda.py","file_url":"https://github.com/viethoang1512/pga/blob/HEAD/LA/main_uda.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":"6301fb5daaeef4c9","mcp_get_code":{"code_sha256":"6301fb5daaeef4c9"}},{"arxiv_id":"2406.02790","paper":"/paper/building-socially-equitable-public-models","title":"Building Socially-Equitable Public Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ren-research/socially-equitable-public-models","path":"main_dc_workload.py","file_url":"https://github.com/ren-research/socially-equitable-public-models/blob/HEAD/main_dc_workload.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":"a8ee0ad3676880ed","mcp_get_code":{"code_sha256":"a8ee0ad3676880ed"}},{"arxiv_id":"2406.02790","paper":"/paper/building-socially-equitable-public-models","title":"Building Socially-Equitable Public Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ren-research/socially-equitable-public-models","path":"main_ev_charging.py","file_url":"https://github.com/ren-research/socially-equitable-public-models/blob/HEAD/main_ev_charging.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":"0315b6ba6612e7d3","mcp_get_code":{"code_sha256":"0315b6ba6612e7d3"}},{"arxiv_id":"2406.00816","paper":"/paper/invisible-backdoor-attacks-on-diffusion","title":"Invisible Backdoor Attacks on Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linweiii/backdoordm","path":"classifier_models/train_classifiers.py","file_url":"https://github.com/linweiii/backdoordm/blob/HEAD/classifier_models/train_classifiers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ba3ce200e91c692","mcp_get_code":{"code_sha256":"5ba3ce200e91c692"}},{"arxiv_id":"2405.17890","paper":"/paper/slmrec-empowering-small-language-models-for","title":"SLMRec: Distilling Large Language Models into Small for Sequential Recommendation","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WujiangXu/SLMRec","path":"train_sr_trad.py","file_url":"https://github.com/WujiangXu/SLMRec/blob/HEAD/train_sr_trad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"294d1fd7209600af","mcp_get_code":{"code_sha256":"294d1fd7209600af"}},{"arxiv_id":"2405.17022","paper":"/paper/compositional-few-shot-class-incremental","title":"Compositional Few-Shot Class-Incremental Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/comp-fscil","path":"models/base/helper.py","file_url":"https://github.com/zoilsen/comp-fscil/blob/HEAD/models/base/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e0029dd3479294e","mcp_get_code":{"code_sha256":"7e0029dd3479294e"}},{"arxiv_id":"2405.16749","paper":"/paper/dmplug-a-plug-in-method-for-solving-inverse","title":"DMPlug: A Plug-in Method for Solving Inverse Problems with Diffusion Models","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanzhi-zhu/DiffPIR","path":"utils/utils_model.py","file_url":"https://github.com/yuanzhi-zhu/DiffPIR/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b2b14a90a19fbe2","mcp_get_code":{"code_sha256":"8b2b14a90a19fbe2"}},{"arxiv_id":"2405.16625","paper":"/paper/few-shot-tuning-of-foundation-models-for","title":"Few-shot Tuning of Foundation Models for Class-incremental Learning","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuvenduroy/coact-fscil","path":"methods/helper.py","file_url":"https://github.com/shuvenduroy/coact-fscil/blob/HEAD/methods/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4d2b757d67335855","mcp_get_code":{"code_sha256":"4d2b757d67335855"}},{"arxiv_id":"2405.16405","paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"gnn_misg.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/gnn_misg.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":"768b8716889709e2","mcp_get_code":{"code_sha256":"768b8716889709e2"}},{"arxiv_id":"2405.16206","paper":"/paper/glycanml-a-multi-task-and-multi-structure","title":"GlycanML: A Multi-Task and Multi-Structure Benchmark for Glycan Machine Learning","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glycanml/glycanml","path":"scripts/run_single.py","file_url":"https://github.com/glycanml/glycanml/blob/HEAD/scripts/run_single.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c14d8e800dd48191","mcp_get_code":{"code_sha256":"c14d8e800dd48191"}},{"arxiv_id":"2405.14303","paper":"/paper/similarity-navigated-conformal-prediction-for","title":"Similarity-Navigated Conformal Prediction for Graph Neural Networks","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"janqsong/SNAPS","path":"ogbn-arxiv.py","file_url":"https://github.com/janqsong/SNAPS/blob/HEAD/ogbn-arxiv.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":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2405.09786","paper":"/paper/ibd-psc-input-level-backdoor-detection-via","title":"IBD-PSC: Input-level Backdoor Detection via Parameter-oriented Scaling Consistency","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuyimingli/backdoorbox","path":"core/defenses/IBD_PSC.py","file_url":"https://github.com/thuyimingli/backdoorbox/blob/HEAD/core/defenses/IBD_PSC.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"code_sha256_prefix":"4689f052cb4bdf86","mcp_get_code":{"code_sha256":"4689f052cb4bdf86"}},{"arxiv_id":"2404.12368","paper":"/paper/gradient-regularized-out-of-distribution","title":"Gradient-Regularized Out-of-Distribution Detection","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"o4lc/greg-ood","path":"train_sea.py","file_url":"https://github.com/o4lc/greg-ood/blob/HEAD/train_sea.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edd782373ad774f1","mcp_get_code":{"code_sha256":"edd782373ad774f1"}},{"arxiv_id":"2404.12020","paper":"/paper/look-listen-and-answer-overcoming-biases-for","title":"Look, Listen, and Answer: Overcoming Biases for Audio-Visual Question Answering","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gewu-lab/music-avqa","path":"net_grd_avst/main_avst.py","file_url":"https://github.com/gewu-lab/music-avqa/blob/HEAD/net_grd_avst/main_avst.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73f55fb868a26848","mcp_get_code":{"code_sha256":"73f55fb868a26848"}},{"arxiv_id":"2404.11265","paper":"/paper/the-victim-and-the-beneficiary-exploiting-a-1","title":"The Victim and The Beneficiary: Exploiting a Poisoned Model to Train a Clean Model on Poisoned Data","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zixuan-zhu/vab","path":"functions_ImageNet.py","file_url":"https://github.com/zixuan-zhu/vab/blob/HEAD/functions_ImageNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60e449e5c49fc546","mcp_get_code":{"code_sha256":"60e449e5c49fc546"}},{"arxiv_id":"2404.11003","paper":"/paper/infomatch-entropy-neural-estimation-for-semi","title":"InfoMatch: Entropy Neural Estimation for Semi-Supervised Image Classification","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kunzhan/InfoMatch","path":"infoMatch_STL.py","file_url":"https://github.com/kunzhan/InfoMatch/blob/HEAD/infoMatch_STL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"314a6334cf0478a8","mcp_get_code":{"code_sha256":"314a6334cf0478a8"}},{"arxiv_id":"2404.08877","paper":"/paper/aligning-llms-for-fl-free-program-repair","title":"Aligning the Objective of LLM-based Program Repair","date":"2024-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuhk-shenzhen-se/d4c","path":"generator/defects4j.py","file_url":"https://github.com/cuhk-shenzhen-se/d4c/blob/HEAD/generator/defects4j.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d40e3e890f68f73","mcp_get_code":{"code_sha256":"0d40e3e890f68f73"}},{"arxiv_id":"2404.04163","paper":"/paper/dwell-in-the-beginning-how-language-models","title":"Dwell in the Beginning: How Language Models Embed Long Documents for Dense Retrieval","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxcscmu/longembeddinganalysis","path":"OpenMatch/v1/inference.py","file_url":"https://github.com/cxcscmu/longembeddinganalysis/blob/HEAD/OpenMatch/v1/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aaf2a2b86f345be4","mcp_get_code":{"code_sha256":"aaf2a2b86f345be4"}},{"arxiv_id":"2404.00722","paper":"/paper/drct-saving-image-super-resolution-away-from","title":"DRCT: Saving Image Super-resolution away from Information Bottleneck","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ming053l/drct","path":"inference.py","file_url":"https://github.com/ming053l/drct/blob/HEAD/inference.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":"8b9d78de0f2e7f75","mcp_get_code":{"code_sha256":"8b9d78de0f2e7f75"}},{"arxiv_id":"2403.19762","paper":"/paper/idp-bert-predicting-properties-of","title":"IDP-Bert: Predicting Properties of Intrinsically Disordered Proteins (IDP) Using Large Language Models","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chakradharg/idp-bert","path":"model/utils.py","file_url":"https://github.com/chakradharg/idp-bert/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":"79660e497ea6a327","mcp_get_code":{"code_sha256":"79660e497ea6a327"}},{"arxiv_id":"2403.12984","paper":"/paper/when-smiles-have-language-drug-classification","title":"When SMILES have Language: Drug Classification using Text Classification Methods on Drug SMILES Strings","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azminewasi/Drug-Classification-NLP","path":"Model/train-ngram.py","file_url":"https://github.com/azminewasi/Drug-Classification-NLP/blob/HEAD/Model/train-ngram.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a0b9a4073d697c0","mcp_get_code":{"code_sha256":"5a0b9a4073d697c0"}},{"arxiv_id":"2403.12570","paper":"/paper/adapting-visual-language-models-for","title":"Adapting Visual-Language Models for Generalizable Anomaly Detection in Medical Images","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/mvfa-ad","path":"train_zero.py","file_url":"https://github.com/mediabrain-sjtu/mvfa-ad/blob/HEAD/train_zero.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e816aad57db813b","mcp_get_code":{"code_sha256":"9e816aad57db813b"}},{"arxiv_id":"2402.18133","paper":"/paper/classes-are-not-equal-an-empirical-study-on","title":"Classes Are Not Equal: An Empirical Study on Image Recognition Fairness","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/parametric-contrastive-learning","path":"GPaCo/MAE-ViTs/engine_finetune_paco.py","file_url":"https://github.com/dvlab-research/parametric-contrastive-learning/blob/HEAD/GPaCo/MAE-ViTs/engine_finetune_paco.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a27000d4fe943463","mcp_get_code":{"code_sha256":"a27000d4fe943463"}},{"arxiv_id":"2402.12789","paper":"/paper/fair-classifiers-without-fair-training-an","title":"Fairness Without Harm: An Influence-Guided Active Sampling Approach","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairnesswithoutharm","path":"src/fair_train.py","file_url":"https://github.com/ucsc-real/fairnesswithoutharm/blob/HEAD/src/fair_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f66864daa20b1b6f","mcp_get_code":{"code_sha256":"f66864daa20b1b6f"}},{"arxiv_id":"2402.08994","paper":"/paper/clip-mused-clip-guided-multi-subject-visual","title":"CLIP-MUSED: CLIP-Guided Multi-Subject Visual Neural Information Semantic Decoding","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clip-mused/clip-mused","path":"decoding_HCP_MS.py","file_url":"https://github.com/clip-mused/clip-mused/blob/HEAD/decoding_HCP_MS.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e6eeb5d19c00fdef","mcp_get_code":{"code_sha256":"e6eeb5d19c00fdef"}},{"arxiv_id":"2402.08595","paper":"/paper/homomorphism-counts-for-graph-neural-networks","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejin700/hombasis-gnn","path":"hombasis-bench/run-collab.py","file_url":"https://github.com/ejin700/hombasis-gnn/blob/HEAD/hombasis-bench/run-collab.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6e419d6bf287a8f","mcp_get_code":{"code_sha256":"a6e419d6bf287a8f"}},{"arxiv_id":"2402.08595","paper":"/paper/homomorphism-counts-for-graph-neural-networks","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejin700/hombasis-gnn","path":"qm9/src/experiments/run_gc.py","file_url":"https://github.com/ejin700/hombasis-gnn/blob/HEAD/qm9/src/experiments/run_gc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bfd4028374d07c7","mcp_get_code":{"code_sha256":"5bfd4028374d07c7"}},{"arxiv_id":"2402.02054","paper":"/paper/neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liu-jingzhe/graph-scaling-laws","path":"main_node.py","file_url":"https://github.com/liu-jingzhe/graph-scaling-laws/blob/HEAD/main_node.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2401.17752","paper":"/paper/pf-gnn-differentiable-particle-filtering-1","title":"PF-GNN: Differentiable particle filtering based approximation of universal graph representations","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfgnn/pf-gnn","path":"worker.py","file_url":"https://github.com/pfgnn/pf-gnn/blob/HEAD/worker.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c03102a09fc8c0fb","mcp_get_code":{"code_sha256":"c03102a09fc8c0fb"}},{"arxiv_id":"2401.15883","paper":"/paper/transtroj-transferable-backdoor-attacks-to","title":"Model Supply Chain Poisoning: Backdooring Pre-trained Models via Embedding Indistinguishability","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haowang-cqu/transtroj","path":"ft_downstream_task.py","file_url":"https://github.com/haowang-cqu/transtroj/blob/HEAD/ft_downstream_task.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c18174c0bde081ba","mcp_get_code":{"code_sha256":"c18174c0bde081ba"}},{"arxiv_id":"2401.15295","paper":"/paper/multi-trigger-backdoor-attacks-more-triggers","title":"Shortcuts Everywhere and Nowhere: Exploring Multi-Trigger Backdoor Attacks","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/multi-trigger-backdoor-attacks","path":"backdoor_mtba.py","file_url":"https://github.com/bboylyg/multi-trigger-backdoor-attacks/blob/HEAD/backdoor_mtba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80cee634119c27b2","mcp_get_code":{"code_sha256":"80cee634119c27b2"}},{"arxiv_id":"2401.12233","paper":"/paper/memorization-in-self-supervised-learning","title":"Memorization in Self-Supervised Learning Improves Downstream Generalization","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sprintml/memorizationssl","path":"SimClr_train.py","file_url":"https://github.com/sprintml/memorizationssl/blob/HEAD/SimClr_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e12dc0e9953ba2ea","mcp_get_code":{"code_sha256":"e12dc0e9953ba2ea"}},{"arxiv_id":"2401.03043","paper":"/paper/learning-multimodal-volumetric-features-for","title":"Learning Multimodal Volumetric Features for Large-Scale Neuron Tracing","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levishery/Flywire-Neuron-Tracing","path":"Pointnet/train_classification.py","file_url":"https://github.com/Levishery/Flywire-Neuron-Tracing/blob/HEAD/Pointnet/train_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cce988c817575a1a","mcp_get_code":{"code_sha256":"cce988c817575a1a"}},{"arxiv_id":"2401.03043","paper":"/paper/learning-multimodal-volumetric-features-for","title":"Learning Multimodal Volumetric Features for Large-Scale Neuron Tracing","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levishery/Flywire-Neuron-Tracing","path":"Pointnet/train_classification_wImage.py","file_url":"https://github.com/Levishery/Flywire-Neuron-Tracing/blob/HEAD/Pointnet/train_classification_wImage.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b80be2cab7df1bf8","mcp_get_code":{"code_sha256":"b80be2cab7df1bf8"}},{"arxiv_id":"2401.03043","paper":"/paper/learning-multimodal-volumetric-features-for","title":"Learning Multimodal Volumetric Features for Large-Scale Neuron Tracing","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levishery/Flywire-Neuron-Tracing","path":"Pointnet/train_connection.py","file_url":"https://github.com/Levishery/Flywire-Neuron-Tracing/blob/HEAD/Pointnet/train_connection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6050663bd99ec753","mcp_get_code":{"code_sha256":"6050663bd99ec753"}},{"arxiv_id":"2312.05632","paper":"/paper/subject-based-domain-adaptation-for-facial","title":"Subject-Based Domain Adaptation for Facial Expression Recognition","date":"2023-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osamazeeshan/subject-based-domain-adaptation-for-fer","path":"methods/msbda.py","file_url":"https://github.com/osamazeeshan/subject-based-domain-adaptation-for-fer/blob/HEAD/methods/msbda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"140731018bf27e5f","mcp_get_code":{"code_sha256":"140731018bf27e5f"}},{"arxiv_id":"2312.04902","paper":"/paper/belt-old-school-backdoor-attacks-can-evade","title":"BELT: Old-School Backdoor Attacks can Evade the State-of-the-Art Defense with Backdoor Exclusivity Lifting","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jsun20220909/belt","path":"BELT/BadNet_BELT.py","file_url":"https://github.com/jsun20220909/belt/blob/HEAD/BELT/BadNet_BELT.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"code_sha256_prefix":"384ecb1106945765","mcp_get_code":{"code_sha256":"384ecb1106945765"}},{"arxiv_id":"2312.00935","paper":"/paper/a-theory-of-unimodal-bias-in-multimodal","title":"Understanding Unimodal Bias in Multimodal Deep Linear Networks","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedizhang/unimodal-bias","path":"MNIST/mnist.py","file_url":"https://github.com/yedizhang/unimodal-bias/blob/HEAD/MNIST/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7ccb0fa52a55533f","mcp_get_code":{"code_sha256":"7ccb0fa52a55533f"}},{"arxiv_id":"2311.14905","paper":"/paper/class-gradient-projection-for-continual","title":"Class Gradient Projection For Continual Learning","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zackschen/CGP","path":"main_cifar100.py","file_url":"https://github.com/zackschen/CGP/blob/HEAD/main_cifar100.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"384f37e826d07a56","mcp_get_code":{"code_sha256":"384f37e826d07a56"}},{"arxiv_id":"2311.11228","paper":"/paper/a-universal-framework-for-accurate-and-1","title":"A Universal Framework for Accurate and Efficient Geometric Deep Learning of Molecular Systems","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XieResearchGroup/Physics-aware-Multiplex-GNN","path":"main_qm9.py","file_url":"https://github.com/XieResearchGroup/Physics-aware-Multiplex-GNN/blob/HEAD/main_qm9.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":"04633d807687d750","mcp_get_code":{"code_sha256":"04633d807687d750"}},{"arxiv_id":"2311.11228","paper":"/paper/a-universal-framework-for-accurate-and-1","title":"A Universal Framework for Accurate and Efficient Geometric Deep Learning of Molecular Systems","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XieResearchGroup/Physics-aware-Multiplex-GNN","path":"main_rna_puzzles.py","file_url":"https://github.com/XieResearchGroup/Physics-aware-Multiplex-GNN/blob/HEAD/main_rna_puzzles.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"650d0035c3186327","mcp_get_code":{"code_sha256":"650d0035c3186327"}},{"arxiv_id":"2311.10572","paper":"/paper/ssb-simple-but-strong-baseline-for-boosting-1","title":"SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learning","date":"2023-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YUE-FAN/SSB","path":"trainer_sim_ssb.py","file_url":"https://github.com/YUE-FAN/SSB/blob/HEAD/trainer_sim_ssb.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"15f0b85cedae6b3a","mcp_get_code":{"code_sha256":"15f0b85cedae6b3a"}},{"arxiv_id":"2311.09084","paper":"/paper/contrastive-transformer-learning-with","title":"Contrastive Transformer Learning with Proximity Data Generation for Text-Based Person Search","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hcplab-sysu/personsearch-ctlg","path":"cross_visualize.py","file_url":"https://github.com/hcplab-sysu/personsearch-ctlg/blob/HEAD/cross_visualize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93d720e560c7f46e","mcp_get_code":{"code_sha256":"93d720e560c7f46e"}},{"arxiv_id":"2311.09060","paper":"/paper/do-localization-methods-actually-localize","title":"Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terarachang/memdata","path":"downstream.py","file_url":"https://github.com/terarachang/memdata/blob/HEAD/downstream.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":"3768a7b1e8d9fea1","mcp_get_code":{"code_sha256":"3768a7b1e8d9fea1"}},{"arxiv_id":"2311.08782","paper":"/paper/language-semantic-graph-guided-data-efficient","title":"Language Semantic Graph Guided Data-Efficient Learning","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bit-da/lsg","path":"lsg_training/src/main_lsg.py","file_url":"https://github.com/bit-da/lsg/blob/HEAD/lsg_training/src/main_lsg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfec6788f6e7fe62","mcp_get_code":{"code_sha256":"bfec6788f6e7fe62"}},{"arxiv_id":"2311.04760","paper":"/paper/towards-open-world-cross-domain-sequential","title":"Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/macd","path":"train_our.py","file_url":"https://github.com/wujiangxu/macd/blob/HEAD/train_our.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cb272ef7e8a6e789","mcp_get_code":{"code_sha256":"cb272ef7e8a6e789"}},{"arxiv_id":"2311.04590","paper":"/paper/rethinking-cross-domain-sequential","title":"Rethinking Cross-Domain Sequential Recommendation under Open-World Assumptions","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/amid","path":"train_sr.py","file_url":"https://github.com/wujiangxu/amid/blob/HEAD/train_sr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6bd502155a74c2ab","mcp_get_code":{"code_sha256":"6bd502155a74c2ab"}},{"arxiv_id":"2311.04590","paper":"/paper/rethinking-cross-domain-sequential","title":"Rethinking Cross-Domain Sequential Recommendation under Open-World Assumptions","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/amid","path":"train_sr_dr.py","file_url":"https://github.com/wujiangxu/amid/blob/HEAD/train_sr_dr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df84355cce57c9ab","mcp_get_code":{"code_sha256":"df84355cce57c9ab"}},{"arxiv_id":"2311.01002","paper":"/paper/robust-data-pruning-under-label-noise-via","title":"Robust Data Pruning under Label Noise via Maximizing Re-labeling Accuracy","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-dmlab/Prune4Rel","path":"utils.py","file_url":"https://github.com/kaist-dmlab/Prune4Rel/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":"fa5017994bfee770","mcp_get_code":{"code_sha256":"fa5017994bfee770"}},{"arxiv_id":"2311.12850","paper":"/paper/meticulously-selecting-1-of-the-dataset-for","title":"PrivImage: Differentially Private Synthetic Image Generation using Diffusion Models with Semantic-Aware Pretraining","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnierlee/dp-imagen","path":"src/SemanticQuery/train_imagenet_classifier.py","file_url":"https://github.com/sunnierlee/dp-imagen/blob/HEAD/src/SemanticQuery/train_imagenet_classifier.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9c75ad90782415bc","mcp_get_code":{"code_sha256":"9c75ad90782415bc"}},{"arxiv_id":"2310.17137","paper":"/paper/large-scale-gaussian-processes-via","title":"Large-Scale Gaussian Processes via Alternating Projection","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kayween/alternating-projection-for-gp","path":"train_svgp.py","file_url":"https://github.com/kayween/alternating-projection-for-gp/blob/HEAD/train_svgp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6527788b76cf43d0","mcp_get_code":{"code_sha256":"6527788b76cf43d0"}},{"arxiv_id":"2310.13852","paper":"/paper/gradual-domain-adaptation-theory-and","title":"Gradual Domain Adaptation: Theory and Algorithms","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/goat","path":"train_model.py","file_url":"https://github.com/yifei-he/goat/blob/HEAD/train_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a027f0cb95c0e29","mcp_get_code":{"code_sha256":"0a027f0cb95c0e29"}},{"arxiv_id":"2310.06396","paper":"/paper/adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zknus/NeurIPS-2023-HANG-Robustness","path":"gnn_misg.py","file_url":"https://github.com/zknus/NeurIPS-2023-HANG-Robustness/blob/HEAD/gnn_misg.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":"768b8716889709e2","mcp_get_code":{"code_sha256":"768b8716889709e2"}},{"arxiv_id":"2310.06232","paper":"/paper/spiking-pointnet-spiking-neural-networks-for-1","title":"Spiking PointNet: Spiking Neural Networks for Point Clouds","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DayongRen/Spiking-PointNet","path":"test_classification.py","file_url":"https://github.com/DayongRen/Spiking-PointNet/blob/HEAD/test_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"290bbfb3d5c4811c","mcp_get_code":{"code_sha256":"290bbfb3d5c4811c"}},{"arxiv_id":"2310.06232","paper":"/paper/spiking-pointnet-spiking-neural-networks-for-1","title":"Spiking PointNet: Spiking Neural Networks for Point Clouds","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"cce988c817575a1a","mcp_get_code":{"code_sha256":"cce988c817575a1a"}},{"arxiv_id":"2310.06077","paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_covid.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_covid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ad2605b62b4e89a7","mcp_get_code":{"code_sha256":"ad2605b62b4e89a7"}},{"arxiv_id":"2310.06077","paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_metrla.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_metrla.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b73c1f329515cfb","mcp_get_code":{"code_sha256":"6b73c1f329515cfb"}},{"arxiv_id":"2310.02401","paper":"/paper/ft-shield-a-watermark-against-unauthorized","title":"FT-Shield: A Watermark Against Unauthorized Fine-tuning in Text-to-Image Diffusion Models","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yingqiancui/FT-Shield","path":"train_classifier.py","file_url":"https://github.com/Yingqiancui/FT-Shield/blob/HEAD/train_classifier.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0369bf376fca01b1","mcp_get_code":{"code_sha256":"0369bf376fca01b1"}},{"arxiv_id":"2310.01875","paper":"/paper/towards-stable-backdoor-purification-through-1","title":"Towards Stable Backdoor Purification through Feature Shift Tuning","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"f634daea78f08e78","mcp_get_code":{"code_sha256":"f634daea78f08e78"}},{"arxiv_id":"2310.01875","paper":"/paper/towards-stable-backdoor-purification-through-1","title":"Towards Stable Backdoor Purification through Feature Shift Tuning","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kr-anonymous/ngf-animus","path":"Purification_NGF.py","file_url":"https://github.com/kr-anonymous/ngf-animus/blob/HEAD/Purification_NGF.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0044d4606bb15d8c","mcp_get_code":{"code_sha256":"0044d4606bb15d8c"}},{"arxiv_id":"2310.01875","paper":"/paper/towards-stable-backdoor-purification-through-1","title":"Towards Stable Backdoor Purification through Feature Shift Tuning","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aisafety-hkust/stable_backdoor_purification","path":"fine_tune/BTIDBF/btidbfp.py","file_url":"https://github.com/aisafety-hkust/stable_backdoor_purification/blob/HEAD/fine_tune/BTIDBF/btidbfp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5840d4aeba85a839","mcp_get_code":{"code_sha256":"5840d4aeba85a839"}},{"arxiv_id":"2310.01376","paper":"/paper/towards-distribution-agnostic-generalized-1","title":"Towards Distribution-Agnostic Generalized Category Discovery","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianhongbai/bacon","path":"model/bacon.py","file_url":"https://github.com/jianhongbai/bacon/blob/HEAD/model/bacon.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa3d31a3392a1b08","mcp_get_code":{"code_sha256":"fa3d31a3392a1b08"}},{"arxiv_id":"2309.06746","paper":"/paper/dp-forward-fine-tuning-and-inference-on","title":"DP-Forward: Fine-tuning and Inference on Language Models with Differential Privacy in Forward Pass","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":"archive","repo":"xiangyue9607/dp-forward","path":"attacks/sensitive_attributes_attack.py","file_url":"https://github.com/xiangyue9607/dp-forward/blob/HEAD/attacks/sensitive_attributes_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ff3442659338ed4f","mcp_get_code":{"code_sha256":"ff3442659338ed4f"}},{"arxiv_id":"2308.16705","paper":"/paper/crehate-cross-cultural-re-annotation-of","title":"Exploring Cross-Cultural Differences in English Hate Speech Annotations: From Dataset Construction to Analysis","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlee0212/crehate","path":"finetune/finetune.py","file_url":"https://github.com/nlee0212/crehate/blob/HEAD/finetune/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a9e6c3ce2aa57e1","mcp_get_code":{"code_sha256":"0a9e6c3ce2aa57e1"}},{"arxiv_id":"2308.12538","paper":"/paper/mutual-guided-dynamic-network-for-image","title":"Mutual-Guided Dynamic Network for Image Fusion","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanys-dar/mgdn","path":"utils/utils_model.py","file_url":"https://github.com/guanys-dar/mgdn/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8afaf26fe2391d00","mcp_get_code":{"code_sha256":"8afaf26fe2391d00"}},{"arxiv_id":"2308.08942","paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_3dpw.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_3dpw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2bf3431aa40754e1","mcp_get_code":{"code_sha256":"2bf3431aa40754e1"}},{"arxiv_id":"2308.08942","paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_cmu.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_cmu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"138adfd1f5f6387c","mcp_get_code":{"code_sha256":"138adfd1f5f6387c"}},{"arxiv_id":"2308.08942","paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_h36m.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_h36m.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a792b53215ecac8","mcp_get_code":{"code_sha256":"6a792b53215ecac8"}},{"arxiv_id":"2308.07026","paper":"/paper/advclip-downstream-agnostic-adversarial","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/advclip","path":"train_downstream_solo.py","file_url":"https://github.com/cgcl-codes/advclip/blob/HEAD/train_downstream_solo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6dd2b488b69305c","mcp_get_code":{"code_sha256":"f6dd2b488b69305c"}},{"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/main_ppi.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/nodeclassification/main_ppi.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf642365a4d2fd72","mcp_get_code":{"code_sha256":"cf642365a4d2fd72"}},{"arxiv_id":"2308.03258","paper":"/paper/apbench-a-unified-benchmark-for-availability","title":"APBench: A Unified Benchmark for Availability Poisoning Attacks and Defenses","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lafeat/apbench","path":"imagenet_train.py","file_url":"https://github.com/lafeat/apbench/blob/HEAD/imagenet_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78f78d87624ccd42","mcp_get_code":{"code_sha256":"78f78d87624ccd42"}},{"arxiv_id":"2307.15539","paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"backdoor_detection_lga.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/backdoor_detection_lga.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"00d271be23c3c5d5","mcp_get_code":{"code_sha256":"00d271be23c3c5d5"}},{"arxiv_id":"2307.15539","paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"pseudo_label_vd.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/pseudo_label_vd.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f3b4889b05be5e1c","mcp_get_code":{"code_sha256":"f3b4889b05be5e1c"}},{"arxiv_id":"2307.15539","paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"train_nab.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/train_nab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c3acbb8209baf8f8","mcp_get_code":{"code_sha256":"c3acbb8209baf8f8"}},{"arxiv_id":"2307.15411","paper":"/paper/investigating-the-learning-behaviour-of-in","title":"Investigating the Learning Behaviour of In-context Learning: A Comparison with Supervised Learning","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xdwang0726/icl_ll","path":"fine-tuning.py","file_url":"https://github.com/xdwang0726/icl_ll/blob/HEAD/fine-tuning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5a8af294c0502be","mcp_get_code":{"code_sha256":"a5a8af294c0502be"}},{"arxiv_id":"2307.06933","paper":"/paper/fdapt-federated-domain-adaptive-pre-training","title":"FDAPT: Federated Domain-adaptive Pre-training for Language Models","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scylj1/FDAPT","path":"utils/utils.py","file_url":"https://github.com/scylj1/FDAPT/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d8c181778ffae310","mcp_get_code":{"code_sha256":"d8c181778ffae310"}},{"arxiv_id":"2307.04052","paper":"/paper/learning-to-group-auxiliary-datasets-for","title":"Learning to Group Auxiliary Datasets for Molecule","date":"2023-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-and-Geometric-Learning/MolGroup","path":"molgroup/app/train_molgroup.py","file_url":"https://github.com/Graph-and-Geometric-Learning/MolGroup/blob/HEAD/molgroup/app/train_molgroup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1393df1c173a4662","mcp_get_code":{"code_sha256":"1393df1c173a4662"}},{"arxiv_id":"2307.02249","paper":"/paper/rethinking-multiple-instance-learning-for","title":"Rethinking Multiple Instance Learning for Whole Slide Image Classification: A Good Instance Classifier is All You Need","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccaiif/ins","path":"train_bag_TCGA.py","file_url":"https://github.com/miccaiif/ins/blob/HEAD/train_bag_TCGA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"66b9367750d8eecd","mcp_get_code":{"code_sha256":"66b9367750d8eecd"}},{"arxiv_id":"2307.02249","paper":"/paper/rethinking-multiple-instance-learning-for","title":"Rethinking Multiple Instance Learning for Whole Slide Image Classification: A Good Instance Classifier is All You Need","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccaiif/ins","path":"train_onlybag_feat_by_bagcls.py","file_url":"https://github.com/miccaiif/ins/blob/HEAD/train_onlybag_feat_by_bagcls.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"35c1fe27f6550518","mcp_get_code":{"code_sha256":"35c1fe27f6550518"}},{"arxiv_id":"2307.02249","paper":"/paper/rethinking-multiple-instance-learning-for","title":"Rethinking Multiple Instance Learning for Whole Slide Image Classification: A Good Instance Classifier is All You Need","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccaiif/ins","path":"train_onlybag_feat_by_bagcls_KI.py","file_url":"https://github.com/miccaiif/ins/blob/HEAD/train_onlybag_feat_by_bagcls_KI.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1da7ac9a76ad965f","mcp_get_code":{"code_sha256":"1da7ac9a76ad965f"}},{"arxiv_id":"2306.17624","paper":"/paper/sphere2vec-a-general-purpose-location","title":"Sphere2Vec: A General-Purpose Location Representation Learning over a Spherical Surface for Large-Scale Geospatial Predictions","date":"2023-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0e60fa29baf88f8c","mcp_get_code":{"code_sha256":"0e60fa29baf88f8c"}},{"arxiv_id":"2306.15902","paper":"/paper/individual-and-structural-graph-information","title":"Individual and Structural Graph Information Bottlenecks for Out-of-Distribution Generalization","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/graphood","path":"run_train.py","file_url":"https://github.com/yangling0818/graphood/blob/HEAD/run_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1c678821704cf092","mcp_get_code":{"code_sha256":"1c678821704cf092"}},{"arxiv_id":"2306.12497","paper":"/paper/density-uncertainty-layers-for-reliable","title":"Density Uncertainty Layers for Reliable Uncertainty Estimation","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yookoon/density_uncertainty_layers","path":"run_uci.py","file_url":"https://github.com/yookoon/density_uncertainty_layers/blob/HEAD/run_uci.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":"1556a229b738ea01","mcp_get_code":{"code_sha256":"1556a229b738ea01"}},{"arxiv_id":"2306.09623","paper":"/paper/from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/HyperGCN","path":"model/model.py","file_url":"https://github.com/malllabiisc/HyperGCN/blob/HEAD/model/model.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":"0dbfc925a3b4c65b","mcp_get_code":{"code_sha256":"0dbfc925a3b4c65b"}},{"arxiv_id":"2306.09595","paper":"/paper/structured-cooperative-learning-with","title":"Structured Cooperative Learning with Graphical Model Priors","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuangtongli/scool","path":"SCooL_SBM.py","file_url":"https://github.com/shuangtongli/scool/blob/HEAD/SCooL_SBM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"f26491b89ba8cbd1","mcp_get_code":{"code_sha256":"f26491b89ba8cbd1"}},{"arxiv_id":"2306.07215","paper":"/paper/efficient-quantization-aware-training-with","title":"Efficient and Robust Quantization-aware Training via Adaptive Coreset Selection","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangowen/qat-acs","path":"utils.py","file_url":"https://github.com/huangowen/qat-acs/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"18733a91af2b5207","mcp_get_code":{"code_sha256":"18733a91af2b5207"}},{"arxiv_id":"2306.06955","paper":"/paper/a-brief-review-of-hypernetworks-in-deep","title":"A Brief Review of Hypernetworks in Deep Learning","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmdvinodjmd/HyperITE","path":"src/training_loop.py","file_url":"https://github.com/jmdvinodjmd/HyperITE/blob/HEAD/src/training_loop.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f478ca191bec1a45","mcp_get_code":{"code_sha256":"f478ca191bec1a45"}},{"arxiv_id":"2306.06722","paper":"/paper/e-2-equivariant-vision-transformer","title":"$E(2)$-Equivariant Vision Transformer","date":"2023-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjucdsyangkaifan/gevit","path":"tester.py","file_url":"https://github.com/zjucdsyangkaifan/gevit/blob/HEAD/tester.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6d8ccaa2184db23","mcp_get_code":{"code_sha256":"f6d8ccaa2184db23"}},{"arxiv_id":"2306.06202","paper":"/paper/neurograph-benchmarks-for-graph-machine","title":"NeuroGraph: Benchmarks for Graph Machine Learning in Brain Connectomics","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anwar-said/neurograph","path":"Dynamic/main-dynamic.py","file_url":"https://github.com/anwar-said/neurograph/blob/HEAD/Dynamic/main-dynamic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77efe8be090daf98","mcp_get_code":{"code_sha256":"77efe8be090daf98"}},{"arxiv_id":"2306.05955","paper":"/paper/path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gasmichel/pathnns_expressive","path":"TUDatasets/main_splits.py","file_url":"https://github.com/gasmichel/pathnns_expressive/blob/HEAD/TUDatasets/main_splits.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36224943b5999acf","mcp_get_code":{"code_sha256":"36224943b5999acf"}},{"arxiv_id":"2306.05651","paper":"/paper/differentially-private-sharpness-aware","title":"Differentially Private Sharpness-Aware Training","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheSunWillRise/DPNAS","path":"dp_evaluate/train_utils.py","file_url":"https://github.com/TheSunWillRise/DPNAS/blob/HEAD/dp_evaluate/train_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd31d8cae37a3810","mcp_get_code":{"code_sha256":"bd31d8cae37a3810"}},{"arxiv_id":"2306.04107","paper":"/paper/bemap-balanced-message-passing-for-fair-graph","title":"BeMap: Balanced Message Passing for Fair Graph Neural Network","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1356322f7eb2e55d","mcp_get_code":{"code_sha256":"1356322f7eb2e55d"}},{"arxiv_id":"2306.03288","paper":"/paper/deep-learning-from-crowdsourced-labels","title":"Deep Learning From Crowdsourced Labels: Coupled Cross-entropy Minimization, Identifiability, and Regularization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahanaibrahimosu/end-to-end-crowdsourcing","path":"algorithms/trainer_proposed.py","file_url":"https://github.com/shahanaibrahimosu/end-to-end-crowdsourcing/blob/HEAD/algorithms/trainer_proposed.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":"13950a50827b0962","mcp_get_code":{"code_sha256":"13950a50827b0962"}},{"arxiv_id":"2306.02031","paper":"/paper/dos-diverse-outlier-sampling-for-out-of","title":"DOS: Diverse Outlier Sampling for Out-of-Distribution Detection","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lygjwy/dos","path":"train_diverse.py","file_url":"https://github.com/lygjwy/dos/blob/HEAD/train_diverse.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f638e35e14ffb38","mcp_get_code":{"code_sha256":"0f638e35e14ffb38"}},{"arxiv_id":"2305.19518","paper":"/paper/label-retrieval-augmented-diffusion-models-1","title":"Label-Retrieval-Augmented Diffusion Models for Learning from Noisy Labels","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puar-playground/lra-diffusion","path":"train_CIFAR.py","file_url":"https://github.com/puar-playground/lra-diffusion/blob/HEAD/train_CIFAR.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1c95f06ac63ad9f3","mcp_get_code":{"code_sha256":"1c95f06ac63ad9f3"}},{"arxiv_id":"2305.18965","paper":"/paper/node-embedding-from-neural-hamiltonian-orbits","title":"Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zknus/hamiltonian-gnn","path":"main_nc.py","file_url":"https://github.com/zknus/hamiltonian-gnn/blob/HEAD/main_nc.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":"5b6fb04ad6e0c9b5","mcp_get_code":{"code_sha256":"5b6fb04ad6e0c9b5"}},{"arxiv_id":"2305.16618","paper":"/paper/confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daehoum1/pcfi","path":"evaluation.py","file_url":"https://github.com/daehoum1/pcfi/blob/HEAD/evaluation.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":"e9b81d3e51978cf1","mcp_get_code":{"code_sha256":"e9b81d3e51978cf1"}},{"arxiv_id":"2305.16618","paper":"/paper/confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daehoum1/pcfi","path":"utils_link.py","file_url":"https://github.com/daehoum1/pcfi/blob/HEAD/utils_link.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":"e2d3e844742319c9","mcp_get_code":{"code_sha256":"e2d3e844742319c9"}},{"arxiv_id":"2305.16202","paper":"/paper/dp-sgd-without-clipping-the-lipschitz-neural","title":"DP-SGD Without Clipping: The Lipschitz Neural Network Way","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Algue-Rythme/lip-dp","path":"experiments/paper_plots/opacus_cifar10.py","file_url":"https://github.com/Algue-Rythme/lip-dp/blob/HEAD/experiments/paper_plots/opacus_cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc270f2e54ccfbdc","mcp_get_code":{"code_sha256":"bc270f2e54ccfbdc"}},{"arxiv_id":"2305.16202","paper":"/paper/dp-sgd-without-clipping-the-lipschitz-neural","title":"DP-SGD Without Clipping: The Lipschitz Neural Network Way","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Algue-Rythme/lip-dp","path":"experiments/paper_plots/opacus_tabular.py","file_url":"https://github.com/Algue-Rythme/lip-dp/blob/HEAD/experiments/paper_plots/opacus_tabular.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f7cf089e90afe382","mcp_get_code":{"code_sha256":"f7cf089e90afe382"}},{"arxiv_id":"2305.15316","paper":"/paper/training-on-thin-air-improve-image","title":"Training on Thin Air: Improve Image Classification with Generated Data","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongchao97/diffusion_inversion","path":"src/train_net.py","file_url":"https://github.com/yongchao97/diffusion_inversion/blob/HEAD/src/train_net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94d7f749a6ed65f8","mcp_get_code":{"code_sha256":"94d7f749a6ed65f8"}},{"arxiv_id":"2305.14876","paper":"/paper/2305-14876","title":"Reconstructive Neuron Pruning for Backdoor Defense","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/rnp","path":"train_backdoor.py","file_url":"https://github.com/bboylyg/rnp/blob/HEAD/train_backdoor.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ff6e5f57d8f518df","mcp_get_code":{"code_sha256":"ff6e5f57d8f518df"}},{"arxiv_id":"2305.12474","paper":"/paper/evaluating-the-performance-of-large-language","title":"Evaluating the Performance of Large Language Models on GAOKAO Benchmark","date":"2023-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openlmlab/gaokao-bench","path":"Models/openai_gpt4.py","file_url":"https://github.com/openlmlab/gaokao-bench/blob/HEAD/Models/openai_gpt4.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":"e9a27274ff1e47ee","mcp_get_code":{"code_sha256":"e9a27274ff1e47ee"}},{"arxiv_id":"2305.08995","paper":"/paper/denoising-diffusion-models-for-plug-and-play","title":"Denoising Diffusion Models for Plug-and-Play Image Restoration","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanzhi-zhu/diffpir","path":"utils/utils_model.py","file_url":"https://github.com/yuanzhi-zhu/diffpir/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b2b14a90a19fbe2","mcp_get_code":{"code_sha256":"8b2b14a90a19fbe2"}},{"arxiv_id":"2305.08386","paper":"/paper/plip-language-image-pre-training-for-person","title":"PLIP: Language-Image Pre-training for Person Representation Learning","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zplusdragon/plip","path":"zs_infer.py","file_url":"https://github.com/zplusdragon/plip/blob/HEAD/zs_infer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b71a5dd46418465","mcp_get_code":{"code_sha256":"2b71a5dd46418465"}},{"arxiv_id":"2305.02299","paper":"/paper/dynamic-sparse-training-with-structured","title":"Dynamic Sparse Training with Structured Sparsity","date":"2023-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"calgaryml/condensed-sparsity","path":"train_rigl.py","file_url":"https://github.com/calgaryml/condensed-sparsity/blob/HEAD/train_rigl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e62b6d8b58cd26a5","mcp_get_code":{"code_sha256":"e62b6d8b58cd26a5"}},{"arxiv_id":"2305.00664","paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"evolunet.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/evolunet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2af86964d73cd0a7","mcp_get_code":{"code_sha256":"2af86964d73cd0a7"}},{"arxiv_id":"2304.13098","paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"main_ann.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/main_ann.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8654ec9c4f1b5798","mcp_get_code":{"code_sha256":"8654ec9c4f1b5798"}},{"arxiv_id":"2304.13098","paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"main_cka.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/main_cka.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"923ba0c4d3b292e9","mcp_get_code":{"code_sha256":"923ba0c4d3b292e9"}},{"arxiv_id":"2304.13098","paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"main_snn.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/main_snn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54dc7295010194cd","mcp_get_code":{"code_sha256":"54dc7295010194cd"}},{"arxiv_id":"2304.12961","paper":"/paper/chameleon-adapting-to-peer-images-for","title":"Chameleon: Adapting to Peer Images for Planting Durable Backdoors in Federated Learning","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ybdai7/chameleon-durable-backdoor","path":"training.py","file_url":"https://github.com/ybdai7/chameleon-durable-backdoor/blob/HEAD/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16fb979ea70caf2c","mcp_get_code":{"code_sha256":"16fb979ea70caf2c"}},{"arxiv_id":"2304.05206","paper":"/paper/the-capacity-and-robustness-trade-off","title":"The Capacity and Robustness Trade-off: Revisiting the Channel Independent Strategy for Multivariate Time Series Forecasting","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanlu-nju/channel_independent_mtsf","path":"layers/utils.py","file_url":"https://github.com/hanlu-nju/channel_independent_mtsf/blob/HEAD/layers/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"13917795f8030166","mcp_get_code":{"code_sha256":"13917795f8030166"}},{"arxiv_id":"2304.04613","paper":"/paper/on-evaluation-of-bangla-word-analogies","title":"On Evaluation of Bangla Word Analogies","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/fastText","path":"python/fasttext_module/fasttext/util/util.py","file_url":"https://github.com/facebookresearch/fastText/blob/HEAD/python/fasttext_module/fasttext/util/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"5c3bcf5ae2042c99","mcp_get_code":{"code_sha256":"5c3bcf5ae2042c99"}},{"arxiv_id":"2304.02806","paper":null,"title":"arXiv:2304.02806","date":null,"month_inferred_from_arxiv_id":"2023-04","title_source":null,"repo":"VITA-Group/Graph-Mixture-of-Experts","path":"linkproppred/ddi/gnn.py","file_url":"https://github.com/VITA-Group/Graph-Mixture-of-Experts/blob/HEAD/linkproppred/ddi/gnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f4e3462c9afd99a","mcp_get_code":{"code_sha256":"2f4e3462c9afd99a"}},{"arxiv_id":"2304.02806","paper":null,"title":"arXiv:2304.02806","date":null,"month_inferred_from_arxiv_id":"2023-04","title_source":null,"repo":"VITA-Group/Graph-Mixture-of-Experts","path":"linkproppred/ddi/mf.py","file_url":"https://github.com/VITA-Group/Graph-Mixture-of-Experts/blob/HEAD/linkproppred/ddi/mf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cfa5ab581d0efea","mcp_get_code":{"code_sha256":"5cfa5ab581d0efea"}},{"arxiv_id":"2304.01731","paper":"/paper/selective-knowledge-sharing-for-privacy","title":"Selective Knowledge Sharing for Privacy-Preserving Federated Distillation without A Good Teacher","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaojiawei07/selective-fd","path":"Selective-FD.py","file_url":"https://github.com/shaojiawei07/selective-fd/blob/HEAD/Selective-FD.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":"ea5b79d254d0c8f7","mcp_get_code":{"code_sha256":"ea5b79d254d0c8f7"}},{"arxiv_id":"2304.00216","paper":"/paper/cross-scale-multi-instance-learning-for","title":"Cross-scale Multi-instance Learning for Pathological Image Diagnosis","date":"2023-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrlblab/cs-mil","path":"Train_Test_Code/MIL_global_Stage1_Training.py","file_url":"https://github.com/hrlblab/cs-mil/blob/HEAD/Train_Test_Code/MIL_global_Stage1_Training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac83ccf8c7576c3e","mcp_get_code":{"code_sha256":"ac83ccf8c7576c3e"}},{"arxiv_id":"2303.16666","paper":"/paper/sc-vae-sparse-coding-based-variational","title":"SC-VAE: Sparse Coding-based Variational Autoencoder with Learned ISTA","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sotiraslab/SC-VAE","path":"main-stage1.py","file_url":"https://github.com/sotiraslab/SC-VAE/blob/HEAD/main-stage1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a930689e63b14eca","mcp_get_code":{"code_sha256":"a930689e63b14eca"}},{"arxiv_id":"2303.14535","paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Eacient/EfficientAD","path":"efficientad.py","file_url":"https://github.com/Eacient/EfficientAD/blob/HEAD/efficientad.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":"21a6b1479ce8651c","mcp_get_code":{"code_sha256":"21a6b1479ce8651c"}},{"arxiv_id":"2303.14535","paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zaza-97/EfficientAD","path":"efficientad.py","file_url":"https://github.com/Zaza-97/EfficientAD/blob/HEAD/efficientad.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":"bde900c03717312f","mcp_get_code":{"code_sha256":"bde900c03717312f"}},{"arxiv_id":"2303.14535","paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielsoy/EfficientAD-1","path":"efficientaddrive.py","file_url":"https://github.com/danielsoy/EfficientAD-1/blob/HEAD/efficientaddrive.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":"fc52334326eef520","mcp_get_code":{"code_sha256":"fc52334326eef520"}},{"arxiv_id":"2303.06275","paper":"/paper/enhancing-protein-language-models-with","title":"A Systematic Study of Joint Representation Learning on Protein Sequences and Structures","date":"2023-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"c14d8e800dd48191","mcp_get_code":{"code_sha256":"c14d8e800dd48191"}},{"arxiv_id":"2302.12247","paper":"/paper/quantifying-modeling-multimodal-interactions-1","title":"Quantifying & Modeling Multimodal Interactions: An Information Decomposition Framework","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/pid","path":"bounds/bounds.py","file_url":"https://github.com/pliang279/pid/blob/HEAD/bounds/bounds.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1eed151775ba41d8","mcp_get_code":{"code_sha256":"1eed151775ba41d8"}},{"arxiv_id":"2302.10289","paper":"/paper/route-interpret-repeat-blurring-the-line","title":"Tackling Shortcut Learning in Deep Neural Networks: An Iterative Approach with Interpretable Models","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"batmanlab/ICML-2023-Route-interpret-repeat","path":"src/codebase/Explainer/models/Gated_Logic_Net.py","file_url":"https://github.com/batmanlab/ICML-2023-Route-interpret-repeat/blob/HEAD/src/codebase/Explainer/models/Gated_Logic_Net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfbd35755954072a","mcp_get_code":{"code_sha256":"bfbd35755954072a"}},{"arxiv_id":"2302.10287","paper":"/paper/certvit-certified-robustness-of-pre-trained","title":"CertViT: Certified Robustness of Pre-Trained Vision Transformers","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sagarverma/transformer-lipschitz","path":"liptrf/pretrained/train_cifar10_from_pretrained.py","file_url":"https://github.com/sagarverma/transformer-lipschitz/blob/HEAD/liptrf/pretrained/train_cifar10_from_pretrained.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":"c1d2eea42a7972d5","mcp_get_code":{"code_sha256":"c1d2eea42a7972d5"}},{"arxiv_id":"2302.10287","paper":"/paper/certvit-certified-robustness-of-pre-trained","title":"CertViT: Certified Robustness of Pre-Trained Vision Transformers","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sagarverma/transformer-lipschitz","path":"liptrf/scratch/vit/train_mnist.py","file_url":"https://github.com/sagarverma/transformer-lipschitz/blob/HEAD/liptrf/scratch/vit/train_mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eace55e02c3af27b","mcp_get_code":{"code_sha256":"eace55e02c3af27b"}},{"arxiv_id":"2302.08466","paper":"/paper/marich-a-query-efficient-distributionally","title":"Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debabrota-basu/marich","path":"lr_cnn_res_marich/utils.py","file_url":"https://github.com/debabrota-basu/marich/blob/HEAD/lr_cnn_res_marich/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ead12bb8e033cf0","mcp_get_code":{"code_sha256":"2ead12bb8e033cf0"}},{"arxiv_id":"2302.08048","paper":"/paper/robust-mid-pass-filtering-graph-convolutional","title":"Robust Mid-Pass Filtering Graph Convolutional Networks","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangJC0429/Mid-GCN","path":"mid_pass_GCN/main_meta.py","file_url":"https://github.com/huangJC0429/Mid-GCN/blob/HEAD/mid_pass_GCN/main_meta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e23043a8dda9695b","mcp_get_code":{"code_sha256":"e23043a8dda9695b"}},{"arxiv_id":"2302.00873","paper":"/paper/predicting-the-silent-majority-on-graphs","title":"Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wendongbi/KT-GNN","path":"KT-GNN/main_twitter.py","file_url":"https://github.com/wendongbi/KT-GNN/blob/HEAD/KT-GNN/main_twitter.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed60114c5953cc5b","mcp_get_code":{"code_sha256":"ed60114c5953cc5b"}},{"arxiv_id":"2301.11578","paper":"/paper/learning-to-unlearn-instance-wise-unlearning","title":"Learning to Unlearn: Instance-wise Unlearning for Pre-trained Classifiers","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csm9493/L2UL","path":"utils.py","file_url":"https://github.com/csm9493/L2UL/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46c8175e55cebcfc","mcp_get_code":{"code_sha256":"46c8175e55cebcfc"}},{"arxiv_id":"2301.06241","paper":"/paper/beagle-forensics-of-deep-learning-backdoor","title":"BEAGLE: Forensics of Deep Learning Backdoor Attack for Better Defense","date":"2023-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megum1/beagle","path":"cifar10/backdoor_removal.py","file_url":"https://github.com/megum1/beagle/blob/HEAD/cifar10/backdoor_removal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff84c411464b4ba8","mcp_get_code":{"code_sha256":"ff84c411464b4ba8"}},{"arxiv_id":"2212.07983","paper":"/paper/vision-transformers-are-parameter-efficient","title":"Vision Transformers are Parameter-Efficient Audio-Visual Learners","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GenjiB/LAVISH","path":"AVQA/grounding_gen/main_grd_gen.py","file_url":"https://github.com/GenjiB/LAVISH/blob/HEAD/AVQA/grounding_gen/main_grd_gen.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4eb3193bc43cfa55","mcp_get_code":{"code_sha256":"4eb3193bc43cfa55"}},{"arxiv_id":"2212.04461","paper":"/paper/leveraging-unlabeled-data-to-track","title":"Leveraging Unlabeled Data to Track Memorization","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahf93/tracking-memorization","path":"experiments.py","file_url":"https://github.com/mahf93/tracking-memorization/blob/HEAD/experiments.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":"c0cfaade26d59007","mcp_get_code":{"code_sha256":"c0cfaade26d59007"}},{"arxiv_id":"2211.15762","paper":"/paper/understanding-the-impact-of-adversarial","title":"Understanding the Impact of Adversarial Robustness on Accuracy Disparity","date":"2022-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Accuracy-Disparity/AT-on-AD","path":"test_syn.py","file_url":"https://github.com/Accuracy-Disparity/AT-on-AD/blob/HEAD/test_syn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ace3388fbfc51fb","mcp_get_code":{"code_sha256":"5ace3388fbfc51fb"}},{"arxiv_id":"2211.04774","paper":"/paper/arnet-automatic-refinement-network-for-noisy","title":"IRNet: Iterative Refinement Network for Noisy Partial Label Learning","date":"2022-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeroqiaoba/irnet","path":"irnet/train_merge.py","file_url":"https://github.com/zeroqiaoba/irnet/blob/HEAD/irnet/train_merge.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ad2d093deb654cc","mcp_get_code":{"code_sha256":"5ad2d093deb654cc"}},{"arxiv_id":"2211.00801","paper":"/paper/multi-agent-reinforcement-learning-for-13","title":"Multi-Agent Reinforcement Learning for Adaptive Mesh Refinement","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"011235813/marl-amr","path":"marl_amr/alg/evaluate.py","file_url":"https://github.com/011235813/marl-amr/blob/HEAD/marl_amr/alg/evaluate.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":"aba74a8f90c0a8eb","mcp_get_code":{"code_sha256":"aba74a8f90c0a8eb"}},{"arxiv_id":"2210.13710","paper":"/paper/motif-backdoor-rethinking-the-backdoor-attack","title":"Motif-Backdoor: Rethinking the Backdoor Attack on Graph Neural Networks via Motifs","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seaocn/motif-backdoor","path":"attack_main.py","file_url":"https://github.com/seaocn/motif-backdoor/blob/HEAD/attack_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7071815a9ba67b6d","mcp_get_code":{"code_sha256":"7071815a9ba67b6d"}},{"arxiv_id":"2210.13473","paper":"/paper/texttt-mangrove-learning-galaxy-properties","title":"$\\texttt{Mangrove}$: Learning Galaxy Properties from Merger Trees","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astrockragh/Mangrove","path":"dev/train_script_gpu.py","file_url":"https://github.com/astrockragh/Mangrove/blob/HEAD/dev/train_script_gpu.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8c6c13b7a165b710","mcp_get_code":{"code_sha256":"8c6c13b7a165b710"}},{"arxiv_id":"2210.13473","paper":"/paper/texttt-mangrove-learning-galaxy-properties","title":"$\\texttt{Mangrove}$: Learning Galaxy Properties from Merger Trees","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astrockragh/Mangrove","path":"dev/train_script_cpu.py","file_url":"https://github.com/astrockragh/Mangrove/blob/HEAD/dev/train_script_cpu.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d99a37c34a2114d4","mcp_get_code":{"code_sha256":"d99a37c34a2114d4"}},{"arxiv_id":"2210.01753","paper":"/paper/hypro-a-hybridly-normalized-probabilistic","title":"HYPRO: A Hybridly Normalized Probabilistic Model for Long-Horizon Prediction of Event Sequences","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivan-chai/hotpp-benchmark","path":"hotpp/evaluate.py","file_url":"https://github.com/ivan-chai/hotpp-benchmark/blob/HEAD/hotpp/evaluate.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":"d35314d71442b416","mcp_get_code":{"code_sha256":"d35314d71442b416"}},{"arxiv_id":"2209.12054","paper":"/paper/from-local-to-global-spectral-inspired-graph","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/spectral-inspired-gnn","path":"power.py","file_url":"https://github.com/nhuang37/spectral-inspired-gnn/blob/HEAD/power.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":"06321154c24315fa","mcp_get_code":{"code_sha256":"06321154c24315fa"}},{"arxiv_id":"2209.12054","paper":"/paper/from-local-to-global-spectral-inspired-graph","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/spectral-inspired-gnn","path":"baseline/gcn_variants_real_graph.py","file_url":"https://github.com/nhuang37/spectral-inspired-gnn/blob/HEAD/baseline/gcn_variants_real_graph.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":"0f53f615b042695b","mcp_get_code":{"code_sha256":"0f53f615b042695b"}},{"arxiv_id":"2209.11628","paper":"/paper/a-neural-model-for-regular-grammar-induction","title":"A Neural Model for Regular Grammar Induction","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbelcak/neregrain","path":"curriculum.py","file_url":"https://github.com/pbelcak/neregrain/blob/HEAD/curriculum.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa0fe1f9417fd9e5","mcp_get_code":{"code_sha256":"fa0fe1f9417fd9e5"}},{"arxiv_id":"2209.04882","paper":"/paper/statistical-mechanics-of-deep-learning-beyond","title":"A statistical mechanics framework for Bayesian deep neural networks beyond the infinite-width limit","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"rpacelli/fc_deep_bayesian_networks","path":"utils.py","file_url":"https://github.com/rpacelli/fc_deep_bayesian_networks/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"code_sha256_prefix":"76930061f3339640","mcp_get_code":{"code_sha256":"76930061f3339640"}},{"arxiv_id":"2209.00546","paper":"/paper/msgnn-a-spectral-graph-neural-network-based","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sherylhyx/msgnn","path":"src/main_SDSBM_node.py","file_url":"https://github.com/sherylhyx/msgnn/blob/HEAD/src/main_SDSBM_node.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af3e0bd74a3c2086","mcp_get_code":{"code_sha256":"af3e0bd74a3c2086"}},{"arxiv_id":"2209.06015","paper":"/paper/black-box-ownership-verification-for-dataset","title":"Black-box Dataset Ownership Verification via Backdoor Watermarking","date":"2022-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuyimingli/dvbw","path":"CIFAR/Ttest.py","file_url":"https://github.com/thuyimingli/dvbw/blob/HEAD/CIFAR/Ttest.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":"6536182ca361beb0","mcp_get_code":{"code_sha256":"6536182ca361beb0"}},{"arxiv_id":"2208.08270","paper":"/paper/on-the-privacy-effect-of-data-enhancement-via","title":"On the Privacy Effect of Data Enhancement via the Lens of Memorization","date":"2022-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixiaothu/privacy_and_aug","path":"utils_h.py","file_url":"https://github.com/lixiaothu/privacy_and_aug/blob/HEAD/utils_h.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79317dc18351550d","mcp_get_code":{"code_sha256":"79317dc18351550d"}},{"arxiv_id":"2208.07232","paper":"/paper/distributional-correlation-aware-knowledge","title":"Distributional Correlation--Aware Knowledge Distillation for Stock Trading Volume Prediction","date":"2022-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lancopku/dckd","path":"ar_kd_main.py","file_url":"https://github.com/lancopku/dckd/blob/HEAD/ar_kd_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5e18ce24ab037d6b","mcp_get_code":{"code_sha256":"5e18ce24ab037d6b"}},{"arxiv_id":"2208.04609","paper":"/paper/e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuanh23/e2eg","path":"baseline_models/gnn.py","file_url":"https://github.com/tuanh23/e2eg/blob/HEAD/baseline_models/gnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2208.04609","paper":"/paper/e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuanh23/e2eg","path":"baseline_models/mlp.py","file_url":"https://github.com/tuanh23/e2eg/blob/HEAD/baseline_models/mlp.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":"11767d5189f43309","mcp_get_code":{"code_sha256":"11767d5189f43309"}},{"arxiv_id":"2208.03873","paper":"/paper/chexrelnet-an-anatomy-aware-model-for","title":"CheXRelNet: An Anatomy-Aware Model for Tracking Longitudinal Relationships between Chest X-Rays","date":"2022-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plan-lab/chexrelnet","path":"src/train_baselines.py","file_url":"https://github.com/plan-lab/chexrelnet/blob/HEAD/src/train_baselines.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b449ab1cbfd21c7","mcp_get_code":{"code_sha256":"0b449ab1cbfd21c7"}},{"arxiv_id":"2208.01462","paper":"/paper/physics-informed-deep-super-resolution-for","title":"Physics-informed Deep Super-resolution for Spatiotemporal Data","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulpuren/physr","path":"Ablation/2DGS[no_phy_loss].py","file_url":"https://github.com/paulpuren/physr/blob/HEAD/Ablation/2DGS%5Bno_phy_loss%5D.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4bd6b46bf27ff16c","mcp_get_code":{"code_sha256":"4bd6b46bf27ff16c"}},{"arxiv_id":"2207.09510","paper":"/paper/contributions-of-shape-texture-and-color-in","title":"Contributions of Shape, Texture, and Color in Visual Recognition","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyhandy/humanoid-vision-engine","path":"HNN/compute_bias.py","file_url":"https://github.com/gyhandy/humanoid-vision-engine/blob/HEAD/HNN/compute_bias.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"883ccd49b57f68c5","mcp_get_code":{"code_sha256":"883ccd49b57f68c5"}},{"arxiv_id":"2207.07972","paper":"/paper/certified-neural-network-watermarks-with","title":"Certified Neural Network Watermarks with Randomized Smoothing","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arpitbansal297/certified_watermarks","path":"cifar10.py","file_url":"https://github.com/arpitbansal297/certified_watermarks/blob/HEAD/cifar10.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c065f29237558c1a","mcp_get_code":{"code_sha256":"c065f29237558c1a"}},{"arxiv_id":"2206.13983","paper":"/paper/bagel-a-benchmark-for-assessing-graph-neural","title":"BAGEL: A Benchmark for Assessing Graph Neural Network Explanations","date":"2022-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandeep-rathee/bagel-benchmark","path":"bagel_benchmark/graph_classification/utils_movie_reviews.py","file_url":"https://github.com/mandeep-rathee/bagel-benchmark/blob/HEAD/bagel_benchmark/graph_classification/utils_movie_reviews.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"451c91cf42e54e33","mcp_get_code":{"code_sha256":"451c91cf42e54e33"}},{"arxiv_id":"2206.12654","paper":"/paper/backdoorbench-a-comprehensive-benchmark-of","title":"BackdoorBench: A Comprehensive Benchmark of Backdoor Learning","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/NAD","path":"train_badnet.py","file_url":"https://github.com/bboylyg/NAD/blob/HEAD/train_badnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"83c10ae2b3ea76b3","mcp_get_code":{"code_sha256":"83c10ae2b3ea76b3"}},{"arxiv_id":"2206.11010","paper":"/paper/agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nokpil/AgentNet","path":"train/AOUP_train.py","file_url":"https://github.com/nokpil/AgentNet/blob/HEAD/train/AOUP_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a97cf5a15c22a81","mcp_get_code":{"code_sha256":"8a97cf5a15c22a81"}},{"arxiv_id":"2206.07387","paper":"/paper/the-manifold-hypothesis-for-gradient-based-1","title":"The Manifold Hypothesis for Gradient-Based Explanations","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tml-tuebingen/explanations-manifold","path":"replicate-paper/mnist/util.py","file_url":"https://github.com/tml-tuebingen/explanations-manifold/blob/HEAD/replicate-paper/mnist/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5e87b702cd8973c","mcp_get_code":{"code_sha256":"b5e87b702cd8973c"}},{"arxiv_id":"2206.04670","paper":"/paper/pointnext-revisiting-pointnet-with-improved","title":"PointNeXt: Revisiting PointNet++ with Improved Training and Scaling Strategies","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanx27/pointnet_pointnet2_pytorch","path":"train_classification.py","file_url":"https://github.com/yanx27/pointnet_pointnet2_pytorch/blob/HEAD/train_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cce988c817575a1a","mcp_get_code":{"code_sha256":"cce988c817575a1a"}},{"arxiv_id":"2205.15117","paper":"/paper/ood-link-prediction-generalization","title":"OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzez/ood-link-prediction-generalization-mpnn","path":"link_prediction_new.py","file_url":"https://github.com/yangzez/ood-link-prediction-generalization-mpnn/blob/HEAD/link_prediction_new.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"658016d2559f35ca","mcp_get_code":{"code_sha256":"658016d2559f35ca"}},{"arxiv_id":"2205.08378","paper":"/paper/machine-learning-and-atomic-layer-deposition","title":"Machine learning and atomic layer deposition: predicting saturation times from reactor growth profiles using artificial neural networks","date":"2022-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aldsim/saturationdataset","path":"train_shallow.py","file_url":"https://github.com/aldsim/saturationdataset/blob/HEAD/train_shallow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51500799e5412d5b","mcp_get_code":{"code_sha256":"51500799e5412d5b"}},{"arxiv_id":"2204.13713","paper":"/paper/learning-cosmology-and-clustering-with-cosmic","title":"Learning cosmology and clustering with cosmic graphs","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PabloVD/CosmoGraphNet","path":"Source/training.py","file_url":"https://github.com/PabloVD/CosmoGraphNet/blob/HEAD/Source/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12748ea8defb4965","mcp_get_code":{"code_sha256":"12748ea8defb4965"}},{"arxiv_id":"2204.11004","paper":"/paper/training-and-challenging-models-for-text","title":"Training and challenging models for text-guided fashion image retrieval","date":"2022-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yahoo/maaf","path":"src/maaf/actions/eval_retrieval.py","file_url":"https://github.com/yahoo/maaf/blob/HEAD/src/maaf/actions/eval_retrieval.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":"782c00ebf1cbbc1c","mcp_get_code":{"code_sha256":"782c00ebf1cbbc1c"}},{"arxiv_id":"2204.08200","paper":"/paper/understanding-gradual-domain-adaptation","title":"Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyond","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuctml/goat","path":"train_model.py","file_url":"https://github.com/uiuctml/goat/blob/HEAD/train_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a027f0cb95c0e29","mcp_get_code":{"code_sha256":"0a027f0cb95c0e29"}},{"arxiv_id":"2204.05986","paper":"/paper/machine-learning-security-against-data","title":"Machine Learning Security against Data Poisoning: Are We There Yet?","date":"2022-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/mithridates","path":"mnist_example.py","file_url":"https://github.com/ebagdasa/mithridates/blob/HEAD/mnist_example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"85e6ba6828465299","mcp_get_code":{"code_sha256":"85e6ba6828465299"}},{"arxiv_id":"2203.16481","paper":"/paper/on-uncertainty-tempering-and-data","title":"On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/bayesian-classification","path":"experiments/train_aug_lik.py","file_url":"https://github.com/activatedgeek/bayesian-classification/blob/HEAD/experiments/train_aug_lik.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":"b13c39f5f6f594b3","mcp_get_code":{"code_sha256":"b13c39f5f6f594b3"}},{"arxiv_id":"2203.13278","paper":"/paper/practical-blind-denoising-via-swin-conv-unet","title":"Practical Blind Image Denoising via Swin-Conv-UNet and Data Synthesis","date":"2022-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszn/scunet","path":"utils/utils_model.py","file_url":"https://github.com/cszn/scunet/blob/HEAD/utils/utils_model.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":"8afaf26fe2391d00","mcp_get_code":{"code_sha256":"8afaf26fe2391d00"}},{"arxiv_id":"2203.06125","paper":"/paper/protein-structure-representation-learning-by","title":"Protein Representation Learning by Geometric Structure Pretraining","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"c14d8e800dd48191","mcp_get_code":{"code_sha256":"c14d8e800dd48191"}},{"arxiv_id":"2203.04738","paper":"/paper/parallel-training-of-gru-networks-with-a-1","title":"Parallel Training of GRU Networks with a Multi-Grid Solver for Long Sequences","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multilevel-nn/torchbraid","path":"examples/UCI_HAR_Recurrent/UCI_HAR_GRU_script.py","file_url":"https://github.com/multilevel-nn/torchbraid/blob/HEAD/examples/UCI_HAR_Recurrent/UCI_HAR_GRU_script.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"84273d11996ee085","mcp_get_code":{"code_sha256":"84273d11996ee085"}},{"arxiv_id":"2202.13094","paper":"/paper/riconv-effective-rotation-invariant","title":"RIConv++: Effective Rotation Invariant Convolutions for 3D Point Clouds Deep Learning","date":"2022-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszyzhang/riconv2","path":"test_classification_modelnet40.py","file_url":"https://github.com/cszyzhang/riconv2/blob/HEAD/test_classification_modelnet40.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c04d675f82c202d1","mcp_get_code":{"code_sha256":"c04d675f82c202d1"}},{"arxiv_id":"2202.13094","paper":"/paper/riconv-effective-rotation-invariant","title":"RIConv++: Effective Rotation Invariant Convolutions for 3D Point Clouds Deep Learning","date":"2022-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszyzhang/riconv2","path":"train_classification_modelnet40.py","file_url":"https://github.com/cszyzhang/riconv2/blob/HEAD/train_classification_modelnet40.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5795997ac125ee61","mcp_get_code":{"code_sha256":"5795997ac125ee61"}},{"arxiv_id":"2202.12002","paper":"/paper/rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ksreenivasan/pruning_is_enough","path":"mnist_pruning_exps.py","file_url":"https://github.com/ksreenivasan/pruning_is_enough/blob/HEAD/mnist_pruning_exps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc2c00b33a3a97ed","mcp_get_code":{"code_sha256":"dc2c00b33a3a97ed"}},{"arxiv_id":"2202.11946","paper":"/paper/temporal-efficient-training-of-spiking-neural-1","title":"Temporal Efficient Training of Spiking Neural Network via Gradient Re-weighting","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-intelligence-lab/temporal_efficient_training","path":"main_training_parallel.py","file_url":"https://github.com/brain-intelligence-lab/temporal_efficient_training/blob/HEAD/main_training_parallel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f238aceb8acee39","mcp_get_code":{"code_sha256":"0f238aceb8acee39"}},{"arxiv_id":"2202.09994","paper":"/paper/transferring-adversarial-robustness-through","title":"Transferring Adversarial Robustness Through Robust Representation Matching","date":"2022-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethos-lab/robust-representation-matching","path":"l_2/train_rrm.py","file_url":"https://github.com/ethos-lab/robust-representation-matching/blob/HEAD/l_2/train_rrm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54bc106eb3c0b0d1","mcp_get_code":{"code_sha256":"54bc106eb3c0b0d1"}},{"arxiv_id":"2202.06768","paper":"/paper/probabilistic-embeddings-revisited","title":"Probabilistic Embeddings Revisited","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkoff-ai/probabilistic-embeddings","path":"src/probabilistic_embeddings/commands/basic.py","file_url":"https://github.com/tinkoff-ai/probabilistic-embeddings/blob/HEAD/src/probabilistic_embeddings/commands/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":"82ef2b6edafe061d","mcp_get_code":{"code_sha256":"82ef2b6edafe061d"}},{"arxiv_id":"2202.03580","paper":"/paper/convolutional-neural-networks-on-graphs-with-1","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","date":"2022-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivam-he/ChebNetII","path":"main/training.py","file_url":"https://github.com/ivam-he/ChebNetII/blob/HEAD/main/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c473ec557e7966bb","mcp_get_code":{"code_sha256":"c473ec557e7966bb"}},{"arxiv_id":"2202.00155","paper":"/paper/fortuitous-forgetting-in-connectionist-1","title":"Fortuitous Forgetting in Connectionist Networks","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hlml/fortuitous_forgetting","path":"targeted_forgetting/mixed_group_training.py","file_url":"https://github.com/hlml/fortuitous_forgetting/blob/HEAD/targeted_forgetting/mixed_group_training.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":"be30a111de94186a","mcp_get_code":{"code_sha256":"be30a111de94186a"}},{"arxiv_id":"2201.12433","paper":"/paper/fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fedgraph/fedgraph","path":"fedgraph/train_func.py","file_url":"https://github.com/fedgraph/fedgraph/blob/HEAD/fedgraph/train_func.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":"8064636d75c58de8","mcp_get_code":{"code_sha256":"8064636d75c58de8"}},{"arxiv_id":"2201.12433","paper":"/paper/fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yh-yao/FedGCN","path":"src/train_func.py","file_url":"https://github.com/yh-yao/FedGCN/blob/HEAD/src/train_func.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58b6937e51285f53","mcp_get_code":{"code_sha256":"58b6937e51285f53"}},{"arxiv_id":"2201.12328","paper":"/paper/toward-training-at-imagenet-scale-with","title":"Toward Training at ImageNet Scale with Differential Privacy","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dp-imagenet","path":"benchmark/mnist_opacus.py","file_url":"https://github.com/google-research/dp-imagenet/blob/HEAD/benchmark/mnist_opacus.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":"4221b2cc1686f00c","mcp_get_code":{"code_sha256":"4221b2cc1686f00c"}},{"arxiv_id":"2201.12293","paper":"/paper/understanding-why-generalized-reweighting","title":"Understanding Why Generalized Reweighting Does Not Improve Over ERM","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtianz/grw-vs-erm","path":"waterbirds_train.py","file_url":"https://github.com/runtianz/grw-vs-erm/blob/HEAD/waterbirds_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e53ce1ef7cbc912f","mcp_get_code":{"code_sha256":"e53ce1ef7cbc912f"}},{"arxiv_id":"2201.12293","paper":"/paper/understanding-why-generalized-reweighting","title":"Understanding Why Generalized Reweighting Does Not Improve Over ERM","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtianz/grw-vs-erm","path":"celeba_train.py","file_url":"https://github.com/runtianz/grw-vs-erm/blob/HEAD/celeba_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b83957c8e7796038","mcp_get_code":{"code_sha256":"b83957c8e7796038"}},{"arxiv_id":"2201.12032","paper":"/paper/neural-approximation-of-extended-persistent","title":"Neural Approximation of Graph Topological Features","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkuyzy/TLC-GNN","path":"pipelines_GIN.py","file_url":"https://github.com/pkuyzy/TLC-GNN/blob/HEAD/pipelines_GIN.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d4e3c72a304bb783","mcp_get_code":{"code_sha256":"d4e3c72a304bb783"}},{"arxiv_id":"2201.11613","paper":"/paper/domain-invariant-representation-learning-from","title":"Domain-Invariant Representation Learning from EEG with Private Encoders","date":"2022-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipph77/DAPE-Framework","path":"pipeline_funcs.py","file_url":"https://github.com/philipph77/DAPE-Framework/blob/HEAD/pipeline_funcs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf7a0ac9040a85fb","mcp_get_code":{"code_sha256":"bf7a0ac9040a85fb"}},{"arxiv_id":"2201.10489","paper":"/paper/sphere2vec-multi-scale-representation","title":"Sphere2Vec: Multi-Scale Representation Learning over a Spherical Surface for Geospatial Predictions","date":"2022-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gengchenmai/sphere2vec","path":"main/train_tang_baseline.py","file_url":"https://github.com/gengchenmai/sphere2vec/blob/HEAD/main/train_tang_baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0e60fa29baf88f8c","mcp_get_code":{"code_sha256":"0e60fa29baf88f8c"}},{"arxiv_id":"2201.02115","paper":"/paper/the-dynamics-of-representation-learning-in","title":"The dynamics of representation learning in shallow, non-linear autoencoders","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariaref/nonlinearshallowae","path":"train_autoencoder.py","file_url":"https://github.com/mariaref/nonlinearshallowae/blob/HEAD/train_autoencoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69e9284c4f5bf028","mcp_get_code":{"code_sha256":"69e9284c4f5bf028"}},{"arxiv_id":"2201.02115","paper":"/paper/the-dynamics-of-representation-learning-in","title":"The dynamics of representation learning in shallow, non-linear autoencoders","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariaref/nonlinearshallowae","path":"truncated_vanilla_SGD.py","file_url":"https://github.com/mariaref/nonlinearshallowae/blob/HEAD/truncated_vanilla_SGD.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"492ecc42d8371fd4","mcp_get_code":{"code_sha256":"492ecc42d8371fd4"}},{"arxiv_id":"2112.15246","paper":"/paper/when-are-iterative-gaussian-processes","title":"When are Iterative Gaussian Processes Reliably Accurate?","date":"2021-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjmaddox/benchmarking_iterative_gps","path":"src/train_keops.py","file_url":"https://github.com/wjmaddox/benchmarking_iterative_gps/blob/HEAD/src/train_keops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"658711389fd94d40","mcp_get_code":{"code_sha256":"658711389fd94d40"}},{"arxiv_id":"2112.05135","paper":"/paper/pixmix-dreamlike-pictures-comprehensively","title":"PixMix: Dreamlike Pictures Comprehensively Improve Safety Measures","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe1chief/windownormalizaion","path":"cifar.py","file_url":"https://github.com/joe1chief/windownormalizaion/blob/HEAD/cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b15873947143ebd","mcp_get_code":{"code_sha256":"2b15873947143ebd"}},{"arxiv_id":"2112.04903","paper":"/paper/pra-net-point-relation-aware-network-for-3d","title":"PRA-Net: Point Relation-Aware Network for 3D Point Cloud Analysis","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiwuchen/pra-net","path":"train_cls.py","file_url":"https://github.com/xiwuchen/pra-net/blob/HEAD/train_cls.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d84f80e6214b67e","mcp_get_code":{"code_sha256":"0d84f80e6214b67e"}},{"arxiv_id":"2112.04166","paper":"/paper/weighted-fairness-notions-for-indivisible","title":"Weighted Fairness Notions for Indivisible Items Revisited","date":null,"month_inferred_from_arxiv_id":"2021-12","title_source":"archive","repo":"erelsgl/fairness-with-entitlements","path":"picking-NMMS.py","file_url":"https://github.com/erelsgl/fairness-with-entitlements/blob/HEAD/picking-NMMS.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5410ebe35062af5","mcp_get_code":{"code_sha256":"b5410ebe35062af5"}},{"arxiv_id":"2112.04166","paper":"/paper/weighted-fairness-notions-for-indivisible","title":"Weighted Fairness Notions for Indivisible Items Revisited","date":null,"month_inferred_from_arxiv_id":"2021-12","title_source":"archive","repo":"erelsgl/fairness-with-entitlements","path":"picking-WMMS.py","file_url":"https://github.com/erelsgl/fairness-with-entitlements/blob/HEAD/picking-WMMS.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d5a9b71614419e69","mcp_get_code":{"code_sha256":"d5a9b71614419e69"}},{"arxiv_id":"2112.02815","paper":"/paper/make-it-move-controllable-image-to-video","title":"Make It Move: Controllable Image-to-Video Generation with Text Descriptions","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youncy-hu/mage","path":"train_vqvae.py","file_url":"https://github.com/youncy-hu/mage/blob/HEAD/train_vqvae.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":"e7621ceec8228429","mcp_get_code":{"code_sha256":"e7621ceec8228429"}},{"arxiv_id":"2111.12128","paper":"/paper/on-the-unreasonable-effectiveness-of-feature-1","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twitter-research/feature-propagation","path":"src/evaluation.py","file_url":"https://github.com/twitter-research/feature-propagation/blob/HEAD/src/evaluation.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":"917430c937090e71","mcp_get_code":{"code_sha256":"917430c937090e71"}},{"arxiv_id":"2111.04964","paper":"/paper/on-representation-knowledge-distillation-for","title":"On Representation Knowledge Distillation for Graph Neural Networks","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaitjo/efficient-gnns","path":"arxiv_pyg/gnn_kd_and_aux.py","file_url":"https://github.com/chaitjo/efficient-gnns/blob/HEAD/arxiv_pyg/gnn_kd_and_aux.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd62a3a65a648717","mcp_get_code":{"code_sha256":"dd62a3a65a648717"}},{"arxiv_id":"2111.00064","paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/pecos","path":"examples/giant-xrt/OGB_baselines/ogbn-arxiv/gnn.py","file_url":"https://github.com/amzn/pecos/blob/HEAD/examples/giant-xrt/OGB_baselines/ogbn-arxiv/gnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e6629dff4ea0a71","mcp_get_code":{"code_sha256":"8e6629dff4ea0a71"}},{"arxiv_id":"2111.00064","paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/pecos","path":"examples/giant-xrt/OGB_baselines/ogbn-papers100M/mlp_xrt.py","file_url":"https://github.com/amzn/pecos/blob/HEAD/examples/giant-xrt/OGB_baselines/ogbn-papers100M/mlp_xrt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b40f6b945f2312d4","mcp_get_code":{"code_sha256":"b40f6b945f2312d4"}},{"arxiv_id":"2111.00064","paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elichienxD/SAGN_with_SLE","path":"src/train_process.py","file_url":"https://github.com/elichienxD/SAGN_with_SLE/blob/HEAD/src/train_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ccc6f05779c9d3f","mcp_get_code":{"code_sha256":"8ccc6f05779c9d3f"}},{"arxiv_id":"2110.14446","paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Non-Homophily-Benchmarks","path":"gcn-ogbn-proteins.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/gcn-ogbn-proteins.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38233058d8c3af1b","mcp_get_code":{"code_sha256":"38233058d8c3af1b"}},{"arxiv_id":"2110.14430","paper":"/paper/adversarial-neuron-pruning-purifies","title":"Adversarial Neuron Pruning Purifies Backdoored Deep Models","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csdongxian/ANP_backdoor","path":"train_backdoor_cifar.py","file_url":"https://github.com/csdongxian/ANP_backdoor/blob/HEAD/train_backdoor_cifar.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":"f634daea78f08e78","mcp_get_code":{"code_sha256":"f634daea78f08e78"}},{"arxiv_id":"2110.14038","paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"models/GAE.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/models/GAE.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":"0cd45d466fcc03c8","mcp_get_code":{"code_sha256":"0cd45d466fcc03c8"}},{"arxiv_id":"2110.12734","paper":"/paper/fast-gradient-non-sign-methods","title":"Fast Gradient Non-sign Methods","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaya-cheng/fgnm","path":"attack.py","file_url":"https://github.com/yaya-cheng/fgnm/blob/HEAD/attack.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":"d323019f2d288d74","mcp_get_code":{"code_sha256":"d323019f2d288d74"}},{"arxiv_id":"2110.11571","paper":"/paper/anti-backdoor-learning-training-clean-models","title":"Anti-Backdoor Learning: Training Clean Models on Poisoned Data","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/ABL","path":"quick_unlearning_demo.py","file_url":"https://github.com/bboylyg/ABL/blob/HEAD/quick_unlearning_demo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cc45337733627b8a","mcp_get_code":{"code_sha256":"cc45337733627b8a"}},{"arxiv_id":"2110.11571","paper":"/paper/anti-backdoor-learning-training-clean-models","title":"Anti-Backdoor Learning: Training Clean Models on Poisoned Data","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/ABL","path":"backdoor_isolation.py","file_url":"https://github.com/bboylyg/ABL/blob/HEAD/backdoor_isolation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"707ba14f7cb744e4","mcp_get_code":{"code_sha256":"707ba14f7cb744e4"}},{"arxiv_id":"2110.11571","paper":"/paper/anti-backdoor-learning-training-clean-models","title":"Anti-Backdoor Learning: Training Clean Models on Poisoned Data","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/ABL","path":"backdoor_unlearning.py","file_url":"https://github.com/bboylyg/ABL/blob/HEAD/backdoor_unlearning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e70250f71aba3296","mcp_get_code":{"code_sha256":"e70250f71aba3296"}},{"arxiv_id":"2110.07136","paper":"/paper/federated-learning-for-covid-19-detection","title":"Federated Learning for COVID-19 Detection with Generative Adversarial Networks in Edge Cloud Computing","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dinhgit/FL-GAN_COVID","path":"COVID_GAN3.py","file_url":"https://github.com/dinhgit/FL-GAN_COVID/blob/HEAD/COVID_GAN3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2f8a4c47f484a9e1","mcp_get_code":{"code_sha256":"2f8a4c47f484a9e1"}},{"arxiv_id":"2110.04099","paper":"/paper/topology-imbalance-learning-for-semi","title":"Topology-Imbalance Learning for Semi-Supervised Node Classification","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorchen96/renode","path":"transductive/transductive_run.py","file_url":"https://github.com/victorchen96/renode/blob/HEAD/transductive/transductive_run.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":"884a6792e888cfc4","mcp_get_code":{"code_sha256":"884a6792e888cfc4"}},{"arxiv_id":"2110.01110","paper":"/paper/safe-control-with-neural-network-dynamic","title":"Safe Control with Neural Network Dynamic Models","date":"2021-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-control-lab/nndm-safe-control","path":"src/train_nn_dynamics.py","file_url":"https://github.com/intelligent-control-lab/nndm-safe-control/blob/HEAD/src/train_nn_dynamics.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":"47a5054cad95781c","mcp_get_code":{"code_sha256":"47a5054cad95781c"}},{"arxiv_id":"2109.12298","paper":"/paper/opacus-user-friendly-differential-privacy","title":"Opacus: User-Friendly Differential Privacy Library in PyTorch","date":"2021-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-pytorch/opacus","path":"examples/mnist.py","file_url":"https://github.com/meta-pytorch/opacus/blob/HEAD/examples/mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"dc66a9c5c516e132","mcp_get_code":{"code_sha256":"dc66a9c5c516e132"}},{"arxiv_id":"2109.06024","paper":"/paper/formalizing-and-estimating-distribution","title":"Formalizing and Estimating Distribution Inference Risks","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamgroot42/form_est_dist_risks","path":"arxiv/model_utils.py","file_url":"https://github.com/iamgroot42/form_est_dist_risks/blob/HEAD/arxiv/model_utils.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":"402b17de9d91f42e","mcp_get_code":{"code_sha256":"402b17de9d91f42e"}},{"arxiv_id":"2109.05263","paper":"/paper/class-distribution-aware-calibration-for-long","title":"Class-Distribution-Aware Calibration for Long-Tailed Visual Recognition","date":"2021-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mobarakol/class-distribution-aware-ts-ls","path":"main_cda.py","file_url":"https://github.com/mobarakol/class-distribution-aware-ts-ls/blob/HEAD/main_cda.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":"bea0f7799acbcb7e","mcp_get_code":{"code_sha256":"bea0f7799acbcb7e"}},{"arxiv_id":"2108.09976","paper":"/paper/revealing-distributional-vulnerability-of","title":"Revealing the Distributional Vulnerability of Discriminators by Implicit Generators","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lawliet-zzl/fig","path":"code_FIG/model_func.py","file_url":"https://github.com/lawliet-zzl/fig/blob/HEAD/code_FIG/model_func.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1b02824bf28d418","mcp_get_code":{"code_sha256":"e1b02824bf28d418"}},{"arxiv_id":"2107.06665","paper":"/paper/disparity-between-batches-as-a-signal-for","title":"Disparity Between Batches as a Signal for Early Stopping","date":"2021-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahf93/disparity_early_stopping","path":"experiments.py","file_url":"https://github.com/mahf93/disparity_early_stopping/blob/HEAD/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e65ad0d96552a41a","mcp_get_code":{"code_sha256":"e65ad0d96552a41a"}},{"arxiv_id":"2107.03356","paper":"/paper/efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IST-DASLab/M-FAC","path":"main_optim.py","file_url":"https://github.com/IST-DASLab/M-FAC/blob/HEAD/main_optim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c1bbbadad5c3cdcf","mcp_get_code":{"code_sha256":"c1bbbadad5c3cdcf"}},{"arxiv_id":"2106.15728","paper":"/paper/detecting-errors-and-estimating-accuracy-on","title":"Detecting Errors and Estimating Accuracy on Unlabeled Data with Self-training Ensembles","date":"2021-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jfc43/self-training-ensembles","path":"train_model.py","file_url":"https://github.com/jfc43/self-training-ensembles/blob/HEAD/train_model.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":"abfc49a6c5259ce6","mcp_get_code":{"code_sha256":"abfc49a6c5259ce6"}},{"arxiv_id":"2106.14806","paper":"/paper/laplace-redux-effortless-bayesian-deep","title":"Laplace Redux -- Effortless Bayesian Deep Learning","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runame/laplace-redux","path":"continual_learning.py","file_url":"https://github.com/runame/laplace-redux/blob/HEAD/continual_learning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0bb74d222799962d","mcp_get_code":{"code_sha256":"0bb74d222799962d"}},{"arxiv_id":"2106.07802","paper":"/paper/geomol-torsional-geometric-generation-of","title":"GeoMol: Torsional Geometric Generation of Molecular 3D Conformer Ensembles","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PattanaikL/GeoMol","path":"model/training.py","file_url":"https://github.com/PattanaikL/GeoMol/blob/HEAD/model/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63f6decfce240abe","mcp_get_code":{"code_sha256":"63f6decfce240abe"}},{"arxiv_id":"2106.06695","paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_keops.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_keops.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":"2644758dc97dafb9","mcp_get_code":{"code_sha256":"2644758dc97dafb9"}},{"arxiv_id":"2106.06695","paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_simplexgp.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_simplexgp.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":"224de20ec1631761","mcp_get_code":{"code_sha256":"224de20ec1631761"}},{"arxiv_id":"2106.06695","paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_skip.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_skip.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":"c8315a839146cf9f","mcp_get_code":{"code_sha256":"c8315a839146cf9f"}},{"arxiv_id":"2106.06142","paper":"/paper/doro-distributional-and-outlier-robust","title":"DORO: Distributional and Outlier Robust Optimization","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuntianZ/doro","path":"celeba.py","file_url":"https://github.com/RuntianZ/doro/blob/HEAD/celeba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"923872f2f1950cc6","mcp_get_code":{"code_sha256":"923872f2f1950cc6"}},{"arxiv_id":"2106.05390","paper":"/paper/optimizing-reusable-knowledge-for-continual","title":"Optimizing Reusable Knowledge for Continual Learning via Metalearning","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JuliousHurtado/meta-training-setup","path":"approach.py","file_url":"https://github.com/JuliousHurtado/meta-training-setup/blob/HEAD/approach.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e987939c21e03a4","mcp_get_code":{"code_sha256":"4e987939c21e03a4"}},{"arxiv_id":"2106.03699","paper":"/paper/formalizing-distribution-inference-risks","title":"Formalizing Distribution Inference Risks","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamgroot42/distribution_inference","path":"arxiv/model_utils.py","file_url":"https://github.com/iamgroot42/distribution_inference/blob/HEAD/arxiv/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":"402b17de9d91f42e","mcp_get_code":{"code_sha256":"402b17de9d91f42e"}},{"arxiv_id":"2106.00967","paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bachnguyente/temporal-mgn","path":"covid/code/experiments.py","file_url":"https://github.com/bachnguyente/temporal-mgn/blob/HEAD/covid/code/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99b16ab3641139d0","mcp_get_code":{"code_sha256":"99b16ab3641139d0"}},{"arxiv_id":"2105.13205","paper":"/paper/hamiltonian-deep-neural-networks-guaranteeing","title":"Hamiltonian Deep Neural Networks Guaranteeing Non-vanishing Gradients by Design","date":"2021-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b72ce5c71654e88c","mcp_get_code":{"code_sha256":"b72ce5c71654e88c"}},{"arxiv_id":"2105.11645","paper":"/paper/feature-space-targeted-attacks-by-statistic","title":"Feature Space Targeted Attacks by Statistic Alignment","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaya-cheng/PAA-GAA","path":"utils.py","file_url":"https://github.com/yaya-cheng/PAA-GAA/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a240eab698972155","mcp_get_code":{"code_sha256":"a240eab698972155"}},{"arxiv_id":"2105.07910","paper":"/paper/rapid-probabilistic-estimation-of-type-ia","title":"Probabilistic Reconstruction of Type Ia Supernova SN 2002bo","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"wkerzendorf/wsynphot","path":"wsynphot/_astropy_init.py","file_url":"https://github.com/wkerzendorf/wsynphot/blob/HEAD/wsynphot/_astropy_init.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":"e6219b8d4d197d28","mcp_get_code":{"code_sha256":"e6219b8d4d197d28"}},{"arxiv_id":"2105.06791","paper":"/paper/agree-to-disagree-when-deep-learning-models","title":"Agree to Disagree: When Deep Learning Models With Identical Architectures Produce Distinct Explanations","date":"2021-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattswatson/agree-to-disagree","path":"mnist/mnist.py","file_url":"https://github.com/mattswatson/agree-to-disagree/blob/HEAD/mnist/mnist.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":"a438d6a37e882441","mcp_get_code":{"code_sha256":"a438d6a37e882441"}},{"arxiv_id":"2105.01601","paper":"/paper/mlp-mixer-an-all-mlp-architecture-for-vision","title":"MLP-Mixer: An all-MLP Architecture for Vision","date":"2021-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/MLP-Mixer-TF2","path":"source/tf_process.py","file_url":"https://github.com/YeongHyeon/MLP-Mixer-TF2/blob/HEAD/source/tf_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b20ca1037f5918f","mcp_get_code":{"code_sha256":"1b20ca1037f5918f"}},{"arxiv_id":"2104.15129","paper":"/paper/stealthy-backdoors-as-compression-artifacts","title":"Stealthy Backdoors as Compression Artifacts","date":"2021-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yulongtzzz/Stealthy-Backdoors-as-Compression-Artifacts","path":"train_baseline_models/auto_compress_for_clean_models.py","file_url":"https://github.com/yulongtzzz/Stealthy-Backdoors-as-Compression-Artifacts/blob/HEAD/train_baseline_models/auto_compress_for_clean_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"400fad4c2a965a37","mcp_get_code":{"code_sha256":"400fad4c2a965a37"}},{"arxiv_id":"2104.09841","paper":"/paper/selfreg-self-supervised-contrastive","title":"SelfReg: Self-supervised Contrastive Regularization for Domain Generalization","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dnap512/SelfReg","path":"codes/utils.py","file_url":"https://github.com/dnap512/SelfReg/blob/HEAD/codes/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec8fc897d0ae3ed2","mcp_get_code":{"code_sha256":"ec8fc897d0ae3ed2"}},{"arxiv_id":"2104.09376","paper":"/paper/scalable-and-adaptive-graph-neural-networks","title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skepsun/SAGN_with_SLE","path":"src/train_process.py","file_url":"https://github.com/skepsun/SAGN_with_SLE/blob/HEAD/src/train_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ccc6f05779c9d3f","mcp_get_code":{"code_sha256":"8ccc6f05779c9d3f"}},{"arxiv_id":"2104.07916","paper":"/paper/polynomial-networks-in-deep-classifiers","title":"Augmenting Deep Classifiers with Polynomial Neural Networks","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grigorisg9gr/polynomials-for-augmenting-nns","path":"train_main.py","file_url":"https://github.com/grigorisg9gr/polynomials-for-augmenting-nns/blob/HEAD/train_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"09aef88b1cb9acde","mcp_get_code":{"code_sha256":"09aef88b1cb9acde"}},{"arxiv_id":"2104.01396","paper":"/paper/property-driven-training-all-you-n-ever","title":"Neural Network Robustness as a Verification Property: A Principled Case Study","date":"2021-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aisec-private/training-with-constraints","path":"src/mainPGD.py","file_url":"https://github.com/aisec-private/training-with-constraints/blob/HEAD/src/mainPGD.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"69be0d76e524e850","mcp_get_code":{"code_sha256":"69be0d76e524e850"}},{"arxiv_id":"2103.14006","paper":"/paper/designing-a-practical-degradation-model-for","title":"Designing a Practical Degradation Model for Deep Blind Image Super-Resolution","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadirnar/bsrgan-pip","path":"bsrgan/utils/utils_model.py","file_url":"https://github.com/kadirnar/bsrgan-pip/blob/HEAD/bsrgan/utils/utils_model.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":"8afaf26fe2391d00","mcp_get_code":{"code_sha256":"8afaf26fe2391d00"}},{"arxiv_id":"2103.09762","paper":"/paper/gradient-projection-memory-for-continual-1","title":"Gradient Projection Memory for Continual Learning","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sahagobinda/GPM","path":"main_cifar100.py","file_url":"https://github.com/sahagobinda/GPM/blob/HEAD/main_cifar100.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":"52f190e75c2b2866","mcp_get_code":{"code_sha256":"52f190e75c2b2866"}},{"arxiv_id":"2102.13186","paper":"/paper/towards-a-unified-framework-for-fair-and","title":"Towards a Unified Framework for Fair and Stable Graph Representation Learning","date":"2021-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaolin-cs/bemap","path":"train_bemap.py","file_url":"https://github.com/xiaolin-cs/bemap/blob/HEAD/train_bemap.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1356322f7eb2e55d","mcp_get_code":{"code_sha256":"1356322f7eb2e55d"}},{"arxiv_id":"2102.11495","paper":"/paper/anytime-sampling-for-autoregressive-models-1","title":"Anytime Sampling for Autoregressive Models via Ordered Autoencoding","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"newbeeer/anytime-auto-regressive-model","path":"vqvae.py","file_url":"https://github.com/newbeeer/anytime-auto-regressive-model/blob/HEAD/vqvae.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":"dd59052ee56ad885","mcp_get_code":{"code_sha256":"dd59052ee56ad885"}},{"arxiv_id":"2012.09688","paper":"/paper/pct-point-cloud-transformer","title":"PCT: Point cloud transformer","date":"2020-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qq456cvb/Point-Transformers","path":"train_cls.py","file_url":"https://github.com/qq456cvb/Point-Transformers/blob/HEAD/train_cls.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"666120673cea6c54","mcp_get_code":{"code_sha256":"666120673cea6c54"}},{"arxiv_id":"2012.07743","paper":"/paper/argument-mining-driven-analysis-of-peer","title":"Argument Mining Driven Analysis of Peer-Reviews","date":"2020-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fromm-m/aaai2021-am-peer-reviews","path":"5_model_works/sentence_level/executables/s_train.py","file_url":"https://github.com/fromm-m/aaai2021-am-peer-reviews/blob/HEAD/5_model_works/sentence_level/executables/s_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a0213bccb4b84c8","mcp_get_code":{"code_sha256":"0a0213bccb4b84c8"}},{"arxiv_id":"2011.00931","paper":"/paper/point-transformer","title":"Point Transformer","date":"2020-11-02","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":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"666120673cea6c54","mcp_get_code":{"code_sha256":"666120673cea6c54"}},{"arxiv_id":"2011.00931","paper":"/paper/point-transformer","title":"Point Transformer","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"engelnico/point-transformer","path":"train_cls.py","file_url":"https://github.com/engelnico/point-transformer/blob/HEAD/train_cls.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5255a9c1ae289d43","mcp_get_code":{"code_sha256":"5255a9c1ae289d43"}},{"arxiv_id":"2010.15824","paper":"/paper/passport-aware-normalization-for-deep-model","title":"Passport-aware Normalization for Deep Model Protection","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJZAC/Passport-aware-Normalization","path":"3d_point_cls/train_3_cls.py","file_url":"https://github.com/ZJZAC/Passport-aware-Normalization/blob/HEAD/3d_point_cls/train_3_cls.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a93734c6b26abdb","mcp_get_code":{"code_sha256":"7a93734c6b26abdb"}},{"arxiv_id":"2010.13993","paper":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/CorrectAndSmooth","path":"gen_models.py","file_url":"https://github.com/CUAI/CorrectAndSmooth/blob/HEAD/gen_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5a209cddf7b3e52f","mcp_get_code":{"code_sha256":"5a209cddf7b3e52f"}},{"arxiv_id":"2010.07565","paper":"/paper/bi-gcn-binary-graph-convolutional-network","title":"Bi-GCN: Binary Graph Convolutional Network","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bywmm/Bi-GCN","path":"inductive-gs-bignn.py","file_url":"https://github.com/bywmm/Bi-GCN/blob/HEAD/inductive-gs-bignn.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":"947a8edd74562e4a","mcp_get_code":{"code_sha256":"947a8edd74562e4a"}},{"arxiv_id":"2010.05851","paper":"/paper/graph-neural-networks-for-an-accurate-and","title":"Graph Neural Networks for an Accurate and Interpretable Prediction of the Properties of Polycrystalline Materials","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"mehmetfdemirel/PolycrystalGraph","path":"model.py","file_url":"https://github.com/mehmetfdemirel/PolycrystalGraph/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7698ed29fb73ad2e","mcp_get_code":{"code_sha256":"7698ed29fb73ad2e"}},{"arxiv_id":"2010.05272","paper":"/paper/if-defense-3d-adversarial-point-cloud-defense-1","title":"IF-Defense: 3D Adversarial Point Cloud Defense via Implicit Function based Restoration","date":"2020-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaidongLi/pytorch-LatticePointClassifier","path":"cluster_attack.py","file_url":"https://github.com/KaidongLi/pytorch-LatticePointClassifier/blob/HEAD/cluster_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f1a30d62ca94b83","mcp_get_code":{"code_sha256":"1f1a30d62ca94b83"}},{"arxiv_id":"2010.04205","paper":"/paper/gaussian-mrf-covariance-modeling-for","title":"Gaussian MRF Covariance Modeling for Efficient Black-Box Adversarial Attacks","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anitksahu/GMRF","path":"attack_imagenet.py","file_url":"https://github.com/anitksahu/GMRF/blob/HEAD/attack_imagenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02223ee10970d0bc","mcp_get_code":{"code_sha256":"02223ee10970d0bc"}},{"arxiv_id":"2010.04011","paper":"/paper/spatially-variant-cnn-based-point-spread","title":"Spatially-Variant CNN-based Point Spread Function Estimation for Blind Deconvolution and Depth Estimation in Optical Microscopy","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idiap/psfestimation","path":"benchmark_models.py","file_url":"https://github.com/idiap/psfestimation/blob/HEAD/benchmark_models.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":"6eab011470cb6598","mcp_get_code":{"code_sha256":"6eab011470cb6598"}},{"arxiv_id":"2009.01454","paper":"/paper/fairgnn-eliminating-the-discrimination-in","title":"Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information","date":"2020-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1356322f7eb2e55d","mcp_get_code":{"code_sha256":"1356322f7eb2e55d"}},{"arxiv_id":"2008.13751","paper":"/paper/plug-and-play-image-restoration-with-deep","title":"Plug-and-Play Image Restoration with Deep Denoiser Prior","date":"2020-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszn/DPIR","path":"utils/utils_model.py","file_url":"https://github.com/cszn/DPIR/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8afaf26fe2391d00","mcp_get_code":{"code_sha256":"8afaf26fe2391d00"}},{"arxiv_id":"2008.01454","paper":"/paper/learning-from-a-complementary-label-source","title":"Learning from a Complementary-label Source Domain: Theory and Algorithms","date":"2020-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiyang98/BFUDA","path":"ours/train_mu_et.py","file_url":"https://github.com/Yiyang98/BFUDA/blob/HEAD/ours/train_mu_et.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"706d37e741433189","mcp_get_code":{"code_sha256":"706d37e741433189"}},{"arxiv_id":"2007.14191","paper":"/paper/tempered-sigmoid-activations-for-deep","title":"Tempered Sigmoid Activations for Deep Learning with Differential Privacy","date":"2020-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0084ec1c2df6dc92","mcp_get_code":{"code_sha256":"0084ec1c2df6dc92"}},{"arxiv_id":"2007.12256","paper":"/paper/towards-recognizing-unseen-categories-in","title":"Towards Recognizing Unseen Categories in Unseen Domains","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mancinimassimiliano/CuMix","path":"utils.py","file_url":"https://github.com/mancinimassimiliano/CuMix/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e9fcbd2a25ff6e86","mcp_get_code":{"code_sha256":"e9fcbd2a25ff6e86"}},{"arxiv_id":"2007.04780","paper":"/paper/modelling-the-distribution-of-3d-brain-mri","title":"Modelling the Distribution of 3D Brain MRI using a 2D Slice VAE","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voanna/slices-to-3d-brain-vae","path":"experiments/MICCAI-release-version/main_experiment_128.py","file_url":"https://github.com/voanna/slices-to-3d-brain-vae/blob/HEAD/experiments/MICCAI-release-version/main_experiment_128.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f9c9d609f6d18ce","mcp_get_code":{"code_sha256":"9f9c9d609f6d18ce"}},{"arxiv_id":"2006.16811","paper":"/paper/path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuGuangWang/PAN","path":"pan_benchmark.py","file_url":"https://github.com/YuGuangWang/PAN/blob/HEAD/pan_benchmark.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":"793f90ca314ad9d4","mcp_get_code":{"code_sha256":"793f90ca314ad9d4"}},{"arxiv_id":"2006.12557","paper":"/paper/just-how-toxic-is-data-poisoning-a-unified","title":"Just How Toxic is Data Poisoning? A Unified Benchmark for Backdoor and Data Poisoning Attacks","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aks2203/poisoning-benchmark","path":"learning_module.py","file_url":"https://github.com/aks2203/poisoning-benchmark/blob/HEAD/learning_module.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c5c5573f3c214926","mcp_get_code":{"code_sha256":"c5c5573f3c214926"}},{"arxiv_id":"2006.11468","paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PetarV-/GAT","path":"utils/process_ppi.py","file_url":"https://github.com/PetarV-/GAT/blob/HEAD/utils/process_ppi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cbd09a8688d1836a","mcp_get_code":{"code_sha256":"cbd09a8688d1836a"}},{"arxiv_id":"2006.10876","paper":"/paper/beware-the-black-box-on-the-robustness-of","title":"Beware the Black-Box: on the Robustness of Recent Defenses to Adversarial Examples","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiaojunQAQ/Comdefend","path":"Train_comdefend_Torch.py","file_url":"https://github.com/jiaxiaojunQAQ/Comdefend/blob/HEAD/Train_comdefend_Torch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"989d4595a4fe4060","mcp_get_code":{"code_sha256":"989d4595a4fe4060"}},{"arxiv_id":"2006.07990","paper":"/paper/optimal-lottery-tickets-via-subsetsum","title":"Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acnagle/optimal-lottery-tickets","path":"subset-sum/utils.py","file_url":"https://github.com/acnagle/optimal-lottery-tickets/blob/HEAD/subset-sum/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f506c17f4ffcf126","mcp_get_code":{"code_sha256":"f506c17f4ffcf126"}},{"arxiv_id":"2006.07846","paper":"/paper/from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omri1348/LRGA","path":"ogb/examples/linkproppred/collab/gnn.py","file_url":"https://github.com/omri1348/LRGA/blob/HEAD/ogb/examples/linkproppred/collab/gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aed917122fd597e7","mcp_get_code":{"code_sha256":"aed917122fd597e7"}},{"arxiv_id":"2006.07540","paper":"/paper/metaperturb-transferable-regularizer-for","title":"MetaPerturb: Transferable Regularizer for Heterogeneous Tasks and Architectures","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JWoong148/MetaPerturb","path":"train_tgt.py","file_url":"https://github.com/JWoong148/MetaPerturb/blob/HEAD/train_tgt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7d416f62c5eb134","mcp_get_code":{"code_sha256":"f7d416f62c5eb134"}},{"arxiv_id":"2006.07356","paper":"/paper/implicit-bias-of-gradient-descent-for-mean","title":"Implicit Bias of Gradient Descent for Mean Squared Error Regression with Two-Layer Wide Neural Networks","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huijin12/implicit_bias_wide_neural_networks","path":"normal_train.py","file_url":"https://github.com/huijin12/implicit_bias_wide_neural_networks/blob/HEAD/normal_train.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":"30a582b71a443c73","mcp_get_code":{"code_sha256":"30a582b71a443c73"}},{"arxiv_id":"2006.00719","paper":"/paper/adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","date":"2020-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirgholami/adahessian","path":"image_classification/utils.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/image_classification/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beeda9e1db69fe81","mcp_get_code":{"code_sha256":"beeda9e1db69fe81"}},{"arxiv_id":"2005.10150","paper":"/paper/gcn-based-user-representation-learning-for","title":"GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detection","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zsjdddhr/GraphRfi","path":"run_GraphRfi_example.py","file_url":"https://github.com/zsjdddhr/GraphRfi/blob/HEAD/run_GraphRfi_example.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":"75d39a399779f248","mcp_get_code":{"code_sha256":"75d39a399779f248"}},{"arxiv_id":"2005.05763","paper":"/paper/winowhy-a-deep-diagnosis-of-essential","title":"WinoWhy: A Deep Diagnosis of Essential Commonsense Knowledge for Answering Winograd Schema Challenge","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/WinoWhy","path":"supervised_winowhy.py","file_url":"https://github.com/HKUST-KnowComp/WinoWhy/blob/HEAD/supervised_winowhy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e210d3e72ed13610","mcp_get_code":{"code_sha256":"e210d3e72ed13610"}},{"arxiv_id":"2005.01856","paper":"/paper/designing-data-augmentation-for-simulating","title":"Selecting Data Augmentation for Simulating Interventions","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DataAugmentationInterventions","path":"PACS/fine_tune_alexnet.py","file_url":"https://github.com/AMLab-Amsterdam/DataAugmentationInterventions/blob/HEAD/PACS/fine_tune_alexnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c830c598efe5902","mcp_get_code":{"code_sha256":"6c830c598efe5902"}},{"arxiv_id":"2005.01856","paper":"/paper/designing-data-augmentation-for-simulating","title":"Selecting Data Augmentation for Simulating Interventions","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DataAugmentationInterventions","path":"PACS/fine_tune_alexnet_domain_classifier.py","file_url":"https://github.com/AMLab-Amsterdam/DataAugmentationInterventions/blob/HEAD/PACS/fine_tune_alexnet_domain_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1c542ac49f80bd6","mcp_get_code":{"code_sha256":"a1c542ac49f80bd6"}},{"arxiv_id":"2005.00206","paper":"/paper/transomcs-from-linguistic-graphs-to","title":"TransOMCS: From Linguistic Graphs to Commonsense Knowledge","date":"2020-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/TransOMCS","path":"Train_and_Predict.py","file_url":"https://github.com/HKUST-KnowComp/TransOMCS/blob/HEAD/Train_and_Predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c57dfbbddabfbf4d","mcp_get_code":{"code_sha256":"c57dfbbddabfbf4d"}},{"arxiv_id":"2004.12615","paper":"/paper/maximum-density-divergence-for-domain","title":"Maximum Density Divergence for Domain Adaptation","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijin118/ATM","path":"train_svhnmnist.py","file_url":"https://github.com/lijin118/ATM/blob/HEAD/train_svhnmnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6c444a074a1c4cdb","mcp_get_code":{"code_sha256":"6c444a074a1c4cdb"}},{"arxiv_id":"2004.12585","paper":"/paper/a-batch-normalized-inference-network-keeps","title":"A Batch Normalized Inference Network Keeps the KL Vanishing Away","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valdersoul/bn-vae","path":"lm.py","file_url":"https://github.com/valdersoul/bn-vae/blob/HEAD/lm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1ba669623777faf","mcp_get_code":{"code_sha256":"f1ba669623777faf"}},{"arxiv_id":"2004.12585","paper":"/paper/a-batch-normalized-inference-network-keeps","title":"A Batch Normalized Inference Network Keeps the KL Vanishing Away","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valdersoul/bn-vae","path":"t_s_f.py","file_url":"https://github.com/valdersoul/bn-vae/blob/HEAD/t_s_f.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ad017041756a7ce","mcp_get_code":{"code_sha256":"7ad017041756a7ce"}},{"arxiv_id":"2004.11198","paper":"/paper/sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twitter-research/sign","path":"sign_training.py","file_url":"https://github.com/twitter-research/sign/blob/HEAD/sign_training.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b40f6b945f2312d4","mcp_get_code":{"code_sha256":"b40f6b945f2312d4"}},{"arxiv_id":"2004.08514","paper":"/paper/semi-supervised-semantic-segmentation-via","title":"DMT: Dynamic Mutual Training for Semi-Supervised Learning","date":"2020-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voldemortX/DST-CBC","path":"classification/main_dmt.py","file_url":"https://github.com/voldemortX/DST-CBC/blob/HEAD/classification/main_dmt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"837df0414a9e9631","mcp_get_code":{"code_sha256":"837df0414a9e9631"}},{"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":"engine/fsl_baseline.py","file_url":"https://github.com/WonderSeven/ULDA/blob/HEAD/engine/fsl_baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f347e7f86ec8d83d","mcp_get_code":{"code_sha256":"f347e7f86ec8d83d"}},{"arxiv_id":"2004.03706","paper":"/paper/long-tailed-recognition-using-class-balanced","title":"Long-Tailed Recognition Using Class-Balanced Experts","date":"2020-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssfootball04/class-balanced-experts","path":"jointCalibration.py","file_url":"https://github.com/ssfootball04/class-balanced-experts/blob/HEAD/jointCalibration.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":"6e5cdfaf59c333f7","mcp_get_code":{"code_sha256":"6e5cdfaf59c333f7"}},{"arxiv_id":"2003.05438","paper":"/paper/rethinking-image-mixture-for-unsupervised","title":"Un-Mix: Rethinking Image Mixtures for Unsupervised Visual Representation Learning","date":"2020-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szq0214/un-mix","path":"unmix_c10.py","file_url":"https://github.com/szq0214/un-mix/blob/HEAD/unmix_c10.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ec86c87ba5292b45","mcp_get_code":{"code_sha256":"ec86c87ba5292b45"}},{"arxiv_id":"2003.02037","paper":"/paper/simple-and-scalable-epistemic-uncertainty","title":"Uncertainty Estimation Using a Single Deep Deterministic Neural Network","date":"2020-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"y0ast/deterministic-uncertainty-quantification","path":"train_deep_ensemble.py","file_url":"https://github.com/y0ast/deterministic-uncertainty-quantification/blob/HEAD/train_deep_ensemble.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d17a6bd8c8316c6e","mcp_get_code":{"code_sha256":"d17a6bd8c8316c6e"}},{"arxiv_id":"2003.02944","paper":"/paper/exploiting-neuron-and-synapse-filter-dynamics","title":"Exploiting Neuron and Synapse Filter Dynamics in Spatial Temporal Learning of Deep Spiking Neural Network","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyuchen/snn-iir","path":"snn_conv_1_gesture.py","file_url":"https://github.com/zhongyuchen/snn-iir/blob/HEAD/snn_conv_1_gesture.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":"a557a6000459cb5f","mcp_get_code":{"code_sha256":"a557a6000459cb5f"}},{"arxiv_id":"2002.10711","paper":"/paper/searching-for-winograd-aware-quantized","title":"Searching for Winograd-aware Quantized Networks","date":"2020-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jafermarq/WinogradAwareNets","path":"adapt.py","file_url":"https://github.com/jafermarq/WinogradAwareNets/blob/HEAD/adapt.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":"539ce8989e097d52","mcp_get_code":{"code_sha256":"539ce8989e097d52"}},{"arxiv_id":"2002.07376","paper":"/paper/picking-winning-tickets-before-training-by-1","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alecwangcq/GraSP","path":"main_prune_non_imagenet.py","file_url":"https://github.com/alecwangcq/GraSP/blob/HEAD/main_prune_non_imagenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7903c905c882d017","mcp_get_code":{"code_sha256":"7903c905c882d017"}},{"arxiv_id":"2002.06349","paper":"/paper/hold-me-tight-influence-of-discriminative","title":"Hold me tight! Influence of discriminative features on deep network boundaries","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LTS4/hold-me-tight","path":"utils.py","file_url":"https://github.com/LTS4/hold-me-tight/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6caa248f9b277e17","mcp_get_code":{"code_sha256":"6caa248f9b277e17"}},{"arxiv_id":"2002.05709","paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ae-foster/pytorch-simclr","path":"evaluate/lbfgs.py","file_url":"https://github.com/ae-foster/pytorch-simclr/blob/HEAD/evaluate/lbfgs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f1dd5d8d7b83513","mcp_get_code":{"code_sha256":"3f1dd5d8d7b83513"}},{"arxiv_id":"2001.07685","paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongying-Deng/NorMatch","path":"train_fixmatch.py","file_url":"https://github.com/Zhongying-Deng/NorMatch/blob/HEAD/train_fixmatch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e516133a9e28be90","mcp_get_code":{"code_sha256":"e516133a9e28be90"}},{"arxiv_id":"1912.13458","paper":"/paper/face-x-ray-for-more-general-face-forgery","title":"Face X-ray for More General Face Forgery Detection","date":"2019-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wkq-wukaiqi/Face-X-Ray","path":"evaluate.py","file_url":"https://github.com/wkq-wukaiqi/Face-X-Ray/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c24c6d6400fe185b","mcp_get_code":{"code_sha256":"c24c6d6400fe185b"}},{"arxiv_id":"1912.11006","paper":"/paper/data-free-adversarial-distillation","title":"Data-Free Adversarial Distillation","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VainF/Data-Free-Adversarial-Distillation","path":"train_teacher.py","file_url":"https://github.com/VainF/Data-Free-Adversarial-Distillation/blob/HEAD/train_teacher.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":"95d8d4d101aeda06","mcp_get_code":{"code_sha256":"95d8d4d101aeda06"}},{"arxiv_id":"1912.11006","paper":"/paper/data-free-adversarial-distillation","title":"Data-Free Adversarial Distillation","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VainF/Data-Free-Adversarial-Distillation","path":"DFAD_mnist.py","file_url":"https://github.com/VainF/Data-Free-Adversarial-Distillation/blob/HEAD/DFAD_mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b113b0620ccf30c3","mcp_get_code":{"code_sha256":"b113b0620ccf30c3"}},{"arxiv_id":"1912.07145","paper":"/paper/pyhessian-neural-networks-through-the-lens-of","title":"PyHessian: Neural Networks Through the Lens of the Hessian","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirgholami/pyhessian","path":"utils.py","file_url":"https://github.com/amirgholami/pyhessian/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"efb74181eced6df4","mcp_get_code":{"code_sha256":"efb74181eced6df4"}},{"arxiv_id":"1911.11834","paper":"/paper/towards-fairness-in-visual-recognition","title":"Towards Fairness in Visual Recognition: Effective Strategies for Bias Mitigation","date":"2019-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjie1003/DL-Fairness-Study","path":"FAAP/train_deployed_model.py","file_url":"https://github.com/junjie1003/DL-Fairness-Study/blob/HEAD/FAAP/train_deployed_model.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":"cb8230eee410ffa7","mcp_get_code":{"code_sha256":"cb8230eee410ffa7"}},{"arxiv_id":"1911.11607","paper":"/paper/deep-learning-with-gaussian-differential","title":"Deep Learning with Gaussian Differential Privacy","date":"2019-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0084ec1c2df6dc92","mcp_get_code":{"code_sha256":"0084ec1c2df6dc92"}},{"arxiv_id":"1911.07389","paper":"/paper/towards-visually-explaining-variational","title":"Towards Visually Explaining Variational Autoencoders","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrankBrongers/Reproducing_expVAE","path":"Anomaly_Detection/code/train_expVAE.py","file_url":"https://github.com/FrankBrongers/Reproducing_expVAE/blob/HEAD/Anomaly_Detection/code/train_expVAE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf7868a2bd2ce0a9","mcp_get_code":{"code_sha256":"bf7868a2bd2ce0a9"}},{"arxiv_id":"1911.07389","paper":"/paper/towards-visually-explaining-variational","title":"Towards Visually Explaining Variational Autoencoders","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuem607/expVAE","path":"code/train_expVAE.py","file_url":"https://github.com/liuem607/expVAE/blob/HEAD/code/train_expVAE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b2cfb305395fca77","mcp_get_code":{"code_sha256":"b2cfb305395fca77"}},{"arxiv_id":"1911.05856","paper":"/paper/spiralnet-a-fast-and-highly-efficient-mesh","title":"SpiralNet++: A Fast and Highly Efficient Mesh Convolution Operator","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sw-gong/spiralnet_plus","path":"correspondence/train_eval.py","file_url":"https://github.com/sw-gong/spiralnet_plus/blob/HEAD/correspondence/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e493cee49e23de35","mcp_get_code":{"code_sha256":"e493cee49e23de35"}},{"arxiv_id":"1911.05856","paper":"/paper/spiralnet-a-fast-and-highly-efficient-mesh","title":"SpiralNet++: A Fast and Highly Efficient Mesh Convolution Operator","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sw-gong/spiralnet_plus","path":"reconstruction/train_eval.py","file_url":"https://github.com/sw-gong/spiralnet_plus/blob/HEAD/reconstruction/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"174d4228a23fda23","mcp_get_code":{"code_sha256":"174d4228a23fda23"}},{"arxiv_id":"1910.03231","paper":"/paper/peer-loss-functions-learning-from-noisy","title":"Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiaheng/Multi-class-Peer-Loss-functions","path":"CIFAR-10/runner.py","file_url":"https://github.com/weijiaheng/Multi-class-Peer-Loss-functions/blob/HEAD/CIFAR-10/runner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"400ca42b786ad4aa","mcp_get_code":{"code_sha256":"400ca42b786ad4aa"}},{"arxiv_id":"1910.03231","paper":"/paper/peer-loss-functions-learning-from-noisy","title":"Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiaheng/Multi-class-Peer-Loss-functions","path":"CIFAR-100/runner.py","file_url":"https://github.com/weijiaheng/Multi-class-Peer-Loss-functions/blob/HEAD/CIFAR-100/runner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c2d3e976a74b0705","mcp_get_code":{"code_sha256":"c2d3e976a74b0705"}},{"arxiv_id":"1910.03231","paper":"/paper/peer-loss-functions-learning-from-noisy","title":"Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiaheng/Multi-class-Peer-Loss-functions","path":"MNIST/runner.py","file_url":"https://github.com/weijiaheng/Multi-class-Peer-Loss-functions/blob/HEAD/MNIST/runner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad3fb425de0113bf","mcp_get_code":{"code_sha256":"ad3fb425de0113bf"}},{"arxiv_id":"1910.00780","paper":"/paper/towards-unifying-neural-architecture-space","title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLDGroup/NN_Mass","path":"train_cifar.py","file_url":"https://github.com/SLDGroup/NN_Mass/blob/HEAD/train_cifar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4800dd5ec9240018","mcp_get_code":{"code_sha256":"4800dd5ec9240018"}},{"arxiv_id":"1909.11957","paper":"/paper/drawing-early-bird-tickets-towards-more","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICE-EIC/Early-Bird-Tickets","path":"main_resnet50.py","file_url":"https://github.com/RICE-EIC/Early-Bird-Tickets/blob/HEAD/main_resnet50.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8a5e585e02729d7","mcp_get_code":{"code_sha256":"d8a5e585e02729d7"}},{"arxiv_id":"1909.01315","paper":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dglai/dgl-0.5-benchmark","path":"end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.py","file_url":"https://github.com/dglai/dgl-0.5-benchmark/blob/HEAD/end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.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":"46f5fd24720486a6","mcp_get_code":{"code_sha256":"46f5fd24720486a6"}},{"arxiv_id":"1909.01315","paper":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dglai/dgl-0.5-benchmark","path":"end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.py","file_url":"https://github.com/dglai/dgl-0.5-benchmark/blob/HEAD/end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8d54f057e38fcfbe","mcp_get_code":{"code_sha256":"8d54f057e38fcfbe"}},{"arxiv_id":"1908.09979","paper":"/paper/deephoyer-learning-sparser-neural-network","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanghr/DeepHoyer","path":"imagenet/util.py","file_url":"https://github.com/yanghr/DeepHoyer/blob/HEAD/imagenet/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":"eae15ffc6073381c","mcp_get_code":{"code_sha256":"eae15ffc6073381c"}},{"arxiv_id":"1908.09186","paper":"/paper/efficient-learning-on-point-clouds-with-basis","title":"Efficient Learning on Point Clouds with Basis Point Sets","date":"2019-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sergeyprokudin/bps","path":"bps_demos/train_modelnet_conv3d.py","file_url":"https://github.com/sergeyprokudin/bps/blob/HEAD/bps_demos/train_modelnet_conv3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT-0","inline_ok":false,"code_sha256_prefix":"f3c6cf0854da6a3a","mcp_get_code":{"code_sha256":"f3c6cf0854da6a3a"}},{"arxiv_id":"1908.07678","paper":"/paper/asymmetric-non-local-neural-networks-for","title":"Asymmetric Non-local Neural Networks for Semantic Segmentation","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MendelXu/ANN","path":"efficiency_statics/time_detail.py","file_url":"https://github.com/MendelXu/ANN/blob/HEAD/efficiency_statics/time_detail.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":"bd8478b90ca0fa11","mcp_get_code":{"code_sha256":"bd8478b90ca0fa11"}},{"arxiv_id":"1908.04950","paper":"/paper/videonavqa-bridging-the-gap-between-visual","title":"VideoNavQA: Bridging the Gap between Visual and Embodied Question Answering","date":"2019-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catalina17/VideoNavQA","path":"eval/q_and_v_test.py","file_url":"https://github.com/catalina17/VideoNavQA/blob/HEAD/eval/q_and_v_test.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69101a8feb315835","mcp_get_code":{"code_sha256":"69101a8feb315835"}},{"arxiv_id":"1907.06515","paper":"/paper/detecting-and-simulating-artifacts-in-gan","title":"Detecting and Simulating Artifacts in GAN Fake Images","date":"2019-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ColumbiaDVMM/AutoGAN","path":"code/GAN_Detection_Test.py","file_url":"https://github.com/ColumbiaDVMM/AutoGAN/blob/HEAD/code/GAN_Detection_Test.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f5f3dfc783ce7c12","mcp_get_code":{"code_sha256":"f5f3dfc783ce7c12"}},{"arxiv_id":"1907.02796","paper":"/paper/unsupervised-anomaly-localization-using","title":"Unsupervised Anomaly Localization using Variational Auto-Encoders","date":"2019-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIC-DKFZ/vae-anomaly-experiments","path":"mnist_script.py","file_url":"https://github.com/MIC-DKFZ/vae-anomaly-experiments/blob/HEAD/mnist_script.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3631d2390cf86991","mcp_get_code":{"code_sha256":"3631d2390cf86991"}},{"arxiv_id":"1907.00865","paper":"/paper/radial-bayesian-neural-networks-robust","title":"Radial Bayesian Neural Networks: Beyond Discrete Support In Large-Scale Bayesian Deep Learning","date":"2019-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"bdea437fe2c544f2","mcp_get_code":{"code_sha256":"bdea437fe2c544f2"}},{"arxiv_id":"1906.11555","paper":"/paper/effective-rotation-invariant-point-cnn-with","title":"Effective Rotation-invariant Point CNN with Spherical Harmonics kernels","date":"2019-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrienPoulenard/SPHnet","path":"SPHnet/train_classification.py","file_url":"https://github.com/adrienPoulenard/SPHnet/blob/HEAD/SPHnet/train_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"083f3648094a9592","mcp_get_code":{"code_sha256":"083f3648094a9592"}},{"arxiv_id":"1906.08632","paper":"/paper/dynamics-of-stochastic-gradient-descent-for","title":"Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setup","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cristianoBY/nn2pp-torch","path":"teacher_student.py","file_url":"https://github.com/cristianoBY/nn2pp-torch/blob/HEAD/teacher_student.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a441ec277fdfd93","mcp_get_code":{"code_sha256":"0a441ec277fdfd93"}},{"arxiv_id":"1906.05747","paper":"/paper/modeling-the-dynamics-of-pde-systems-with","title":"Modeling the Dynamics of PDE Systems with Physics-Constrained Deep Auto-Regressive Networks","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cics-nd/ar-pde-cnn","path":"1D-Burger-SWAG/post/plotARContour.py","file_url":"https://github.com/cics-nd/ar-pde-cnn/blob/HEAD/1D-Burger-SWAG/post/plotARContour.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6dcfb58126fa9c11","mcp_get_code":{"code_sha256":"6dcfb58126fa9c11"}},{"arxiv_id":"1905.11452","paper":"/paper/differentiable-quantization-of-deep-neural","title":"Mixed Precision DNNs: All you need is a good parametrization","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vovamedentsiy/mpdnn","path":"experiments/train_loops.py","file_url":"https://github.com/vovamedentsiy/mpdnn/blob/HEAD/experiments/train_loops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c43668f981804409","mcp_get_code":{"code_sha256":"c43668f981804409"}},{"arxiv_id":"1905.10671","paper":"/paper/dianet-dense-and-implicit-attention-network","title":"DIANet: Dense-and-Implicit Attention Network","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/EAN-efficient-attention-network","path":"search_imagent/train_imagenet_ensemble_subset.py","file_url":"https://github.com/gbup-group/EAN-efficient-attention-network/blob/HEAD/search_imagent/train_imagenet_ensemble_subset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"98b70efbbd8108b2","mcp_get_code":{"code_sha256":"98b70efbbd8108b2"}},{"arxiv_id":"1905.10427","paper":"/paper/diva-domain-invariant-variational","title":"DIVA: Domain Invariant Variational Autoencoders","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"41ecd72a1b2446e5","mcp_get_code":{"code_sha256":"41ecd72a1b2446e5"}},{"arxiv_id":"1904.12368","paper":"/paper/legr-filter-pruning-via-learned-global","title":"Towards Efficient Model Compression via Learned Global Ranking","date":"2019-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmu-enyac/LeGR","path":"utils/drivers.py","file_url":"https://github.com/cmu-enyac/LeGR/blob/HEAD/utils/drivers.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":"a5658e5e4ec22f8c","mcp_get_code":{"code_sha256":"a5658e5e4ec22f8c"}},{"arxiv_id":"1904.01082","paper":"/paper/parametric-shortest-path-algorithms-via","title":"Parametric shortest-path algorithms via tropical geometry","date":null,"month_inferred_from_arxiv_id":"2019-04","title_source":"archive","repo":"MrCopprHead/joswig","path":"old/interp.py","file_url":"https://github.com/MrCopprHead/joswig/blob/HEAD/old/interp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d21758f14b5c14fc","mcp_get_code":{"code_sha256":"d21758f14b5c14fc"}},{"arxiv_id":"1904.00887","paper":"/paper/adversarial-defense-by-restricting-the-hidden","title":"Adversarial Defense by Restricting the Hidden Space of Deep Neural Networks","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aamir-mustafa/pcl-adversarial-defense","path":"pcl_training.py","file_url":"https://github.com/aamir-mustafa/pcl-adversarial-defense/blob/HEAD/pcl_training.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c15892ac30a8f0c0","mcp_get_code":{"code_sha256":"c15892ac30a8f0c0"}},{"arxiv_id":"1904.00887","paper":"/paper/adversarial-defense-by-restricting-the-hidden","title":"Adversarial Defense by Restricting the Hidden Space of Deep Neural Networks","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aamir-mustafa/pcl-adversarial-defense","path":"softmax_training.py","file_url":"https://github.com/aamir-mustafa/pcl-adversarial-defense/blob/HEAD/softmax_training.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":"67c367afa6418ca2","mcp_get_code":{"code_sha256":"67c367afa6418ca2"}},{"arxiv_id":"1903.12394","paper":"/paper/informed-machine-learning-towards-a-taxonomy","title":"Informed Machine Learning -- A Taxonomy and Survey of Integrating Knowledge into Learning Systems","date":"2019-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tvhahn/weibull-knowledge-informed-ml","path":"src/models/utils.py","file_url":"https://github.com/tvhahn/weibull-knowledge-informed-ml/blob/HEAD/src/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"135db9ea11d9ad79","mcp_get_code":{"code_sha256":"135db9ea11d9ad79"}},{"arxiv_id":"1903.09734","paper":"/paper/regularized-learning-for-domain-adaptation-1","title":"Regularized Learning for Domain Adaptation under Label Shifts","date":"2019-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Angie-Liu/labelshift","path":"offline_label_shift.py","file_url":"https://github.com/Angie-Liu/labelshift/blob/HEAD/offline_label_shift.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7db3138f22f6cd5f","mcp_get_code":{"code_sha256":"7db3138f22f6cd5f"}},{"arxiv_id":"1903.03894","paper":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RexYing/gnn-model-explainer","path":"explain_pyg.py","file_url":"https://github.com/RexYing/gnn-model-explainer/blob/HEAD/explain_pyg.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":"1194b67a9fa45964","mcp_get_code":{"code_sha256":"1194b67a9fa45964"}},{"arxiv_id":"1903.03894","paper":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexDuvalinho/GNNE_eval","path":"explain_pyg.py","file_url":"https://github.com/AlexDuvalinho/GNNE_eval/blob/HEAD/explain_pyg.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":"b35616ed5d1efd11","mcp_get_code":{"code_sha256":"b35616ed5d1efd11"}},{"arxiv_id":"1902.07243","paper":"/paper/graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLiangwei/ConsisRec","path":"run_GraphConsis_example.py","file_url":"https://github.com/YangLiangwei/ConsisRec/blob/HEAD/run_GraphConsis_example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c3647dc49ab201a8","mcp_get_code":{"code_sha256":"c3647dc49ab201a8"}},{"arxiv_id":"1901.11058","paper":"/paper/hypergan-a-generative-model-for-diverse","title":"HyperGAN: A Generative Model for Diverse, Performant Neural Networks","date":"2019-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simeetnayan81/hypergan-pytorch","path":"model.py","file_url":"https://github.com/simeetnayan81/hypergan-pytorch/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee66b036eb7eafa5","mcp_get_code":{"code_sha256":"ee66b036eb7eafa5"}},{"arxiv_id":"1901.05534","paper":"/paper/lagging-inference-networks-and-posterior","title":"Lagging Inference Networks and Posterior Collapse in Variational Autoencoders","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/vae-lagging-encoder","path":"image.py","file_url":"https://github.com/jxhe/vae-lagging-encoder/blob/HEAD/image.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79e431252f32cf60","mcp_get_code":{"code_sha256":"79e431252f32cf60"}},{"arxiv_id":"1901.05534","paper":"/paper/lagging-inference-networks-and-posterior","title":"Lagging Inference Networks and Posterior Collapse in Variational Autoencoders","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/vae-lagging-encoder","path":"text.py","file_url":"https://github.com/jxhe/vae-lagging-encoder/blob/HEAD/text.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3884f3eb2fb3adc2","mcp_get_code":{"code_sha256":"3884f3eb2fb3adc2"}},{"arxiv_id":"1901.05534","paper":"/paper/lagging-inference-networks-and-posterior","title":"Lagging Inference Networks and Posterior Collapse in Variational Autoencoders","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/vae-lagging-encoder","path":"toy.py","file_url":"https://github.com/jxhe/vae-lagging-encoder/blob/HEAD/toy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3d3feb42f9c79a9e","mcp_get_code":{"code_sha256":"3d3feb42f9c79a9e"}},{"arxiv_id":"1812.07179","paper":"/paper/pseudo-lidar-from-visual-depth-estimation","title":"Pseudo-LiDAR from Visual Depth Estimation: Bridging the Gap in 3D Object Detection for Autonomous Driving","date":"2018-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mileyan/pseudo_lidar","path":"psmnet/finetune_3d.py","file_url":"https://github.com/mileyan/pseudo_lidar/blob/HEAD/psmnet/finetune_3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e262e7cb04403ae","mcp_get_code":{"code_sha256":"1e262e7cb04403ae"}},{"arxiv_id":"1812.07108","paper":"/paper/learning-private-neural-language-modeling","title":"Learning Private Neural Language Modeling with Attentive Aggregation","date":"2018-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoxiongji/federated-learning","path":"main_nn.py","file_url":"https://github.com/shaoxiongji/federated-learning/blob/HEAD/main_nn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a15078a8d47f36f1","mcp_get_code":{"code_sha256":"a15078a8d47f36f1"}},{"arxiv_id":"1812.04224","paper":"/paper/on-the-dimensionality-of-word-embedding","title":"On the Dimensionality of Word Embedding","date":"2018-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaaasssddf/PIP-experiments","path":"forward_stability/cross_comparison.py","file_url":"https://github.com/aaaasssddf/PIP-experiments/blob/HEAD/forward_stability/cross_comparison.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c888017b3a38ec00","mcp_get_code":{"code_sha256":"c888017b3a38ec00"}},{"arxiv_id":"1812.00564","paper":"/paper/split-learning-for-health-distributed-deep","title":"Split learning for health: Distributed deep learning without sharing raw patient data","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bt-s/Split-Learning-and-Federated-Learning","path":"src/federated_learning.py","file_url":"https://github.com/bt-s/Split-Learning-and-Federated-Learning/blob/HEAD/src/federated_learning.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89cc7e81633904bf","mcp_get_code":{"code_sha256":"89cc7e81633904bf"}},{"arxiv_id":"1811.12673","paper":"/paper/comdefend-an-efficient-image-compression","title":"ComDefend: An Efficient Image Compression Model to Defend Adversarial Examples","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"989d4595a4fe4060","mcp_get_code":{"code_sha256":"989d4595a4fe4060"}},{"arxiv_id":"1811.07246","paper":"/paper/pointconv-deep-convolutional-networks-on-3d","title":"PointConv: Deep Convolutional Networks on 3D Point Clouds","date":"2018-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DylanWusee/pointconv_pytorch","path":"utils/utils.py","file_url":"https://github.com/DylanWusee/pointconv_pytorch/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3fbd70fccfa67f08","mcp_get_code":{"code_sha256":"3fbd70fccfa67f08"}},{"arxiv_id":"1811.07130","paper":"/paper/batch-feature-erasing-for-person-re","title":"Batch DropBlock Network for Person Re-identification and Beyond","date":"2018-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjjszj/ps_dm_reid","path":"main_reid.py","file_url":"https://github.com/zjjszj/ps_dm_reid/blob/HEAD/main_reid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99bbeaa12c80f194","mcp_get_code":{"code_sha256":"99bbeaa12c80f194"}},{"arxiv_id":"1810.03958","paper":"/paper/deterministic-variational-inference-for","title":"Deterministic Variational Inference for Robust Bayesian Neural Networks","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omwright/cov-prop-nn","path":"train_mnist.py","file_url":"https://github.com/omwright/cov-prop-nn/blob/HEAD/train_mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57b45b3540c780fe","mcp_get_code":{"code_sha256":"57b45b3540c780fe"}},{"arxiv_id":"1809.06267","paper":"/paper/pointnetgpd-detecting-grasp-configurations","title":"PointNetGPD: Detecting Grasp Configurations from Point Sets","date":null,"month_inferred_from_arxiv_id":"2018-09","title_source":"archive","repo":"lianghongzhuo/PointNetGPD","path":"PointNetGPD/main_1v.py","file_url":"https://github.com/lianghongzhuo/PointNetGPD/blob/HEAD/PointNetGPD/main_1v.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51b8ec2235fca87b","mcp_get_code":{"code_sha256":"51b8ec2235fca87b"}},{"arxiv_id":"1808.08718","paper":"/paper/wide-activation-for-efficient-and-accurate","title":"Wide Activation for Efficient and Accurate Image Super-Resolution","date":"2018-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SJHNJU/WDSR","path":"psnr.py","file_url":"https://github.com/SJHNJU/WDSR/blob/HEAD/psnr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37c6b07e255ca382","mcp_get_code":{"code_sha256":"37c6b07e255ca382"}},{"arxiv_id":"1808.00508","paper":"/paper/neural-arithmetic-logic-units","title":"Neural Arithmetic Logic Units","date":"2018-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrederikWarburg/latent_disagreement","path":"Experiments/NALU_all_we_need.py","file_url":"https://github.com/FrederikWarburg/latent_disagreement/blob/HEAD/Experiments/NALU_all_we_need.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":"634dd1dd6bda3381","mcp_get_code":{"code_sha256":"634dd1dd6bda3381"}},{"arxiv_id":"1806.03836","paper":"/paper/bayesian-model-agnostic-meta-learning","title":"Bayesian Model-Agnostic Meta-Learning","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaesik817/bmaml","path":"bmaml_main.py","file_url":"https://github.com/jaesik817/bmaml/blob/HEAD/bmaml_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41c113e97f65bc84","mcp_get_code":{"code_sha256":"41c113e97f65bc84"}},{"arxiv_id":"1806.03836","paper":"/paper/bayesian-model-agnostic-meta-learning","title":"Bayesian Model-Agnostic Meta-Learning","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaesik817/bmaml","path":"emaml_main.py","file_url":"https://github.com/jaesik817/bmaml/blob/HEAD/emaml_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"497268d1ca2c3360","mcp_get_code":{"code_sha256":"497268d1ca2c3360"}},{"arxiv_id":"1805.04601","paper":"/paper/double-embeddings-and-cnn-based-sequence","title":"Double Embeddings and CNN-based Sequence Labeling for Aspect Extraction","date":"2018-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"howardhsu/DE-CNN","path":"script/evaluation.py","file_url":"https://github.com/howardhsu/DE-CNN/blob/HEAD/script/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2de8bd9815cfbb28","mcp_get_code":{"code_sha256":"2de8bd9815cfbb28"}},{"arxiv_id":"1803.10081","paper":"/paper/deepjdot-deep-joint-distribution-optimal","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asahi417/DeepDomainAdaptation","path":"random/script_network_simplex_method.py","file_url":"https://github.com/asahi417/DeepDomainAdaptation/blob/HEAD/random/script_network_simplex_method.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4d73a818388c204","mcp_get_code":{"code_sha256":"e4d73a818388c204"}},{"arxiv_id":"1803.09574","paper":"/paper/long-short-term-memory-and-learning-to-learn","title":"Long short-term memory and learning-to-learn in networks of spiking neurons","date":"2018-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"norse/norse","path":"norse/task/mnist.py","file_url":"https://github.com/norse/norse/blob/HEAD/norse/task/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"code_sha256_prefix":"9965114171da1c70","mcp_get_code":{"code_sha256":"9965114171da1c70"}},{"arxiv_id":"1802.07088","paper":"/paper/i-revnet-deep-invertible-networks","title":"i-RevNet: Deep Invertible Networks","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhjacobsen/pytorch-i-revnet","path":"models/utils_cifar.py","file_url":"https://github.com/jhjacobsen/pytorch-i-revnet/blob/HEAD/models/utils_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dab1f482d324fc51","mcp_get_code":{"code_sha256":"dab1f482d324fc51"}},{"arxiv_id":"1712.02560","paper":"/paper/maximum-classifier-discrepancy-for","title":"Maximum Classifier Discrepancy for Unsupervised Domain Adaptation","date":"2017-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HiGal/Domain-Adaptation","path":"baseline.py","file_url":"https://github.com/HiGal/Domain-Adaptation/blob/HEAD/baseline.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":"92b5f7c292e95c2c","mcp_get_code":{"code_sha256":"92b5f7c292e95c2c"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"404nofound/gat","path":"utils/process_ppi.py","file_url":"https://github.com/404nofound/gat/blob/HEAD/utils/process_ppi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cbd09a8688d1836a","mcp_get_code":{"code_sha256":"cbd09a8688d1836a"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DanielLongo/CapsNet-PyTorch","path":"CapsNet.py","file_url":"https://github.com/DanielLongo/CapsNet-PyTorch/blob/HEAD/CapsNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f854823338dc9ee8","mcp_get_code":{"code_sha256":"f854823338dc9ee8"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lauromoraes/capsnet-promoter","path":"capsulenet.py","file_url":"https://github.com/lauromoraes/capsnet-promoter/blob/HEAD/capsulenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9baf4429c73eff71","mcp_get_code":{"code_sha256":"9baf4429c73eff71"}},{"arxiv_id":"1705.07832","paper":"/paper/concrete-dropout","title":"Concrete Dropout","date":"2017-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielkelshaw/ConcreteDropout","path":"mnist_example.py","file_url":"https://github.com/danielkelshaw/ConcreteDropout/blob/HEAD/mnist_example.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a04fa1a0775cf9b","mcp_get_code":{"code_sha256":"8a04fa1a0775cf9b"}},{"arxiv_id":"1705.03341","paper":"/paper/stable-architectures-for-deep-neural-networks","title":"Stable Architectures for Deep Neural Networks","date":"2017-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DecodEPFL/HamiltonianNet","path":"examples/run_MNIST.py","file_url":"https://github.com/DecodEPFL/HamiltonianNet/blob/HEAD/examples/run_MNIST.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"b72ce5c71654e88c","mcp_get_code":{"code_sha256":"b72ce5c71654e88c"}},{"arxiv_id":"1703.03864","paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangtongZhang/DistributedES","path":"cma_es.py","file_url":"https://github.com/ShangtongZhang/DistributedES/blob/HEAD/cma_es.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":"0f3373194a3a7f49","mcp_get_code":{"code_sha256":"0f3373194a3a7f49"}},{"arxiv_id":"1703.03864","paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangtongZhang/DistributedES","path":"natural_es.py","file_url":"https://github.com/ShangtongZhang/DistributedES/blob/HEAD/natural_es.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":"d216d50a731d0266","mcp_get_code":{"code_sha256":"d216d50a731d0266"}},{"arxiv_id":"1703.02702","paper":"/paper/robust-adversarial-reinforcement-learning","title":"Robust Adversarial Reinforcement Learning","date":"2017-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidsonic/robust-grasp","path":"src/PPO_RARL.py","file_url":"https://github.com/davidsonic/robust-grasp/blob/HEAD/src/PPO_RARL.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":"d30a9422beea45f4","mcp_get_code":{"code_sha256":"d30a9422beea45f4"}},{"arxiv_id":"1612.05153","paper":"/paper/on-the-potential-of-simple-framewise","title":"On the Potential of Simple Framewise Approaches to Piano Transcription","date":"2016-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainerkelz/framewise_2016","path":"check_scheduler.py","file_url":"https://github.com/rainerkelz/framewise_2016/blob/HEAD/check_scheduler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b91251c7af139f06","mcp_get_code":{"code_sha256":"b91251c7af139f06"}},{"arxiv_id":"1612.03651","paper":"/paper/fasttextzip-compressing-text-classification","title":"FastText.zip: Compressing text classification models","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FengJiaChunFromSYSU/fastText","path":"python/fastText/util/util.py","file_url":"https://github.com/FengJiaChunFromSYSU/fastText/blob/HEAD/python/fastText/util/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"5c3bcf5ae2042c99","mcp_get_code":{"code_sha256":"5c3bcf5ae2042c99"}},{"arxiv_id":"1612.00796","paper":"/paper/overcoming-catastrophic-forgetting-in-neural","title":"Overcoming catastrophic forgetting in neural networks","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clam004/intro_continual_learning","path":"contlearn/gettrainer.py","file_url":"https://github.com/clam004/intro_continual_learning/blob/HEAD/contlearn/gettrainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"426df1649f33777b","mcp_get_code":{"code_sha256":"426df1649f33777b"}},{"arxiv_id":"1611.08402","paper":"/paper/geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theswgong/MoNet","path":"image/train_eval.py","file_url":"https://github.com/theswgong/MoNet/blob/HEAD/image/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a70eb3051c972797","mcp_get_code":{"code_sha256":"a70eb3051c972797"}},{"arxiv_id":"1611.08402","paper":"/paper/geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theswgong/MoNet","path":"manifolds/train_eval.py","file_url":"https://github.com/theswgong/MoNet/blob/HEAD/manifolds/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa42f81c7ba963a8","mcp_get_code":{"code_sha256":"fa42f81c7ba963a8"}},{"arxiv_id":"1611.05267","paper":"/paper/temporal-convolutional-networks-for-action","title":"Temporal Convolutional Networks for Action Segmentation and Detection","date":"2016-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderSkyChen/Action_Recognition_Zoo","path":"model_zoo/inceptionresnetv2/pytorch_load.py","file_url":"https://github.com/coderSkyChen/Action_Recognition_Zoo/blob/HEAD/model_zoo/inceptionresnetv2/pytorch_load.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae9e3d8a0c2437a3","mcp_get_code":{"code_sha256":"ae9e3d8a0c2437a3"}},{"arxiv_id":"1611.05267","paper":"/paper/temporal-convolutional-networks-for-action","title":"Temporal Convolutional Networks for Action Segmentation and Detection","date":"2016-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderSkyChen/Action_Recognition_Zoo","path":"model_zoo/inceptionv4/pytorch_load.py","file_url":"https://github.com/coderSkyChen/Action_Recognition_Zoo/blob/HEAD/model_zoo/inceptionv4/pytorch_load.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0795c8d92282a8a8","mcp_get_code":{"code_sha256":"0795c8d92282a8a8"}},{"arxiv_id":"1610.00087","paper":"/paper/very-deep-convolutional-neural-networks-for","title":"Very Deep Convolutional Neural Networks for Raw Waveforms","date":"2016-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andry-Heritiana/Very_Deep_CNN_Audio_Classification","path":"audio_classifier.py","file_url":"https://github.com/Andry-Heritiana/Very_Deep_CNN_Audio_Classification/blob/HEAD/audio_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8073a6d3ba5a0498","mcp_get_code":{"code_sha256":"8073a6d3ba5a0498"}},{"arxiv_id":"1609.01596","paper":"/paper/direct-feedback-alignment-provides-learning","title":"Direct Feedback Alignment Provides Learning in Deep Neural Networks","date":"2016-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"florian-bacho/dirdfa","path":"main_fwd_grad.py","file_url":"https://github.com/florian-bacho/dirdfa/blob/HEAD/main_fwd_grad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51c09bebc952acfe","mcp_get_code":{"code_sha256":"51c09bebc952acfe"}},{"arxiv_id":"1607.00133","paper":"/paper/deep-learning-with-differential-privacy","title":"Deep Learning with Differential Privacy","date":"2016-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woodyx218/opacus_global_clipping","path":"examples/mnist.py","file_url":"https://github.com/woodyx218/opacus_global_clipping/blob/HEAD/examples/mnist.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":"0084ec1c2df6dc92","mcp_get_code":{"code_sha256":"0084ec1c2df6dc92"}},{"arxiv_id":"1604.00772","paper":"/paper/the-cma-evolution-strategy-a-tutorial","title":"The CMA Evolution Strategy: A Tutorial","date":"2016-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0f3373194a3a7f49","mcp_get_code":{"code_sha256":"0f3373194a3a7f49"}},{"arxiv_id":"1602.02644","paper":"/paper/generating-images-with-perceptual-similarity","title":"Generating Images with Perceptual Similarity Metrics based on Deep Networks","date":"2016-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukky17/DeePSiM_pytorch","path":"ff_training.py","file_url":"https://github.com/ukky17/DeePSiM_pytorch/blob/HEAD/ff_training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ae6f395d3f13127","mcp_get_code":{"code_sha256":"4ae6f395d3f13127"}},{"arxiv_id":"1602.02644","paper":"/paper/generating-images-with-perceptual-similarity","title":"Generating Images with Perceptual Similarity Metrics based on Deep Networks","date":"2016-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukky17/DeePSiM_pytorch","path":"invert.py","file_url":"https://github.com/ukky17/DeePSiM_pytorch/blob/HEAD/invert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"34c9ffd370cc3a66","mcp_get_code":{"code_sha256":"34c9ffd370cc3a66"}},{"arxiv_id":"1512.02325","paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Richard-cpu2333/tx2dl","path":"train_ssd.py","file_url":"https://github.com/Richard-cpu2333/tx2dl/blob/HEAD/train_ssd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6abcd99e86cde01d","mcp_get_code":{"code_sha256":"6abcd99e86cde01d"}},{"arxiv_id":"1512.02325","paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qfgaohao/pytorch-ssd","path":"train_ssd.py","file_url":"https://github.com/qfgaohao/pytorch-ssd/blob/HEAD/train_ssd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f2cc07a0b923e0be","mcp_get_code":{"code_sha256":"f2cc07a0b923e0be"}},{"arxiv_id":"1511.06530","paper":"/paper/compression-of-deep-convolutional-neural","title":"Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications","date":"2015-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"634c4d5814f593b1","mcp_get_code":{"code_sha256":"634c4d5814f593b1"}},{"arxiv_id":"1506.02025","paper":"/paper/spatial-transformer-networks","title":"Spatial Transformer Networks","date":"2015-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dabane-ghassan/int-lab-book","path":"src/what_where/what.py","file_url":"https://github.com/dabane-ghassan/int-lab-book/blob/HEAD/src/what_where/what.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5fa28bbc8a62fb2","mcp_get_code":{"code_sha256":"a5fa28bbc8a62fb2"}},{"arxiv_id":"1506.02025","paper":"/paper/spatial-transformer-networks","title":"Spatial Transformer Networks","date":"2015-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dabane-ghassan/int-lab-book","path":"src/what_where/where.py","file_url":"https://github.com/dabane-ghassan/int-lab-book/blob/HEAD/src/what_where/where.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6da6edb8aece76fb","mcp_get_code":{"code_sha256":"6da6edb8aece76fb"}},{"arxiv_id":"1505.05424","paper":"/paper/weight-uncertainty-in-neural-networks","title":"Weight Uncertainty in Neural Networks","date":"2015-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielkelshaw/RadialBNN","path":"mnist_radial_bnn.py","file_url":"https://github.com/danielkelshaw/RadialBNN/blob/HEAD/mnist_radial_bnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bdea437fe2c544f2","mcp_get_code":{"code_sha256":"bdea437fe2c544f2"}},{"arxiv_id":"1412.6553","paper":"/paper/speeding-up-convolutional-neural-networks","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","date":"2014-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graphiiz/low-rank-factorization","path":"pretrained_main.py","file_url":"https://github.com/Graphiiz/low-rank-factorization/blob/HEAD/pretrained_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"634c4d5814f593b1","mcp_get_code":{"code_sha256":"634c4d5814f593b1"}},{"arxiv_id":"1412.0035","paper":"/paper/understanding-deep-image-representations-by","title":"Understanding Deep Image Representations by Inverting Them","date":"2014-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"4ae6f395d3f13127","mcp_get_code":{"code_sha256":"4ae6f395d3f13127"}},{"arxiv_id":"aaai_29519","paper":null,"title":"arXiv:aaai_29519","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wu-dd/DIRK","path":"utils/util.py","file_url":"https://github.com/wu-dd/DIRK/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":"6f22dafb9443ee73","mcp_get_code":{"code_sha256":"6f22dafb9443ee73"}},{"arxiv_id":"aaai_27944","paper":null,"title":"arXiv:aaai_27944","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"FengZicai/Interpretable3D","path":"PointNet2/train_modelnet_ip3d.py","file_url":"https://github.com/FengZicai/Interpretable3D/blob/HEAD/PointNet2/train_modelnet_ip3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce172d643935fc9d","mcp_get_code":{"code_sha256":"ce172d643935fc9d"}},{"arxiv_id":"aaai_27944","paper":null,"title":"arXiv:aaai_27944","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"FengZicai/Interpretable3D","path":"PointNet2/train_scanobjectnn.py","file_url":"https://github.com/FengZicai/Interpretable3D/blob/HEAD/PointNet2/train_scanobjectnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f90d1e6603325c7d","mcp_get_code":{"code_sha256":"f90d1e6603325c7d"}},{"arxiv_id":"aaai_21366","paper":null,"title":"arXiv:aaai_21366","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"qkrdmsghk/TextSSL","path":"ssl_graphmodels/pyg_models/train_docs.py","file_url":"https://github.com/qkrdmsghk/TextSSL/blob/HEAD/ssl_graphmodels/pyg_models/train_docs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ddba71f9bc7fc2a","mcp_get_code":{"code_sha256":"7ddba71f9bc7fc2a"}},{"arxiv_id":"aaai_20460","paper":null,"title":"arXiv:aaai_20460","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"rpSebastian/AutoCFR","path":"autocfr/plot.py","file_url":"https://github.com/rpSebastian/AutoCFR/blob/HEAD/autocfr/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51a10af52857c09a","mcp_get_code":{"code_sha256":"51a10af52857c09a"}},{"arxiv_id":"aaai_17462","paper":null,"title":"arXiv:aaai_17462","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/nni","path":"nni_assets/hello_hpo/model.py","file_url":"https://github.com/microsoft/nni/blob/HEAD/nni_assets/hello_hpo/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1cf9444cdb9ff2b","mcp_get_code":{"code_sha256":"d1cf9444cdb9ff2b"}},{"arxiv_id":"Ding_Motion-Aware_Contrastive_Video_Representation_Learning_via_Foreground-Background_Merging_CVPR_2022_paper","paper":null,"title":"arXiv:Ding_Motion-Aware_Contrastive_Video_Representation_Learning_via_Foreground-Background_Merging_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Mark12Ding/FAME","path":"main_retrieve.py","file_url":"https://github.com/Mark12Ding/FAME/blob/HEAD/main_retrieve.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":"2679d2440b5bd036","mcp_get_code":{"code_sha256":"2679d2440b5bd036"}},{"arxiv_id":"2024.naacl-long.176","paper":null,"title":"arXiv:2024.naacl-long.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"terarachang/MemPi","path":"downstream.py","file_url":"https://github.com/terarachang/MemPi/blob/HEAD/downstream.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":"3768a7b1e8d9fea1","mcp_get_code":{"code_sha256":"3768a7b1e8d9fea1"}}]}