{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/lr-schedule","entry":"lr_schedule","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":30,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":23,"n_papers_ran_instrument_only":1,"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":25,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":17,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":16,"n_places":33,"n_places_pointer_only":13,"n_places_pointer_only_link_open":3,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":11,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":7},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2605.08636","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08636","title":"EdgeFlowerTune: Evaluating Federated LLM Fine-Tuning Under Realistic Edge System Constraints","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Edge-Intelligence-Lab/EdgeFlowerTune","path":"standalone/pytorch_alignment/gpt2_full_finetune.py","file_url":"https://github.com/Edge-Intelligence-Lab/EdgeFlowerTune/blob/HEAD/standalone/pytorch_alignment/gpt2_full_finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Edge-Intelligence-Lab/EdgeFlowerTune when it was checked","code_sha256":"2b364c7f42df4bd8","code_sha256_prefix":"2b364c7f42df4bd8","mcp_get_code":{"code_sha256":"2b364c7f42df4bd8"}},{"arxiv_id":"2503.11832","arxiv_id_is_arxiv":true,"paper":"/paper/safety-mirage-how-spurious-correlations","title":"Safety Mirage: How Spurious Correlations Undermine VLM Safety Fine-tuning","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alewarne/MachineUnlearning","path":"Unlearner/DNNUnlearner.py","file_url":"https://github.com/alewarne/MachineUnlearning/blob/HEAD/Unlearner/DNNUnlearner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"188b8fe064496487","code_sha256_prefix":"188b8fe064496487","mcp_get_code":{"code_sha256":"188b8fe064496487"}},{"arxiv_id":"2311.04146","arxiv_id_is_arxiv":true,"paper":"/paper/galaxy-spectra-neural-network-gasnet-ii-using","title":"Galaxy Spectra neural Network (GaSNet). II. Using Deep Learning for Spectral Classification and Redshift Predictions","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"fucheng-zhong/gasnet-ii","path":"GaSNet_MC_model.py","file_url":"https://github.com/fucheng-zhong/gasnet-ii/blob/HEAD/GaSNet_MC_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fucheng-zhong/gasnet-ii when it was checked","code_sha256":"92d1041c4ebc1807","code_sha256_prefix":"92d1041c4ebc1807","mcp_get_code":{"code_sha256":"92d1041c4ebc1807"}},{"arxiv_id":"2305.01139","arxiv_id_is_arxiv":true,"paper":"/paper/stratified-adversarial-robustness-with","title":"Stratified Adversarial Robustness with Rejection","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jfc43/stratified-adv-rej","path":"train_at.py","file_url":"https://github.com/jfc43/stratified-adv-rej/blob/HEAD/train_at.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a480fc5a71521b3f","code_sha256_prefix":"a480fc5a71521b3f","mcp_get_code":{"code_sha256":"a480fc5a71521b3f"}},{"arxiv_id":"2211.03420","arxiv_id_is_arxiv":true,"paper":"/paper/moving-frame-net-se-3-equivariant-network-for","title":"Moving Frame Net: SE(3)-Equivariant Network for Volumes","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateussangalli/movingframenetwork","path":"medmnist_train_movfr.py","file_url":"https://github.com/mateussangalli/movingframenetwork/blob/HEAD/medmnist_train_movfr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5189969c5c93d008","code_sha256_prefix":"5189969c5c93d008","mcp_get_code":{"code_sha256":"5189969c5c93d008"}},{"arxiv_id":"2108.11577","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-of-features-and-labels","title":"Machine Unlearning of Features and Labels","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alewarne/machineunlearning","path":"Unlearner/DNNUnlearner.py","file_url":"https://github.com/alewarne/machineunlearning/blob/HEAD/Unlearner/DNNUnlearner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"188b8fe064496487","code_sha256_prefix":"188b8fe064496487","mcp_get_code":{"code_sha256":"188b8fe064496487"}},{"arxiv_id":"2106.11872","arxiv_id_is_arxiv":true,"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/smallcnn.py","file_url":"https://github.com/usyd-fsalab/NeuralNetworkRandomness/blob/HEAD/src/training_script/smallcnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9f3fb2653030c316","code_sha256_prefix":"9f3fb2653030c316","mcp_get_code":{"code_sha256":"9f3fb2653030c316"}},{"arxiv_id":"2011.08271","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-mapping-of-dark-matter-by","title":"Probabilistic Mapping of Dark Matter by Neural Score Matching","date":null,"month_inferred_from_arxiv_id":"2020-11","title_source":"archive","repo":"cosmostat/jax-lensing","path":"scripts/train_deepmass.py","file_url":"https://github.com/cosmostat/jax-lensing/blob/HEAD/scripts/train_deepmass.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8c8d53d3d1619e9f","code_sha256_prefix":"8c8d53d3d1619e9f","mcp_get_code":{"code_sha256":"8c8d53d3d1619e9f"}},{"arxiv_id":"2006.06643","arxiv_id_is_arxiv":true,"paper":"/paper/smoothed-geometry-for-robust-attribution","title":"Smoothed Geometry for Robust Attribution","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zifanw/smoothed_geometry","path":"models/keras_model.py","file_url":"https://github.com/zifanw/smoothed_geometry/blob/HEAD/models/keras_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Jeongyun-Lee-0423/Classification, and GitHub detected no licence in that repository when it was checked","code_sha256":"67e18e3fdd805d03","code_sha256_prefix":"67e18e3fdd805d03","mcp_get_code":{"code_sha256":"67e18e3fdd805d03"}},{"arxiv_id":"2004.01176","arxiv_id_is_arxiv":true,"paper":"/paper/learning-unsupervised-hierarchical-part","title":"Learning Unsupervised Hierarchical Part Decomposition of 3D Objects from a Single RGB Image","date":"2020-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paschalidoud/hierarchical_primitives","path":"scripts/train_network.py","file_url":"https://github.com/paschalidoud/hierarchical_primitives/blob/HEAD/scripts/train_network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2137962bf83873a0","code_sha256_prefix":"2137962bf83873a0","mcp_get_code":{"code_sha256":"2137962bf83873a0"}},{"arxiv_id":"1911.07532","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-ordinary-differential-equations","title":"Graph Neural Ordinary Differential Equations","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caidao22/pnode","path":"examples-pnode/models/sqnxt_PETSc.py","file_url":"https://github.com/caidao22/pnode/blob/HEAD/examples-pnode/models/sqnxt_PETSc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2003406c1040031b","code_sha256_prefix":"2003406c1040031b","mcp_get_code":{"code_sha256":"2003406c1040031b"}},{"arxiv_id":"1910.08168","arxiv_id_is_arxiv":true,"paper":"/paper/deep-sub-ensembles-for-fast-uncertainty","title":"Deep Sub-Ensembles for Fast Uncertainty Estimation in Image Classification","date":"2019-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvaldenegro/paper-subensembles-image-classification","path":"ResNet.py","file_url":"https://github.com/mvaldenegro/paper-subensembles-image-classification/blob/HEAD/ResNet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf394bbbc12e9f8a","code_sha256_prefix":"bf394bbbc12e9f8a","mcp_get_code":{"code_sha256":"bf394bbbc12e9f8a"}},{"arxiv_id":"1909.08174","arxiv_id_is_arxiv":true,"paper":"/paper/gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/neural-distiller","path":"src/models/generate_resnet.py","file_url":"https://github.com/softsys4ai/neural-distiller/blob/HEAD/src/models/generate_resnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Jeongyun-Lee-0423/Classification, and GitHub detected no licence in that repository when it was checked","code_sha256":"67e18e3fdd805d03","code_sha256_prefix":"67e18e3fdd805d03","mcp_get_code":{"code_sha256":"67e18e3fdd805d03"}},{"arxiv_id":"1908.06477","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-learning-rate-polices-for-high","title":"Demystifying Learning Rate Policies for High Accuracy Training of Deep Neural Networks","date":"2019-08-18","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":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"67e18e3fdd805d03","code_sha256_prefix":"67e18e3fdd805d03","mcp_get_code":{"code_sha256":"67e18e3fdd805d03"}},{"arxiv_id":"1907.04840","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-networks-from-scratch-faster-training","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/rigl","path":"rigl/imagenet_resnet/imagenet_train_eval.py","file_url":"https://github.com/google-research/rigl/blob/HEAD/rigl/imagenet_resnet/imagenet_train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a760cb9df1b030d1","code_sha256_prefix":"a760cb9df1b030d1","mcp_get_code":{"code_sha256":"a760cb9df1b030d1"}},{"arxiv_id":"1906.12183","arxiv_id_is_arxiv":true,"paper":"/paper/neural-odes-as-the-deep-limit-of-resnets-with","title":"Neural ODEs as the Deep Limit of ResNets with constant weights","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BennyAvelin/DeepLimitNeuralODE","path":"Annulus_crossval.py","file_url":"https://github.com/BennyAvelin/DeepLimitNeuralODE/blob/HEAD/Annulus_crossval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, BennyAvelin/DeepLimitNeuralODE, is not in the permissive set Syntology serves inline","code_sha256":"fbb44bf5d58a7062","code_sha256_prefix":"fbb44bf5d58a7062","mcp_get_code":{"code_sha256":"fbb44bf5d58a7062"}},{"arxiv_id":"1906.12183","arxiv_id_is_arxiv":true,"paper":"/paper/neural-odes-as-the-deep-limit-of-resnets-with","title":"Neural ODEs as the Deep Limit of ResNets with constant weights","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BennyAvelin/DeepLimitNeuralODE","path":"Cifar10_crossval.py","file_url":"https://github.com/BennyAvelin/DeepLimitNeuralODE/blob/HEAD/Cifar10_crossval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, BennyAvelin/DeepLimitNeuralODE, is not in the permissive set Syntology serves inline","code_sha256":"e8e37a5dfe0ab695","code_sha256_prefix":"e8e37a5dfe0ab695","mcp_get_code":{"code_sha256":"e8e37a5dfe0ab695"}},{"arxiv_id":"1905.05040","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-utilizing-deep-neural","title":"Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels","date":"2019-05-13","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":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"fde7eb75fcfa9d2b","code_sha256_prefix":"fde7eb75fcfa9d2b","mcp_get_code":{"code_sha256":"fde7eb75fcfa9d2b"}},{"arxiv_id":"1902.10298","arxiv_id_is_arxiv":true,"paper":"/paper/anode-unconditionally-accurate-memory","title":"ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEs","date":"2019-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirgholami/anode","path":"models/resnet.py","file_url":"https://github.com/amirgholami/anode/blob/HEAD/models/resnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2003406c1040031b","code_sha256_prefix":"2003406c1040031b","mcp_get_code":{"code_sha256":"2003406c1040031b"}},{"arxiv_id":"1902.09658","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-lesion-bounding-ellipses-with","title":"Detecting Lesion Bounding Ellipses With Gaussian Proposal Networks","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baidu-research/GPN","path":"model/utils.py","file_url":"https://github.com/baidu-research/GPN/blob/HEAD/model/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97030ff0abd7504d","code_sha256_prefix":"97030ff0abd7504d","mcp_get_code":{"code_sha256":"97030ff0abd7504d"}},{"arxiv_id":"1901.08846","arxiv_id_is_arxiv":true,"paper":"/paper/improving-adversarial-robustness-via","title":"Improving Adversarial Robustness via Promoting Ensemble Diversity","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Adaptive-Diversity-Promoting","path":"train_mnist.py","file_url":"https://github.com/P2333/Adaptive-Diversity-Promoting/blob/HEAD/train_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7006699b75166f2","code_sha256_prefix":"f7006699b75166f2","mcp_get_code":{"code_sha256":"f7006699b75166f2"}},{"arxiv_id":"1901.08846","arxiv_id_is_arxiv":true,"paper":"/paper/improving-adversarial-robustness-via","title":"Improving Adversarial Robustness via Promoting Ensemble Diversity","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Adaptive-Diversity-Promoting","path":"advtrain_cifar10.py","file_url":"https://github.com/P2333/Adaptive-Diversity-Promoting/blob/HEAD/advtrain_cifar10.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b81eea765d67184","code_sha256_prefix":"3b81eea765d67184","mcp_get_code":{"code_sha256":"3b81eea765d67184"}},{"arxiv_id":"1810.05546","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-in-neural-networks-bayesian","title":"Uncertainty in Neural Networks: Approximately Bayesian Ensembling","date":"2018-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TeaPearce/Bayesian_NN_Ensembles","path":"classification/2d_class_need_03.py","file_url":"https://github.com/TeaPearce/Bayesian_NN_Ensembles/blob/HEAD/classification/2d_class_need_03.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"626f3d6baf7dc55b","code_sha256_prefix":"626f3d6baf7dc55b","mcp_get_code":{"code_sha256":"626f3d6baf7dc55b"}},{"arxiv_id":"1807.06521","arxiv_id_is_arxiv":true,"paper":"/paper/cbam-convolutional-block-attention-module","title":"CBAM: Convolutional Block Attention Module","date":"2018-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kobiso/CBAM-keras","path":"utils.py","file_url":"https://github.com/kobiso/CBAM-keras/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Jeongyun-Lee-0423/Classification, and GitHub detected no licence in that repository when it was checked","code_sha256":"67e18e3fdd805d03","code_sha256_prefix":"67e18e3fdd805d03","mcp_get_code":{"code_sha256":"67e18e3fdd805d03"}},{"arxiv_id":"1804.03599","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-disentangling-in-vae","title":"Understanding disentangling in $β$-VAE","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityabingi/Beta-VAE","path":"vae.py","file_url":"https://github.com/adityabingi/Beta-VAE/blob/HEAD/vae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dbc820f27054078","code_sha256_prefix":"2dbc820f27054078","mcp_get_code":{"code_sha256":"2dbc820f27054078"}},{"arxiv_id":"1803.09010","arxiv_id_is_arxiv":true,"paper":"/paper/datasheets-for-datasets","title":"Datasheets for Datasets","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OlafenwaMoses/IdenProf","path":"idenprof.py","file_url":"https://github.com/OlafenwaMoses/IdenProf/blob/HEAD/idenprof.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a58fe9d476887c88","code_sha256_prefix":"a58fe9d476887c88","mcp_get_code":{"code_sha256":"a58fe9d476887c88"}},{"arxiv_id":"1711.10282","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-between-class-examples-for-deep","title":"Learning from Between-class Examples for Deep Sound Recognition","date":"2017-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaoranREN/EnvNet_v1_v2_TensorFlow_Keras","path":"EnvNet_v2.py","file_url":"https://github.com/HaoranREN/EnvNet_v1_v2_TensorFlow_Keras/blob/HEAD/EnvNet_v2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HaoranREN/EnvNet_v1_v2_TensorFlow_Keras when it was checked","code_sha256":"27341ddedfdb004b","code_sha256_prefix":"27341ddedfdb004b","mcp_get_code":{"code_sha256":"27341ddedfdb004b"}},{"arxiv_id":"1606.05908","arxiv_id_is_arxiv":true,"paper":"/paper/tutorial-on-variational-autoencoders","title":"Tutorial on Variational Autoencoders","date":"2016-06-19","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":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"2dbc820f27054078","code_sha256_prefix":"2dbc820f27054078","mcp_get_code":{"code_sha256":"2dbc820f27054078"}},{"arxiv_id":"1606.04080","arxiv_id_is_arxiv":true,"paper":"/paper/matching-networks-for-one-shot-learning","title":"Matching Networks for One Shot Learning","date":"2016-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KamalM8/Few-Shot-learning-Fashion","path":"experiments/proto_nets.py","file_url":"https://github.com/KamalM8/Few-Shot-learning-Fashion/blob/HEAD/experiments/proto_nets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7b885cfa7d6a165","code_sha256_prefix":"c7b885cfa7d6a165","mcp_get_code":{"code_sha256":"c7b885cfa7d6a165"}},{"arxiv_id":"1603.05027","arxiv_id_is_arxiv":true,"paper":"/paper/identity-mappings-in-deep-residual-networks","title":"Identity Mappings in Deep Residual Networks","date":"2016-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jeongyun-Lee-0423/Classification","path":"cifar10_resnet.py","file_url":"https://github.com/Jeongyun-Lee-0423/Classification/blob/HEAD/cifar10_resnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jeongyun-Lee-0423/Classification when it was checked","code_sha256":"67e18e3fdd805d03","code_sha256_prefix":"67e18e3fdd805d03","mcp_get_code":{"code_sha256":"67e18e3fdd805d03"}},{"arxiv_id":"1511.06807","arxiv_id_is_arxiv":true,"paper":"/paper/adding-gradient-noise-improves-learning-for","title":"Adding Gradient Noise Improves Learning for Very Deep Networks","date":"2015-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunk/qneurons","path":"runqact.py","file_url":"https://github.com/sunk/qneurons/blob/HEAD/runqact.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sunk/qneurons when it was checked","code_sha256":"fde7eb75fcfa9d2b","code_sha256_prefix":"fde7eb75fcfa9d2b","mcp_get_code":{"code_sha256":"fde7eb75fcfa9d2b"}},{"arxiv_id":"1511.00561","arxiv_id_is_arxiv":true,"paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"control_functions.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/control_functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2d560d2c8feddab","code_sha256_prefix":"d2d560d2c8feddab","mcp_get_code":{"code_sha256":"d2d560d2c8feddab"}},{"arxiv_id":"1511.00561","arxiv_id_is_arxiv":true,"paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"train_models.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/train_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be1229f36bea96c7","code_sha256_prefix":"be1229f36bea96c7","mcp_get_code":{"code_sha256":"be1229f36bea96c7"}}],"record_sha256":"e084a7f1a96b4db4094dea2b7fec1fb3baa609db17a6a64531f70ec1cca5e2e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}