{"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/lr-scheduler","entry":"lr_scheduler","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":32,"n_papers_ran":26,"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":18,"n_samples_ran":11,"n_samples_fingerprinted":2,"n_places":34,"n_places_pointer_only":19,"by_status":{"ran_honours":4,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":2,"unverified":7},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2607.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":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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2412.14301","paper":"/paper/what-has-been-overlooked-in-contrastive","title":"What Has Been Overlooked in Contrastive Source-Free Domain Adaptation: Leveraging Source-Informed Latent Augmentation within Neighborhood Context","date":"2024-12-18","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2411.12558","paper":"/paper/recall-and-refine-a-simple-but-effective","title":"Recall and Refine: A Simple but Effective Source-free Open-set Domain Adaptation Framework","date":"2024-11-19","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2403.03421","paper":"/paper/lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/glc","path":"train_source.py","file_url":"https://github.com/ispc-lab/glc/blob/HEAD/train_source.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"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":"function.py","file_url":"https://github.com/hcplab-sysu/personsearch-ctlg/blob/HEAD/function.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"87e153290f393327","mcp_get_code":{"code_sha256":"87e153290f393327"}},{"arxiv_id":"2307.03133","paper":"/paper/benchmarking-test-time-adaptation-against","title":"Benchmarking Test-Time Adaptation against Distribution Shifts in Image Classification","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/benchmark-tta","path":"train_source.py","file_url":"https://github.com/yuyongcan/benchmark-tta/blob/HEAD/train_source.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"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":"utils.py","file_url":"https://github.com/zplusdragon/plip/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":"a31fc96a7b978b35","mcp_get_code":{"code_sha256":"a31fc96a7b978b35"}},{"arxiv_id":"2211.06612","paper":"/paper/divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyezhang/dac","path":"VisDA/target.py","file_url":"https://github.com/zyezhang/dac/blob/HEAD/VisDA/target.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"b7e334f5e0eb5920","mcp_get_code":{"code_sha256":"b7e334f5e0eb5920"}},{"arxiv_id":"2211.06027","paper":"/paper/dance-of-snn-and-ann-solving-binding-problem","title":"Dance of SNN and ANN: Solving binding problem by combining spike timing and reconstructive attention","date":"2022-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monstersecond/dasbe","path":"dasbe/train_clrnet.py","file_url":"https://github.com/monstersecond/dasbe/blob/HEAD/dasbe/train_clrnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"acc54adbeafc8bec","mcp_get_code":{"code_sha256":"acc54adbeafc8bec"}},{"arxiv_id":"2211.06027","paper":"/paper/dance-of-snn-and-ann-solving-binding-problem","title":"Dance of SNN and ANN: Solving binding problem by combining spike timing and reconstructive attention","date":"2022-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monstersecond/dasbe","path":"dasbe/train_net.py","file_url":"https://github.com/monstersecond/dasbe/blob/HEAD/dasbe/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":"02df8fd7598f2c2b","mcp_get_code":{"code_sha256":"02df8fd7598f2c2b"}},{"arxiv_id":"2211.03876","paper":"/paper/conmix-for-source-free-single-and-multi","title":"CoNMix for Source-free Single and Multi-target Domain Adaptation","date":"2022-11-07","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2208.13986","paper":"/paper/uncertainty-induced-transferability","title":"Uncertainty-Induced Transferability Representation for Source-Free Unsupervised Domain Adaptation","date":"2022-08-30","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2207.13247","paper":"/paper/concurrent-subsidiary-supervision-for","title":"Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/sfda_neighbors","path":"train_src.py","file_url":"https://github.com/albert0147/sfda_neighbors/blob/HEAD/train_src.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2207.08877","paper":"/paper/prior-knowledge-guided-unsupervised-domain","title":"Prior Knowledge Guided Unsupervised Domain Adaptation","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/KUDA","path":"DINE/DINE_dist.py","file_url":"https://github.com/tsun/KUDA/blob/HEAD/DINE/DINE_dist.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2206.06640","paper":"/paper/confidence-score-for-source-free-unsupervised","title":"Confidence Score for Source-Free Unsupervised Domain Adaptation","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhyun17/cowa-jmds","path":"image_target_CoWA.py","file_url":"https://github.com/jhyun17/cowa-jmds/blob/HEAD/image_target_CoWA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ee7b6c67ccbf3fb","mcp_get_code":{"code_sha256":"1ee7b6c67ccbf3fb"}},{"arxiv_id":"2205.14566","paper":"/paper/proxymix-proxy-based-mixup-training-with","title":"ProxyMix: Proxy-based Mixup Training with Label Refinery for Source-Free Domain Adaptation","date":"2022-05-29","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":"f46ea90b31f5948a","mcp_get_code":{"code_sha256":"f46ea90b31f5948a"}},{"arxiv_id":"2205.06900","paper":"/paper/universal-post-training-backdoor-detection","title":"MM-BD: Post-Training Detection of Backdoor Attacks with Arbitrary Backdoor Pattern Types Using a Maximum Margin Statistic","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghangpsu/mm-bd","path":"univ_bd.py","file_url":"https://github.com/wanghangpsu/mm-bd/blob/HEAD/univ_bd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a97f204f592690b1","mcp_get_code":{"code_sha256":"a97f204f592690b1"}},{"arxiv_id":"2205.04183","paper":"/paper/local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/aad_sfda","path":"tar_adaptation.py","file_url":"https://github.com/albert0147/aad_sfda/blob/HEAD/tar_adaptation.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2202.00796","paper":"/paper/on-the-benefits-of-selectivity-in-pseudo","title":"On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptation","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/MSFDA","path":"train_source.py","file_url":"https://github.com/maohaos2/MSFDA/blob/HEAD/train_source.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2107.12585","paper":"/paper/nearest-neighborhood-based-deep-clustering","title":"Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tntek/N2DCX","path":"object/N2DCEX_target.py","file_url":"https://github.com/tntek/N2DCX/blob/HEAD/object/N2DCEX_target.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2106.11872","paper":"/paper/randomness-in-neural-network-training","title":"Randomness In Neural Network Training: Characterizing The Impact of Tooling","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usyd-fsalab/NeuralNetworkRandomness","path":"src/training_script/resnet_celeba.py","file_url":"https://github.com/usyd-fsalab/NeuralNetworkRandomness/blob/HEAD/src/training_script/resnet_celeba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"384218efc7e9fdd8","mcp_get_code":{"code_sha256":"384218efc7e9fdd8"}},{"arxiv_id":"2104.01539","paper":"/paper/distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/Dis-tune","path":"DINE_dist.py","file_url":"https://github.com/tim-learn/Dis-tune/blob/HEAD/DINE_dist.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2104.01539","paper":"/paper/distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/dine","path":"DINE_ft.py","file_url":"https://github.com/tim-learn/dine/blob/HEAD/DINE_ft.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":"8bd136d4257e40ea","mcp_get_code":{"code_sha256":"8bd136d4257e40ea"}},{"arxiv_id":"2012.07297","paper":"/paper/source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2007.04171","paper":"/paper/combating-domain-shift-with-self-taught","title":"Domain Adaptation with Auxiliary Target Domain-Oriented Classifier","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/atdoc","path":"demo_uda.py","file_url":"https://github.com/tim-learn/atdoc/blob/HEAD/demo_uda.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":"f46ea90b31f5948a","mcp_get_code":{"code_sha256":"f46ea90b31f5948a"}},{"arxiv_id":"2005.02183","paper":"/paper/comparing-snns-and-rnns-on-neuromorphic","title":"Comparing SNNs and RNNs on Neuromorphic Vision Datasets: Similarities and Differences","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hewh16/SNNs-RNNs","path":"N-MNIST/nmnist_snn.py","file_url":"https://github.com/hewh16/SNNs-RNNs/blob/HEAD/N-MNIST/nmnist_snn.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":"ccc54468ebc4ee84","mcp_get_code":{"code_sha256":"ccc54468ebc4ee84"}},{"arxiv_id":"2002.08546","paper":"/paper/do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}},{"arxiv_id":"2002.08253","paper":"/paper/distance-based-regularisation-of-deep","title":"Distance-Based Regularisation of Deep Networks for Fine-Tuning","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henrygouk/mars-finetuning","path":"finetune.py","file_url":"https://github.com/henrygouk/mars-finetuning/blob/HEAD/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aab819df6ce20af6","mcp_get_code":{"code_sha256":"aab819df6ce20af6"}},{"arxiv_id":"1902.08153","paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhutmost/lsq-net","path":"util/lr_scheduler.py","file_url":"https://github.com/zhutmost/lsq-net/blob/HEAD/util/lr_scheduler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39de768061885cd0","mcp_get_code":{"code_sha256":"39de768061885cd0"}},{"arxiv_id":"1901.08164","paper":"/paper/decoupled-greedy-learning-of-cnns","title":"Decoupled Greedy Learning of CNNs","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenium/DGL","path":"dni_comparisons/cifar_cnn_dni.py","file_url":"https://github.com/eugenium/DGL/blob/HEAD/dni_comparisons/cifar_cnn_dni.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f81566b35c748e30","mcp_get_code":{"code_sha256":"f81566b35c748e30"}},{"arxiv_id":"1804.07573","paper":"/paper/mobilefacenets-efficient-cnns-for-accurate","title":"MobileFaceNets: Efficient CNNs for Accurate Real-Time Face Verification on Mobile Devices","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"godofpdog/MobileFaceNet_keras","path":"src/build_model.py","file_url":"https://github.com/godofpdog/MobileFaceNet_keras/blob/HEAD/src/build_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"64d058db63223637","mcp_get_code":{"code_sha256":"64d058db63223637"}},{"arxiv_id":"1702.00783","paper":"/paper/pixel-recursive-super-resolution","title":"Pixel Recursive Super Resolution","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhran/Pixel-Recursive-Super-resolution","path":"model.py","file_url":"https://github.com/abhran/Pixel-Recursive-Super-resolution/blob/HEAD/model.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":"9ed1db0f8b2c5a7b","mcp_get_code":{"code_sha256":"9ed1db0f8b2c5a7b"}},{"arxiv_id":"Ozdenizci_Improving_Robustness_Against_Stealthy_Weight_Bit-Flip_Attacks_by_Output_Code_CVPR_2022_paper","paper":null,"title":"arXiv:Ozdenizci_Improving_Robustness_Against_Stealthy_Weight_Bit-Flip_Attacks_by_Output_Code_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IGITUGraz/OutputCodeMatching","path":"utils/schedules.py","file_url":"https://github.com/IGITUGraz/OutputCodeMatching/blob/HEAD/utils/schedules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6bcbaa367995adaf","mcp_get_code":{"code_sha256":"6bcbaa367995adaf"}},{"arxiv_id":"Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","paper":null,"title":"arXiv:Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tim-learn/DINE","path":"DINE_dist.py","file_url":"https://github.com/tim-learn/DINE/blob/HEAD/DINE_dist.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":"0b7ffc9f8b77529c","mcp_get_code":{"code_sha256":"0b7ffc9f8b77529c"}}]}