{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DFCENPOL5JBPKOO55MOJKCWRUE","short_pith_number":"pith:DFCENPOL","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"},"canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","source":{"kind":"arxiv","id":"1512.02356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02356","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02356v1","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02356","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"DFCENPOL5JBP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DFCENPOL5JBPKOO5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DFCENPOL","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DFCENPOL5JBPKOO55MOJKCWRUE","target":"record","payload":{"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"},"canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","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"},"source_kind":"arxiv","source_id":"1512.02356","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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jsxqj2bqGIzrhk4rgBDIxmaqh7apqjMJI1Mzu1AIEEgkwFLDW6AXzr5XnU3UcsnCGuFOwyfFTQWlmDsvBFvgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:26.579847Z"},"content_sha256":"6cb9a2d68ade74ecc038ea2cd843f805dab59108b14ee6fbe2734a24d2e7e4fa","schema_version":"1.0","event_id":"sha256:6cb9a2d68ade74ecc038ea2cd843f805dab59108b14ee6fbe2734a24d2e7e4fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DFCENPOL5JBPKOO55MOJKCWRUE","target":"graph","payload":{"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"},"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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lChcTzjfIXQRYjMzuzdKU8vynBs1GpWNx5oLsXgoFX6azzeL3i7GYkBN0eWKCTRUXrqTp/ffSKeMXowmksXUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:26.580198Z"},"content_sha256":"cf25d20903fe4a0dc518fd3b97aed8922c3303e708dc677b4bdcf5b4b4573081","schema_version":"1.0","event_id":"sha256:cf25d20903fe4a0dc518fd3b97aed8922c3303e708dc677b4bdcf5b4b4573081"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/bundle.json","state_url":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFCENPOL5JBPKOO55MOJKCWRUE/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-02T22:55:26Z","links":{"resolver":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE","bundle":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/bundle.json","state":"https://pith.science/pith/DFCENPOL5JBPKOO55MOJKCWRUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFCENPOL5JBPKOO55MOJKCWRUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DFCENPOL5JBPKOO55MOJKCWRUE","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":"37e0cb9be8fd43da189af852d9fd51db6acc087ff87762a4a15ca98b46affffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-08T07:15:56Z","title_canon_sha256":"e091718b107bfebe9903579e2bbb0e85b29861005f94c03058557ae4f0a303f3"},"schema_version":"1.0","source":{"id":"1512.02356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02356","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02356v1","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02356","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"DFCENPOL5JBP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DFCENPOL5JBPKOO5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DFCENPOL","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:cf25d20903fe4a0dc518fd3b97aed8922c3303e708dc677b4bdcf5b4b4573081","target":"graph","created_at":"2026-05-18T01:24:44Z","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":"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","authors_text":"Anil Maheswari, Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-08T07:15:56Z","title":"Approximation algorithms for the two-center problem of convex polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02356","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:6cb9a2d68ade74ecc038ea2cd843f805dab59108b14ee6fbe2734a24d2e7e4fa","target":"record","created_at":"2026-05-18T01:24:44Z","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":"37e0cb9be8fd43da189af852d9fd51db6acc087ff87762a4a15ca98b46affffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-08T07:15:56Z","title_canon_sha256":"e091718b107bfebe9903579e2bbb0e85b29861005f94c03058557ae4f0a303f3"},"schema_version":"1.0","source":{"id":"1512.02356","kind":"arxiv","version":1}},"canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"194446bdcbea42f539ddeb1c950ad1a122fa659078245aa1e3a60facf584e81c","first_computed_at":"2026-05-18T01:24:44.844772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:44.844772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZjN9bNy8xiZ7Z43pNnZUZV7GZuowkEu2FkOSahNws0BWwaSVhfXpaEs+58UUnk+mCVGhG71Ey0BoImDjNKXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:44.845494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cb9a2d68ade74ecc038ea2cd843f805dab59108b14ee6fbe2734a24d2e7e4fa","sha256:cf25d20903fe4a0dc518fd3b97aed8922c3303e708dc677b4bdcf5b4b4573081"],"state_sha256":"8d4cc09bdb4704dd13a44bca89b795f055e857370ee5a7730b16d5e3e0b59169"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgeWx4UU1D6LB19cAx0t68n1qUkFi7PQbivlVGh9qWA0vSazqChF3g/95zvkPV4PjFX8taW7Dr+yXgVjNpQQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:55:26.582111Z","bundle_sha256":"4a743bc7279b98d7c0f5215b4bc07457daab6fb0ea8ac110575a006dfa9f7ecf"}}