{"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-cifar10","entry":"load_cifar10","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":20,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"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":18,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":15,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":15},"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":"2606.21488","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-21488","title":"Robustness Cannot be Reduced to Regularization: Studying Adversarial Training Beyond the Linear Case","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"RobustBench/robustbench","path":"robustbench/data.py","file_url":"https://github.com/RobustBench/robustbench/blob/HEAD/robustbench/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, RobustBench/robustbench (NOASSERTION)","code_sha256":"5ea0ef1ed4fe208c","code_sha256_prefix":"5ea0ef1ed4fe208c","mcp_get_code":{"code_sha256":"5ea0ef1ed4fe208c"}},{"arxiv_id":"2604.11011","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11011","title":"K-Way Energy Probes for Metacognition Reduce to Softmax in Discriminative Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"synthiumjp/ima","path":"src/cifar10_data.py","file_url":"https://github.com/synthiumjp/ima/blob/HEAD/src/cifar10_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, synthiumjp/ima when it was checked","code_sha256":"94203b1eb6857141","code_sha256_prefix":"94203b1eb6857141","mcp_get_code":{"code_sha256":"94203b1eb6857141"}},{"arxiv_id":"2407.06315","arxiv_id_is_arxiv":true,"paper":"/paper/shedding-more-light-on-robust-classifiers","title":"Shedding More Light on Robust Classifiers under the lens of Energy-based Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omnai-lab/robust-classifiers-under-the-lens-of-ebm","path":"image_generation/utils.py","file_url":"https://github.com/omnai-lab/robust-classifiers-under-the-lens-of-ebm/blob/HEAD/image_generation/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":"f4b0898be0b428b7","code_sha256_prefix":"f4b0898be0b428b7","mcp_get_code":{"code_sha256":"f4b0898be0b428b7"}},{"arxiv_id":"2406.10737","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-domains-dynamic-solutions-dpcore-for","title":"Dynamic Domains, Dynamic Solutions: DPCore for Continual Test-Time Adaptation","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/DPCore","path":"imagenet/robustbench/data.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/robustbench/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":"2ef65c34f0fa8042","code_sha256_prefix":"2ef65c34f0fa8042","mcp_get_code":{"code_sha256":"2ef65c34f0fa8042"}},{"arxiv_id":"2406.05927","arxiv_id_is_arxiv":true,"paper":"/paper/meansparse-post-training-robustness","title":"MeanSparse: Post-Training Robustness Enhancement Through Mean-Centered Feature Sparsification","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spin-umass/meansparse","path":"CIFAR100_Linfinity/data.py","file_url":"https://github.com/spin-umass/meansparse/blob/HEAD/CIFAR100_Linfinity/data.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, spin-umass/meansparse when it was checked","code_sha256":"2ea97919e65e55d9","code_sha256_prefix":"2ea97919e65e55d9","mcp_get_code":{"code_sha256":"2ea97919e65e55d9"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"robustbench/data.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/robustbench/data.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, royzry98/moase-pytorch when it was checked","code_sha256":"2ef65c34f0fa8042","code_sha256_prefix":"2ef65c34f0fa8042","mcp_get_code":{"code_sha256":"2ef65c34f0fa8042"}},{"arxiv_id":"2311.13613","arxiv_id_is_arxiv":true,"paper":"/paper/spanning-training-progress-temporal-dual","title":"Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxin-xd/Dataset-Pruning-TDDS","path":"data.py","file_url":"https://github.com/zhangxin-xd/Dataset-Pruning-TDDS/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":"daa31faafe9d2c13","code_sha256_prefix":"daa31faafe9d2c13","mcp_get_code":{"code_sha256":"daa31faafe9d2c13"}},{"arxiv_id":"2307.03133","arxiv_id_is_arxiv":true,"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":"robustbench/data.py","file_url":"https://github.com/yuyongcan/benchmark-tta/blob/HEAD/robustbench/data.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, yuyongcan/benchmark-tta when it was checked","code_sha256":"2ef65c34f0fa8042","code_sha256_prefix":"2ef65c34f0fa8042","mcp_get_code":{"code_sha256":"2ef65c34f0fa8042"}},{"arxiv_id":"2307.02337","arxiv_id_is_arxiv":true,"paper":"/paper/fam-relative-flatness-aware-minimization","title":"FAM: Relative Flatness Aware Minimization","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kampmichael/RelativeFlatnessAndGeneralization","path":"CorrelationFlatnessGeneralization/data_loaders.py","file_url":"https://github.com/kampmichael/RelativeFlatnessAndGeneralization/blob/HEAD/CorrelationFlatnessGeneralization/data_loaders.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":"535c69c58c3d899b","code_sha256_prefix":"535c69c58c3d899b","mcp_get_code":{"code_sha256":"535c69c58c3d899b"}},{"arxiv_id":"2201.01212","arxiv_id_is_arxiv":true,"paper":"/paper/autobalance-optimized-loss-functions-for-1","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucr-optml/autobalance","path":"dataset/cifar10.py","file_url":"https://github.com/ucr-optml/autobalance/blob/HEAD/dataset/cifar10.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":"8bf3be98e6cb32cb","code_sha256_prefix":"8bf3be98e6cb32cb","mcp_get_code":{"code_sha256":"8bf3be98e6cb32cb"}},{"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":"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":"d918fcad643bf10e","code_sha256_prefix":"d918fcad643bf10e","mcp_get_code":{"code_sha256":"d918fcad643bf10e"}},{"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":"b61d063e75caff81","code_sha256_prefix":"b61d063e75caff81","mcp_get_code":{"code_sha256":"b61d063e75caff81"}},{"arxiv_id":"2004.09805","arxiv_id_is_arxiv":true,"paper":"/paper/amc-loss-angular-margin-contrastive-loss-for","title":"AMC-Loss: Angular Margin Contrastive Loss for Improved Explainability in Image Classification","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hchoi71/AMC-Loss","path":"dataset.py","file_url":"https://github.com/hchoi71/AMC-Loss/blob/HEAD/dataset.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":"5a30aefe53a9d152","code_sha256_prefix":"5a30aefe53a9d152","mcp_get_code":{"code_sha256":"5a30aefe53a9d152"}},{"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":"80ab7f0d5badcb2c","code_sha256_prefix":"80ab7f0d5badcb2c","mcp_get_code":{"code_sha256":"80ab7f0d5badcb2c"}},{"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":"66e93b6f5e7a8457","code_sha256_prefix":"66e93b6f5e7a8457","mcp_get_code":{"code_sha256":"66e93b6f5e7a8457"}},{"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":"51fd45e7747d0b80","code_sha256_prefix":"51fd45e7747d0b80","mcp_get_code":{"code_sha256":"51fd45e7747d0b80"}},{"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":"69536dd4fda5a080","code_sha256_prefix":"69536dd4fda5a080","mcp_get_code":{"code_sha256":"69536dd4fda5a080"}},{"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":"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":"8458ac32d9281d6c","code_sha256_prefix":"8458ac32d9281d6c","mcp_get_code":{"code_sha256":"8458ac32d9281d6c"}},{"arxiv_id":"1412.6572","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-and-harnessing-adversarial","title":"Explaining and Harnessing Adversarial Examples","date":"2014-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BendeguzToth/Fun-with-ConvNets","path":"project/utils.py","file_url":"https://github.com/BendeguzToth/Fun-with-ConvNets/blob/HEAD/project/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4bbe5492f940117b","code_sha256_prefix":"4bbe5492f940117b","mcp_get_code":{"code_sha256":"4bbe5492f940117b"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vivswan/ECE-3195-Course-Project","path":"src/load_cifar10.py","file_url":"https://github.com/Vivswan/ECE-3195-Course-Project/blob/HEAD/src/load_cifar10.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":"79aea1123cdd414d","code_sha256_prefix":"79aea1123cdd414d","mcp_get_code":{"code_sha256":"79aea1123cdd414d"}}],"record_sha256":"e1165f2ecbe98d66666eff84acdf2fc215a2a4c90ff7338a2bfa71b4bdb44e85","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}