{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HZPKZ24PXGVG5RVFVMFPOHAXFA","short_pith_number":"pith:HZPKZ24P","schema_version":"1.0","canonical_sha256":"3e5eaceb8fb9aa6ec6a5ab0af71c1728395d3239e7cdfaa96ad1b2683ac46dcc","source":{"kind":"arxiv","id":"1702.03044","version":2},"attestation_state":"computed","paper":{"title":"Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.CV","authors_text":"Anbang Yao, Aojun Zhou, Lin Xu, Yiwen Guo, Yurong Chen","submitted_at":"2017-02-10T02:30:22Z","abstract_excerpt":"This paper presents incremental network quantization (INQ), a novel method, targeting to efficiently convert any pre-trained full-precision convolutional neural network (CNN) model into a low-precision version whose weights are constrained to be either powers of two or zero. Unlike existing methods which are struggled in noticeable accuracy loss, our INQ has the potential to resolve this issue, as benefiting from two innovations. On one hand, we introduce three interdependent operations, namely weight partition, group-wise quantization and re-training. A well-proven measure is employed to divi"},"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":"1702.03044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-10T02:30:22Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"1c11a5a6f9dce1946cf71c234350853ed35c00e1065932c556f3ed46e6199a7b","abstract_canon_sha256":"fd2339062194b0f8ef5a2b91efd82eef5c985472add26e17dab7b3e33da585c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.475080Z","signature_b64":"b1FtfJhducNIWS0z6l/J+enqTnR2hbkTKXIjlmehnVmrZ9rpLs66RaM0RSGXRf4ChzT+3avYkgLgyUDMjd9pBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5eaceb8fb9aa6ec6a5ab0af71c1728395d3239e7cdfaa96ad1b2683ac46dcc","last_reissued_at":"2026-05-18T00:36:43.474310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.474310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.CV","authors_text":"Anbang Yao, Aojun Zhou, Lin Xu, Yiwen Guo, Yurong Chen","submitted_at":"2017-02-10T02:30:22Z","abstract_excerpt":"This paper presents incremental network quantization (INQ), a novel method, targeting to efficiently convert any pre-trained full-precision convolutional neural network (CNN) model into a low-precision version whose weights are constrained to be either powers of two or zero. Unlike existing methods which are struggled in noticeable accuracy loss, our INQ has the potential to resolve this issue, as benefiting from two innovations. On one hand, we introduce three interdependent operations, namely weight partition, group-wise quantization and re-training. A well-proven measure is employed to divi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03044","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":"1702.03044","created_at":"2026-05-18T00:36:43.474446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03044v2","created_at":"2026-05-18T00:36:43.474446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03044","created_at":"2026-05-18T00:36:43.474446+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZPKZ24PXGVG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZPKZ24PXGVG5RVF","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZPKZ24P","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.05271","citing_title":"A Targeted Acceleration and Compression Framework for Low bit Neural Networks","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"1910.09876","citing_title":"Neural Network Training with Approximate Logarithmic Computations","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2508.06974","citing_title":"Rethinking 1-bit Optimization Leveraging Pre-trained Large Language Models","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04988","citing_title":"Prune-Quantize-Distill: An Ordered Pipeline for Efficient Neural Network Compression","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA","json":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA.json","graph_json":"https://pith.science/api/pith-number/HZPKZ24PXGVG5RVFVMFPOHAXFA/graph.json","events_json":"https://pith.science/api/pith-number/HZPKZ24PXGVG5RVFVMFPOHAXFA/events.json","paper":"https://pith.science/paper/HZPKZ24P"},"agent_actions":{"view_html":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA","download_json":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA.json","view_paper":"https://pith.science/paper/HZPKZ24P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03044&json=true","fetch_graph":"https://pith.science/api/pith-number/HZPKZ24PXGVG5RVFVMFPOHAXFA/graph.json","fetch_events":"https://pith.science/api/pith-number/HZPKZ24PXGVG5RVFVMFPOHAXFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA/action/storage_attestation","attest_author":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA/action/author_attestation","sign_citation":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA/action/citation_signature","submit_replication":"https://pith.science/pith/HZPKZ24PXGVG5RVFVMFPOHAXFA/action/replication_record"}},"created_at":"2026-05-18T00:36:43.474446+00:00","updated_at":"2026-05-18T00:36:43.474446+00:00"}