{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VWJK5MSCULQGAINBQBTIBZ6N4U","short_pith_number":"pith:VWJK5MSC","canonical_record":{"source":{"id":"1905.00136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T23:40:51Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"5811cd1d2a1a143131388078c4fdad7b9153e76e83ab621bcbe2f239e7e34f0a","abstract_canon_sha256":"9a4848be42582417c6251c599d74b59b54aac27c45fe4ce4b95a6d048e5b7382"},"schema_version":"1.0"},"canonical_sha256":"ad92aeb242a2e06021a1806680e7cde5206e6684d153a6e5010e9f01dfd05b56","source":{"kind":"arxiv","id":"1905.00136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00136","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00136v1","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00136","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"VWJK5MSCULQG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VWJK5MSCULQGAINB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VWJK5MSC","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VWJK5MSCULQGAINBQBTIBZ6N4U","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T23:40:51Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"5811cd1d2a1a143131388078c4fdad7b9153e76e83ab621bcbe2f239e7e34f0a","abstract_canon_sha256":"9a4848be42582417c6251c599d74b59b54aac27c45fe4ce4b95a6d048e5b7382"},"schema_version":"1.0"},"canonical_sha256":"ad92aeb242a2e06021a1806680e7cde5206e6684d153a6e5010e9f01dfd05b56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:11.878224Z","signature_b64":"epqGAQ1JP8SNckdcXewRwltASMg1J/M/+1nqaagwPad09KEEBUEHRse1g+oeFpFiJUWNf1mMYeDaaUFvMadUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad92aeb242a2e06021a1806680e7cde5206e6684d153a6e5010e9f01dfd05b56","last_reissued_at":"2026-05-17T23:47:11.877838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:11.877838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00136","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:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVDQoyyhVnd87UmM7n2Rodkz0QeGI0uHeJ2pWR3ZKnmPHzko9LayVmQRNT1J8Vw5dXScAKdwrzUwKu27L7MDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:58:13.306641Z"},"content_sha256":"186f3424d7af13dbbcf7cf404f986d072bd628e219cdd4c8165a036589376a1e","schema_version":"1.0","event_id":"sha256:186f3424d7af13dbbcf7cf404f986d072bd628e219cdd4c8165a036589376a1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VWJK5MSCULQGAINBQBTIBZ6N4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ResNet Can Be Pruned 60x: Introducing Network Purification and Unused Path Removal (P-RM) after Weight Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Geng Yuan, Hao Sun, Sheng Lin, Xiaolong Ma, Yanzhi Wang, Zhengang Li","submitted_at":"2019-04-30T23:40:51Z","abstract_excerpt":"The state-of-art DNN structures involve high computation and great demand for memory storage which pose intensive challenge on DNN framework resources. To mitigate the challenges, weight pruning techniques has been studied. However, high accuracy solution for extreme structured pruning that combines different types of structured sparsity still waiting for unraveling due to the extremely reduced weights in DNN networks. In this paper, we propose a DNN framework which combines two different types of structured weight pruning (filter and column prune) by incorporating alternating direction method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00136","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:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5Dp1f/TRZ/8aNpG0j+NMqWaGzi6ssjONLemGKjWBGTElwz6NH0qplaK+C42NrBSFC7H44FBWX4sARa0b/FiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:58:13.307034Z"},"content_sha256":"ce6790086da82837ebbcbc8a9dc17a250705c0c3c5a902bc32497c9c14ab6591","schema_version":"1.0","event_id":"sha256:ce6790086da82837ebbcbc8a9dc17a250705c0c3c5a902bc32497c9c14ab6591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/bundle.json","state_url":"https://pith.science/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/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-26T06:58:13Z","links":{"resolver":"https://pith.science/pith/VWJK5MSCULQGAINBQBTIBZ6N4U","bundle":"https://pith.science/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/bundle.json","state":"https://pith.science/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWJK5MSCULQGAINBQBTIBZ6N4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VWJK5MSCULQGAINBQBTIBZ6N4U","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":"9a4848be42582417c6251c599d74b59b54aac27c45fe4ce4b95a6d048e5b7382","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T23:40:51Z","title_canon_sha256":"5811cd1d2a1a143131388078c4fdad7b9153e76e83ab621bcbe2f239e7e34f0a"},"schema_version":"1.0","source":{"id":"1905.00136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00136","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00136v1","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00136","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"VWJK5MSCULQG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VWJK5MSCULQGAINB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VWJK5MSC","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:ce6790086da82837ebbcbc8a9dc17a250705c0c3c5a902bc32497c9c14ab6591","target":"graph","created_at":"2026-05-17T23:47:11Z","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":"The state-of-art DNN structures involve high computation and great demand for memory storage which pose intensive challenge on DNN framework resources. To mitigate the challenges, weight pruning techniques has been studied. However, high accuracy solution for extreme structured pruning that combines different types of structured sparsity still waiting for unraveling due to the extremely reduced weights in DNN networks. In this paper, we propose a DNN framework which combines two different types of structured weight pruning (filter and column prune) by incorporating alternating direction method","authors_text":"Geng Yuan, Hao Sun, Sheng Lin, Xiaolong Ma, Yanzhi Wang, Zhengang Li","cross_cats":["cs.AI","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T23:40:51Z","title":"ResNet Can Be Pruned 60x: Introducing Network Purification and Unused Path Removal (P-RM) after Weight Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00136","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:186f3424d7af13dbbcf7cf404f986d072bd628e219cdd4c8165a036589376a1e","target":"record","created_at":"2026-05-17T23:47:11Z","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":"9a4848be42582417c6251c599d74b59b54aac27c45fe4ce4b95a6d048e5b7382","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T23:40:51Z","title_canon_sha256":"5811cd1d2a1a143131388078c4fdad7b9153e76e83ab621bcbe2f239e7e34f0a"},"schema_version":"1.0","source":{"id":"1905.00136","kind":"arxiv","version":1}},"canonical_sha256":"ad92aeb242a2e06021a1806680e7cde5206e6684d153a6e5010e9f01dfd05b56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad92aeb242a2e06021a1806680e7cde5206e6684d153a6e5010e9f01dfd05b56","first_computed_at":"2026-05-17T23:47:11.877838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:11.877838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"epqGAQ1JP8SNckdcXewRwltASMg1J/M/+1nqaagwPad09KEEBUEHRse1g+oeFpFiJUWNf1mMYeDaaUFvMadUCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:11.878224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:186f3424d7af13dbbcf7cf404f986d072bd628e219cdd4c8165a036589376a1e","sha256:ce6790086da82837ebbcbc8a9dc17a250705c0c3c5a902bc32497c9c14ab6591"],"state_sha256":"e5baa9df203c301fcf0a0c98addaf0a88933165e21a3b2028e6408316174530b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbnfzRsv10+M9/hNF1zum958aFdkpSBfF+OZoulh7WJbYc8gw8fyI2HpwYYOXsYij7ZoRKTn9o6BCNM3jHTQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:58:13.309651Z","bundle_sha256":"9f7ae168a7205482d98e9e44b6a1f13b57a16c8512cb6ddfd28e9491be06a183"}}