{"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/load-mnist","entry":"load_mnist","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":35,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":4,"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":35,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":3,"n_samples_unverified":21,"n_samples_fingerprinted":0,"n_places":36,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":10,"unverified":21},"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":"2608.17190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17190","title":"How smoothing the affinity matrix affects neighborhood preservation in t-SNE","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"aida-ugent/smooth_affinity_tsne","path":"experiments/compare_affinity_variants.py","file_url":"https://github.com/aida-ugent/smooth_affinity_tsne/blob/HEAD/experiments/compare_affinity_variants.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e267fe6d285a5ca0","code_sha256_prefix":"e267fe6d285a5ca0","mcp_get_code":{"code_sha256":"e267fe6d285a5ca0"}},{"arxiv_id":"2607.21622","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-21622","title":"Local Synaptic Rules Can Implement a SIGReg Gradient Without Backpropagation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"mdda/biological-sigreg","path":"experiments/mnist_multilayer.py","file_url":"https://github.com/mdda/biological-sigreg/blob/HEAD/experiments/mnist_multilayer.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":"b41d0bf43e00d078","code_sha256_prefix":"b41d0bf43e00d078","mcp_get_code":{"code_sha256":"b41d0bf43e00d078"}},{"arxiv_id":"2606.04451","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-04451","title":"On Out-of-sample Embedding in UMAP","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"tariqul-islam/OOS_UMAP","path":"MNIST/mnist_reader.py","file_url":"https://github.com/tariqul-islam/OOS_UMAP/blob/HEAD/MNIST/mnist_reader.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":"fcde486b88e624a8","code_sha256_prefix":"fcde486b88e624a8","mcp_get_code":{"code_sha256":"fcde486b88e624a8"}},{"arxiv_id":"2503.00856","arxiv_id_is_arxiv":true,"paper":"/paper/asymptotic-analysis-of-two-layer-neural","title":"Asymptotic Analysis of Two-Layer Neural Networks after One Gradient Step under Gaussian Mixtures Data with Structure","date":"2025-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-MLIP/2-Layer-NNs-with-Gaussian-Mixtures-Data","path":"utils.py","file_url":"https://github.com/KU-MLIP/2-Layer-NNs-with-Gaussian-Mixtures-Data/blob/HEAD/utils.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":"3ceb0ad81b0b7777","code_sha256_prefix":"3ceb0ad81b0b7777","mcp_get_code":{"code_sha256":"3ceb0ad81b0b7777"}},{"arxiv_id":"2412.11480","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-precipitation-nowcasting-using","title":"Data-driven Precipitation Nowcasting Using Satellite Imagery","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seominseok0429/data-driven-precipitation-nowcasting-using-satellite-imagery","path":"API/dataloader_moving_mnist.py","file_url":"https://github.com/seominseok0429/data-driven-precipitation-nowcasting-using-satellite-imagery/blob/HEAD/API/dataloader_moving_mnist.py","status":"unverified","verification_level":0,"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, seominseok0429/data-driven-precipitation-nowcasting-using-satellite-imagery when it was checked","code_sha256":"68f48f4d3c47966d","code_sha256_prefix":"68f48f4d3c47966d","mcp_get_code":{"code_sha256":"68f48f4d3c47966d"}},{"arxiv_id":"2410.23660","arxiv_id_is_arxiv":true,"paper":"/paper/local-superior-soups-a-catalyst-for-model","title":"Local Superior Soups: A Catalyst for Model Merging in Cross-Silo Federated Learning","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-tea/Local-Superior-Soups","path":"dataset/generate_Digit5.py","file_url":"https://github.com/ubc-tea/Local-Superior-Soups/blob/HEAD/dataset/generate_Digit5.py","status":"unverified","verification_level":0,"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, ubc-tea/Local-Superior-Soups when it was checked","code_sha256":"4a4d555c3688f0f6","code_sha256_prefix":"4a4d555c3688f0f6","mcp_get_code":{"code_sha256":"4a4d555c3688f0f6"}},{"arxiv_id":"2406.09353","arxiv_id_is_arxiv":true,"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/digit5.py","file_url":"https://github.com/VietHoang1512/PGA/blob/HEAD/LA/digit5.py","status":"unverified","verification_level":0,"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, VietHoang1512/PGA when it was checked","code_sha256":"342c0c85275110c4","code_sha256_prefix":"342c0c85275110c4","mcp_get_code":{"code_sha256":"342c0c85275110c4"}},{"arxiv_id":"2310.02557","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-in-diffusion-models-arises","title":"Generalization in diffusion models arises from geometry-adaptive harmonic representations","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LabForComputationalVision/memorization_generalization_in_diffusion_models","path":"code/dataloader_func.py","file_url":"https://github.com/LabForComputationalVision/memorization_generalization_in_diffusion_models/blob/HEAD/code/dataloader_func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ad8ccbe18be47c9","code_sha256_prefix":"6ad8ccbe18be47c9","mcp_get_code":{"code_sha256":"6ad8ccbe18be47c9"}},{"arxiv_id":"2310.02423","arxiv_id_is_arxiv":true,"paper":"/paper/delta-ai-local-objectives-for-amortized","title":"Delta-AI: Local objectives for amortized inference in sparse graphical models","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GFNOrg/Delta-AI","path":"mnist/data.py","file_url":"https://github.com/GFNOrg/Delta-AI/blob/HEAD/mnist/data.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":"1005ab6934ffad36","code_sha256_prefix":"1005ab6934ffad36","mcp_get_code":{"code_sha256":"1005ab6934ffad36"}},{"arxiv_id":"2306.00740","arxiv_id_is_arxiv":true,"paper":"/paper/a-uniform-confidence-phenomenon-in-deep","title":"On the Limitations of Temperature Scaling for Distributions with Overlaps","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2014mchidamb/temp-scaling-limitations","path":"utils/data_utils.py","file_url":"https://github.com/2014mchidamb/temp-scaling-limitations/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a69802ad54de18d","code_sha256_prefix":"9a69802ad54de18d","mcp_get_code":{"code_sha256":"9a69802ad54de18d"}},{"arxiv_id":"2305.19535","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-extended-kalman-filtering-for-online","title":"Low-rank extended Kalman filtering for online learning of neural networks from streaming data","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probml/rebayes","path":"rebayes/datasets/datasets.py","file_url":"https://github.com/probml/rebayes/blob/HEAD/rebayes/datasets/datasets.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":"1656f7098078556c","code_sha256_prefix":"1656f7098078556c","mcp_get_code":{"code_sha256":"1656f7098078556c"}},{"arxiv_id":"2302.12431","arxiv_id_is_arxiv":true,"paper":"/paper/flexible-phase-dynamics-for-bio-plausible","title":"Flexible Phase Dynamics for Bio-Plausible Contrastive Learning","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zek3r/icml2023","path":"MNIST_TOOLS_ICML.py","file_url":"https://github.com/zek3r/icml2023/blob/HEAD/MNIST_TOOLS_ICML.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zek3r/icml2023 when it was checked","code_sha256":"6c9d971c4cd0e840","code_sha256_prefix":"6c9d971c4cd0e840","mcp_get_code":{"code_sha256":"6c9d971c4cd0e840"}},{"arxiv_id":"2302.02607","arxiv_id_is_arxiv":true,"paper":"/paper/target-based-surrogates-for-stochastic","title":"Target-based Surrogates for Stochastic Optimization","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wilderlavington/target-based-surrogates-for-stochastic-optimization","path":"loaders/load_data.py","file_url":"https://github.com/wilderlavington/target-based-surrogates-for-stochastic-optimization/blob/HEAD/loaders/load_data.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":"2cb1e15f8d60f5a0","code_sha256_prefix":"2cb1e15f8d60f5a0","mcp_get_code":{"code_sha256":"2cb1e15f8d60f5a0"}},{"arxiv_id":"2209.11222","arxiv_id_is_arxiv":true,"paper":"/paper/concept-activation-regions-a-generalized","title":"Concept Activation Regions: A Generalized Framework For Concept-Based Explanations","date":"2022-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/CARs","path":"src/cars/models/mnist.py","file_url":"https://github.com/vanderschaarlab/CARs/blob/HEAD/src/cars/models/mnist.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":"46ff66ae7e7ac875","code_sha256_prefix":"46ff66ae7e7ac875","mcp_get_code":{"code_sha256":"46ff66ae7e7ac875"}},{"arxiv_id":"2203.12997","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-nearest-neighbor-graph-embedding","title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","date":"2022-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koulakis/h-nne","path":"benchmarking/hnne_benchmarking/data.py","file_url":"https://github.com/koulakis/h-nne/blob/HEAD/benchmarking/hnne_benchmarking/data.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":"36476255697ea82f","code_sha256_prefix":"36476255697ea82f","mcp_get_code":{"code_sha256":"36476255697ea82f"}},{"arxiv_id":"2202.04557","arxiv_id_is_arxiv":true,"paper":"/paper/universal-hopfield-networks-a-general","title":"Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BerenMillidge/Theory_Associative_Memory","path":"data.py","file_url":"https://github.com/BerenMillidge/Theory_Associative_Memory/blob/HEAD/data.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":"166095face05d8e0","code_sha256_prefix":"166095face05d8e0","mcp_get_code":{"code_sha256":"166095face05d8e0"}},{"arxiv_id":"2112.03939","arxiv_id_is_arxiv":true,"paper":"/paper/photometric-redshifts-from-sdss-images-with","title":"Photometric Redshifts from SDSS Images with an Interpretable Deep Capsule Network","date":null,"month_inferred_from_arxiv_id":"2021-12","title_source":"archive","repo":"biprateep/encapZulate-1","path":"src/encapzulate/data_loader/data_loader.py","file_url":"https://github.com/biprateep/encapZulate-1/blob/HEAD/src/encapzulate/data_loader/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea3d5625d0edc156","code_sha256_prefix":"ea3d5625d0edc156","mcp_get_code":{"code_sha256":"ea3d5625d0edc156"}},{"arxiv_id":"2107.04694","arxiv_id_is_arxiv":true,"paper":"/paper/lifelong-mixture-of-variational-autoencoders","title":"Lifelong Mixture of Variational Autoencoders","date":"2021-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtuzi123/LifelongMixtureVAEs","path":"LifelongMixture_32New_Dirchlet.py","file_url":"https://github.com/dtuzi123/LifelongMixtureVAEs/blob/HEAD/LifelongMixture_32New_Dirchlet.py","status":"unverified","verification_level":0,"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, dtuzi123/LifelongMixtureVAEs when it was checked","code_sha256":"99eec1bd389d0c5c","code_sha256_prefix":"99eec1bd389d0c5c","mcp_get_code":{"code_sha256":"99eec1bd389d0c5c"}},{"arxiv_id":"2010.09063","arxiv_id_is_arxiv":true,"paper":"/paper/enabling-fast-differentially-private-sgd-via","title":"Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorization","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheSalon/fast-dpsgd","path":"data.py","file_url":"https://github.com/TheSalon/fast-dpsgd/blob/HEAD/data.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":"923ce6d32026c59f","code_sha256_prefix":"923ce6d32026c59f","mcp_get_code":{"code_sha256":"923ce6d32026c59f"}},{"arxiv_id":"2009.09590","arxiv_id_is_arxiv":true,"paper":"/paper/deep-clustering-and-representation-learning","title":"Generalized Clustering and Multi-Manifold Learning with Geometric Structure Preservation","date":"2020-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/gcml","path":"dataset.py","file_url":"https://github.com/lirongwu/gcml/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b95d14e03470986e","code_sha256_prefix":"b95d14e03470986e","mcp_get_code":{"code_sha256":"b95d14e03470986e"}},{"arxiv_id":"1909.13404","arxiv_id_is_arxiv":true,"paper":"/paper/towards-modular-and-programmable-architecture","title":"Towards modular and programmable architecture search","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"negrinho/deep_architect_legacy","path":"darch/datasets.py","file_url":"https://github.com/negrinho/deep_architect_legacy/blob/HEAD/darch/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a670d1a23a9c9041","code_sha256_prefix":"a670d1a23a9c9041","mcp_get_code":{"code_sha256":"a670d1a23a9c9041"}},{"arxiv_id":"1902.08727","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-visual-domain-adaptation-a-deep","title":"Unsupervised Visual Domain Adaptation: A Deep Max-Margin Gaussian Process Approach","date":"2019-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seqam-lab/GPDA","path":"src/data_manager/mnist.py","file_url":"https://github.com/seqam-lab/GPDA/blob/HEAD/src/data_manager/mnist.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":"c3e19a4b614256b8","code_sha256_prefix":"c3e19a4b614256b8","mcp_get_code":{"code_sha256":"c3e19a4b614256b8"}},{"arxiv_id":"1811.12254","arxiv_id_is_arxiv":true,"paper":"/paper/the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ychnlgy/Chebyshev-Lagrange","path":"shake-shake_pytorch/datasets.py","file_url":"https://github.com/ychnlgy/Chebyshev-Lagrange/blob/HEAD/shake-shake_pytorch/datasets.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":"11439743f8dc1cb3","code_sha256_prefix":"11439743f8dc1cb3","mcp_get_code":{"code_sha256":"11439743f8dc1cb3"}},{"arxiv_id":"1810.12042","arxiv_id_is_arxiv":true,"paper":"/paper/logit-pairing-methods-can-fool-gradient-based","title":"Logit Pairing Methods Can Fool Gradient-Based Attacks","date":"2018-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uds-lsv/evaluating-logit-pairing-methods","path":"mnist_cifar10/utils.py","file_url":"https://github.com/uds-lsv/evaluating-logit-pairing-methods/blob/HEAD/mnist_cifar10/utils.py","status":"ran","verification_level":1,"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":"4131fcb2c408c901","code_sha256_prefix":"4131fcb2c408c901","mcp_get_code":{"code_sha256":"4131fcb2c408c901"}},{"arxiv_id":"1807.00734","arxiv_id_is_arxiv":true,"paper":"/paper/the-relativistic-discriminator-a-key-element","title":"The relativistic discriminator: a key element missing from standard GAN","date":"2018-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taki0112/RelativisticGAN-Tensorflow","path":"utils.py","file_url":"https://github.com/taki0112/RelativisticGAN-Tensorflow/blob/HEAD/utils.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":"a5d19dceb0c8a790","code_sha256_prefix":"a5d19dceb0c8a790","mcp_get_code":{"code_sha256":"a5d19dceb0c8a790"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taki0112/Self-Attention-GAN-Tensorflow","path":"utils.py","file_url":"https://github.com/taki0112/Self-Attention-GAN-Tensorflow/blob/HEAD/utils.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":"7fddf2b174e60ac1","code_sha256_prefix":"7fddf2b174e60ac1","mcp_get_code":{"code_sha256":"7fddf2b174e60ac1"}},{"arxiv_id":"1801.03558","arxiv_id_is_arxiv":true,"paper":"/paper/inference-suboptimality-in-variational","title":"Inference Suboptimality in Variational Autoencoders","date":"2018-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chriscremer/Inference-Suboptimality","path":"gaps_over_training_exp/compute_gaps.py","file_url":"https://github.com/chriscremer/Inference-Suboptimality/blob/HEAD/gaps_over_training_exp/compute_gaps.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chriscremer/Inference-Suboptimality when it was checked","code_sha256":"715241df022a8fa7","code_sha256_prefix":"715241df022a8fa7","mcp_get_code":{"code_sha256":"715241df022a8fa7"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"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":"naturomics/CapsNet-Tensorflow","path":"utils.py","file_url":"https://github.com/naturomics/CapsNet-Tensorflow/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a60140719ee8eeab","code_sha256_prefix":"a60140719ee8eeab","mcp_get_code":{"code_sha256":"a60140719ee8eeab"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"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":"ethanleet/CapsNet","path":"data_loaders.py","file_url":"https://github.com/ethanleet/CapsNet/blob/HEAD/data_loaders.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":"906e695c111ae448","code_sha256_prefix":"906e695c111ae448","mcp_get_code":{"code_sha256":"906e695c111ae448"}},{"arxiv_id":"1708.07747","arxiv_id_is_arxiv":true,"paper":"/paper/fashion-mnist-a-novel-image-dataset-for","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","date":"2017-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zalandoresearch/fashion-mnist","path":"utils/mnist_reader.py","file_url":"https://github.com/zalandoresearch/fashion-mnist/blob/HEAD/utils/mnist_reader.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":"fcde486b88e624a8","code_sha256_prefix":"fcde486b88e624a8","mcp_get_code":{"code_sha256":"fcde486b88e624a8"}},{"arxiv_id":"1701.03551","arxiv_id_is_arxiv":true,"paper":"/paper/cost-effective-active-learning-for-deep-image","title":"Cost-Effective Active Learning for Deep Image Classification","date":"2017-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tueboesen/Active-Learning","path":"src/dataloader.py","file_url":"https://github.com/tueboesen/Active-Learning/blob/HEAD/src/dataloader.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":"3f44d3934b8b9f41","code_sha256_prefix":"3f44d3934b8b9f41","mcp_get_code":{"code_sha256":"3f44d3934b8b9f41"}},{"arxiv_id":"1602.02697","arxiv_id_is_arxiv":true,"paper":"/paper/practical-black-box-attacks-against-machine","title":"Practical Black-Box Attacks against Machine Learning","date":"2016-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jbinas/fortified-networks","path":"datasets/utils_fashion_mnist.py","file_url":"https://github.com/jbinas/fortified-networks/blob/HEAD/datasets/utils_fashion_mnist.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":"7802d4d8bfea87e4","code_sha256_prefix":"7802d4d8bfea87e4","mcp_get_code":{"code_sha256":"7802d4d8bfea87e4"}},{"arxiv_id":"1511.02580","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-can-we-go-without-convolution","title":"How far can we go without convolution: Improving fully-connected networks","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvocadoAlpha/boltz_bo","path":"boltzmann_machines/utils/dataset.py","file_url":"https://github.com/AvocadoAlpha/boltz_bo/blob/HEAD/boltzmann_machines/utils/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f2bf14cc230e210e","code_sha256_prefix":"f2bf14cc230e210e","mcp_get_code":{"code_sha256":"f2bf14cc230e210e"}},{"arxiv_id":"1411.1784","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-generative-adversarial-nets","title":"Conditional Generative Adversarial Nets","date":"2014-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daheyinyin/CGAN","path":"src/dataset.py","file_url":"https://github.com/daheyinyin/CGAN/blob/HEAD/src/dataset.py","status":"ran","verification_level":1,"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":"650292d030baf2d8","code_sha256_prefix":"650292d030baf2d8","mcp_get_code":{"code_sha256":"650292d030baf2d8"}},{"arxiv_id":"1404.3606","arxiv_id_is_arxiv":true,"paper":"/paper/pcanet-a-simple-deep-learning-baseline-for","title":"PCANet: A Simple Deep Learning Baseline for Image Classification?","date":"2014-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucasleesw/PCANet_python_ver","path":"data_loader.py","file_url":"https://github.com/lucasleesw/PCANet_python_ver/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f56553edd2ec3aa","code_sha256_prefix":"3f56553edd2ec3aa","mcp_get_code":{"code_sha256":"3f56553edd2ec3aa"}},{"arxiv_id":"04326","arxiv_id_is_arxiv":false,"paper":null,"title":"id 04326 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DongGeun-Yoon/DGDM","path":"datasets/mmnist.py","file_url":"https://github.com/DongGeun-Yoon/DGDM/blob/HEAD/datasets/mmnist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f08dfc9a469e83b7","code_sha256_prefix":"f08dfc9a469e83b7","mcp_get_code":{"code_sha256":"f08dfc9a469e83b7"}}],"record_sha256":"1f4db6ce9d9b893fbfa7bd9fd182f4f5ec85d13a5ed3f1e7e9afda74f5dea5c8","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}