{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KFOHLM6JPJ2AZRRQLH5CSMMOL","short_pith_number":"pith:6KFOHLM6","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"},"canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","source":{"kind":"arxiv","id":"1712.05010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05010","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05010v2","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05010","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"6KFOHLM6JPJ2","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KFOHLM6JPJ2AZRR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KFOHLM6","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KFOHLM6JPJ2AZRRQLH5CSMMOL","target":"record","payload":{"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"},"canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","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"},"source_kind":"arxiv","source_id":"1712.05010","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-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Hbpk4qSSufTcBNEh9y66BtNExkjSqCe/IHovBkf5JESwlP9SCeIOakm6W8Cqw3wvNddvcC5Rpitr8TVHH42Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:42.660908Z"},"content_sha256":"4c56b5dee0c70e85e6f85f89b9965a925ff4576a375b7801ef9f0ab2e4ffc159","schema_version":"1.0","event_id":"sha256:4c56b5dee0c70e85e6f85f89b9965a925ff4576a375b7801ef9f0ab2e4ffc159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KFOHLM6JPJ2AZRRQLH5CSMMOL","target":"graph","payload":{"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"},"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-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OC/iF+SFGt9j0BUh8ZV1GumH9hXlVPnllLO0rF2Ip+JpJzNrqAp/N6BskrKzOIH10df+qWpyO0WwrEp2EzdgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:42.662163Z"},"content_sha256":"5aea261c529843a90c9a5af9a486f5019a038e50c0182cf019af907fa938989e","schema_version":"1.0","event_id":"sha256:5aea261c529843a90c9a5af9a486f5019a038e50c0182cf019af907fa938989e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/bundle.json","state_url":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/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-31T02:56:42Z","links":{"resolver":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL","bundle":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/bundle.json","state":"https://pith.science/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KFOHLM6JPJ2AZRRQLH5CSMMOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KFOHLM6JPJ2AZRRQLH5CSMMOL","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":"1970de4ebd035a10770d44ea036768d2487c0e76241c7138e8cdc4fe1dacd4a5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-13T21:10:13Z","title_canon_sha256":"6c49c3408f4ee05aac44e7df497b7eecb2155355c125fcbc30d7640f4371d7ec"},"schema_version":"1.0","source":{"id":"1712.05010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05010","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05010v2","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05010","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"6KFOHLM6JPJ2","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KFOHLM6JPJ2AZRR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KFOHLM6","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5aea261c529843a90c9a5af9a486f5019a038e50c0182cf019af907fa938989e","target":"graph","created_at":"2026-05-18T00:22:18Z","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":"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","authors_text":"\\'Edouard Bonnet, Eun Jung Kim, Florian Sikora, Panos Giannopoulos, Pawe{\\l} Rz\\k{a}\\.zewski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-13T21:10:13Z","title":"QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05010","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:4c56b5dee0c70e85e6f85f89b9965a925ff4576a375b7801ef9f0ab2e4ffc159","target":"record","created_at":"2026-05-18T00:22:18Z","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":"1970de4ebd035a10770d44ea036768d2487c0e76241c7138e8cdc4fe1dacd4a5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-13T21:10:13Z","title_canon_sha256":"6c49c3408f4ee05aac44e7df497b7eecb2155355c125fcbc30d7640f4371d7ec"},"schema_version":"1.0","source":{"id":"1712.05010","kind":"arxiv","version":2}},"canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28ae3ad9e4bd3a0663182cfd1498c72c2621a3479af701613df3286ec4fcc20","first_computed_at":"2026-05-18T00:22:18.422755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:18.422755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtKn1VJrpCG1vs8eE8+6QUmV+0+5TqCDmD5VBBXxNgx+WiknypM9/eF1GCTJfMMRmVuDXFwK5t7FKRbDZAABDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:18.423178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c56b5dee0c70e85e6f85f89b9965a925ff4576a375b7801ef9f0ab2e4ffc159","sha256:5aea261c529843a90c9a5af9a486f5019a038e50c0182cf019af907fa938989e"],"state_sha256":"89ba00379302978fdfd1e86351e14bc8d7836cd90f13cffa5a40b4bb9566d4cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E54aIFHB7DsnONQ4qi8eG/Ytx+XyxQODcL75T1xWDmy8n85C4aGucwPI+BTa/0lM5Kw2XmRUctvC9wHLUHNJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:56:42.665607Z","bundle_sha256":"053426eb8422129456d6f6ccdd7f51d043fc94da2b727d91119948bbe4a8b175"}}