{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3HMKOS62QOWRW2IPZUG4CST7KH","short_pith_number":"pith:3HMKOS62","canonical_record":{"source":{"id":"1906.03826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-10T07:53:18Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9f83261e98aea89657269397d36e16c8982470a22c1015b0589a756480af1039","abstract_canon_sha256":"46b94502eb056f8b42966d53dd3912f9ebc90dc9a8ac9138cfdc3d691e6ca214"},"schema_version":"1.0"},"canonical_sha256":"d9d8a74bda83ad1b690fcd0dc14a7f51d01766ee7dfb1c8d37885c577a83d146","source":{"kind":"arxiv","id":"1906.03826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03826","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03826v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03826","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"3HMKOS62QOWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3HMKOS62QOWRW2IP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3HMKOS62","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3HMKOS62QOWRW2IPZUG4CST7KH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-10T07:53:18Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9f83261e98aea89657269397d36e16c8982470a22c1015b0589a756480af1039","abstract_canon_sha256":"46b94502eb056f8b42966d53dd3912f9ebc90dc9a8ac9138cfdc3d691e6ca214"},"schema_version":"1.0"},"canonical_sha256":"d9d8a74bda83ad1b690fcd0dc14a7f51d01766ee7dfb1c8d37885c577a83d146","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:44.821411Z","signature_b64":"SeUu2RToe8U3+kplkyzX96q8/vWXz6+CtiOFpg5DdcL34DukruL24q5xouGO6b+gRBJMfy0ya3rBYElfZ6/aDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9d8a74bda83ad1b690fcd0dc14a7f51d01766ee7dfb1c8d37885c577a83d146","last_reissued_at":"2026-05-17T23:43:44.820761Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:44.820761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03826","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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhOU2flO4y0kVySlAmIW9uZPnxDSXRU5yfqlgPCN3RhWP5D1//kZ+ZJ4ynC1h+H4ey+Sl0Ya3TW9dpwcG673Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:46:07.314125Z"},"content_sha256":"c5953790ffaf437068c2f2338cdb1c3e128aec076a22e01d066b365824c0eed9","schema_version":"1.0","event_id":"sha256:c5953790ffaf437068c2f2338cdb1c3e128aec076a22e01d066b365824c0eed9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3HMKOS62QOWRW2IPZUG4CST7KH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Implosion: Effective Model Compression for ResNets via Static Layer Pruning and Retraining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yasuhiro Fujiwara, Yasutoshi Ida","submitted_at":"2019-06-10T07:53:18Z","abstract_excerpt":"Residual Networks with convolutional layers are widely used in the field of machine learning. Since they effectively extract features from input data by stacking multiple layers, they can achieve high accuracy in many applications. However, the stacking of many layers raises their computation costs. To address this problem, we propose Network Implosion, it erases multiple layers from Residual Networks without degrading accuracy. Our key idea is to introduce a priority term that identifies the importance of a layer; we can select unimportant layers according to the priority and erase them after"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03826","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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGVPr7kL0bfed6yWuh1F7JkBJxsp45Jl5yvfgi52l0eQvqYUDV30WS69mfmLZ7ES+VPQY9KAHBsyVNYqrsXTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:46:07.314840Z"},"content_sha256":"19b5c5f6339c8dba2121de25bc27466e7c85aa9220de02d6aa9140a29680db88","schema_version":"1.0","event_id":"sha256:19b5c5f6339c8dba2121de25bc27466e7c85aa9220de02d6aa9140a29680db88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HMKOS62QOWRW2IPZUG4CST7KH/bundle.json","state_url":"https://pith.science/pith/3HMKOS62QOWRW2IPZUG4CST7KH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HMKOS62QOWRW2IPZUG4CST7KH/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-06-08T06:46:07Z","links":{"resolver":"https://pith.science/pith/3HMKOS62QOWRW2IPZUG4CST7KH","bundle":"https://pith.science/pith/3HMKOS62QOWRW2IPZUG4CST7KH/bundle.json","state":"https://pith.science/pith/3HMKOS62QOWRW2IPZUG4CST7KH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HMKOS62QOWRW2IPZUG4CST7KH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3HMKOS62QOWRW2IPZUG4CST7KH","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":"46b94502eb056f8b42966d53dd3912f9ebc90dc9a8ac9138cfdc3d691e6ca214","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-10T07:53:18Z","title_canon_sha256":"9f83261e98aea89657269397d36e16c8982470a22c1015b0589a756480af1039"},"schema_version":"1.0","source":{"id":"1906.03826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03826","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03826v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03826","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"3HMKOS62QOWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3HMKOS62QOWRW2IP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3HMKOS62","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:19b5c5f6339c8dba2121de25bc27466e7c85aa9220de02d6aa9140a29680db88","target":"graph","created_at":"2026-05-17T23:43:44Z","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":"Residual Networks with convolutional layers are widely used in the field of machine learning. Since they effectively extract features from input data by stacking multiple layers, they can achieve high accuracy in many applications. However, the stacking of many layers raises their computation costs. To address this problem, we propose Network Implosion, it erases multiple layers from Residual Networks without degrading accuracy. Our key idea is to introduce a priority term that identifies the importance of a layer; we can select unimportant layers according to the priority and erase them after","authors_text":"Yasuhiro Fujiwara, Yasutoshi Ida","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-10T07:53:18Z","title":"Network Implosion: Effective Model Compression for ResNets via Static Layer Pruning and Retraining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03826","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:c5953790ffaf437068c2f2338cdb1c3e128aec076a22e01d066b365824c0eed9","target":"record","created_at":"2026-05-17T23:43:44Z","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":"46b94502eb056f8b42966d53dd3912f9ebc90dc9a8ac9138cfdc3d691e6ca214","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-10T07:53:18Z","title_canon_sha256":"9f83261e98aea89657269397d36e16c8982470a22c1015b0589a756480af1039"},"schema_version":"1.0","source":{"id":"1906.03826","kind":"arxiv","version":1}},"canonical_sha256":"d9d8a74bda83ad1b690fcd0dc14a7f51d01766ee7dfb1c8d37885c577a83d146","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9d8a74bda83ad1b690fcd0dc14a7f51d01766ee7dfb1c8d37885c577a83d146","first_computed_at":"2026-05-17T23:43:44.820761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:44.820761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SeUu2RToe8U3+kplkyzX96q8/vWXz6+CtiOFpg5DdcL34DukruL24q5xouGO6b+gRBJMfy0ya3rBYElfZ6/aDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:44.821411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5953790ffaf437068c2f2338cdb1c3e128aec076a22e01d066b365824c0eed9","sha256:19b5c5f6339c8dba2121de25bc27466e7c85aa9220de02d6aa9140a29680db88"],"state_sha256":"02b6793142bff686d8f55dfebaf7210c679f9fdbf150c9b094c9eaed4a8eec25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVGNq5Zq2VhGkZrWXOZsFII+BMjnwUhBa39ts1YWXpbkrMw/gis5Fw4eGu4Kc1Jh1Eq/ISvfiwYf9nAwGpR1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:46:07.318411Z","bundle_sha256":"4e6f68038157f2de82c86745e4b87579ff0981d9d290e1174b14b60b5d2b0272"}}