{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7MDE5FG5546CB3KRBNJ2HNIXB3","short_pith_number":"pith:7MDE5FG5","schema_version":"1.0","canonical_sha256":"fb064e94ddef3c20ed510b53a3b5170ef4796001ea0b24ab8e65701886d5e67b","source":{"kind":"arxiv","id":"2103.10858","version":2},"attestation_state":"computed","paper":{"title":"Toward Compact Deep Neural Networks via Energy-Aware Pruning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jee-Hyun Hwang, Kyung-Hwan Shim, Seul-Ki Yeom","submitted_at":"2021-03-19T15:33:16Z","abstract_excerpt":"Despite the remarkable performance, modern deep neural networks are inevitably accompanied by a significant amount of computational cost for learning and deployment, which may be incompatible with their usage on edge devices. Recent efforts to reduce these overheads involve pruning and decomposing the parameters of various layers without performance deterioration. Inspired by several decomposition studies, in this paper, we propose a novel energy-aware pruning method that quantifies the importance of each filter in the network using nuclear-norm (NN). Proposed energy-aware pruning leads to sta"},"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":"2103.10858","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2021-03-19T15:33:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"73821edd0153fd903e46d5d111f5abd4e64c0892a4e7ff3a0a06269ad7ee9b81","abstract_canon_sha256":"bf3249edad889e1f5f780dab1843c6621067f8c93aae5dbb74b024746b0f9ee3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:36.216515Z","signature_b64":"ODzfdfWjO4TcfOd0j9ALXPTepf1Dele18TaGX5jAXMeowCNqk+7D92e5AudCqjS1C+0zaW3k/2MuFamavEg7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb064e94ddef3c20ed510b53a3b5170ef4796001ea0b24ab8e65701886d5e67b","last_reissued_at":"2026-07-05T04:03:36.216041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:36.216041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Compact Deep Neural Networks via Energy-Aware Pruning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jee-Hyun Hwang, Kyung-Hwan Shim, Seul-Ki Yeom","submitted_at":"2021-03-19T15:33:16Z","abstract_excerpt":"Despite the remarkable performance, modern deep neural networks are inevitably accompanied by a significant amount of computational cost for learning and deployment, which may be incompatible with their usage on edge devices. Recent efforts to reduce these overheads involve pruning and decomposing the parameters of various layers without performance deterioration. Inspired by several decomposition studies, in this paper, we propose a novel energy-aware pruning method that quantifies the importance of each filter in the network using nuclear-norm (NN). Proposed energy-aware pruning leads to sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10858","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.10858/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.10858","created_at":"2026-07-05T04:03:36.216102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.10858v2","created_at":"2026-07-05T04:03:36.216102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10858","created_at":"2026-07-05T04:03:36.216102+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MDE5FG5546C","created_at":"2026-07-05T04:03:36.216102+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MDE5FG5546CB3KR","created_at":"2026-07-05T04:03:36.216102+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MDE5FG5","created_at":"2026-07-05T04:03:36.216102+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21573","citing_title":"LinDeps: A Fine-tuning Free Post-Pruning Method to Remove Layer-Wise Linear Dependencies with Guaranteed Performance Preservation","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3","json":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3.json","graph_json":"https://pith.science/api/pith-number/7MDE5FG5546CB3KRBNJ2HNIXB3/graph.json","events_json":"https://pith.science/api/pith-number/7MDE5FG5546CB3KRBNJ2HNIXB3/events.json","paper":"https://pith.science/paper/7MDE5FG5"},"agent_actions":{"view_html":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3","download_json":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3.json","view_paper":"https://pith.science/paper/7MDE5FG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.10858&json=true","fetch_graph":"https://pith.science/api/pith-number/7MDE5FG5546CB3KRBNJ2HNIXB3/graph.json","fetch_events":"https://pith.science/api/pith-number/7MDE5FG5546CB3KRBNJ2HNIXB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3/action/storage_attestation","attest_author":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3/action/author_attestation","sign_citation":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3/action/citation_signature","submit_replication":"https://pith.science/pith/7MDE5FG5546CB3KRBNJ2HNIXB3/action/replication_record"}},"created_at":"2026-07-05T04:03:36.216102+00:00","updated_at":"2026-07-05T04:03:36.216102+00:00"}