{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KPOPMKYNTJO73UVZIB662NZ6SZ","short_pith_number":"pith:KPOPMKYN","schema_version":"1.0","canonical_sha256":"53dcf62b0d9a5dfdd2b9407ded373e9649c8296f16eb7980c97a8ec6907c5dce","source":{"kind":"arxiv","id":"1906.02337","version":1},"attestation_state":"computed","paper":{"title":"MNIST-C: A Robustness Benchmark for Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Justin Gilmer, Norman Mu","submitted_at":"2019-06-05T22:23:43Z","abstract_excerpt":"We introduce the MNIST-C dataset, a comprehensive suite of 15 corruptions applied to the MNIST test set, for benchmarking out-of-distribution robustness in computer vision. Through several experiments and visualizations we demonstrate that our corruptions significantly degrade performance of state-of-the-art computer vision models while preserving the semantic content of the test images. In contrast to the popular notion of adversarial robustness, our model-agnostic corruptions do not seek worst-case performance but are instead designed to be broad and diverse, capturing multiple failure modes"},"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":"1906.02337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-05T22:23:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"891924c021aaa9876b26c766598afd538723b1c53a07db34a6260a4002f9b78b","abstract_canon_sha256":"703feccd2efcf9aca8a2cbe0ea4b0b2e158a96f560d545fc4f2d2636f02dce15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:01.573809Z","signature_b64":"vi6UyAQNIUgCURu6wBbA89M4tirU+cClE6eVffToEmTTWMtXhgjJrrpMU49bC6Y9O377IE3wvTH+HdLahyQ6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53dcf62b0d9a5dfdd2b9407ded373e9649c8296f16eb7980c97a8ec6907c5dce","last_reissued_at":"2026-05-17T23:44:01.573175Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:01.573175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MNIST-C: A Robustness Benchmark for Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Justin Gilmer, Norman Mu","submitted_at":"2019-06-05T22:23:43Z","abstract_excerpt":"We introduce the MNIST-C dataset, a comprehensive suite of 15 corruptions applied to the MNIST test set, for benchmarking out-of-distribution robustness in computer vision. Through several experiments and visualizations we demonstrate that our corruptions significantly degrade performance of state-of-the-art computer vision models while preserving the semantic content of the test images. In contrast to the popular notion of adversarial robustness, our model-agnostic corruptions do not seek worst-case performance but are instead designed to be broad and diverse, capturing multiple failure modes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02337","kind":"arxiv","version":1},"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":"1906.02337","created_at":"2026-05-17T23:44:01.573265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02337v1","created_at":"2026-05-17T23:44:01.573265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02337","created_at":"2026-05-17T23:44:01.573265+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPOPMKYNTJO7","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPOPMKYNTJO73UVZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPOPMKYN","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.23244","citing_title":"Convex Optimization for Alignment and Preference Learning on a Single GPU","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2502.02345","citing_title":"Low Rank Based Subspace Inference for the Laplace Approximation of Bayesian Neural Networks","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23342","citing_title":"Empirical Insights of Test Selection Metrics under Multiple Testing Objectives and Distribution Shifts","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ","json":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ.json","graph_json":"https://pith.science/api/pith-number/KPOPMKYNTJO73UVZIB662NZ6SZ/graph.json","events_json":"https://pith.science/api/pith-number/KPOPMKYNTJO73UVZIB662NZ6SZ/events.json","paper":"https://pith.science/paper/KPOPMKYN"},"agent_actions":{"view_html":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ","download_json":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ.json","view_paper":"https://pith.science/paper/KPOPMKYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02337&json=true","fetch_graph":"https://pith.science/api/pith-number/KPOPMKYNTJO73UVZIB662NZ6SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KPOPMKYNTJO73UVZIB662NZ6SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ/action/storage_attestation","attest_author":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ/action/author_attestation","sign_citation":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ/action/citation_signature","submit_replication":"https://pith.science/pith/KPOPMKYNTJO73UVZIB662NZ6SZ/action/replication_record"}},"created_at":"2026-05-17T23:44:01.573265+00:00","updated_at":"2026-05-17T23:44:01.573265+00:00"}