{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EGLJ2TE33NIV5GYWU4ZGHZO7C7","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":"f83aa5e289ebf90d856ddbf2fc412e27dade64e4bfeeace8efc6845c24f91f0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-04-19T08:49:40Z","title_canon_sha256":"c340dba1acd20ea55281941bdece5d084ed18474338e0310d015d082bdc24fa5"},"schema_version":"1.0","source":{"id":"2204.08754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.08754","created_at":"2026-07-05T04:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"2204.08754v1","created_at":"2026-07-05T04:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08754","created_at":"2026-07-05T04:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"EGLJ2TE33NIV","created_at":"2026-07-05T04:15:33Z"},{"alias_kind":"pith_short_16","alias_value":"EGLJ2TE33NIV5GYW","created_at":"2026-07-05T04:15:33Z"},{"alias_kind":"pith_short_8","alias_value":"EGLJ2TE3","created_at":"2026-07-05T04:15:33Z"}],"graph_snapshots":[{"event_id":"sha256:edd40a70423be134efe6d2e95e1ab8049dd30e7ee8887fba614b26240b2dd273","target":"graph","created_at":"2026-07-05T04:15:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.08754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set $P$ of $n$ points in the plane, the $k$-center problem is to find $k$ congruent disks of minimum possible radius such that their union covers all the points in $P$. The $2$-center problem is a special case of the $k$-center problem that has been extensively studied in the recent past \\cite{CAHN,HT,SH}. In this paper, we consider a generalized version of the $2$-center problem called \\textit{proximity connected} $2$-center (PCTC) problem. In this problem, we are also given a parameter $\\delta\\geq 0$ and we have the additional constraint that the distance between the centers of the d","authors_text":"Amirhossein Mozafari, Binay Bhattacharya, Thomas C. Shermer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-04-19T08:49:40Z","title":"An Efficient Algorithm for the Proximity Connected Two Center Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08754","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:7322f71c32c5f755d879765eed06278ad0235ea1bed6146a9f96a57a9732e65b","target":"record","created_at":"2026-07-05T04:15:33Z","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":"f83aa5e289ebf90d856ddbf2fc412e27dade64e4bfeeace8efc6845c24f91f0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-04-19T08:49:40Z","title_canon_sha256":"c340dba1acd20ea55281941bdece5d084ed18474338e0310d015d082bdc24fa5"},"schema_version":"1.0","source":{"id":"2204.08754","kind":"arxiv","version":1}},"canonical_sha256":"21969d4c9bdb515e9b16a73263e5df17d958e3389ca7c3efd74e6e9bdb7ae28b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21969d4c9bdb515e9b16a73263e5df17d958e3389ca7c3efd74e6e9bdb7ae28b","first_computed_at":"2026-07-05T04:15:33.769800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:15:33.769800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rc6boBQnAU3q2olXbw7rpe7wTur9pcaZ93wn+gwvJiXPFdqKA8ZKoskU05bek62Qx97y/f3LueHlsVJ5rKyuBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:15:33.770275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.08754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7322f71c32c5f755d879765eed06278ad0235ea1bed6146a9f96a57a9732e65b","sha256:edd40a70423be134efe6d2e95e1ab8049dd30e7ee8887fba614b26240b2dd273"],"state_sha256":"02c9ac481bc81622221b277e246e40cbdbd7989322e340927e1fe349981f6962"}