{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SDIQOYEY4N4FCDMPXLBC6PIDXY","short_pith_number":"pith:SDIQOYEY","canonical_record":{"source":{"id":"2607.09909","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T18:59:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"31e1cbc631739d5258f943bc7cffb7744ec7a0aa00d034c7eeadaa38156253fa","abstract_canon_sha256":"070faf5ff222346a867a7fffb9968a66857f37f89f537997abc4106f3e3f8512"},"schema_version":"1.0"},"canonical_sha256":"90d1076098e378510d8fbac22f3d03be3a1d6624de9207ab440ce3f09ca98c52","source":{"kind":"arxiv","id":"2607.09909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09909","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09909v1","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09909","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"SDIQOYEY4N4F","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_16","alias_value":"SDIQOYEY4N4FCDMP","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_8","alias_value":"SDIQOYEY","created_at":"2026-07-14T00:18:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SDIQOYEY4N4FCDMPXLBC6PIDXY","target":"record","payload":{"canonical_record":{"source":{"id":"2607.09909","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T18:59:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"31e1cbc631739d5258f943bc7cffb7744ec7a0aa00d034c7eeadaa38156253fa","abstract_canon_sha256":"070faf5ff222346a867a7fffb9968a66857f37f89f537997abc4106f3e3f8512"},"schema_version":"1.0"},"canonical_sha256":"90d1076098e378510d8fbac22f3d03be3a1d6624de9207ab440ce3f09ca98c52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T00:18:42.499870Z","signature_b64":"tgMd8lqo352NNbFG7NHxkFzUPWxLOKPvNi8wfxWtHfnbiCmvrXgZ6WH8v3Klm5mhNVlyr5haPwZmszK3/0kFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d1076098e378510d8fbac22f3d03be3a1d6624de9207ab440ce3f09ca98c52","last_reissued_at":"2026-07-14T00:18:42.498999Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T00:18:42.498999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.09909","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-14T00:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0T3/trGVh/8EFEaesxLHOXCVSUvexVpRK/+CjUGY1wuTqlTLQEdc9hrGGig+EuXHyKtvDab7qRoFL7gIVd4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:54:02.928168Z"},"content_sha256":"28f4e1b54ad4d7ed421499f25ffa29d01ff6a50ed93bbbd469d57b155bbd752a","schema_version":"1.0","event_id":"sha256:28f4e1b54ad4d7ed421499f25ffa29d01ff6a50ed93bbbd469d57b155bbd752a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SDIQOYEY4N4FCDMPXLBC6PIDXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Partition Trees for Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ashwin Padaki, Erik Waingarten, Sanjeev Khanna","submitted_at":"2026-07-10T18:59:31Z","abstract_excerpt":"We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \\subset \\mathbb{R}^d$ of size $n$ and sample access to a query distribution over $\\mathbb{R}^d$, the goal is to learn a data structure optimized for queries drawn from that specific distribution. We focus on the class of balanced halfspace trees, which naturally abstracts space-partitioning frameworks like locality-sensitive hashing. Assuming Gaussian-like marginal conditions on the dataset and query distribution, we give an efficient algorithm that learns a tree achieving $o(nd)$ query ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09909","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.09909/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-14T00:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ascgjuseLNM6qWVHo7FKQ+ZfXdPG0dXfIBPNEJW40H4ewi0TZ8942M/VNJW7xi6w5UxArxxU7Lt7s9KHjQL5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:54:02.928543Z"},"content_sha256":"766f10ca3d788fd9b7264ad5ca9fe2b328e72400990a001a1d8894ca23c95c7a","schema_version":"1.0","event_id":"sha256:766f10ca3d788fd9b7264ad5ca9fe2b328e72400990a001a1d8894ca23c95c7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/bundle.json","state_url":"https://pith.science/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/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-08-23T23:54:02Z","links":{"resolver":"https://pith.science/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY","bundle":"https://pith.science/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/bundle.json","state":"https://pith.science/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDIQOYEY4N4FCDMPXLBC6PIDXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SDIQOYEY4N4FCDMPXLBC6PIDXY","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":"070faf5ff222346a867a7fffb9968a66857f37f89f537997abc4106f3e3f8512","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T18:59:31Z","title_canon_sha256":"31e1cbc631739d5258f943bc7cffb7744ec7a0aa00d034c7eeadaa38156253fa"},"schema_version":"1.0","source":{"id":"2607.09909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09909","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09909v1","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09909","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"SDIQOYEY4N4F","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_16","alias_value":"SDIQOYEY4N4FCDMP","created_at":"2026-07-14T00:18:42Z"},{"alias_kind":"pith_short_8","alias_value":"SDIQOYEY","created_at":"2026-07-14T00:18:42Z"}],"graph_snapshots":[{"event_id":"sha256:766f10ca3d788fd9b7264ad5ca9fe2b328e72400990a001a1d8894ca23c95c7a","target":"graph","created_at":"2026-07-14T00:18:42Z","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.09909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \\subset \\mathbb{R}^d$ of size $n$ and sample access to a query distribution over $\\mathbb{R}^d$, the goal is to learn a data structure optimized for queries drawn from that specific distribution. We focus on the class of balanced halfspace trees, which naturally abstracts space-partitioning frameworks like locality-sensitive hashing. Assuming Gaussian-like marginal conditions on the dataset and query distribution, we give an efficient algorithm that learns a tree achieving $o(nd)$ query ti","authors_text":"Ashwin Padaki, Erik Waingarten, Sanjeev Khanna","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T18:59:31Z","title":"Learning Partition Trees for Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09909","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:28f4e1b54ad4d7ed421499f25ffa29d01ff6a50ed93bbbd469d57b155bbd752a","target":"record","created_at":"2026-07-14T00:18:42Z","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":"070faf5ff222346a867a7fffb9968a66857f37f89f537997abc4106f3e3f8512","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T18:59:31Z","title_canon_sha256":"31e1cbc631739d5258f943bc7cffb7744ec7a0aa00d034c7eeadaa38156253fa"},"schema_version":"1.0","source":{"id":"2607.09909","kind":"arxiv","version":1}},"canonical_sha256":"90d1076098e378510d8fbac22f3d03be3a1d6624de9207ab440ce3f09ca98c52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90d1076098e378510d8fbac22f3d03be3a1d6624de9207ab440ce3f09ca98c52","first_computed_at":"2026-07-14T00:18:42.498999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T00:18:42.498999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgMd8lqo352NNbFG7NHxkFzUPWxLOKPvNi8wfxWtHfnbiCmvrXgZ6WH8v3Klm5mhNVlyr5haPwZmszK3/0kFDQ==","signature_status":"signed_v1","signed_at":"2026-07-14T00:18:42.499870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28f4e1b54ad4d7ed421499f25ffa29d01ff6a50ed93bbbd469d57b155bbd752a","sha256:766f10ca3d788fd9b7264ad5ca9fe2b328e72400990a001a1d8894ca23c95c7a"],"state_sha256":"dc2b01b9bd82a870bed3b070450c2dc9097494d4a736515bd586b107ff23af5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUpiX5wXBrQepNTJmS3POKOC/M8uKxi4bn5szRo95rVJ2leW1LQ7qyp16d6DWO6ZfnXu1rn/dm5KVJc3YHIiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T23:54:02.931233Z","bundle_sha256":"289b0bda4928bdde33480cd1d4b29bec6e99645d76a70e49beebf0a11bd2224e"}}