{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TZPSAJIC742PC62M5Q75APYHLR","short_pith_number":"pith:TZPSAJIC","schema_version":"1.0","canonical_sha256":"9e5f202502ff34f17b4cec3fd03f075c679862ab0b5a8c94b622b0ab4b6e23a5","source":{"kind":"arxiv","id":"1807.11091","version":3},"attestation_state":"computed","paper":{"title":"StructADMM: A Systematic, High-Efficiency Framework of Structured Weight Pruning for DNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jian Tang, Kaiqi Zhang, Kaisheng Ma, Linfeng Zhang, Makan Fardad, Ning Liu, Shaokai Ye, Tianyun Zhang, Xiaolong Ma, Xue Lin, Yanzhi Wang","submitted_at":"2018-07-29T18:07:04Z","abstract_excerpt":"Weight pruning methods of DNNs have been demonstrated to achieve a good model pruning rate without loss of accuracy, thereby alleviating the significant computation/storage requirements of large-scale DNNs. Structured weight pruning methods have been proposed to overcome the limitation of irregular network structure and demonstrated actual GPU acceleration. However, in prior work the pruning rate (degree of sparsity) and GPU acceleration are limited (to less than 50%) when accuracy needs to be maintained. In this work,we overcome these limitations by proposing a unified, systematic framework o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.11091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-29T18:07:04Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"eb8db9be1ee57083a7f86eb9a05a021add689d3461b00a1f55cda72587fc49d7","abstract_canon_sha256":"df6fa400704e356d414f37ba4fc3a98c24480aba588ccfa10af63c07bb970968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:07.119599Z","signature_b64":"xUjabLMOcg3BBy/eW/NIXQVRa6Wwhqh9+pszDXO98ZOWiE14Y6QJlcSYpZnyMxg54//+a/c3JNgK53RB5db+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5f202502ff34f17b4cec3fd03f075c679862ab0b5a8c94b622b0ab4b6e23a5","last_reissued_at":"2026-05-17T23:50:07.118886Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:07.118886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StructADMM: A Systematic, High-Efficiency Framework of Structured Weight Pruning for DNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jian Tang, Kaiqi Zhang, Kaisheng Ma, Linfeng Zhang, Makan Fardad, Ning Liu, Shaokai Ye, Tianyun Zhang, Xiaolong Ma, Xue Lin, Yanzhi Wang","submitted_at":"2018-07-29T18:07:04Z","abstract_excerpt":"Weight pruning methods of DNNs have been demonstrated to achieve a good model pruning rate without loss of accuracy, thereby alleviating the significant computation/storage requirements of large-scale DNNs. Structured weight pruning methods have been proposed to overcome the limitation of irregular network structure and demonstrated actual GPU acceleration. However, in prior work the pruning rate (degree of sparsity) and GPU acceleration are limited (to less than 50%) when accuracy needs to be maintained. In this work,we overcome these limitations by proposing a unified, systematic framework o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11091","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.11091","created_at":"2026-05-17T23:50:07.118994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11091v3","created_at":"2026-05-17T23:50:07.118994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11091","created_at":"2026-05-17T23:50:07.118994+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZPSAJIC742P","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZPSAJIC742PC62M","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZPSAJIC","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2508.03949","citing_title":"Model Compression vs. Adversarial Robustness: An Empirical Study on Language Models for Code","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2511.05476","citing_title":"A Metamorphic Testing Perspective on Knowledge Distillation for Language Models of Code: Does the Student Deeply Mimic the Teacher?","ref_index":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR","json":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR.json","graph_json":"https://pith.science/api/pith-number/TZPSAJIC742PC62M5Q75APYHLR/graph.json","events_json":"https://pith.science/api/pith-number/TZPSAJIC742PC62M5Q75APYHLR/events.json","paper":"https://pith.science/paper/TZPSAJIC"},"agent_actions":{"view_html":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR","download_json":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR.json","view_paper":"https://pith.science/paper/TZPSAJIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11091&json=true","fetch_graph":"https://pith.science/api/pith-number/TZPSAJIC742PC62M5Q75APYHLR/graph.json","fetch_events":"https://pith.science/api/pith-number/TZPSAJIC742PC62M5Q75APYHLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR/action/storage_attestation","attest_author":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR/action/author_attestation","sign_citation":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR/action/citation_signature","submit_replication":"https://pith.science/pith/TZPSAJIC742PC62M5Q75APYHLR/action/replication_record"}},"created_at":"2026-05-17T23:50:07.118994+00:00","updated_at":"2026-05-17T23:50:07.118994+00:00"}