{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UDQVQFNUWLHQZJTV5CETS26HNX","short_pith_number":"pith:UDQVQFNU","schema_version":"1.0","canonical_sha256":"a0e15815b4b2cf0ca675e889396bc76def38cbe3c321891002c6e691e5802fd3","source":{"kind":"arxiv","id":"1702.05373","version":2},"attestation_state":"computed","paper":{"title":"EMNIST: an extension of MNIST to handwritten letters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andr\\'e van Schaik, Gregory Cohen, Jonathan Tapson, Saeed Afshar","submitted_at":"2017-02-17T15:06:14Z","abstract_excerpt":"The MNIST dataset has become a standard benchmark for learning, classification and computer vision systems. Contributing to its widespread adoption are the understandable and intuitive nature of the task, its relatively small size and storage requirements and the accessibility and ease-of-use of the database itself. The MNIST database was derived from a larger dataset known as the NIST Special Database 19 which contains digits, uppercase and lowercase handwritten letters. This paper introduces a variant of the full NIST dataset, which we have called Extended MNIST (EMNIST), which follows the s"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.05373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T15:06:14Z","cross_cats_sorted":[],"title_canon_sha256":"90d25ac0daaf4ec21fc5732cc4336b71e4899d2b2daf327403b1a8dd23d88c08","abstract_canon_sha256":"f0690edfa1ba283e46f2d32c2fb93a88eddfd8d4df29d75502e2b652e7ed502a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:46.420273Z","signature_b64":"rfaTcslMhZnfAWL+ZDMkBinfKhO9h1NdsnnDTjMnmlewiFd8ft5H0WK0dkJ2//LWrvhlV9+hxcFcmf34HGk3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e15815b4b2cf0ca675e889396bc76def38cbe3c321891002c6e691e5802fd3","last_reissued_at":"2026-05-18T00:49:46.419682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:46.419682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EMNIST: an extension of MNIST to handwritten letters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andr\\'e van Schaik, Gregory Cohen, Jonathan Tapson, Saeed Afshar","submitted_at":"2017-02-17T15:06:14Z","abstract_excerpt":"The MNIST dataset has become a standard benchmark for learning, classification and computer vision systems. Contributing to its widespread adoption are the understandable and intuitive nature of the task, its relatively small size and storage requirements and the accessibility and ease-of-use of the database itself. The MNIST database was derived from a larger dataset known as the NIST Special Database 19 which contains digits, uppercase and lowercase handwritten letters. This paper introduces a variant of the full NIST dataset, which we have called Extended MNIST (EMNIST), which follows the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05373","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"1702.05373","created_at":"2026-05-18T00:49:46.419788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05373v2","created_at":"2026-05-18T00:49:46.419788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05373","created_at":"2026-05-18T00:49:46.419788+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDQVQFNUWLHQ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDQVQFNUWLHQZJTV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDQVQFNU","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"1910.09876","citing_title":"Neural Network Training with Approximate Logarithmic Computations","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03472","citing_title":"DPQuant: Efficient and Differentially-Private Model Training via Dynamic Quantization Scheduling","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2509.17398","citing_title":"Optimizing Split Federated Learning with Unstable Client Participation","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"1909.06335","citing_title":"Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10560","citing_title":"Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"1708.07747","citing_title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14336","citing_title":"Mistake gating leads to energy and memory efficient continual learning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX","json":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX.json","graph_json":"https://pith.science/api/pith-number/UDQVQFNUWLHQZJTV5CETS26HNX/graph.json","events_json":"https://pith.science/api/pith-number/UDQVQFNUWLHQZJTV5CETS26HNX/events.json","paper":"https://pith.science/paper/UDQVQFNU"},"agent_actions":{"view_html":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX","download_json":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX.json","view_paper":"https://pith.science/paper/UDQVQFNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05373&json=true","fetch_graph":"https://pith.science/api/pith-number/UDQVQFNUWLHQZJTV5CETS26HNX/graph.json","fetch_events":"https://pith.science/api/pith-number/UDQVQFNUWLHQZJTV5CETS26HNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX/action/storage_attestation","attest_author":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX/action/author_attestation","sign_citation":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX/action/citation_signature","submit_replication":"https://pith.science/pith/UDQVQFNUWLHQZJTV5CETS26HNX/action/replication_record"}},"created_at":"2026-05-18T00:49:46.419788+00:00","updated_at":"2026-05-18T00:49:46.419788+00:00"}