{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E5LSCI27FKFAJNHOEKR2EJBEQR","short_pith_number":"pith:E5LSCI27","schema_version":"1.0","canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","source":{"kind":"arxiv","id":"1905.00157","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jie Xue","submitted_at":"2019-05-01T01:29:21Z","abstract_excerpt":"We consider a bichromatic two-center problem for pairs of points. Given a set $S$ of $n$ pairs of points in the plane, for every pair, we want to assign a red color to one point and a blue color to the other, in such a way that the value $\\max\\{r_1,r_2\\}$ is minimized, where $r_1$ (resp., $r_2$) is the radius of the smallest enclosing disk of all red (resp., blue) points. Previously, an exact algorithm of $O(n^3\\log^2 n)$ time and a $(1+\\varepsilon)$-approximate algorithm of $O(n + (1/\\varepsilon)^6 \\log^2 (1/\\varepsilon))$ time were known. In this paper, we propose a new exact algorithm of $O"},"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":"1905.00157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-01T01:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"c16f6aed969c2162bb316c5fd8787f1b7933a9e19c59eeb3cbb026620c32e128","abstract_canon_sha256":"0d141f38ed35c8daabb23c646cb29356dd38374610989dfe35d1260de5ee3a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:13.547649Z","signature_b64":"zCg7Dbt2PJ3rt4mVBZACDYnPXi3iSyeC0n16yxHe8YSHCXHLKDpAadQKCgfryPwHIr/G+BqiP8a7jz4gWaJmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","last_reissued_at":"2026-05-17T23:47:13.547255Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:13.547255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jie Xue","submitted_at":"2019-05-01T01:29:21Z","abstract_excerpt":"We consider a bichromatic two-center problem for pairs of points. Given a set $S$ of $n$ pairs of points in the plane, for every pair, we want to assign a red color to one point and a blue color to the other, in such a way that the value $\\max\\{r_1,r_2\\}$ is minimized, where $r_1$ (resp., $r_2$) is the radius of the smallest enclosing disk of all red (resp., blue) points. Previously, an exact algorithm of $O(n^3\\log^2 n)$ time and a $(1+\\varepsilon)$-approximate algorithm of $O(n + (1/\\varepsilon)^6 \\log^2 (1/\\varepsilon))$ time were known. In this paper, we propose a new exact algorithm of $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00157","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":"1905.00157","created_at":"2026-05-17T23:47:13.547327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00157v1","created_at":"2026-05-17T23:47:13.547327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00157","created_at":"2026-05-17T23:47:13.547327+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5LSCI27FKFA","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5LSCI27FKFAJNHO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5LSCI27","created_at":"2026-05-18T12:33:15.570797+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/E5LSCI27FKFAJNHOEKR2EJBEQR","json":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR.json","graph_json":"https://pith.science/api/pith-number/E5LSCI27FKFAJNHOEKR2EJBEQR/graph.json","events_json":"https://pith.science/api/pith-number/E5LSCI27FKFAJNHOEKR2EJBEQR/events.json","paper":"https://pith.science/paper/E5LSCI27"},"agent_actions":{"view_html":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR","download_json":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR.json","view_paper":"https://pith.science/paper/E5LSCI27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00157&json=true","fetch_graph":"https://pith.science/api/pith-number/E5LSCI27FKFAJNHOEKR2EJBEQR/graph.json","fetch_events":"https://pith.science/api/pith-number/E5LSCI27FKFAJNHOEKR2EJBEQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/action/storage_attestation","attest_author":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/action/author_attestation","sign_citation":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/action/citation_signature","submit_replication":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/action/replication_record"}},"created_at":"2026-05-17T23:47:13.547327+00:00","updated_at":"2026-05-17T23:47:13.547327+00:00"}