{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G5RXS2FQ2KZ4MYCBVTHUE63PVW","short_pith_number":"pith:G5RXS2FQ","schema_version":"1.0","canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","source":{"kind":"arxiv","id":"1604.02188","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Piotr Indyk, Robert Kleinberg, Sepideh Mahabadi, Yang Yuan","submitted_at":"2016-04-07T22:31:38Z","abstract_excerpt":"Motivated by applications in computer vision and databases, we introduce and study the Simultaneous Nearest Neighbor Search (SNN) problem. Given a set of data points, the goal of SNN is to design a data structure that, given a collection of queries, finds a collection of close points that are compatible with each other. Formally, we are given $k$ query points $Q=q_1,\\cdots,q_k$, and a compatibility graph $G$ with vertices in $Q$, and the goal is to return data points $p_1,\\cdots,p_k$ that minimize (i) the weighted sum of the distances from $q_i$ to $p_i$ and (ii) the weighted sum, over all edg"},"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":"1604.02188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T22:31:38Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"231fce5ac3cce1e64a5e55f3d9aa4f0b48d90c2edcde545901b86392201b7759","abstract_canon_sha256":"63973023e8ea17f130fbff73d4ab2a2355295024f057e55e1a7878e7c01e6f51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:28.255089Z","signature_b64":"N1pftmlx3MOW9iWt00sBJEGv6gSjOvK9cd+wC4qESkYrpiNio96c23eJENrc/vRlag20bJPoC4IUH71lIMNUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","last_reissued_at":"2026-05-18T01:17:28.254390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:28.254390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Piotr Indyk, Robert Kleinberg, Sepideh Mahabadi, Yang Yuan","submitted_at":"2016-04-07T22:31:38Z","abstract_excerpt":"Motivated by applications in computer vision and databases, we introduce and study the Simultaneous Nearest Neighbor Search (SNN) problem. Given a set of data points, the goal of SNN is to design a data structure that, given a collection of queries, finds a collection of close points that are compatible with each other. Formally, we are given $k$ query points $Q=q_1,\\cdots,q_k$, and a compatibility graph $G$ with vertices in $Q$, and the goal is to return data points $p_1,\\cdots,p_k$ that minimize (i) the weighted sum of the distances from $q_i$ to $p_i$ and (ii) the weighted sum, over all edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02188","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":"1604.02188","created_at":"2026-05-18T01:17:28.254510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02188v1","created_at":"2026-05-18T01:17:28.254510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02188","created_at":"2026-05-18T01:17:28.254510+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5RXS2FQ2KZ4","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5RXS2FQ2KZ4MYCB","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5RXS2FQ","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/G5RXS2FQ2KZ4MYCBVTHUE63PVW","json":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW.json","graph_json":"https://pith.science/api/pith-number/G5RXS2FQ2KZ4MYCBVTHUE63PVW/graph.json","events_json":"https://pith.science/api/pith-number/G5RXS2FQ2KZ4MYCBVTHUE63PVW/events.json","paper":"https://pith.science/paper/G5RXS2FQ"},"agent_actions":{"view_html":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW","download_json":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW.json","view_paper":"https://pith.science/paper/G5RXS2FQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02188&json=true","fetch_graph":"https://pith.science/api/pith-number/G5RXS2FQ2KZ4MYCBVTHUE63PVW/graph.json","fetch_events":"https://pith.science/api/pith-number/G5RXS2FQ2KZ4MYCBVTHUE63PVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/action/storage_attestation","attest_author":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/action/author_attestation","sign_citation":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/action/citation_signature","submit_replication":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/action/replication_record"}},"created_at":"2026-05-18T01:17:28.254510+00:00","updated_at":"2026-05-18T01:17:28.254510+00:00"}