{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DFCENPOL5JBPKOO55MOJKCWRUE","short_pith_number":"pith:DFCENPOL","schema_version":"1.0","canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","source":{"kind":"arxiv","id":"1512.02356","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for the two-center problem of convex polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheswari, Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy","submitted_at":"2015-12-08T07:15:56Z","abstract_excerpt":"Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the input stream is the vertices of the polygon in clockwise order. It produces a radius $r$ satisfying $r\\leq2r_{opt}$ using $O(1)$ space, where $r_{opt}$ is the optimum solution. Next, we show that in non-streaming setup, we can improve the approximation factor by $r\\leq 1.84 r_{opt}$, maintaining the time complexity of the algorithm to $O(n)$, and using $O(1)$ e"},"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":"1512.02356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-08T07:15:56Z","cross_cats_sorted":[],"title_canon_sha256":"e091718b107bfebe9903579e2bbb0e85b29861005f94c03058557ae4f0a303f3","abstract_canon_sha256":"37e0cb9be8fd43da189af852d9fd51db6acc087ff87762a4a15ca98b46affffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.845494Z","signature_b64":"fZjN9bNy8xiZ7Z43pNnZUZV7GZuowkEu2FkOSahNws0BWwaSVhfXpaEs+58UUnk+mCVGhG71Ey0BoImDjNKXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","last_reissued_at":"2026-05-18T01:24:44.844772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.844772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for the two-center problem of convex polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheswari, Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy","submitted_at":"2015-12-08T07:15:56Z","abstract_excerpt":"Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the input stream is the vertices of the polygon in clockwise order. It produces a radius $r$ satisfying $r\\leq2r_{opt}$ using $O(1)$ space, where $r_{opt}$ is the optimum solution. Next, we show that in non-streaming setup, we can improve the approximation factor by $r\\leq 1.84 r_{opt}$, maintaining the time complexity of the algorithm to $O(n)$, and using $O(1)$ e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02356","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":"1512.02356","created_at":"2026-05-18T01:24:44.844872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02356v1","created_at":"2026-05-18T01:24:44.844872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02356","created_at":"2026-05-18T01:24:44.844872+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFCENPOL5JBP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFCENPOL5JBPKOO5","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFCENPOL","created_at":"2026-05-18T12:29:17.054201+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/DFCENPOL5JBPKOO55MOJKCWRUE","json":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE.json","graph_json":"https://pith.science/api/pith-number/DFCENPOL5JBPKOO55MOJKCWRUE/graph.json","events_json":"https://pith.science/api/pith-number/DFCENPOL5JBPKOO55MOJKCWRUE/events.json","paper":"https://pith.science/paper/DFCENPOL"},"agent_actions":{"view_html":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE","download_json":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE.json","view_paper":"https://pith.science/paper/DFCENPOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02356&json=true","fetch_graph":"https://pith.science/api/pith-number/DFCENPOL5JBPKOO55MOJKCWRUE/graph.json","fetch_events":"https://pith.science/api/pith-number/DFCENPOL5JBPKOO55MOJKCWRUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/action/storage_attestation","attest_author":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/action/author_attestation","sign_citation":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/action/citation_signature","submit_replication":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/action/replication_record"}},"created_at":"2026-05-18T01:24:44.844872+00:00","updated_at":"2026-05-18T01:24:44.844872+00:00"}