{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E5LSCI27FKFAJNHOEKR2EJBEQR","short_pith_number":"pith:E5LSCI27","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"},"canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","source":{"kind":"arxiv","id":"1905.00157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00157","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00157v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00157","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"E5LSCI27FKFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E5LSCI27FKFAJNHO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E5LSCI27","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E5LSCI27FKFAJNHOEKR2EJBEQR","target":"record","payload":{"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"},"canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","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"},"source_kind":"arxiv","source_id":"1905.00157","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:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOkDBj2hHtptQ2qR7JLBPXGDYOVuic6y4xxhBlp4tZW5gr5YZZAts/2GUlWaI/FD4JDKF2o5h8O8dqnBDH4ICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:09:17.273418Z"},"content_sha256":"b953070f5845c56a31408324774c7bca10208f84cda2d793f16e944f0daafdfc","schema_version":"1.0","event_id":"sha256:b953070f5845c56a31408324774c7bca10208f84cda2d793f16e944f0daafdfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E5LSCI27FKFAJNHOEKR2EJBEQR","target":"graph","payload":{"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"},"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:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTLE0/KhhnqYqG1i0YTKwJCtvLS9Cf6/iqTMjGTYMYpTY6XnYQ4Y2ivkdRWiQksfgtaPo28z4RAgjT8zNKkvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:09:17.273767Z"},"content_sha256":"11cfc6914188d87a91490be5d05c144aaa0a01079f1072eed7e462ffde7d9aa7","schema_version":"1.0","event_id":"sha256:11cfc6914188d87a91490be5d05c144aaa0a01079f1072eed7e462ffde7d9aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/bundle.json","state_url":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/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-20T13:09:17Z","links":{"resolver":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR","bundle":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/bundle.json","state":"https://pith.science/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5LSCI27FKFAJNHOEKR2EJBEQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E5LSCI27FKFAJNHOEKR2EJBEQR","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":"0d141f38ed35c8daabb23c646cb29356dd38374610989dfe35d1260de5ee3a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-01T01:29:21Z","title_canon_sha256":"c16f6aed969c2162bb316c5fd8787f1b7933a9e19c59eeb3cbb026620c32e128"},"schema_version":"1.0","source":{"id":"1905.00157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00157","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00157v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00157","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"E5LSCI27FKFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E5LSCI27FKFAJNHO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E5LSCI27","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:11cfc6914188d87a91490be5d05c144aaa0a01079f1072eed7e462ffde7d9aa7","target":"graph","created_at":"2026-05-17T23:47:13Z","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":"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","authors_text":"Haitao Wang, Jie Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-01T01:29:21Z","title":"Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00157","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:b953070f5845c56a31408324774c7bca10208f84cda2d793f16e944f0daafdfc","target":"record","created_at":"2026-05-17T23:47:13Z","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":"0d141f38ed35c8daabb23c646cb29356dd38374610989dfe35d1260de5ee3a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-01T01:29:21Z","title_canon_sha256":"c16f6aed969c2162bb316c5fd8787f1b7933a9e19c59eeb3cbb026620c32e128"},"schema_version":"1.0","source":{"id":"1905.00157","kind":"arxiv","version":1}},"canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"275721235f2a8a04b4ee22a3a224248467949dcca29e5dcd654b1bea92e256db","first_computed_at":"2026-05-17T23:47:13.547255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:13.547255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCg7Dbt2PJ3rt4mVBZACDYnPXi3iSyeC0n16yxHe8YSHCXHLKDpAadQKCgfryPwHIr/G+BqiP8a7jz4gWaJmCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:13.547649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b953070f5845c56a31408324774c7bca10208f84cda2d793f16e944f0daafdfc","sha256:11cfc6914188d87a91490be5d05c144aaa0a01079f1072eed7e462ffde7d9aa7"],"state_sha256":"988f6a9a242f2037f19493cf4b75a435eaaf2685c8a6c02198ef9c102792aa02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0yZGyT76J7y9LQVaCD+ZCD+ibsW4o3JI7zKca6601rFJ5EpVwEp6CEGFBwj/+yOAsBXLfO0vBbbt3vJV+hlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:09:17.275707Z","bundle_sha256":"d22d6073bda28c8161a9be996636545ff7898829c2d67e382af95960c9e014f2"}}