{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1999:QBT7Q3M4AYBPI6VLBZDNVOOP6A","short_pith_number":"pith:QBT7Q3M4","canonical_record":{"source":{"id":"cs/9901013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"0af3fb28051d69bcf61d108002f01a46199520139d9cec7e0d0963ffa915215e","abstract_canon_sha256":"fbbed17fcd0f286e839eb5270c8c3515290d489d92bed98d37f9c1433b778232"},"schema_version":"1.0"},"canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","source":{"kind":"arxiv","id":"cs/9901013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9901013","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9901013v1","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9901013","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"QBT7Q3M4AYBP","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"QBT7Q3M4AYBPI6VL","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"QBT7Q3M4","created_at":"2026-07-04T14:25:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1999:QBT7Q3M4AYBPI6VLBZDNVOOP6A","target":"record","payload":{"canonical_record":{"source":{"id":"cs/9901013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"0af3fb28051d69bcf61d108002f01a46199520139d9cec7e0d0963ffa915215e","abstract_canon_sha256":"fbbed17fcd0f286e839eb5270c8c3515290d489d92bed98d37f9c1433b778232"},"schema_version":"1.0"},"canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:09.283552Z","signature_b64":"sdmU7Wm2w5nNxrbG4sBUP9JYhoshV8BbjYlWgRmX9oy86hNtpB9FnH/8mXnpyqfN/BYTxxWVjrjvbJkl+h6OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","last_reissued_at":"2026-07-04T14:25:09.283135Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:09.283135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/9901013","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-04T14:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWfNBV/SSxPGjoUZu0mqbuPYztSKub2Gg0thHRVZFfSA2XQX4X0nYEFBtl9ycyhhxoh1m8irPMw3UcnoxWGlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T19:20:02.095151Z"},"content_sha256":"eef4c27fb0345bdf147d1fc6bc10c2813d034dc16ee6106c99d9d6669750d0e1","schema_version":"1.0","event_id":"sha256:eef4c27fb0345bdf147d1fc6bc10c2813d034dc16ee6106c99d9d6669750d0e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1999:QBT7Q3M4AYBPI6VLBZDNVOOP6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of approximate nearest neighbor searching with clustered point sets","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Songrit Maneewongvatana","submitted_at":"1999-01-26T21:23:37Z","abstract_excerpt":"We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9901013","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/cs/9901013/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-04T14:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxxSLrMu1s9zjjnbQGjzI3QLSP10UiytU1w1/2Q6S80mwMnlxL95YmuXUQVvjQa7t4z2u1HUvWQoBCIDH6VNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T19:20:02.095436Z"},"content_sha256":"eca051211cd39a3656d34838c21a59897e3d0952ba4051a41ef9c2b834e2d2ab","schema_version":"1.0","event_id":"sha256:eca051211cd39a3656d34838c21a59897e3d0952ba4051a41ef9c2b834e2d2ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/bundle.json","state_url":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/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-31T19:20:02Z","links":{"resolver":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A","bundle":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/bundle.json","state":"https://pith.science/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBT7Q3M4AYBPI6VLBZDNVOOP6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1999:QBT7Q3M4AYBPI6VLBZDNVOOP6A","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":"fbbed17fcd0f286e839eb5270c8c3515290d489d92bed98d37f9c1433b778232","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","title_canon_sha256":"0af3fb28051d69bcf61d108002f01a46199520139d9cec7e0d0963ffa915215e"},"schema_version":"1.0","source":{"id":"cs/9901013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9901013","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9901013v1","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9901013","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"QBT7Q3M4AYBP","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"QBT7Q3M4AYBPI6VL","created_at":"2026-07-04T14:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"QBT7Q3M4","created_at":"2026-07-04T14:25:09Z"}],"graph_snapshots":[{"event_id":"sha256:eca051211cd39a3656d34838c21a59897e3d0952ba4051a41ef9c2b834e2d2ab","target":"graph","created_at":"2026-07-04T14:25:09Z","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/cs/9901013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the","authors_text":"David M. Mount, Songrit Maneewongvatana","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","title":"Analysis of approximate nearest neighbor searching with clustered point sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9901013","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:eef4c27fb0345bdf147d1fc6bc10c2813d034dc16ee6106c99d9d6669750d0e1","target":"record","created_at":"2026-07-04T14:25:09Z","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":"fbbed17fcd0f286e839eb5270c8c3515290d489d92bed98d37f9c1433b778232","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"1999-01-26T21:23:37Z","title_canon_sha256":"0af3fb28051d69bcf61d108002f01a46199520139d9cec7e0d0963ffa915215e"},"schema_version":"1.0","source":{"id":"cs/9901013","kind":"arxiv","version":1}},"canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8067f86d9c0602f47aab0e46dab9cff01bd2ba8b77753f685c9c15fcecf2d5e9","first_computed_at":"2026-07-04T14:25:09.283135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:25:09.283135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sdmU7Wm2w5nNxrbG4sBUP9JYhoshV8BbjYlWgRmX9oy86hNtpB9FnH/8mXnpyqfN/BYTxxWVjrjvbJkl+h6OBA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:25:09.283552Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9901013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eef4c27fb0345bdf147d1fc6bc10c2813d034dc16ee6106c99d9d6669750d0e1","sha256:eca051211cd39a3656d34838c21a59897e3d0952ba4051a41ef9c2b834e2d2ab"],"state_sha256":"adb126c1ef2d7b9172c833aff5c747d30cbd57daba998438dc55e34e15b69b8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVvP8YFG0Ck9hA9ZOr2yHcHf7L2nVDRa+lrT0i9J4N7L4yXCd1hgUbyjCSQfccv3O+U2NGasvtXcEj52SabdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T19:20:02.100143Z","bundle_sha256":"a3988f926f5a6a18e983f1ddd0e550fdafc11a634e2c9b742ebdff86965bd16f"}}