{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E5MBQXPQJCIRC24OZSS7AUQCGD","short_pith_number":"pith:E5MBQXPQ","canonical_record":{"source":{"id":"1810.07378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T03:51:38Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"346b06512c26956eb66375a773f4bc714fcd8ec3fe989c010b6a6ddb816df680","abstract_canon_sha256":"30617ad20921df4e49a7b09d91e8fb3d0260b91343bb61d572860b5156ad97aa"},"schema_version":"1.0"},"canonical_sha256":"2758185df04891116b8ecca5f0520230c5bcd03f9ea25e11219fe61f6813a7e9","source":{"kind":"arxiv","id":"1810.07378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07378","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07378v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07378","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"E5MBQXPQJCIR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5MBQXPQJCIRC24O","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5MBQXPQ","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E5MBQXPQJCIRC24OZSS7AUQCGD","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T03:51:38Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"346b06512c26956eb66375a773f4bc714fcd8ec3fe989c010b6a6ddb816df680","abstract_canon_sha256":"30617ad20921df4e49a7b09d91e8fb3d0260b91343bb61d572860b5156ad97aa"},"schema_version":"1.0"},"canonical_sha256":"2758185df04891116b8ecca5f0520230c5bcd03f9ea25e11219fe61f6813a7e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.525044Z","signature_b64":"MuGDEdU6PUidjljBtsXKMJkd02g2t3nyS4d29ve7iAy+DrkPe/SWqdXx/OGAf2QWp7FbZEgM7bKiE23afQggAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2758185df04891116b8ecca5f0520230c5bcd03f9ea25e11219fe61f6813a7e9","last_reissued_at":"2026-05-18T00:01:37.524427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.524427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07378","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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4s0aE3Qk/AQHAkmc4V1dFn1+vCBHMzp3bH2bmjufMtxJfAYZwwgLn+WL294JToff0QkGTGcWbzA7qJ0qcGqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:31:36.975699Z"},"content_sha256":"d7f3c9e5c66d7858ec8775755ac5a6ccd2a514b29ed351e8f9c798846880f920","schema_version":"1.0","event_id":"sha256:d7f3c9e5c66d7858ec8775755ac5a6ccd2a514b29ed351e8f9c798846880f920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E5MBQXPQJCIRC24OZSS7AUQCGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive Weight Pruning of Deep Neural Networks using ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fuxun Yu, Jian Tang, Jiayu Li, Kaidi Xu, Kaiqi Zhang, Makan Fardad, Shaokai Ye, Sijia Liu, Tianyun Zhang, Xiang Chen, Xue Lin, Yanzhi Wang, Yunfei Yang","submitted_at":"2018-10-17T03:51:38Z","abstract_excerpt":"Deep neural networks (DNNs) although achieving human-level performance in many domains, have very large model size that hinders their broader applications on edge computing devices. Extensive research work have been conducted on DNN model compression or pruning. However, most of the previous work took heuristic approaches. This work proposes a progressive weight pruning approach based on ADMM (Alternating Direction Method of Multipliers), a powerful technique to deal with non-convex optimization problems with potentially combinatorial constraints. Motivated by dynamic programming, the proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07378","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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsUL5AI2wvQQ7LUwGOeJlJauy3xs22iVkwjJSC6axIVsy8OS5CxT9ofFPXQYr8fQq+hXRCxOP3CjFhafK5AwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:31:36.976259Z"},"content_sha256":"4898cd941c3aef87e46ffc0083ff87681dda21a002e8a19185e352f0cc72613e","schema_version":"1.0","event_id":"sha256:4898cd941c3aef87e46ffc0083ff87681dda21a002e8a19185e352f0cc72613e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/bundle.json","state_url":"https://pith.science/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/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-19T07:31:36Z","links":{"resolver":"https://pith.science/pith/E5MBQXPQJCIRC24OZSS7AUQCGD","bundle":"https://pith.science/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/bundle.json","state":"https://pith.science/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5MBQXPQJCIRC24OZSS7AUQCGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E5MBQXPQJCIRC24OZSS7AUQCGD","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":"30617ad20921df4e49a7b09d91e8fb3d0260b91343bb61d572860b5156ad97aa","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T03:51:38Z","title_canon_sha256":"346b06512c26956eb66375a773f4bc714fcd8ec3fe989c010b6a6ddb816df680"},"schema_version":"1.0","source":{"id":"1810.07378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07378","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07378v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07378","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"E5MBQXPQJCIR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5MBQXPQJCIRC24O","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5MBQXPQ","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4898cd941c3aef87e46ffc0083ff87681dda21a002e8a19185e352f0cc72613e","target":"graph","created_at":"2026-05-18T00:01:37Z","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 neural networks (DNNs) although achieving human-level performance in many domains, have very large model size that hinders their broader applications on edge computing devices. Extensive research work have been conducted on DNN model compression or pruning. However, most of the previous work took heuristic approaches. This work proposes a progressive weight pruning approach based on ADMM (Alternating Direction Method of Multipliers), a powerful technique to deal with non-convex optimization problems with potentially combinatorial constraints. Motivated by dynamic programming, the proposed","authors_text":"Fuxun Yu, Jian Tang, Jiayu Li, Kaidi Xu, Kaiqi Zhang, Makan Fardad, Shaokai Ye, Sijia Liu, Tianyun Zhang, Xiang Chen, Xue Lin, Yanzhi Wang, Yunfei Yang","cross_cats":["cs.CV","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T03:51:38Z","title":"Progressive Weight Pruning of Deep Neural Networks using ADMM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07378","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:d7f3c9e5c66d7858ec8775755ac5a6ccd2a514b29ed351e8f9c798846880f920","target":"record","created_at":"2026-05-18T00:01:37Z","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":"30617ad20921df4e49a7b09d91e8fb3d0260b91343bb61d572860b5156ad97aa","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-17T03:51:38Z","title_canon_sha256":"346b06512c26956eb66375a773f4bc714fcd8ec3fe989c010b6a6ddb816df680"},"schema_version":"1.0","source":{"id":"1810.07378","kind":"arxiv","version":2}},"canonical_sha256":"2758185df04891116b8ecca5f0520230c5bcd03f9ea25e11219fe61f6813a7e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2758185df04891116b8ecca5f0520230c5bcd03f9ea25e11219fe61f6813a7e9","first_computed_at":"2026-05-18T00:01:37.524427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.524427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MuGDEdU6PUidjljBtsXKMJkd02g2t3nyS4d29ve7iAy+DrkPe/SWqdXx/OGAf2QWp7FbZEgM7bKiE23afQggAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.525044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f3c9e5c66d7858ec8775755ac5a6ccd2a514b29ed351e8f9c798846880f920","sha256:4898cd941c3aef87e46ffc0083ff87681dda21a002e8a19185e352f0cc72613e"],"state_sha256":"e27313d8ee6d30bd118bd985cad08fd1998e62c9f6ad70ba586b518cac5542c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWdYnEmPDQeoag3IasbcVByktmwX6eGQi98Ttj6JIttxzQKafd6IsLpflFPoBycCP8hRlhRlYxidILhvoAYABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:31:36.978691Z","bundle_sha256":"a00b1dd41391ad89dbacce17f16fd07b9ab8ef922de7a3ed92e5f2cafe82221c"}}