{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TFRUFL2RFRWKVMDJLJIUNWX66O","short_pith_number":"pith:TFRUFL2R","canonical_record":{"source":{"id":"1302.1690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-07T10:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"66a5d742648ea3a021232277a2645d848bddcbfeead4086642cd8f966b217f44","abstract_canon_sha256":"919dab086d2c996fd51057ed2593ab63b4898cb49190255149116777610753c4"},"schema_version":"1.0"},"canonical_sha256":"996342af512c6caab0695a5146dafef3893fd36c9743005f6e55a9fd9588475b","source":{"kind":"arxiv","id":"1302.1690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1690","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1690v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1690","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"TFRUFL2RFRWK","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TFRUFL2RFRWKVMDJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TFRUFL2R","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TFRUFL2RFRWKVMDJLJIUNWX66O","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-07T10:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"66a5d742648ea3a021232277a2645d848bddcbfeead4086642cd8f966b217f44","abstract_canon_sha256":"919dab086d2c996fd51057ed2593ab63b4898cb49190255149116777610753c4"},"schema_version":"1.0"},"canonical_sha256":"996342af512c6caab0695a5146dafef3893fd36c9743005f6e55a9fd9588475b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:14.994205Z","signature_b64":"NajOXFytfmWW1HBci/X/wmDDUm9wLRswfAgVawUXsGFXJeOn/g8w56ycv4Cg08Qc/G7p6KGEkdc1YWwHYJZyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996342af512c6caab0695a5146dafef3893fd36c9743005f6e55a9fd9588475b","last_reissued_at":"2026-05-18T03:34:14.993498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:14.993498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1690","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UN/7p8R3cqglS6B88llJfFJ82Tn9noRbiN8MPhg1sBMKB1lrYrNwc7HabkkgKvhpJXX+Z8Eogtvi8MeJhhejBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:24.403239Z"},"content_sha256":"054c242b6373f22a7204bc9c913ba3404b607928f0d1a2deceeb4b14ab352205","schema_version":"1.0","event_id":"sha256:054c242b6373f22a7204bc9c913ba3404b607928f0d1a2deceeb4b14ab352205"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TFRUFL2RFRWKVMDJLJIUNWX66O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Learning Algorithm for Image Segmentation with Max-Pooling Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alessandro Giusti, Dan Cire\\c{s}an, Gabriel Fricout, Jonathan Masci, J\\\"urgen Schmidhuber","submitted_at":"2013-02-07T10:17:07Z","abstract_excerpt":"We present a fast algorithm for training MaxPooling Convolutional Networks to segment images. This type of network yields record-breaking performance in a variety of tasks, but is normally trained on a computationally expensive patch-by-patch basis. Our new method processes each training image in a single pass, which is vastly more efficient.\n  We validate the approach in different scenarios and report a 1500-fold speed-up. In an application to automated steel defect detection and segmentation, we obtain excellent performance with short training times."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1690","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K/0UGTW8sw/pJVll16toyAFhuAKVDhiM1LlKFZtDpFBOcvzV6D9cGm2DtVg89UMDuGNlXHNX040fb0ah6PLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:24.403623Z"},"content_sha256":"6f6421281b3e7832f21b3e8e67a2ccc8bb07fe36619935a2c79189ad2926d2be","schema_version":"1.0","event_id":"sha256:6f6421281b3e7832f21b3e8e67a2ccc8bb07fe36619935a2c79189ad2926d2be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/bundle.json","state_url":"https://pith.science/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:20:24Z","links":{"resolver":"https://pith.science/pith/TFRUFL2RFRWKVMDJLJIUNWX66O","bundle":"https://pith.science/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/bundle.json","state":"https://pith.science/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFRUFL2RFRWKVMDJLJIUNWX66O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TFRUFL2RFRWKVMDJLJIUNWX66O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"919dab086d2c996fd51057ed2593ab63b4898cb49190255149116777610753c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-07T10:17:07Z","title_canon_sha256":"66a5d742648ea3a021232277a2645d848bddcbfeead4086642cd8f966b217f44"},"schema_version":"1.0","source":{"id":"1302.1690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1690","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1690v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1690","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"TFRUFL2RFRWK","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TFRUFL2RFRWKVMDJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TFRUFL2R","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:6f6421281b3e7832f21b3e8e67a2ccc8bb07fe36619935a2c79189ad2926d2be","target":"graph","created_at":"2026-05-18T03:34:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present a fast algorithm for training MaxPooling Convolutional Networks to segment images. This type of network yields record-breaking performance in a variety of tasks, but is normally trained on a computationally expensive patch-by-patch basis. Our new method processes each training image in a single pass, which is vastly more efficient.\n  We validate the approach in different scenarios and report a 1500-fold speed-up. In an application to automated steel defect detection and segmentation, we obtain excellent performance with short training times.","authors_text":"Alessandro Giusti, Dan Cire\\c{s}an, Gabriel Fricout, Jonathan Masci, J\\\"urgen Schmidhuber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-07T10:17:07Z","title":"A Fast Learning Algorithm for Image Segmentation with Max-Pooling Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1690","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:054c242b6373f22a7204bc9c913ba3404b607928f0d1a2deceeb4b14ab352205","target":"record","created_at":"2026-05-18T03:34:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"919dab086d2c996fd51057ed2593ab63b4898cb49190255149116777610753c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-07T10:17:07Z","title_canon_sha256":"66a5d742648ea3a021232277a2645d848bddcbfeead4086642cd8f966b217f44"},"schema_version":"1.0","source":{"id":"1302.1690","kind":"arxiv","version":1}},"canonical_sha256":"996342af512c6caab0695a5146dafef3893fd36c9743005f6e55a9fd9588475b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"996342af512c6caab0695a5146dafef3893fd36c9743005f6e55a9fd9588475b","first_computed_at":"2026-05-18T03:34:14.993498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:14.993498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NajOXFytfmWW1HBci/X/wmDDUm9wLRswfAgVawUXsGFXJeOn/g8w56ycv4Cg08Qc/G7p6KGEkdc1YWwHYJZyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:14.994205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:054c242b6373f22a7204bc9c913ba3404b607928f0d1a2deceeb4b14ab352205","sha256:6f6421281b3e7832f21b3e8e67a2ccc8bb07fe36619935a2c79189ad2926d2be"],"state_sha256":"cd1b3107753f7aff8ea701f1d9876c49e3bd0be63d5cb807ef910d48fe58a970"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ls/sUeEBkXkW2SAETSMxJj2pH4bBrWjNyS9BAEBiC9Lyz3C9rJ6JoXVvsnXFr8P/L4BTv59PaQZQDyy4Ps9VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:20:24.405987Z","bundle_sha256":"0ee1f18a8bdc66a7f9361495483ad2b1ed5e0946cf4ae16cf0574d86d738cb90"}}