{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MZV6RJ7NMLEVM2AZBLY3EU6KUX","short_pith_number":"pith:MZV6RJ7N","schema_version":"1.0","canonical_sha256":"666be8a7ed62c95668190af1b253caa5fd2704f34dafc49e9e199971793876ea","source":{"kind":"arxiv","id":"1708.07747","version":2},"attestation_state":"computed","paper":{"title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fashion-MNIST supplies a drop-in replacement for MNIST using 28x28 fashion images.","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Xiao, Kashif Rasul, Roland Vollgraf","submitted_at":"2017-08-25T14:01:29Z","abstract_excerpt":"We present Fashion-MNIST, a new dataset comprising of 28x28 grayscale images of 70,000 fashion products from 10 categories, with 7,000 images per category. The training set has 60,000 images and the test set has 10,000 images. Fashion-MNIST is intended to serve as a direct drop-in replacement for the original MNIST dataset for benchmarking machine learning algorithms, as it shares the same image size, data format and the structure of training and testing splits. The dataset is freely available at https://github.com/zalandoresearch/fashion-mnist"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"1708.07747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-25T14:01:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"b4b833ec4287cb5254729cb556b1f63b9b330becde7456764761e80a6a5ade3e","abstract_canon_sha256":"56146780c28e5f6027123bd67b95f2b95094bcb777bead1bfc63a9c5f68c55ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T22:12:34.839049Z","signature_b64":"3j0TkoaIemfPJErsMgnFRNCUeJrhizp+jIsdDrIlwQ0yaiLceEQKf09bMnwejnrOf1e2y8WiedP2L6Yj4QPRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"666be8a7ed62c95668190af1b253caa5fd2704f34dafc49e9e199971793876ea","last_reissued_at":"2026-07-04T22:12:34.838563Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T22:12:34.838563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fashion-MNIST supplies a drop-in replacement for MNIST using 28x28 fashion images.","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Xiao, Kashif Rasul, Roland Vollgraf","submitted_at":"2017-08-25T14:01:29Z","abstract_excerpt":"We present Fashion-MNIST, a new dataset comprising of 28x28 grayscale images of 70,000 fashion products from 10 categories, with 7,000 images per category. The training set has 60,000 images and the test set has 10,000 images. Fashion-MNIST is intended to serve as a direct drop-in replacement for the original MNIST dataset for benchmarking machine learning algorithms, as it shares the same image size, data format and the structure of training and testing splits. The dataset is freely available at https://github.com/zalandoresearch/fashion-mnist"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Fashion-MNIST is intended to serve as a direct drop-in replacement for the original MNIST dataset for benchmarking machine learning algorithms, as it shares the same image size, data format and the structure of training and testing splits.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the fashion images provide a meaningfully harder yet still accessible benchmark that will be widely adopted by the community in place of MNIST.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Fashion-MNIST is a new benchmark dataset of 70,000 fashion product images that serves as a direct drop-in replacement for the original MNIST dataset while being more challenging.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fashion-MNIST supplies a drop-in replacement for MNIST using 28x28 fashion images.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e44da03d80d276e7f6a570cb70a5e1df419a819cc6b3d7e58f03b9c7bcff1744"},"source":{"id":"1708.07747","kind":"arxiv","version":2},"verdict":{"id":"e207a28b-bde1-413f-ae2c-ca10d5400b78","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T05:17:28.596879Z","strongest_claim":"Fashion-MNIST is intended to serve as a direct drop-in replacement for the original MNIST dataset for benchmarking machine learning algorithms, as it shares the same image size, data format and the structure of training and testing splits.","one_line_summary":"Fashion-MNIST is a new benchmark dataset of 70,000 fashion product images that serves as a direct drop-in replacement for the original MNIST dataset while being more challenging.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the fashion images provide a meaningfully harder yet still accessible benchmark that will be widely adopted by the community in place of MNIST.","pith_extraction_headline":"Fashion-MNIST supplies a drop-in replacement for MNIST using 28x28 fashion images."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1708.07747/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":6,"sample":[{"doi":"","year":2012,"title":"D. Ciregan, U. Meier, and J. Schmidhuber. Multi-column deep neural networks for image classification. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pages 3642--3649. IEEE","work_id":"12e93749-a846-4005-88a0-e8af6f109f6d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"EMNIST: an extension of MNIST to handwritten letters","work_id":"86fc316d-b762-434e-8af4-868553442be7","ref_index":2,"cited_arxiv_id":"1702.05373","is_internal_anchor":false},{"doi":"","year":2009,"title":"J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei. Imagenet: A large-scale hierarchical image database. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, page","work_id":"525f2019-b709-4387-bf5d-0526a9b53fc5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"A. Krizhevsky and G. Hinton. Learning multiple layers of features from tiny images. 2009","work_id":"f5d088d4-552b-490e-86a3-7c8096c74241","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86 0 (11): 0 2278--2324, 1998","work_id":"38515ceb-51e2-4345-ba2b-afabdb9dec71","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"03fc867253d16379f82340402d4357bb10fb851c2ddd5fba85cee641c699639c","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"a699f978a9133d95a17023aa26f0a5c01ea2ae7842b0c646a366589050a141b5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07747","created_at":"2026-07-04T22:12:34.838622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07747v2","created_at":"2026-07-04T22:12:34.838622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07747","created_at":"2026-07-04T22:12:34.838622+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZV6RJ7NMLEV","created_at":"2026-07-04T22:12:34.838622+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZV6RJ7NMLEVM2AZ","created_at":"2026-07-04T22:12:34.838622+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZV6RJ7N","created_at":"2026-07-04T22:12:34.838622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":251,"internal_anchor_count":251,"sample":[{"citing_arxiv_id":"2607.06719","citing_title":"Macroeconomic Message Passing for Anticipating Foreign Exchange Regime Changes: A Deep Logical Learning Approach using Graph Tsetlin Machines","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07754","citing_title":"Image classification via a quantum-inspired strategy involving a mixture of experts","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06887","citing_title":"Converge to Surprise: Evolutionary Self-supervised Image Clustering","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07314","citing_title":"FedCVESA: Taking Away Training Data in Federated Learning via Correlation Value Encoding and Segmented Aggregation","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06058","citing_title":"SQGen: Structured Quantum Image Generation with Latent-Modulated Quantized Tensor Trains","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06281","citing_title":"Straight-Path Flow Matching for Incomplete Multi-View Clustering","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06295","citing_title":"Visual graphs for image classification: does the structure affect performance?","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27294","citing_title":"Generative Models on Analog Hardware with Dynamics","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26273","citing_title":"Equivariance and Augmentation for Bayesian Neural Networks","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27246","citing_title":"Effective Covariance Dynamics in Solvable High-Dimensional GANs","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26902","citing_title":"Learning to Recover Task Experts from a Multi-Task Merged Model","ref_index":95,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27171","citing_title":"Stochastic Gradient Optimization with Model-Assisted Sampling","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2606.23550","citing_title":"Approximating velocity fields with planted attractors via Neural-ODEs for classification purposes","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22589","citing_title":"Training-free Task Classification for Multi-Task Model Merging","ref_index":81,"is_internal_anchor":true},{"citing_arxiv_id":"2606.21096","citing_title":"SLeDGe: Semi-Supervised Learning on Data Streams with Graph Structure Learning","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18923","citing_title":"GrapNet: A Programmable Dynamic-Architecture Neural Graph Substrate","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19164","citing_title":"Essential Subspace Merging for Multi-Task Learning","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18627","citing_title":"PACT: Preserving Anchored Cores in Task-vectors for Model Merging","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17961","citing_title":"Robustness of Similarity-based Positional Encoding Under Rotations: Theoretical Analysis and Experimental Validation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18384","citing_title":"SCOPE-FL: A Strategy-proof Chain-based Optimal pareto efficient Federated Learning System","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2607.01689","citing_title":"Model Merging as Probabilistic Inference in Fine-Tuning Parameter Space","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24903","citing_title":"The Geometry of Saturation: Effective Rank Predicts When Labels Stop Helping in Few-Shot Classification","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11738","citing_title":"Renewable Lasso without Batch-Number Constraints: A Gradient-Enhanced Approach","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12124","citing_title":"A Unified Zeroth-Order Approach for Decentralized Minimax Optimization","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11695","citing_title":"Noise-Aware Framework for Correcting Corrupted Labels","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX","json":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX.json","graph_json":"https://pith.science/api/pith-number/MZV6RJ7NMLEVM2AZBLY3EU6KUX/graph.json","events_json":"https://pith.science/api/pith-number/MZV6RJ7NMLEVM2AZBLY3EU6KUX/events.json","paper":"https://pith.science/paper/MZV6RJ7N"},"agent_actions":{"view_html":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX","download_json":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX.json","view_paper":"https://pith.science/paper/MZV6RJ7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07747&json=true","fetch_graph":"https://pith.science/api/pith-number/MZV6RJ7NMLEVM2AZBLY3EU6KUX/graph.json","fetch_events":"https://pith.science/api/pith-number/MZV6RJ7NMLEVM2AZBLY3EU6KUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX/action/storage_attestation","attest_author":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX/action/author_attestation","sign_citation":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX/action/citation_signature","submit_replication":"https://pith.science/pith/MZV6RJ7NMLEVM2AZBLY3EU6KUX/action/replication_record"}},"created_at":"2026-07-04T22:12:34.838622+00:00","updated_at":"2026-07-04T22:12:34.838622+00:00"}