{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4OKEBKDU46AKAHJVTRAPHZGYKQ","short_pith_number":"pith:4OKEBKDU","schema_version":"1.0","canonical_sha256":"e39440a874e780a01d359c40f3e4d8541484bbd504ec74d7a3e888f6501e9e62","source":{"kind":"arxiv","id":"1810.00518","version":2},"attestation_state":"computed","paper":{"title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cha Zhang, Diana Marculescu, Ting-Wu Chin","submitted_at":"2018-10-01T03:41:25Z","abstract_excerpt":"Resource-efficient convolution neural networks enable not only the intelligence on edge devices but also opportunities in system-level optimization such as scheduling. In this work, we aim to improve the performance of resource-constrained filter pruning by merging two sub-problems commonly considered, i.e., (i) how many filters to prune for each layer and (ii) which filters to prune given a per-layer pruning budget, into a global filter ranking problem. Our framework entails a novel algorithm, dubbed layer-compensated pruning, where meta-learning is involved to determine better solutions. We "},"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":"1810.00518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-01T03:41:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b9afc9696c798b03178e67f3124a5bb77a6b6696ed1f427e60e79a6987e2b7ad","abstract_canon_sha256":"58402aaad74b9d50e080229331afc5a88918d1bd54a4b33fb4c95e299cea65d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:54.583534Z","signature_b64":"EPQDM65Vck7xSi2QiakjAe7R47CCWs6l3gfIT6GQk1fMGE3v2o4/qmt+NgLtTztFLXctQrbGAlW2esq4yQgaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e39440a874e780a01d359c40f3e4d8541484bbd504ec74d7a3e888f6501e9e62","last_reissued_at":"2026-05-18T00:02:54.582846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:54.582846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cha Zhang, Diana Marculescu, Ting-Wu Chin","submitted_at":"2018-10-01T03:41:25Z","abstract_excerpt":"Resource-efficient convolution neural networks enable not only the intelligence on edge devices but also opportunities in system-level optimization such as scheduling. In this work, we aim to improve the performance of resource-constrained filter pruning by merging two sub-problems commonly considered, i.e., (i) how many filters to prune for each layer and (ii) which filters to prune given a per-layer pruning budget, into a global filter ranking problem. Our framework entails a novel algorithm, dubbed layer-compensated pruning, where meta-learning is involved to determine better solutions. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00518","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.00518","created_at":"2026-05-18T00:02:54.582954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00518v2","created_at":"2026-05-18T00:02:54.582954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00518","created_at":"2026-05-18T00:02:54.582954+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OKEBKDU46AK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OKEBKDU46AKAHJV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OKEBKDU","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00733","citing_title":"On Importance of Layer Pruning for Smaller BERT Models and Low Resource Languages","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ","json":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ.json","graph_json":"https://pith.science/api/pith-number/4OKEBKDU46AKAHJVTRAPHZGYKQ/graph.json","events_json":"https://pith.science/api/pith-number/4OKEBKDU46AKAHJVTRAPHZGYKQ/events.json","paper":"https://pith.science/paper/4OKEBKDU"},"agent_actions":{"view_html":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ","download_json":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ.json","view_paper":"https://pith.science/paper/4OKEBKDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00518&json=true","fetch_graph":"https://pith.science/api/pith-number/4OKEBKDU46AKAHJVTRAPHZGYKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4OKEBKDU46AKAHJVTRAPHZGYKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ/action/storage_attestation","attest_author":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ/action/author_attestation","sign_citation":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ/action/citation_signature","submit_replication":"https://pith.science/pith/4OKEBKDU46AKAHJVTRAPHZGYKQ/action/replication_record"}},"created_at":"2026-05-18T00:02:54.582954+00:00","updated_at":"2026-05-18T00:02:54.582954+00:00"}