{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G3BWTZ74FZSMACUNZIU4HZZGPJ","short_pith_number":"pith:G3BWTZ74","schema_version":"1.0","canonical_sha256":"36c369e7fc2e64c00a8dca29c3e7267a46c8d122f88a38c5c866d80ba28b0aba","source":{"kind":"arxiv","id":"1606.00112","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00112","created_at":"2026-05-18T01:13:05.904379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00112v1","created_at":"2026-05-18T01:13:05.904379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00112","created_at":"2026-05-18T01:13:05.904379+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3BWTZ74FZSM","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3BWTZ74FZSMACUN","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3BWTZ74","created_at":"2026-05-18T12:30:15.759754+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/G3BWTZ74FZSMACUNZIU4HZZGPJ","json":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ.json","graph_json":"https://pith.science/api/pith-number/G3BWTZ74FZSMACUNZIU4HZZGPJ/graph.json","events_json":"https://pith.science/api/pith-number/G3BWTZ74FZSMACUNZIU4HZZGPJ/events.json","paper":"https://pith.science/paper/G3BWTZ74"},"agent_actions":{"view_html":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ","download_json":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ.json","view_paper":"https://pith.science/paper/G3BWTZ74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00112&json=true","fetch_graph":"https://pith.science/api/pith-number/G3BWTZ74FZSMACUNZIU4HZZGPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/G3BWTZ74FZSMACUNZIU4HZZGPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/action/storage_attestation","attest_author":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/action/author_attestation","sign_citation":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/action/citation_signature","submit_replication":"https://pith.science/pith/G3BWTZ74FZSMACUNZIU4HZZGPJ/action/replication_record"}},"created_at":"2026-05-18T01:13:05.904379+00:00","updated_at":"2026-05-18T01:13:05.904379+00:00"}