{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RNXOEJBJWOTYUSGGXCZWWO6ZOH","short_pith_number":"pith:RNXOEJBJ","canonical_record":{"source":{"id":"1812.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-03T17:01:06Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"bf95925b73a43b4912f8a2871906400486e3ba4f16e6c68899d5d60fba614467","abstract_canon_sha256":"0251052400b50373ca20986b6512c339f3b7578fb6d6113a6af2e2e8a50e4a8b"},"schema_version":"1.0"},"canonical_sha256":"8b6ee22429b3a78a48c6b8b36b3bd971e4d36e69eecdf79dcd48b2949d95d1cb","source":{"kind":"arxiv","id":"1812.00901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00901","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00901v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00901","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"RNXOEJBJWOTY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNXOEJBJWOTYUSGG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNXOEJBJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RNXOEJBJWOTYUSGGXCZWWO6ZOH","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-03T17:01:06Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"bf95925b73a43b4912f8a2871906400486e3ba4f16e6c68899d5d60fba614467","abstract_canon_sha256":"0251052400b50373ca20986b6512c339f3b7578fb6d6113a6af2e2e8a50e4a8b"},"schema_version":"1.0"},"canonical_sha256":"8b6ee22429b3a78a48c6b8b36b3bd971e4d36e69eecdf79dcd48b2949d95d1cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.629025Z","signature_b64":"DP0kPY2v6lUtYLYtBpf6QrDS67naSl3/NM4TwYgRW9KMcUsg+YrLwD+D/X9kdBpWDVrDycYYSr0/9zNzE+wgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b6ee22429b3a78a48c6b8b36b3bd971e4d36e69eecdf79dcd48b2949d95d1cb","last_reissued_at":"2026-05-17T23:59:18.628635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.628635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00901","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M57BpGWa6DINWq5C8MYs72mHOtLquOqA/kbcn5QYu7lYgXzqufijwNQDtkGyTIpBLVJN+VxWNMPc4qqaDMmkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:54:25.908027Z"},"content_sha256":"405fca87d3add608e3510b72aa423819d4c3fa8573e564d487962b1c8302b9ce","schema_version":"1.0","event_id":"sha256:405fca87d3add608e3510b72aa423819d4c3fa8573e564d487962b1c8302b9ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RNXOEJBJWOTYUSGGXCZWWO6ZOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.CG","authors_text":"Karthik C. S., Pasin Manurangsi","submitted_at":"2018-12-03T17:01:06Z","abstract_excerpt":"Given a set of $n$ points in $\\mathbb R^d$, the (monochromatic) Closest Pair problem asks to find a pair of distinct points in the set that are closest in the $\\ell_p$-metric. Closest Pair is a fundamental problem in Computational Geometry and understanding its fine-grained complexity in the Euclidean metric when $d=\\omega(\\log n)$ was raised as an open question in recent works (Abboud-Rubinstein-Williams [FOCS'17], Williams [SODA'18], David-Karthik-Laekhanukit [SoCG'18]).\n  In this paper, we show that for every $p\\in\\mathbb R_{\\ge 1}\\cup\\{0\\}$, under the Strong Exponential Time Hypothesis (SE"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00901","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0kkPZHpWK9EzBCZ/ZcUH4QpUvqLlNDfpgRszbVLoG/Hg+3rdg/NTsAs0p1Qbonr3wz09CzmTMVnw4zIMz4CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:54:25.908386Z"},"content_sha256":"533566b2cf01c19801dd1ed2ab21a787483d6878ec0686ca4c257ed5fd91b2a4","schema_version":"1.0","event_id":"sha256:533566b2cf01c19801dd1ed2ab21a787483d6878ec0686ca4c257ed5fd91b2a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/bundle.json","state_url":"https://pith.science/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/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-01T14:54:25Z","links":{"resolver":"https://pith.science/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH","bundle":"https://pith.science/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/bundle.json","state":"https://pith.science/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNXOEJBJWOTYUSGGXCZWWO6ZOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RNXOEJBJWOTYUSGGXCZWWO6ZOH","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":"0251052400b50373ca20986b6512c339f3b7578fb6d6113a6af2e2e8a50e4a8b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-03T17:01:06Z","title_canon_sha256":"bf95925b73a43b4912f8a2871906400486e3ba4f16e6c68899d5d60fba614467"},"schema_version":"1.0","source":{"id":"1812.00901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00901","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00901v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00901","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"RNXOEJBJWOTY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNXOEJBJWOTYUSGG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNXOEJBJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:533566b2cf01c19801dd1ed2ab21a787483d6878ec0686ca4c257ed5fd91b2a4","target":"graph","created_at":"2026-05-17T23:59:18Z","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 of $n$ points in $\\mathbb R^d$, the (monochromatic) Closest Pair problem asks to find a pair of distinct points in the set that are closest in the $\\ell_p$-metric. Closest Pair is a fundamental problem in Computational Geometry and understanding its fine-grained complexity in the Euclidean metric when $d=\\omega(\\log n)$ was raised as an open question in recent works (Abboud-Rubinstein-Williams [FOCS'17], Williams [SODA'18], David-Karthik-Laekhanukit [SoCG'18]).\n  In this paper, we show that for every $p\\in\\mathbb R_{\\ge 1}\\cup\\{0\\}$, under the Strong Exponential Time Hypothesis (SE","authors_text":"Karthik C. S., Pasin Manurangsi","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-03T17:01:06Z","title":"On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00901","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:405fca87d3add608e3510b72aa423819d4c3fa8573e564d487962b1c8302b9ce","target":"record","created_at":"2026-05-17T23:59:18Z","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":"0251052400b50373ca20986b6512c339f3b7578fb6d6113a6af2e2e8a50e4a8b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-03T17:01:06Z","title_canon_sha256":"bf95925b73a43b4912f8a2871906400486e3ba4f16e6c68899d5d60fba614467"},"schema_version":"1.0","source":{"id":"1812.00901","kind":"arxiv","version":1}},"canonical_sha256":"8b6ee22429b3a78a48c6b8b36b3bd971e4d36e69eecdf79dcd48b2949d95d1cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b6ee22429b3a78a48c6b8b36b3bd971e4d36e69eecdf79dcd48b2949d95d1cb","first_computed_at":"2026-05-17T23:59:18.628635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.628635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DP0kPY2v6lUtYLYtBpf6QrDS67naSl3/NM4TwYgRW9KMcUsg+YrLwD+D/X9kdBpWDVrDycYYSr0/9zNzE+wgCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.629025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:405fca87d3add608e3510b72aa423819d4c3fa8573e564d487962b1c8302b9ce","sha256:533566b2cf01c19801dd1ed2ab21a787483d6878ec0686ca4c257ed5fd91b2a4"],"state_sha256":"5152f57fd61725ba27ca3210a238c0a516262d3718ef031c823f18fdc3a65da4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OoCCzjiEBJPZ7xDvSgcqgahCJ8lzHohreaXEFcJqd20VBMau+u4F9VCYOeSvbWWA5CNV+arVQbmkHso1tNcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:54:25.910345Z","bundle_sha256":"871bba98c06b91344980eb86e4785e877ada0e2d6b63491c8d0b5037c249f7e2"}}