{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CXRMH4KG3TUYKMEAWPDDJJ3LVI","short_pith_number":"pith:CXRMH4KG","schema_version":"1.0","canonical_sha256":"15e2c3f146dce9853080b3c634a76baa125d44e2832327907edb2fe35b5a074a","source":{"kind":"arxiv","id":"2102.10462","version":1},"attestation_state":"computed","paper":{"title":"BSQ: Exploring Bit-Level Sparsity for Mixed-Precision Neural Network Quantization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hai Li, Huanrui Yang, Lin Duan, Yiran Chen","submitted_at":"2021-02-20T22:37:41Z","abstract_excerpt":"Mixed-precision quantization can potentially achieve the optimal tradeoff between performance and compression rate of deep neural networks, and thus, have been widely investigated. However, it lacks a systematic method to determine the exact quantization scheme. Previous methods either examine only a small manually-designed search space or utilize a cumbersome neural architecture search to explore the vast search space. These approaches cannot lead to an optimal quantization scheme efficiently. This work proposes bit-level sparsity quantization (BSQ) to tackle the mixed-precision quantization "},"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":"2102.10462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T22:37:41Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a964434da5bceba70e6383b61630bf7dd159ddf50278e087cc051cff624796d7","abstract_canon_sha256":"bc1b89a1b11e6783a7df3d2ffd1ded680ee3f8a5a2e6f1c82a89626e77abc9f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:58.187743Z","signature_b64":"lVJOzU5o6UtW230L/jYyeu7nKOIqyhhxt+TJB4TIX2+EEq71rpL0AN1rsU1UIFtpjz/9MfW6gnh/NNtTO/TdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e2c3f146dce9853080b3c634a76baa125d44e2832327907edb2fe35b5a074a","last_reissued_at":"2026-07-05T02:16:58.187207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:58.187207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BSQ: Exploring Bit-Level Sparsity for Mixed-Precision Neural Network Quantization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hai Li, Huanrui Yang, Lin Duan, Yiran Chen","submitted_at":"2021-02-20T22:37:41Z","abstract_excerpt":"Mixed-precision quantization can potentially achieve the optimal tradeoff between performance and compression rate of deep neural networks, and thus, have been widely investigated. However, it lacks a systematic method to determine the exact quantization scheme. Previous methods either examine only a small manually-designed search space or utilize a cumbersome neural architecture search to explore the vast search space. These approaches cannot lead to an optimal quantization scheme efficiently. This work proposes bit-level sparsity quantization (BSQ) to tackle the mixed-precision quantization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10462","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/2102.10462/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":"2102.10462","created_at":"2026-07-05T02:16:58.187265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10462v1","created_at":"2026-07-05T02:16:58.187265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10462","created_at":"2026-07-05T02:16:58.187265+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXRMH4KG3TUY","created_at":"2026-07-05T02:16:58.187265+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXRMH4KG3TUYKMEA","created_at":"2026-07-05T02:16:58.187265+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXRMH4KG","created_at":"2026-07-05T02:16:58.187265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18475","citing_title":"GAMMA: Global Bit Allocation for Mixed-Precision Models under Arbitrary Budgets","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06836","citing_title":"STQuant: Spatio-Temporal Adaptive Framework for Optimizer Quantization in Large Multimodal Model Training","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI","json":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI.json","graph_json":"https://pith.science/api/pith-number/CXRMH4KG3TUYKMEAWPDDJJ3LVI/graph.json","events_json":"https://pith.science/api/pith-number/CXRMH4KG3TUYKMEAWPDDJJ3LVI/events.json","paper":"https://pith.science/paper/CXRMH4KG"},"agent_actions":{"view_html":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI","download_json":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI.json","view_paper":"https://pith.science/paper/CXRMH4KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10462&json=true","fetch_graph":"https://pith.science/api/pith-number/CXRMH4KG3TUYKMEAWPDDJJ3LVI/graph.json","fetch_events":"https://pith.science/api/pith-number/CXRMH4KG3TUYKMEAWPDDJJ3LVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI/action/storage_attestation","attest_author":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI/action/author_attestation","sign_citation":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI/action/citation_signature","submit_replication":"https://pith.science/pith/CXRMH4KG3TUYKMEAWPDDJJ3LVI/action/replication_record"}},"created_at":"2026-07-05T02:16:58.187265+00:00","updated_at":"2026-07-05T02:16:58.187265+00:00"}