{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2B7XMA3EGNUGA6NQ4NXSGXNODB","short_pith_number":"pith:2B7XMA3E","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"},"canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","source":{"kind":"arxiv","id":"2607.01283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01283","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01283v1","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01283","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"2B7XMA3EGNUG","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_16","alias_value":"2B7XMA3EGNUGA6NQ","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_8","alias_value":"2B7XMA3E","created_at":"2026-07-03T00:16:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2B7XMA3EGNUGA6NQ4NXSGXNODB","target":"record","payload":{"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"},"canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","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"},"source_kind":"arxiv","source_id":"2607.01283","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T00:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GdxVUhLd2PXfdEK2NCe+7K/MDyXi3HcKJXrIEL8954uj0EWYr5sSwtUmPHkQx9ZWEzW5+Nat2prW6Pa++c5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:06:38.634437Z"},"content_sha256":"4b55c0149816db9cc87977917f5162bcc740ce9f2aefc25937eea7a088a86cc1","schema_version":"1.0","event_id":"sha256:4b55c0149816db9cc87977917f5162bcc740ce9f2aefc25937eea7a088a86cc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2B7XMA3EGNUGA6NQ4NXSGXNODB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T00:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt29eCahSBeKNGr6Lr5mnHUkdGUZc1pE9bDzfTeguo9lbaMff8nJ9j9MuOFdiw3FHWfqakjs72K1B4YLAjq1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:06:38.634833Z"},"content_sha256":"ea912159b25f5ed8c8406a7bfa6df7ca859b7a7c75e85633b1c72398954d9793","schema_version":"1.0","event_id":"sha256:ea912159b25f5ed8c8406a7bfa6df7ca859b7a7c75e85633b1c72398954d9793"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/bundle.json","state_url":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T11:06:38Z","links":{"resolver":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB","bundle":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/bundle.json","state":"https://pith.science/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B7XMA3EGNUGA6NQ4NXSGXNODB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2B7XMA3EGNUGA6NQ4NXSGXNODB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b79bfe69b59dca200f2a007e081155247fff9e782a1b34e3fec4a7378cde3c8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T08:42:38Z","title_canon_sha256":"35e85f83e78b4169f3a5179bca1b8248952b1612b9109ab4a3c6bfe068485d20"},"schema_version":"1.0","source":{"id":"2607.01283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01283","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01283v1","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01283","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"2B7XMA3EGNUG","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_16","alias_value":"2B7XMA3EGNUGA6NQ","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_8","alias_value":"2B7XMA3E","created_at":"2026-07-03T00:16:56Z"}],"graph_snapshots":[{"event_id":"sha256:ea912159b25f5ed8c8406a7bfa6df7ca859b7a7c75e85633b1c72398954d9793","target":"graph","created_at":"2026-07-03T00:16:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01283/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chieh-En Li, Jerry Li, Matthew J Liu, Noah Flynn, Siqi Xie, Vidhan Purohit, Wei Hang Zheng","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T08:42:38Z","title":"Scaling Laws for Grid-Based Approximate Nearest Neighbor Search in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01283","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b55c0149816db9cc87977917f5162bcc740ce9f2aefc25937eea7a088a86cc1","target":"record","created_at":"2026-07-03T00:16:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b79bfe69b59dca200f2a007e081155247fff9e782a1b34e3fec4a7378cde3c8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T08:42:38Z","title_canon_sha256":"35e85f83e78b4169f3a5179bca1b8248952b1612b9109ab4a3c6bfe068485d20"},"schema_version":"1.0","source":{"id":"2607.01283","kind":"arxiv","version":1}},"canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d07f76036433686079b0e36f235dae187c0ae67ac9ad7ce6fa90beac4771736e","first_computed_at":"2026-07-03T00:16:56.287408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:16:56.287408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8p2JqoHuBkPkUuDsycnwZtBTWIls+3MtCDHIzWb54NjdCHGmmXNioyPcaXMjQQY7skalPLxeWcS9ne2tdnADA==","signature_status":"signed_v1","signed_at":"2026-07-03T00:16:56.287746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b55c0149816db9cc87977917f5162bcc740ce9f2aefc25937eea7a088a86cc1","sha256:ea912159b25f5ed8c8406a7bfa6df7ca859b7a7c75e85633b1c72398954d9793"],"state_sha256":"e30970765bc3e957da4017302b5213219d1f21843ab6c15c88266edf0482f957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIoeb6T0G1KyZt+w5LYDpqmebh6WTPR7PF0noVzWLARi1TJHlWXDO1YKGvn75jQA6eiLDt/6iWl08Gp26IdDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:06:38.637173Z","bundle_sha256":"18a1f2a184cfd8c8d566b03a11543ab2e144a93862980d60d764722692aefd83"}}