{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KFOHLM6JPJ2AZRRQLH5CSMMOL","short_pith_number":"pith:6KFOHLM6","schema_version":"1.0","canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","source":{"kind":"arxiv","id":"1712.05010","version":2},"attestation_state":"computed","paper":{"title":"QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"\\'Edouard Bonnet, Eun Jung Kim, Florian Sikora, Panos Giannopoulos, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2017-12-13T21:10:13Z","abstract_excerpt":"A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \\textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexp"},"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":"1712.05010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-13T21:10:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c49c3408f4ee05aac44e7df497b7eecb2155355c125fcbc30d7640f4371d7ec","abstract_canon_sha256":"1970de4ebd035a10770d44ea036768d2487c0e76241c7138e8cdc4fe1dacd4a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:18.423178Z","signature_b64":"gtKn1VJrpCG1vs8eE8+6QUmV+0+5TqCDmD5VBBXxNgx+WiknypM9/eF1GCTJfMMRmVuDXFwK5t7FKRbDZAABDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","last_reissued_at":"2026-05-18T00:22:18.422755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:18.422755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"\\'Edouard Bonnet, Eun Jung Kim, Florian Sikora, Panos Giannopoulos, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2017-12-13T21:10:13Z","abstract_excerpt":"A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \\textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05010","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":"1712.05010","created_at":"2026-05-18T00:22:18.422822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05010v2","created_at":"2026-05-18T00:22:18.422822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05010","created_at":"2026-05-18T00:22:18.422822+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KFOHLM6JPJ2","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KFOHLM6JPJ2AZRR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KFOHLM6","created_at":"2026-05-18T12:31:03.183658+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/6KFOHLM6JPJ2AZRRQLH5CSMMOL","json":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL.json","graph_json":"https://pith.science/api/pith-number/6KFOHLM6JPJ2AZRRQLH5CSMMOL/graph.json","events_json":"https://pith.science/api/pith-number/6KFOHLM6JPJ2AZRRQLH5CSMMOL/events.json","paper":"https://pith.science/paper/6KFOHLM6"},"agent_actions":{"view_html":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL","download_json":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL.json","view_paper":"https://pith.science/paper/6KFOHLM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05010&json=true","fetch_graph":"https://pith.science/api/pith-number/6KFOHLM6JPJ2AZRRQLH5CSMMOL/graph.json","fetch_events":"https://pith.science/api/pith-number/6KFOHLM6JPJ2AZRRQLH5CSMMOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/action/storage_attestation","attest_author":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/action/author_attestation","sign_citation":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/action/citation_signature","submit_replication":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/action/replication_record"}},"created_at":"2026-05-18T00:22:18.422822+00:00","updated_at":"2026-05-18T00:22:18.422822+00:00"}