{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:I5KLKAC6QW57RBTNFEXFAYXZK2","short_pith_number":"pith:I5KLKAC6","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"},"canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","source":{"kind":"arxiv","id":"0904.2203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2203","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2203v2","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2203","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5KLKAC6QW57","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"I5KLKAC6QW57RBTN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"I5KLKAC6","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:I5KLKAC6QW57RBTNFEXFAYXZK2","target":"record","payload":{"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"},"canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","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"},"source_kind":"arxiv","source_id":"0904.2203","source_version":2,"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-18T02:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5RLfZDsvSxMFjuzYeGXFm0pJpo5oy/e5k6ut+Yg+TiTgUG3Y+/Zi9xF9vEB7orMNPxflyS9L9psQxmU8Rh0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:13.463638Z"},"content_sha256":"db5d4303243b7754ad950dcf1691b205caa4ece14d19d6b9b77e47ee1b0c6256","schema_version":"1.0","event_id":"sha256:db5d4303243b7754ad950dcf1691b205caa4ece14d19d6b9b77e47ee1b0c6256"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:I5KLKAC6QW57RBTNFEXFAYXZK2","target":"graph","payload":{"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"},"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-18T02:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6AFXjIcKWoDqng+62zc7VvJPLcZNtuUPoB2JNG+2pXSQEG95i181D0wdrxyCvIJzTxXQGrzL7rtyVByEdlUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:13.464399Z"},"content_sha256":"c2de1692765ee760d4f7790d831858527ec8925e942322aba937674ae5253d61","schema_version":"1.0","event_id":"sha256:c2de1692765ee760d4f7790d831858527ec8925e942322aba937674ae5253d61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/bundle.json","state_url":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/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-05-30T10:42:13Z","links":{"resolver":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2","bundle":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/bundle.json","state":"https://pith.science/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5KLKAC6QW57RBTNFEXFAYXZK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:I5KLKAC6QW57RBTNFEXFAYXZK2","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":"0f330de680c12fdd33098145de046ac1bdb57cb46acf1fe0aeace485215ebd9c","cross_cats_sorted":["cs.DC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-04-14T20:44:57Z","title_canon_sha256":"8815f0525c67740f1d52bf19f44fb54cc16cca6d8e367020702fb05f3fd3c718"},"schema_version":"1.0","source":{"id":"0904.2203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2203","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2203v2","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2203","created_at":"2026-05-18T02:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5KLKAC6QW57","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"I5KLKAC6QW57RBTN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"I5KLKAC6","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:c2de1692765ee760d4f7790d831858527ec8925e942322aba937674ae5253d61","target":"graph","created_at":"2026-05-18T02:14:00Z","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":"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","authors_text":"Canada), Edmonton, Imran A. Pirwani (1), Mohammad R. Salavatipour (1) ((1) Department of Computing Science, University of Alberta","cross_cats":["cs.DC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-04-14T20:44:57Z","title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2203","kind":"arxiv","version":2},"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:db5d4303243b7754ad950dcf1691b205caa4ece14d19d6b9b77e47ee1b0c6256","target":"record","created_at":"2026-05-18T02:14:00Z","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":"0f330de680c12fdd33098145de046ac1bdb57cb46acf1fe0aeace485215ebd9c","cross_cats_sorted":["cs.DC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-04-14T20:44:57Z","title_canon_sha256":"8815f0525c67740f1d52bf19f44fb54cc16cca6d8e367020702fb05f3fd3c718"},"schema_version":"1.0","source":{"id":"0904.2203","kind":"arxiv","version":2}},"canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4754b5005e85bbf8866d292e5062f956a612556663c72e2a36b8b8727e78c696","first_computed_at":"2026-05-18T02:14:00.456458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:00.456458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcX54pEAHjG9zpiTROQurHUlitzmvMmdzXiTQqNabdmk8P5dxJch4xCBgKGt1ZuEml2dpD5m1LphuSatVPytCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:00.456942Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.2203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db5d4303243b7754ad950dcf1691b205caa4ece14d19d6b9b77e47ee1b0c6256","sha256:c2de1692765ee760d4f7790d831858527ec8925e942322aba937674ae5253d61"],"state_sha256":"9aacbb8e153a8273be3d40a1c75a5134b0b9223e29283a1a3c12164ccb22c1ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fpv6PMwIkaQCM3MKasbPbb5giUxjCZumiVx793lFvn8VFrrkyR4/3jaNhNsKUSUnU6CLH9aTh1y6JNCHM4r/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:42:13.468080Z","bundle_sha256":"58a2c7822e64110a5528dc6526e9949101f666f2dbed1acb4899f5c81c7e0a44"}}