{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PKPF52N6BDVX3EHDINGF55ZMBE","short_pith_number":"pith:PKPF52N6","schema_version":"1.0","canonical_sha256":"7a9e5ee9be08eb7d90e3434c5ef72c091ea5a88cefe171657a1e939fb6126725","source":{"kind":"arxiv","id":"1012.2694","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.2694","created_at":"2026-05-18T04:33:27.987742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2694v1","created_at":"2026-05-18T04:33:27.987742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2694","created_at":"2026-05-18T04:33:27.987742+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKPF52N6BDVX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKPF52N6BDVX3EHD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKPF52N6","created_at":"2026-05-18T12:26:12.377268+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/PKPF52N6BDVX3EHDINGF55ZMBE","json":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE.json","graph_json":"https://pith.science/api/pith-number/PKPF52N6BDVX3EHDINGF55ZMBE/graph.json","events_json":"https://pith.science/api/pith-number/PKPF52N6BDVX3EHDINGF55ZMBE/events.json","paper":"https://pith.science/paper/PKPF52N6"},"agent_actions":{"view_html":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE","download_json":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE.json","view_paper":"https://pith.science/paper/PKPF52N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2694&json=true","fetch_graph":"https://pith.science/api/pith-number/PKPF52N6BDVX3EHDINGF55ZMBE/graph.json","fetch_events":"https://pith.science/api/pith-number/PKPF52N6BDVX3EHDINGF55ZMBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/action/storage_attestation","attest_author":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/action/author_attestation","sign_citation":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/action/citation_signature","submit_replication":"https://pith.science/pith/PKPF52N6BDVX3EHDINGF55ZMBE/action/replication_record"}},"created_at":"2026-05-18T04:33:27.987742+00:00","updated_at":"2026-05-18T04:33:27.987742+00:00"}