{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G3BWTZ74FZSMACUNZIU4HZZGPJ","short_pith_number":"pith:G3BWTZ74","canonical_record":{"source":{"id":"1606.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T04:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"e15bb588fa210ad725458fbe78f41cff42525faac45e56a001430c9a6b80328f","abstract_canon_sha256":"12dc933552df252c8f6c02882fa1df29c649696be14873e961258726fb34bc1d"},"schema_version":"1.0"},"canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","source":{"kind":"arxiv","id":"1606.00112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00112","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00112v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00112","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"G3BWTZ74FZSM","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3BWTZ74FZSMACUN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3BWTZ74","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G3BWTZ74FZSMACUNZIU4HZZGPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T04:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"e15bb588fa210ad725458fbe78f41cff42525faac45e56a001430c9a6b80328f","abstract_canon_sha256":"12dc933552df252c8f6c02882fa1df29c649696be14873e961258726fb34bc1d"},"schema_version":"1.0"},"canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.904691Z","signature_b64":"eZb8h/00Tj9JHOVNQDpo/Gz1sbtDVBviHG7fJmW893ewLhIbsOt2KTp7IoGrjBAX96lPCj/v9RBKULTJu2N6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","last_reissued_at":"2026-05-18T01:13:05.904306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.904306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00112","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-05-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2Dr7vZWbXzMVhJWmJhNpJC8IbiL30CheLd7U5cqN18gOYEFPdKZtrOIbSKSCQYNGoyg6Lg2MhyfPT1slTgfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:41:28.212088Z"},"content_sha256":"dc5435a023944cb8770fbbbc1c71204b608482c9946f7bfb119052ab9ae50b61","schema_version":"1.0","event_id":"sha256:dc5435a023944cb8770fbbbc1c71204b608482c9946f7bfb119052ab9ae50b61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G3BWTZ74FZSMACUNZIU4HZZGPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearest-Neighbor Searching Under Uncertainty II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Jeff M. Philips, Ke Yi, Pankaj K. Agarwal, Sariel Har-Peled, Wuzhou Zhang","submitted_at":"2016-06-01T04:36:43Z","abstract_excerpt":"Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest-neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for\n  - computing all points that are nearest neighbors of a query "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00112","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":""},"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-05-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fp8bzmkJxZifo9gt8u5MRkLFA3DK7vw9iR96aGz9cyOyQnir31x2Js/m4W+HqgA9alx2UEbpLrq1Nzz3ie2qBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:41:28.212829Z"},"content_sha256":"a4f065ff1b4bfae15753189adc91f7ea3f6a8e6ef4fd8e547a3b1a94b2438429","schema_version":"1.0","event_id":"sha256:a4f065ff1b4bfae15753189adc91f7ea3f6a8e6ef4fd8e547a3b1a94b2438429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/bundle.json","state_url":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/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-06-08T15:41:28Z","links":{"resolver":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ","bundle":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/bundle.json","state":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G3BWTZ74FZSMACUNZIU4HZZGPJ","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":"12dc933552df252c8f6c02882fa1df29c649696be14873e961258726fb34bc1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T04:36:43Z","title_canon_sha256":"e15bb588fa210ad725458fbe78f41cff42525faac45e56a001430c9a6b80328f"},"schema_version":"1.0","source":{"id":"1606.00112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00112","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00112v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00112","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"G3BWTZ74FZSM","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3BWTZ74FZSMACUN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3BWTZ74","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:a4f065ff1b4bfae15753189adc91f7ea3f6a8e6ef4fd8e547a3b1a94b2438429","target":"graph","created_at":"2026-05-18T01:13:05Z","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"},"paper":{"abstract_excerpt":"Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest-neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for\n  - computing all points that are nearest neighbors of a query ","authors_text":"Boris Aronov, Jeff M. Philips, Ke Yi, Pankaj K. Agarwal, Sariel Har-Peled, Wuzhou Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T04:36:43Z","title":"Nearest-Neighbor Searching Under Uncertainty II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00112","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:dc5435a023944cb8770fbbbc1c71204b608482c9946f7bfb119052ab9ae50b61","target":"record","created_at":"2026-05-18T01:13:05Z","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":"12dc933552df252c8f6c02882fa1df29c649696be14873e961258726fb34bc1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T04:36:43Z","title_canon_sha256":"e15bb588fa210ad725458fbe78f41cff42525faac45e56a001430c9a6b80328f"},"schema_version":"1.0","source":{"id":"1606.00112","kind":"arxiv","version":1}},"canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","first_computed_at":"2026-05-18T01:13:05.904306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.904306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eZb8h/00Tj9JHOVNQDpo/Gz1sbtDVBviHG7fJmW893ewLhIbsOt2KTp7IoGrjBAX96lPCj/v9RBKULTJu2N6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.904691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5435a023944cb8770fbbbc1c71204b608482c9946f7bfb119052ab9ae50b61","sha256:a4f065ff1b4bfae15753189adc91f7ea3f6a8e6ef4fd8e547a3b1a94b2438429"],"state_sha256":"af8dd033e746d69ecbcefb16bb574e7846aaa12ba25245b3d8ff1596c7821fb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fC1N9bbaX/5qx+YcdT9w1MUCKUzGTpEbc8sAbSDmUqZapPy4H13KSIHaePyrAA6dTsOPQL4oyFHYqBkQnSYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:41:28.219508Z","bundle_sha256":"d22003692b6e14a4331e279052a62cc76a28f3a0ccff95d3c9347b368060ea2c"}}