{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:37ABDDUQQQKT5GREQYJWZLM226","short_pith_number":"pith:37ABDDUQ","schema_version":"1.0","canonical_sha256":"dfc0118e9084153e9a2486136cad9ad791f467291a0976bb6db10e757ab232f3","source":{"kind":"arxiv","id":"2505.03254","version":2},"attestation_state":"computed","paper":{"title":"PROM: Prioritize Reduction of Multiplications Over Lower Bit-Widths for Efficient CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Alexandru Paul Condurache, Jens Mehnert, Lukas Meiner","submitted_at":"2025-05-06T07:32:24Z","abstract_excerpt":"Convolutional neural networks (CNNs) are crucial for computer vision tasks on resource-constrained devices. Quantization effectively compresses these models, reducing storage size and energy cost. However, in modern depthwise-separable architectures, the computational cost is distributed unevenly across its components, with pointwise operations being the most expensive. By applying a general quantization scheme to this imbalanced cost distribution, existing quantization approaches fail to fully exploit potential efficiency gains. To this end, we introduce PROM, a straightforward approach for q"},"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":"2505.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-05-06T07:32:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5a6883cbb304f2b90edf94e4ba073552dd9edf89b89b56239c345bd611bca7d6","abstract_canon_sha256":"a0550b323708d541454ebeb5d647e1fd69429c98f606103e4a8c19b9f49143a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:09.779698Z","signature_b64":"iPqgWZmFOHjsyrKy8JeHUXN8QuGSJxaQ6VVlvNj/9DoSC3C0xUWZZfnmhFYmsh/h06ed2RedyFNszZ3zd30oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc0118e9084153e9a2486136cad9ad791f467291a0976bb6db10e757ab232f3","last_reissued_at":"2026-07-05T11:49:09.779220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:09.779220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PROM: Prioritize Reduction of Multiplications Over Lower Bit-Widths for Efficient CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Alexandru Paul Condurache, Jens Mehnert, Lukas Meiner","submitted_at":"2025-05-06T07:32:24Z","abstract_excerpt":"Convolutional neural networks (CNNs) are crucial for computer vision tasks on resource-constrained devices. Quantization effectively compresses these models, reducing storage size and energy cost. However, in modern depthwise-separable architectures, the computational cost is distributed unevenly across its components, with pointwise operations being the most expensive. By applying a general quantization scheme to this imbalanced cost distribution, existing quantization approaches fail to fully exploit potential efficiency gains. To this end, we introduce PROM, a straightforward approach for q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03254","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/2505.03254/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":"2505.03254","created_at":"2026-07-05T11:49:09.779280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.03254v2","created_at":"2026-07-05T11:49:09.779280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03254","created_at":"2026-07-05T11:49:09.779280+00:00"},{"alias_kind":"pith_short_12","alias_value":"37ABDDUQQQKT","created_at":"2026-07-05T11:49:09.779280+00:00"},{"alias_kind":"pith_short_16","alias_value":"37ABDDUQQQKT5GRE","created_at":"2026-07-05T11:49:09.779280+00:00"},{"alias_kind":"pith_short_8","alias_value":"37ABDDUQ","created_at":"2026-07-05T11:49:09.779280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30516","citing_title":"HASTE: A Framework for Training-Free, Dynamic, and Steerable Compression of Pre-Trained Convolutional Neural Networks","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226","json":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226.json","graph_json":"https://pith.science/api/pith-number/37ABDDUQQQKT5GREQYJWZLM226/graph.json","events_json":"https://pith.science/api/pith-number/37ABDDUQQQKT5GREQYJWZLM226/events.json","paper":"https://pith.science/paper/37ABDDUQ"},"agent_actions":{"view_html":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226","download_json":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226.json","view_paper":"https://pith.science/paper/37ABDDUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.03254&json=true","fetch_graph":"https://pith.science/api/pith-number/37ABDDUQQQKT5GREQYJWZLM226/graph.json","fetch_events":"https://pith.science/api/pith-number/37ABDDUQQQKT5GREQYJWZLM226/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226/action/storage_attestation","attest_author":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226/action/author_attestation","sign_citation":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226/action/citation_signature","submit_replication":"https://pith.science/pith/37ABDDUQQQKT5GREQYJWZLM226/action/replication_record"}},"created_at":"2026-07-05T11:49:09.779280+00:00","updated_at":"2026-07-05T11:49:09.779280+00:00"}