{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3BZMRM5SK2LSUULTNUO7K3VSSE","short_pith_number":"pith:3BZMRM5S","schema_version":"1.0","canonical_sha256":"d872c8b3b256972a51736d1df56eb291335e2cc38fb2b028d985788bbc024390","source":{"kind":"arxiv","id":"2606.11780","version":1},"attestation_state":"computed","paper":{"title":"What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Koki Okajima, Tsukasa Yoshida","submitted_at":"2026-06-10T08:11:41Z","abstract_excerpt":"We establish conditions for embedding a corpus of $N$ documents as $d$-dimensional vectors such that every $k$-subset $S \\subseteq [N]$ is realizable as a result of top-$k$ retrieval by some query vector. Recent work shows that $d = O(k)$ suffices for such embeddings to exist in $\\mathbb{R}^d$, independently of $N$. We theoretically prove that this corpus-independent bound is specific to infinite precision. With $B$ bits per coordinate, perfect top-$k$ retrieval requires $Bd = \\Omega(k \\ln N)$; thus, at any fixed precision, the dimension must grow at least logarithmically with $N$. Specializin"},"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":"2606.11780","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-10T08:11:41Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"ceeb451d253048ce3c6af33e0573a0172792a09e87d7f09f4a3c55d387d90f83","abstract_canon_sha256":"d2bf2905e771b58a1a038f97eb8ae55f86aa6d14746687fa3c39d20ed8defa1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:07.427490Z","signature_b64":"HHRocTRiBu4udTRYyaG55OAuKOd9TTYuCk8b+pUWpUm40BL05CB9YtX6UmgfUnxdM14B29SpqoMUh+wy2+c6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d872c8b3b256972a51736d1df56eb291335e2cc38fb2b028d985788bbc024390","last_reissued_at":"2026-06-11T01:10:07.426637Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:07.426637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Koki Okajima, Tsukasa Yoshida","submitted_at":"2026-06-10T08:11:41Z","abstract_excerpt":"We establish conditions for embedding a corpus of $N$ documents as $d$-dimensional vectors such that every $k$-subset $S \\subseteq [N]$ is realizable as a result of top-$k$ retrieval by some query vector. Recent work shows that $d = O(k)$ suffices for such embeddings to exist in $\\mathbb{R}^d$, independently of $N$. We theoretically prove that this corpus-independent bound is specific to infinite precision. With $B$ bits per coordinate, perfect top-$k$ retrieval requires $Bd = \\Omega(k \\ln N)$; thus, at any fixed precision, the dimension must grow at least logarithmically with $N$. Specializin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11780","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/2606.11780/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":"2606.11780","created_at":"2026-06-11T01:10:07.426776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11780v1","created_at":"2026-06-11T01:10:07.426776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11780","created_at":"2026-06-11T01:10:07.426776+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BZMRM5SK2LS","created_at":"2026-06-11T01:10:07.426776+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BZMRM5SK2LSUULT","created_at":"2026-06-11T01:10:07.426776+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BZMRM5S","created_at":"2026-06-11T01:10:07.426776+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE","json":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE.json","graph_json":"https://pith.science/api/pith-number/3BZMRM5SK2LSUULTNUO7K3VSSE/graph.json","events_json":"https://pith.science/api/pith-number/3BZMRM5SK2LSUULTNUO7K3VSSE/events.json","paper":"https://pith.science/paper/3BZMRM5S"},"agent_actions":{"view_html":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE","download_json":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE.json","view_paper":"https://pith.science/paper/3BZMRM5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11780&json=true","fetch_graph":"https://pith.science/api/pith-number/3BZMRM5SK2LSUULTNUO7K3VSSE/graph.json","fetch_events":"https://pith.science/api/pith-number/3BZMRM5SK2LSUULTNUO7K3VSSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE/action/storage_attestation","attest_author":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE/action/author_attestation","sign_citation":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE/action/citation_signature","submit_replication":"https://pith.science/pith/3BZMRM5SK2LSUULTNUO7K3VSSE/action/replication_record"}},"created_at":"2026-06-11T01:10:07.426776+00:00","updated_at":"2026-06-11T01:10:07.426776+00:00"}