{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2YUJJWS4NOH5ZTOQ4N4LR3R7RT","short_pith_number":"pith:2YUJJWS4","schema_version":"1.0","canonical_sha256":"d62894da5c6b8fdccdd0e378b8ee3f8cd0989a2c02506bf5c3e34c602853da2e","source":{"kind":"arxiv","id":"2307.08771","version":1},"attestation_state":"computed","paper":{"title":"UPSCALE: Unconstrained Channel Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alvin Wan, David G\\\"uera, Hanxiang Hao, Kaushik Patnaik, Omer Hadad, Qi Shan, Yueyang Xu, Zhile Ren","submitted_at":"2023-07-17T18:31:25Z","abstract_excerpt":"As neural networks grow in size and complexity, inference speeds decline. To combat this, one of the most effective compression techniques -- channel pruning -- removes channels from weights. However, for multi-branch segments of a model, channel removal can introduce inference-time memory copies. In turn, these copies increase inference latency -- so much so that the pruned model can be slower than the unpruned model. As a workaround, pruners conventionally constrain certain channels to be pruned together. This fully eliminates memory copies but, as we show, significantly impairs accuracy. 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":"2307.08771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-07-17T18:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"771c545069f49942a0d5f5e0609b9c84d2604707644cb2f74e8d26048d7309be","abstract_canon_sha256":"b666b6e11da46d787c221458ba93fed750191a77954f1e60f2cbe6fd4f45381d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:34.058394Z","signature_b64":"NeSqbK3mEVvItRyEpeo47ZALG7PRH3AZ6+flRMdgyr0+wJw1epCJVW8S51hZYw2wA2Sb4SjEpvjM0OM+HOtyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d62894da5c6b8fdccdd0e378b8ee3f8cd0989a2c02506bf5c3e34c602853da2e","last_reissued_at":"2026-07-05T06:31:34.057909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:34.057909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UPSCALE: Unconstrained Channel Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alvin Wan, David G\\\"uera, Hanxiang Hao, Kaushik Patnaik, Omer Hadad, Qi Shan, Yueyang Xu, Zhile Ren","submitted_at":"2023-07-17T18:31:25Z","abstract_excerpt":"As neural networks grow in size and complexity, inference speeds decline. To combat this, one of the most effective compression techniques -- channel pruning -- removes channels from weights. However, for multi-branch segments of a model, channel removal can introduce inference-time memory copies. In turn, these copies increase inference latency -- so much so that the pruned model can be slower than the unpruned model. As a workaround, pruners conventionally constrain certain channels to be pruned together. This fully eliminates memory copies but, as we show, significantly impairs accuracy. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08771","kind":"arxiv","version":1},"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/2307.08771/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":"2307.08771","created_at":"2026-07-05T06:31:34.057965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08771v1","created_at":"2026-07-05T06:31:34.057965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08771","created_at":"2026-07-05T06:31:34.057965+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YUJJWS4NOH5","created_at":"2026-07-05T06:31:34.057965+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YUJJWS4NOH5ZTOQ","created_at":"2026-07-05T06:31:34.057965+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YUJJWS4","created_at":"2026-07-05T06:31:34.057965+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT","json":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT.json","graph_json":"https://pith.science/api/pith-number/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/graph.json","events_json":"https://pith.science/api/pith-number/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/events.json","paper":"https://pith.science/paper/2YUJJWS4"},"agent_actions":{"view_html":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT","download_json":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT.json","view_paper":"https://pith.science/paper/2YUJJWS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08771&json=true","fetch_graph":"https://pith.science/api/pith-number/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/graph.json","fetch_events":"https://pith.science/api/pith-number/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/action/storage_attestation","attest_author":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/action/author_attestation","sign_citation":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/action/citation_signature","submit_replication":"https://pith.science/pith/2YUJJWS4NOH5ZTOQ4N4LR3R7RT/action/replication_record"}},"created_at":"2026-07-05T06:31:34.057965+00:00","updated_at":"2026-07-05T06:31:34.057965+00:00"}