{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YGRVLGNOBIERFN6BCTBPYDRAKE","short_pith_number":"pith:YGRVLGNO","canonical_record":{"source":{"id":"1605.08107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T00:23:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e6764ecd631140eae24d3ab3de41360c00f6c7a6b84a505c5bd51d420ee4e22c","abstract_canon_sha256":"b87cfa679ad80e86cc686052f69f49f36f3fc140ff4f24594df395fbdcccf46f"},"schema_version":"1.0"},"canonical_sha256":"c1a35599ae0a0912b7c114c2fc0e2051084c1e01afc32485a1b71303cf27574e","source":{"kind":"arxiv","id":"1605.08107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08107","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08107v2","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08107","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"YGRVLGNOBIER","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YGRVLGNOBIERFN6B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YGRVLGNO","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YGRVLGNOBIERFN6BCTBPYDRAKE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T00:23:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e6764ecd631140eae24d3ab3de41360c00f6c7a6b84a505c5bd51d420ee4e22c","abstract_canon_sha256":"b87cfa679ad80e86cc686052f69f49f36f3fc140ff4f24594df395fbdcccf46f"},"schema_version":"1.0"},"canonical_sha256":"c1a35599ae0a0912b7c114c2fc0e2051084c1e01afc32485a1b71303cf27574e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.978372Z","signature_b64":"+/FeYpGKvSufM9rbgKW8R2c1wnv2/DfxmyzdJqxonsAG/eRlflFgTD41nwkxiXPoSE5tKGgrxTldb3JJMac+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a35599ae0a0912b7c114c2fc0e2051084c1e01afc32485a1b71303cf27574e","last_reissued_at":"2026-05-18T00:41:47.977657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.977657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08107","source_version":2,"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-18T00:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGHKsGHR9rar+wXYxgAUZRp61FiaBHS1xUpRY5yoMQFfkb1Bw7jx2uXU2QYRtslaeQ0XHshM0iCixU/j7X/EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:29.631583Z"},"content_sha256":"6eb0d9b0c20bbf18fd29134c5dc65054850618576ca4bfe581a74b030cd12737","schema_version":"1.0","event_id":"sha256:6eb0d9b0c20bbf18fd29134c5dc65054850618576ca4bfe581a74b030cd12737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YGRVLGNOBIERFN6BCTBPYDRAKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dominance Product and High-Dimensional Closest Pair under $L_\\infty$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Micha Sharir, Omer Gold","submitted_at":"2016-05-26T00:23:34Z","abstract_excerpt":"Given a set $S$ of $n$ points in $\\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate solutions for general $d$. However, obtaining an exact solution in very high dimensions seems to be much less understood. We consider the high-dimensional $L_\\infty$ Closest Pair problem, where $d=n^r$ for some $r > 0$, and the underlying metric is $L_\\infty$.\n  We improve and simplify previous results for $L_\\infty$ Closest Pair, showing that it can be solved"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08107","kind":"arxiv","version":2},"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-18T00:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzlyR4XXqN5pjsHJBy3RT4enjBAqgZJvN5tq3Tombii33uRAm8VzFL8T/bLcMBiAqzVJx8a5sTVQoQW12hPQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:29.632289Z"},"content_sha256":"96cfa0a139f735c1a51298b1654816d0a4c6d387e06ec7df4b4ec783b3d753a7","schema_version":"1.0","event_id":"sha256:96cfa0a139f735c1a51298b1654816d0a4c6d387e06ec7df4b4ec783b3d753a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/bundle.json","state_url":"https://pith.science/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/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-27T17:35:29Z","links":{"resolver":"https://pith.science/pith/YGRVLGNOBIERFN6BCTBPYDRAKE","bundle":"https://pith.science/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/bundle.json","state":"https://pith.science/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGRVLGNOBIERFN6BCTBPYDRAKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YGRVLGNOBIERFN6BCTBPYDRAKE","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":"b87cfa679ad80e86cc686052f69f49f36f3fc140ff4f24594df395fbdcccf46f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T00:23:34Z","title_canon_sha256":"e6764ecd631140eae24d3ab3de41360c00f6c7a6b84a505c5bd51d420ee4e22c"},"schema_version":"1.0","source":{"id":"1605.08107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08107","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08107v2","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08107","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"YGRVLGNOBIER","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YGRVLGNOBIERFN6B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YGRVLGNO","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:96cfa0a139f735c1a51298b1654816d0a4c6d387e06ec7df4b4ec783b3d753a7","target":"graph","created_at":"2026-05-18T00:41:47Z","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":"Given a set $S$ of $n$ points in $\\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate solutions for general $d$. However, obtaining an exact solution in very high dimensions seems to be much less understood. We consider the high-dimensional $L_\\infty$ Closest Pair problem, where $d=n^r$ for some $r > 0$, and the underlying metric is $L_\\infty$.\n  We improve and simplify previous results for $L_\\infty$ Closest Pair, showing that it can be solved","authors_text":"Micha Sharir, Omer Gold","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T00:23:34Z","title":"Dominance Product and High-Dimensional Closest Pair under $L_\\infty$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08107","kind":"arxiv","version":2},"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:6eb0d9b0c20bbf18fd29134c5dc65054850618576ca4bfe581a74b030cd12737","target":"record","created_at":"2026-05-18T00:41:47Z","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":"b87cfa679ad80e86cc686052f69f49f36f3fc140ff4f24594df395fbdcccf46f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T00:23:34Z","title_canon_sha256":"e6764ecd631140eae24d3ab3de41360c00f6c7a6b84a505c5bd51d420ee4e22c"},"schema_version":"1.0","source":{"id":"1605.08107","kind":"arxiv","version":2}},"canonical_sha256":"c1a35599ae0a0912b7c114c2fc0e2051084c1e01afc32485a1b71303cf27574e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1a35599ae0a0912b7c114c2fc0e2051084c1e01afc32485a1b71303cf27574e","first_computed_at":"2026-05-18T00:41:47.977657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:47.977657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+/FeYpGKvSufM9rbgKW8R2c1wnv2/DfxmyzdJqxonsAG/eRlflFgTD41nwkxiXPoSE5tKGgrxTldb3JJMac+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:47.978372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eb0d9b0c20bbf18fd29134c5dc65054850618576ca4bfe581a74b030cd12737","sha256:96cfa0a139f735c1a51298b1654816d0a4c6d387e06ec7df4b4ec783b3d753a7"],"state_sha256":"13f90178e02b965f6eb6c89f82a0c44d53c798a99e28cbaf3461c9c44980642b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsp8mN/TswD2pSGxk6VHBDJk24PRbGts0j8IK37REzpWj66AFgnKFOxAVpaeDmqNJYhKVms6eBk0LdvvkwLVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:35:29.635987Z","bundle_sha256":"f57b9e8077594877101c8e028bce7abd805794ee9d68470374617836f86f2f4d"}}