{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2B7XMA3EGNUGA6NQ4NXSGXNODB","short_pith_number":"pith:2B7XMA3E","schema_version":"1.0","canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","source":{"kind":"arxiv","id":"2607.01283","version":1},"attestation_state":"computed","paper":{"title":"Scaling Laws for Grid-Based Approximate Nearest Neighbor Search in High Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chieh-En Li, Jerry Li, Matthew J Liu, Noah Flynn, Siqi Xie, Vidhan Purohit, Wei Hang Zheng","submitted_at":"2026-07-01T08:42:38Z","abstract_excerpt":"Grid-based approaches to approximate nearest neighbor (ANN) search have been absent from modern scaling analyses. We present a systematic characterization of a multiprobe grid algorithm with respect to dataset size $N$ and dimensionality $d$. Our experiments reveal a previously unreported $d$-scaling crossover on the GloVe embedding family, in which multiprobe grid search maintains an approximately constant dimensional scaling exponent while other graph-, tree-, and partitioning-based methods exhibit degrading throughput. The advantage comes with near-linear query scaling in $N$, but also with"},"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":"2607.01283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T08:42:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"35e85f83e78b4169f3a5179bca1b8248952b1612b9109ab4a3c6bfe068485d20","abstract_canon_sha256":"0b79bfe69b59dca200f2a007e081155247fff9e782a1b34e3fec4a7378cde3c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:56.287746Z","signature_b64":"s8p2JqoHuBkPkUuDsycnwZtBTWIls+3MtCDHIzWb54NjdCHGmmXNioyPcaXMjQQY7skalPLxeWcS9ne2tdnADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","last_reissued_at":"2026-07-03T00:16:56.287408Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:56.287408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Laws for Grid-Based Approximate Nearest Neighbor Search in High Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chieh-En Li, Jerry Li, Matthew J Liu, Noah Flynn, Siqi Xie, Vidhan Purohit, Wei Hang Zheng","submitted_at":"2026-07-01T08:42:38Z","abstract_excerpt":"Grid-based approaches to approximate nearest neighbor (ANN) search have been absent from modern scaling analyses. We present a systematic characterization of a multiprobe grid algorithm with respect to dataset size $N$ and dimensionality $d$. Our experiments reveal a previously unreported $d$-scaling crossover on the GloVe embedding family, in which multiprobe grid search maintains an approximately constant dimensional scaling exponent while other graph-, tree-, and partitioning-based methods exhibit degrading throughput. The advantage comes with near-linear query scaling in $N$, but also with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01283","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/2607.01283/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":"2607.01283","created_at":"2026-07-03T00:16:56.287454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01283v1","created_at":"2026-07-03T00:16:56.287454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01283","created_at":"2026-07-03T00:16:56.287454+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B7XMA3EGNUG","created_at":"2026-07-03T00:16:56.287454+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B7XMA3EGNUGA6NQ","created_at":"2026-07-03T00:16:56.287454+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B7XMA3E","created_at":"2026-07-03T00:16:56.287454+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/2B7XMA3EGNUGA6NQ4NXSGXNODB","json":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB.json","graph_json":"https://pith.science/api/pith-number/2B7XMA3EGNUGA6NQ4NXSGXNODB/graph.json","events_json":"https://pith.science/api/pith-number/2B7XMA3EGNUGA6NQ4NXSGXNODB/events.json","paper":"https://pith.science/paper/2B7XMA3E"},"agent_actions":{"view_html":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB","download_json":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB.json","view_paper":"https://pith.science/paper/2B7XMA3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01283&json=true","fetch_graph":"https://pith.science/api/pith-number/2B7XMA3EGNUGA6NQ4NXSGXNODB/graph.json","fetch_events":"https://pith.science/api/pith-number/2B7XMA3EGNUGA6NQ4NXSGXNODB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/action/storage_attestation","attest_author":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/action/author_attestation","sign_citation":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/action/citation_signature","submit_replication":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/action/replication_record"}},"created_at":"2026-07-03T00:16:56.287454+00:00","updated_at":"2026-07-03T00:16:56.287454+00:00"}