{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G5RXS2FQ2KZ4MYCBVTHUE63PVW","short_pith_number":"pith:G5RXS2FQ","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"},"canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","source":{"kind":"arxiv","id":"1604.02188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02188","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02188v1","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02188","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"G5RXS2FQ2KZ4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5RXS2FQ2KZ4MYCB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5RXS2FQ","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G5RXS2FQ2KZ4MYCBVTHUE63PVW","target":"record","payload":{"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"},"canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","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"},"source_kind":"arxiv","source_id":"1604.02188","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:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE+jQ9mtMESWbawv+2zPOgI81mUBUjj6eSHyktSrC4wGqg5EUVr19H2gCtKac/tpiW35upJluhlXlmrSwCy2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:14.592761Z"},"content_sha256":"a9a50af0fd344c4049e6de32611705c2e0f0f10ac849c86fb400d580b2a518e7","schema_version":"1.0","event_id":"sha256:a9a50af0fd344c4049e6de32611705c2e0f0f10ac849c86fb400d580b2a518e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G5RXS2FQ2KZ4MYCBVTHUE63PVW","target":"graph","payload":{"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"},"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:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjbdLe1p14Nc4E8YJhdr1tAImtLNdGJRwMyzNXrMRsFwycFfXS08Yl/2DCX0OkCjAJGJDv3Uz5p/N1h1rcaHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:14.593234Z"},"content_sha256":"27039ccf1284bb03cf92866d6a748136c6772baa7614fb5c5cae0fb0da7fb978","schema_version":"1.0","event_id":"sha256:27039ccf1284bb03cf92866d6a748136c6772baa7614fb5c5cae0fb0da7fb978"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/bundle.json","state_url":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/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-05-30T08:56:14Z","links":{"resolver":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW","bundle":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/bundle.json","state":"https://pith.science/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5RXS2FQ2KZ4MYCBVTHUE63PVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G5RXS2FQ2KZ4MYCBVTHUE63PVW","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":"63973023e8ea17f130fbff73d4ab2a2355295024f057e55e1a7878e7c01e6f51","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T22:31:38Z","title_canon_sha256":"231fce5ac3cce1e64a5e55f3d9aa4f0b48d90c2edcde545901b86392201b7759"},"schema_version":"1.0","source":{"id":"1604.02188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02188","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02188v1","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02188","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"G5RXS2FQ2KZ4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5RXS2FQ2KZ4MYCB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5RXS2FQ","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:27039ccf1284bb03cf92866d6a748136c6772baa7614fb5c5cae0fb0da7fb978","target":"graph","created_at":"2026-05-18T01:17:28Z","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":"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","authors_text":"Piotr Indyk, Robert Kleinberg, Sepideh Mahabadi, Yang Yuan","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T22:31:38Z","title":"Simultaneous Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02188","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:a9a50af0fd344c4049e6de32611705c2e0f0f10ac849c86fb400d580b2a518e7","target":"record","created_at":"2026-05-18T01:17:28Z","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":"63973023e8ea17f130fbff73d4ab2a2355295024f057e55e1a7878e7c01e6f51","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-07T22:31:38Z","title_canon_sha256":"231fce5ac3cce1e64a5e55f3d9aa4f0b48d90c2edcde545901b86392201b7759"},"schema_version":"1.0","source":{"id":"1604.02188","kind":"arxiv","version":1}},"canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37637968b0d2b3c66041accf427b6fadb24bdc1bc507a917b47095f1de21d0aa","first_computed_at":"2026-05-18T01:17:28.254390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:28.254390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N1pftmlx3MOW9iWt00sBJEGv6gSjOvK9cd+wC4qESkYrpiNio96c23eJENrc/vRlag20bJPoC4IUH71lIMNUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:28.255089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9a50af0fd344c4049e6de32611705c2e0f0f10ac849c86fb400d580b2a518e7","sha256:27039ccf1284bb03cf92866d6a748136c6772baa7614fb5c5cae0fb0da7fb978"],"state_sha256":"068cab74f8a424e686191021589533e36555328b1100fd5065ab6cd998b20842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ck9KRltd0PpkNVzBodcEFnKcVj6gvZdZH8UlJMjQXJVokm6U0xHtgSJO9gyqgHE4Ivg+wJbCXVtKCFkKIOiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:56:14.596145Z","bundle_sha256":"a37edb60eb0276aa43f023a7f4c2f34e157aaa2ffec8316f05ddc2c772c7da1a"}}