{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:I5KLKAC6QW57RBTNFEXFAYXZK2","short_pith_number":"pith:I5KLKAC6","schema_version":"1.0","canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","source":{"kind":"arxiv","id":"0904.2203","version":2},"attestation_state":"computed","paper":{"title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Canada), Edmonton, Imran A. Pirwani (1), Mohammad R. Salavatipour (1) ((1) Department of Computing Science, University of Alberta","submitted_at":"2009-04-14T20:44:57Z","abstract_excerpt":"We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor approximations are known, with the current best ratio of 3. Our main result is a {\\em weakly robust} polynomial time approximation scheme (PTAS) for UDGs expressed with edge-lengths, it either (i) computes a clique partition or (ii) gives a certificate that the graph is not a UDG; for the case (i) that it computes a clique partition, we show that it is guaranteed to be within $(1+\\eps)$ ratio of the optimum if the inpu"},"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":"0904.2203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-04-14T20:44:57Z","cross_cats_sorted":["cs.DC","cs.DM","cs.DS"],"title_canon_sha256":"8815f0525c67740f1d52bf19f44fb54cc16cca6d8e367020702fb05f3fd3c718","abstract_canon_sha256":"0f330de680c12fdd33098145de046ac1bdb57cb46acf1fe0aeace485215ebd9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:00.456942Z","signature_b64":"RcX54pEAHjG9zpiTROQurHUlitzmvMmdzXiTQqNabdmk8P5dxJch4xCBgKGt1ZuEml2dpD5m1LphuSatVPytCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","last_reissued_at":"2026-05-18T02:14:00.456458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:00.456458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Canada), Edmonton, Imran A. Pirwani (1), Mohammad R. Salavatipour (1) ((1) Department of Computing Science, University of Alberta","submitted_at":"2009-04-14T20:44:57Z","abstract_excerpt":"We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor approximations are known, with the current best ratio of 3. Our main result is a {\\em weakly robust} polynomial time approximation scheme (PTAS) for UDGs expressed with edge-lengths, it either (i) computes a clique partition or (ii) gives a certificate that the graph is not a UDG; for the case (i) that it computes a clique partition, we show that it is guaranteed to be within $(1+\\eps)$ ratio of the optimum if the inpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2203","kind":"arxiv","version":2},"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":"0904.2203","created_at":"2026-05-18T02:14:00.456541+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2203v2","created_at":"2026-05-18T02:14:00.456541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2203","created_at":"2026-05-18T02:14:00.456541+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5KLKAC6QW57","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5KLKAC6QW57RBTN","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5KLKAC6","created_at":"2026-05-18T12:25:59.703012+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/I5KLKAC6QW57RBTNFEXFAYXZK2","json":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2.json","graph_json":"https://pith.science/api/pith-number/I5KLKAC6QW57RBTNFEXFAYXZK2/graph.json","events_json":"https://pith.science/api/pith-number/I5KLKAC6QW57RBTNFEXFAYXZK2/events.json","paper":"https://pith.science/paper/I5KLKAC6"},"agent_actions":{"view_html":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2","download_json":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2.json","view_paper":"https://pith.science/paper/I5KLKAC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2203&json=true","fetch_graph":"https://pith.science/api/pith-number/I5KLKAC6QW57RBTNFEXFAYXZK2/graph.json","fetch_events":"https://pith.science/api/pith-number/I5KLKAC6QW57RBTNFEXFAYXZK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/action/storage_attestation","attest_author":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/action/author_attestation","sign_citation":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/action/citation_signature","submit_replication":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/action/replication_record"}},"created_at":"2026-05-18T02:14:00.456541+00:00","updated_at":"2026-05-18T02:14:00.456541+00:00"}