{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VKZPJGQXAAM4MKGHNGIZSKYDIX","short_pith_number":"pith:VKZPJGQX","canonical_record":{"source":{"id":"1608.04493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-08-16T06:23:05Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"87dbbaa7376745d6e253ac2244a5952acd1b0d63a4d59f88a02264855d5144b8","abstract_canon_sha256":"18f12a14004f3ff7927eac771f3d5879529f24478621745c5f4cacd47aef1f42"},"schema_version":"1.0"},"canonical_sha256":"aab2f49a170019c628c76991992b0345caa9e070c862d1ed07c5f57cfcb90311","source":{"kind":"arxiv","id":"1608.04493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04493","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04493v2","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04493","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"VKZPJGQXAAM4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKZPJGQXAAM4MKGH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKZPJGQX","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VKZPJGQXAAM4MKGHNGIZSKYDIX","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-08-16T06:23:05Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"87dbbaa7376745d6e253ac2244a5952acd1b0d63a4d59f88a02264855d5144b8","abstract_canon_sha256":"18f12a14004f3ff7927eac771f3d5879529f24478621745c5f4cacd47aef1f42"},"schema_version":"1.0"},"canonical_sha256":"aab2f49a170019c628c76991992b0345caa9e070c862d1ed07c5f57cfcb90311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:41.720989Z","signature_b64":"KxAXBIMedIYay+RlK6ycGNyrYKZ1BmXk9OO+AqhzwktUuV+YqSZm/kKVdgEgOuO4uN75Uqdvb3uZda3eev8GCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aab2f49a170019c628c76991992b0345caa9e070c862d1ed07c5f57cfcb90311","last_reissued_at":"2026-05-18T00:59:41.720289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:41.720289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04493","source_version":2,"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-18T00:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyCmfMXrN6Hu5ibTCrMipApxhPFBQ786i4+TxRndop4KRhQoX9nTbm+uNVrJc68AvUX395ltu27kbs3xzCGZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:19:42.056482Z"},"content_sha256":"5b18065095c98e7d2bb28e661361bc086a4571375461725a3c73f82708bcc4ed","schema_version":"1.0","event_id":"sha256:5b18065095c98e7d2bb28e661361bc086a4571375461725a3c73f82708bcc4ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VKZPJGQXAAM4MKGHNGIZSKYDIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Network Surgery for Efficient DNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Anbang Yao, Yiwen Guo, Yurong Chen","submitted_at":"2016-08-16T06:23:05Z","abstract_excerpt":"Deep learning has become a ubiquitous technology to improve machine intelligence. However, most of the existing deep models are structurally very complex, making them difficult to be deployed on the mobile platforms with limited computational power. In this paper, we propose a novel network compression method called dynamic network surgery, which can remarkably reduce the network complexity by making on-the-fly connection pruning. Unlike the previous methods which accomplish this task in a greedy way, we properly incorporate connection splicing into the whole process to avoid incorrect pruning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04493","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"},"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-18T00:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MVwW+sYKMaBl3CIJlMGKrjQTORMK66ix22y2wsvP5fvzRDba5w5xIDDhEM4JZbETGD6iuTIQuZU5O4Mpq/nXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:19:42.056829Z"},"content_sha256":"375e49732f451446ece2a3b6ecabb5735f67d2d187727f5202947ee4d61f1eee","schema_version":"1.0","event_id":"sha256:375e49732f451446ece2a3b6ecabb5735f67d2d187727f5202947ee4d61f1eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/bundle.json","state_url":"https://pith.science/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/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-28T20:19:42Z","links":{"resolver":"https://pith.science/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX","bundle":"https://pith.science/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/bundle.json","state":"https://pith.science/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKZPJGQXAAM4MKGHNGIZSKYDIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VKZPJGQXAAM4MKGHNGIZSKYDIX","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":"18f12a14004f3ff7927eac771f3d5879529f24478621745c5f4cacd47aef1f42","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-08-16T06:23:05Z","title_canon_sha256":"87dbbaa7376745d6e253ac2244a5952acd1b0d63a4d59f88a02264855d5144b8"},"schema_version":"1.0","source":{"id":"1608.04493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04493","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04493v2","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04493","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"VKZPJGQXAAM4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKZPJGQXAAM4MKGH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKZPJGQX","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:375e49732f451446ece2a3b6ecabb5735f67d2d187727f5202947ee4d61f1eee","target":"graph","created_at":"2026-05-18T00:59:41Z","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":"Deep learning has become a ubiquitous technology to improve machine intelligence. However, most of the existing deep models are structurally very complex, making them difficult to be deployed on the mobile platforms with limited computational power. In this paper, we propose a novel network compression method called dynamic network surgery, which can remarkably reduce the network complexity by making on-the-fly connection pruning. Unlike the previous methods which accomplish this task in a greedy way, we properly incorporate connection splicing into the whole process to avoid incorrect pruning","authors_text":"Anbang Yao, Yiwen Guo, Yurong Chen","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-08-16T06:23:05Z","title":"Dynamic Network Surgery for Efficient DNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04493","kind":"arxiv","version":2},"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:5b18065095c98e7d2bb28e661361bc086a4571375461725a3c73f82708bcc4ed","target":"record","created_at":"2026-05-18T00:59:41Z","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":"18f12a14004f3ff7927eac771f3d5879529f24478621745c5f4cacd47aef1f42","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-08-16T06:23:05Z","title_canon_sha256":"87dbbaa7376745d6e253ac2244a5952acd1b0d63a4d59f88a02264855d5144b8"},"schema_version":"1.0","source":{"id":"1608.04493","kind":"arxiv","version":2}},"canonical_sha256":"aab2f49a170019c628c76991992b0345caa9e070c862d1ed07c5f57cfcb90311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aab2f49a170019c628c76991992b0345caa9e070c862d1ed07c5f57cfcb90311","first_computed_at":"2026-05-18T00:59:41.720289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:41.720289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KxAXBIMedIYay+RlK6ycGNyrYKZ1BmXk9OO+AqhzwktUuV+YqSZm/kKVdgEgOuO4uN75Uqdvb3uZda3eev8GCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:41.720989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b18065095c98e7d2bb28e661361bc086a4571375461725a3c73f82708bcc4ed","sha256:375e49732f451446ece2a3b6ecabb5735f67d2d187727f5202947ee4d61f1eee"],"state_sha256":"7a64be14c87d2edb97a2272e4412ed71f9e6159b094a4b09419e878b09d665d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9zwQStO+jlSrnxCCxr8jAEGKU0iKU3Af19EkC++eJiMrWGixGkH9OPfZZi2JjDYSrabbIrTPn99mjhes5CVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:19:42.058949Z","bundle_sha256":"e5817517d5c9fda84d8d4d6bab4a3520a9fa4fe53f1e843875c37b45321a7ea6"}}