{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EGLJ2TE33NIV5GYWU4ZGHZO7C7","short_pith_number":"pith:EGLJ2TE3","schema_version":"1.0","canonical_sha256":"21969d4c9bdb515e9b16a73263e5df17d958e3389ca7c3efd74e6e9bdb7ae28b","source":{"kind":"arxiv","id":"2204.08754","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for the Proximity Connected Two Center Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amirhossein Mozafari, Binay Bhattacharya, Thomas C. Shermer","submitted_at":"2022-04-19T08:49:40Z","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"},"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":"2204.08754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-04-19T08:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"c340dba1acd20ea55281941bdece5d084ed18474338e0310d015d082bdc24fa5","abstract_canon_sha256":"f83aa5e289ebf90d856ddbf2fc412e27dade64e4bfeeace8efc6845c24f91f0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:33.770275Z","signature_b64":"Rc6boBQnAU3q2olXbw7rpe7wTur9pcaZ93wn+gwvJiXPFdqKA8ZKoskU05bek62Qx97y/f3LueHlsVJ5rKyuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21969d4c9bdb515e9b16a73263e5df17d958e3389ca7c3efd74e6e9bdb7ae28b","last_reissued_at":"2026-07-05T04:15:33.769800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:33.769800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for the Proximity Connected Two Center Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amirhossein Mozafari, Binay Bhattacharya, Thomas C. Shermer","submitted_at":"2022-04-19T08:49:40Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08754","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.08754/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2204.08754","created_at":"2026-07-05T04:15:33.769852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.08754v1","created_at":"2026-07-05T04:15:33.769852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08754","created_at":"2026-07-05T04:15:33.769852+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGLJ2TE33NIV","created_at":"2026-07-05T04:15:33.769852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGLJ2TE33NIV5GYW","created_at":"2026-07-05T04:15:33.769852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGLJ2TE3","created_at":"2026-07-05T04:15:33.769852+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/EGLJ2TE33NIV5GYWU4ZGHZO7C7","json":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7.json","graph_json":"https://pith.science/api/pith-number/EGLJ2TE33NIV5GYWU4ZGHZO7C7/graph.json","events_json":"https://pith.science/api/pith-number/EGLJ2TE33NIV5GYWU4ZGHZO7C7/events.json","paper":"https://pith.science/paper/EGLJ2TE3"},"agent_actions":{"view_html":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7","download_json":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7.json","view_paper":"https://pith.science/paper/EGLJ2TE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.08754&json=true","fetch_graph":"https://pith.science/api/pith-number/EGLJ2TE33NIV5GYWU4ZGHZO7C7/graph.json","fetch_events":"https://pith.science/api/pith-number/EGLJ2TE33NIV5GYWU4ZGHZO7C7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7/action/storage_attestation","attest_author":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7/action/author_attestation","sign_citation":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7/action/citation_signature","submit_replication":"https://pith.science/pith/EGLJ2TE33NIV5GYWU4ZGHZO7C7/action/replication_record"}},"created_at":"2026-07-05T04:15:33.769852+00:00","updated_at":"2026-07-05T04:15:33.769852+00:00"}