{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PKPF52N6BDVX3EHDINGF55ZMBE","short_pith_number":"pith:PKPF52N6","canonical_record":{"source":{"id":"1012.2694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-13T11:17:35Z","cross_cats_sorted":[],"title_canon_sha256":"22e55dab8ef38ed5121188fe8506865c86d6a26280eabd2617633402ed6e9c37","abstract_canon_sha256":"76f3820cda87ac168d50960a34881d2864ed0c87545facf39383860f58f2df98"},"schema_version":"1.0"},"canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","source":{"kind":"arxiv","id":"1012.2694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2694","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2694v1","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2694","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"PKPF52N6BDVX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PKPF52N6BDVX3EHD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PKPF52N6","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PKPF52N6BDVX3EHDINGF55ZMBE","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-13T11:17:35Z","cross_cats_sorted":[],"title_canon_sha256":"22e55dab8ef38ed5121188fe8506865c86d6a26280eabd2617633402ed6e9c37","abstract_canon_sha256":"76f3820cda87ac168d50960a34881d2864ed0c87545facf39383860f58f2df98"},"schema_version":"1.0"},"canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:27.988179Z","signature_b64":"olRm5glWKxNjUsjREUbIP0dY5InRppF85m9JVCrb1knLQFELnf0+cndfbrsY8+pCPWOuJLQrISeaEOZKpV6jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","last_reissued_at":"2026-05-18T04:33:27.987668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:27.987668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2694","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-18T04:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLKGGRsTMkR4GrlZpNR2Vq8xyEfvzzTeo/XyE4yuyFaZAAj6qVuWJO6Owr1oEaALBx2o5VvowDWiCUdnWbETAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:28.583897Z"},"content_sha256":"d908bed204b8b7cc9d2b46a1f9b6e0f882bba7691ce4d2b7a963fa900a7db5f7","schema_version":"1.0","event_id":"sha256:d908bed204b8b7cc9d2b46a1f9b6e0f882bba7691ce4d2b7a963fa900a7db5f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PKPF52N6BDVX3EHDINGF55ZMBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The 2-Center Problem in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Micha Sharir, Pankaj K. Agarwal, Rinat Ben Avraham","submitted_at":"2010-12-13T11:17:35Z","abstract_excerpt":"Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5 n) expected time, and the second algorithm runs in O((n^2 log^5 n) /(1-r*/r_0)^3) expected time, where r* is the radius of the 2-center balls of P and r_0 is the radius of the smallest enclosing ball of P. The second algorithm is faster than the first one as long as r* is not too close to r_0, which is equivalent to the condition that the centers of the two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2694","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-18T04:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F47WYwwBjFvpAQzylAmy6CMTOqFz6Azv2LLzbBbfn9yz3wtj6fWZTJBDSkQjoCsu2kn+vS/9Roh3qCIn705FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:28.584524Z"},"content_sha256":"5a4fd7cec24d3cc3272904f3a2a19340c464a3e9a5540fb01d44b2da56ac6947","schema_version":"1.0","event_id":"sha256:5a4fd7cec24d3cc3272904f3a2a19340c464a3e9a5540fb01d44b2da56ac6947"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/bundle.json","state_url":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKPF52N6BDVX3EHDINGF55ZMBE/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-27T10:58:28Z","links":{"resolver":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE","bundle":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/bundle.json","state":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKPF52N6BDVX3EHDINGF55ZMBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PKPF52N6BDVX3EHDINGF55ZMBE","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":"76f3820cda87ac168d50960a34881d2864ed0c87545facf39383860f58f2df98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-13T11:17:35Z","title_canon_sha256":"22e55dab8ef38ed5121188fe8506865c86d6a26280eabd2617633402ed6e9c37"},"schema_version":"1.0","source":{"id":"1012.2694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2694","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2694v1","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2694","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"PKPF52N6BDVX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PKPF52N6BDVX3EHD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PKPF52N6","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:5a4fd7cec24d3cc3272904f3a2a19340c464a3e9a5540fb01d44b2da56ac6947","target":"graph","created_at":"2026-05-18T04:33:27Z","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":"Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5 n) expected time, and the second algorithm runs in O((n^2 log^5 n) /(1-r*/r_0)^3) expected time, where r* is the radius of the 2-center balls of P and r_0 is the radius of the smallest enclosing ball of P. The second algorithm is faster than the first one as long as r* is not too close to r_0, which is equivalent to the condition that the centers of the two","authors_text":"Micha Sharir, Pankaj K. Agarwal, Rinat Ben Avraham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-13T11:17:35Z","title":"The 2-Center Problem in Three Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2694","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:d908bed204b8b7cc9d2b46a1f9b6e0f882bba7691ce4d2b7a963fa900a7db5f7","target":"record","created_at":"2026-05-18T04:33:27Z","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":"76f3820cda87ac168d50960a34881d2864ed0c87545facf39383860f58f2df98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-13T11:17:35Z","title_canon_sha256":"22e55dab8ef38ed5121188fe8506865c86d6a26280eabd2617633402ed6e9c37"},"schema_version":"1.0","source":{"id":"1012.2694","kind":"arxiv","version":1}},"canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","first_computed_at":"2026-05-18T04:33:27.987668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:27.987668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"olRm5glWKxNjUsjREUbIP0dY5InRppF85m9JVCrb1knLQFELnf0+cndfbrsY8+pCPWOuJLQrISeaEOZKpV6jBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:27.988179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d908bed204b8b7cc9d2b46a1f9b6e0f882bba7691ce4d2b7a963fa900a7db5f7","sha256:5a4fd7cec24d3cc3272904f3a2a19340c464a3e9a5540fb01d44b2da56ac6947"],"state_sha256":"943ae158955564de801230ef4bcbb265c3369d052d2f0232e6e966ccafb0ecdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RV1N17vQYjJAFTt1yY1I8EyLaqrJtn5PASxHQAUkTFc1SWgAcTzZ69x+OwNtHKCK2/+wH/q64zDCNAw4/AMhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:58:28.587826Z","bundle_sha256":"2cd7392483912aae68e06f038c8194e757d0c32429ca2cac1e39524024eac732"}}