{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CCOSXCG6L73HK5DOCYUXFJQLWJ","short_pith_number":"pith:CCOSXCG6","schema_version":"1.0","canonical_sha256":"109d2b88de5ff675746e162972a60bb255a30127d12d00358b60259b468337c1","source":{"kind":"arxiv","id":"2401.14732","version":2},"attestation_state":"computed","paper":{"title":"Residual Quantization with Implicit Neural Codebooks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Iris A. M. Huijben, Jakob Verbeek, Matthew Muckley, Matthijs Douze, Ruud J. G. van Sloun","submitted_at":"2024-01-26T09:42:51Z","abstract_excerpt":"Vector quantization is a fundamental operation for data compression and vector search. To obtain high accuracy, multi-codebook methods represent each vector using codewords across several codebooks. Residual quantization (RQ) is one such method, which iteratively quantizes the error of the previous step. While the error distribution is dependent on previously-selected codewords, this dependency is not accounted for in conventional RQ as it uses a fixed codebook per quantization step. In this paper, we propose QINCo, a neural RQ variant that constructs specialized codebooks per step that depend"},"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":"2401.14732","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-26T09:42:51Z","cross_cats_sorted":[],"title_canon_sha256":"8cc6de8f19800e7912ed7b4843aacd607766cf8abc150b25a28133b79e806d59","abstract_canon_sha256":"1cc82507527b02972f4f156f29628daf463f95fb66ee8fd2b598c92243b4994d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:11.748105Z","signature_b64":"xHNtacVhNLrkOxikj6z7gZWq12kQSaRCesVIUmbPeGE7juiZeh25j2ChHJ6ZwNy8TmndbavintHP2rFK4b6uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109d2b88de5ff675746e162972a60bb255a30127d12d00358b60259b468337c1","last_reissued_at":"2026-07-05T08:21:11.747489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:11.747489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Residual Quantization with Implicit Neural Codebooks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Iris A. M. Huijben, Jakob Verbeek, Matthew Muckley, Matthijs Douze, Ruud J. G. van Sloun","submitted_at":"2024-01-26T09:42:51Z","abstract_excerpt":"Vector quantization is a fundamental operation for data compression and vector search. To obtain high accuracy, multi-codebook methods represent each vector using codewords across several codebooks. Residual quantization (RQ) is one such method, which iteratively quantizes the error of the previous step. While the error distribution is dependent on previously-selected codewords, this dependency is not accounted for in conventional RQ as it uses a fixed codebook per quantization step. In this paper, we propose QINCo, a neural RQ variant that constructs specialized codebooks per step that depend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14732","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/2401.14732/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":"2401.14732","created_at":"2026-07-05T08:21:11.747562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14732v2","created_at":"2026-07-05T08:21:11.747562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14732","created_at":"2026-07-05T08:21:11.747562+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCOSXCG6L73H","created_at":"2026-07-05T08:21:11.747562+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCOSXCG6L73HK5DO","created_at":"2026-07-05T08:21:11.747562+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCOSXCG6","created_at":"2026-07-05T08:21:11.747562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02266","citing_title":"HERMES: A Multi-Granularity Labeling Substrate for Pre-training Data Mixtures","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12876","citing_title":"Multi-Bitwidth Quantization for LLMs Using Additive Codebooks","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24144","citing_title":"EVA: Accelerating LLM Decoding via an Efficient Vector Quantization Architecture","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ","json":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ.json","graph_json":"https://pith.science/api/pith-number/CCOSXCG6L73HK5DOCYUXFJQLWJ/graph.json","events_json":"https://pith.science/api/pith-number/CCOSXCG6L73HK5DOCYUXFJQLWJ/events.json","paper":"https://pith.science/paper/CCOSXCG6"},"agent_actions":{"view_html":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ","download_json":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ.json","view_paper":"https://pith.science/paper/CCOSXCG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14732&json=true","fetch_graph":"https://pith.science/api/pith-number/CCOSXCG6L73HK5DOCYUXFJQLWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CCOSXCG6L73HK5DOCYUXFJQLWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ/action/storage_attestation","attest_author":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ/action/author_attestation","sign_citation":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ/action/citation_signature","submit_replication":"https://pith.science/pith/CCOSXCG6L73HK5DOCYUXFJQLWJ/action/replication_record"}},"created_at":"2026-07-05T08:21:11.747562+00:00","updated_at":"2026-07-05T08:21:11.747562+00:00"}