{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F6QPL72A54PDAXOCJH5AQR2MQU","short_pith_number":"pith:F6QPL72A","schema_version":"1.0","canonical_sha256":"2fa0f5ff40ef1e305dc249fa08474c851af3b81df04d99d2d3df724ad6f4f25c","source":{"kind":"arxiv","id":"2302.07612","version":2},"attestation_state":"computed","paper":{"title":"Towards Optimal Compression: Joint Pruning and Quantization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adrian Alan Pol, Ben Zandonati, Glenn Bucagu, Maurizio Pierini, Olya Sirkin, Tal Kopetz","submitted_at":"2023-02-15T12:02:30Z","abstract_excerpt":"Model compression is instrumental in optimizing deep neural network inference on resource-constrained hardware. The prevailing methods for network compression, namely quantization and pruning, have been shown to enhance efficiency at the cost of performance. Determining the most effective quantization and pruning strategies for individual layers and parameters remains a challenging problem, often requiring computationally expensive and ad hoc numerical optimization techniques. This paper introduces FITCompress, a novel method integrating layer-wise mixed-precision quantization and unstructured"},"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":"2302.07612","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-15T12:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"0b427d7c75a3a040be7bdbbd8856004fd4d926266b0461c40a845ff2bbda3fc2","abstract_canon_sha256":"34fd79e4016de1b3059ec19737accb7e4acba327dfe3a481d014407060eac7db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:18.363045Z","signature_b64":"9EU+d5JNf/PV+SWI9mZKuvxO/AgLGW5LbJuXTfB8hgi3Z4TDPgFXv6ZUT+jor2sAuPMd/XRns2dsipZXk472Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa0f5ff40ef1e305dc249fa08474c851af3b81df04d99d2d3df724ad6f4f25c","last_reissued_at":"2026-07-05T06:19:18.362556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:18.362556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Compression: Joint Pruning and Quantization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adrian Alan Pol, Ben Zandonati, Glenn Bucagu, Maurizio Pierini, Olya Sirkin, Tal Kopetz","submitted_at":"2023-02-15T12:02:30Z","abstract_excerpt":"Model compression is instrumental in optimizing deep neural network inference on resource-constrained hardware. The prevailing methods for network compression, namely quantization and pruning, have been shown to enhance efficiency at the cost of performance. Determining the most effective quantization and pruning strategies for individual layers and parameters remains a challenging problem, often requiring computationally expensive and ad hoc numerical optimization techniques. This paper introduces FITCompress, a novel method integrating layer-wise mixed-precision quantization and unstructured"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07612","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/2302.07612/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":"2302.07612","created_at":"2026-07-05T06:19:18.362614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07612v2","created_at":"2026-07-05T06:19:18.362614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07612","created_at":"2026-07-05T06:19:18.362614+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6QPL72A54PD","created_at":"2026-07-05T06:19:18.362614+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6QPL72A54PDAXOC","created_at":"2026-07-05T06:19:18.362614+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6QPL72A","created_at":"2026-07-05T06:19:18.362614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.17733","citing_title":"MXSens: Sensitivity-Aware Mixed-Precision Quantization for Efficient LLM Inference","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU","json":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU.json","graph_json":"https://pith.science/api/pith-number/F6QPL72A54PDAXOCJH5AQR2MQU/graph.json","events_json":"https://pith.science/api/pith-number/F6QPL72A54PDAXOCJH5AQR2MQU/events.json","paper":"https://pith.science/paper/F6QPL72A"},"agent_actions":{"view_html":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU","download_json":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU.json","view_paper":"https://pith.science/paper/F6QPL72A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07612&json=true","fetch_graph":"https://pith.science/api/pith-number/F6QPL72A54PDAXOCJH5AQR2MQU/graph.json","fetch_events":"https://pith.science/api/pith-number/F6QPL72A54PDAXOCJH5AQR2MQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU/action/storage_attestation","attest_author":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU/action/author_attestation","sign_citation":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU/action/citation_signature","submit_replication":"https://pith.science/pith/F6QPL72A54PDAXOCJH5AQR2MQU/action/replication_record"}},"created_at":"2026-07-05T06:19:18.362614+00:00","updated_at":"2026-07-05T06:19:18.362614+00:00"}