{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MOGZZG3VQZOY7UWKWSJWUSNEMG","short_pith_number":"pith:MOGZZG3V","schema_version":"1.0","canonical_sha256":"638d9c9b75865d8fd2cab4936a49a461ae7a895117ff90fa27ff3850d14627ff","source":{"kind":"arxiv","id":"1803.01822","version":2},"attestation_state":"computed","paper":{"title":"EPTAS for Max Clique on Disks and Unit Balls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"\\'Edouard Bonnet, Marthe Bonamy, Nicolas Bousquet, Pierre Charbit, St\\'ephan Thomass\\'e","submitted_at":"2018-03-05T18:32:32Z","abstract_excerpt":"We propose a polynomial-time algorithm which takes as input a finite set of points of $\\mathbb R^3$ and compute, up to arbitrary precision, a maximum subset with diameter at most $1$. More precisely, we give the first randomized EPTAS and deterministic PTAS for Maximum Clique in unit ball graphs. Our approximation algorithm also works on disk graphs with arbitrary radii. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether "},"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":"1803.01822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-05T18:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"43eedcf394295dbcf839e4b92d18176c9976dac0864a90814be4f86215230fb7","abstract_canon_sha256":"20bb53a063e2c521ef76e466078ce45be69240e1c166c9761c2b55dcc7ac49e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.631005Z","signature_b64":"TiR9YZuoni0T9Z7d2i93J8Nn/mxmoSRMftxupH30P+2iSocp+xGcDcosESXestObleL/1Jw4u1HpNHdm+7f0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638d9c9b75865d8fd2cab4936a49a461ae7a895117ff90fa27ff3850d14627ff","last_reissued_at":"2026-05-18T00:18:45.630437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.630437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EPTAS for Max Clique on Disks and Unit Balls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"\\'Edouard Bonnet, Marthe Bonamy, Nicolas Bousquet, Pierre Charbit, St\\'ephan Thomass\\'e","submitted_at":"2018-03-05T18:32:32Z","abstract_excerpt":"We propose a polynomial-time algorithm which takes as input a finite set of points of $\\mathbb R^3$ and compute, up to arbitrary precision, a maximum subset with diameter at most $1$. More precisely, we give the first randomized EPTAS and deterministic PTAS for Maximum Clique in unit ball graphs. Our approximation algorithm also works on disk graphs with arbitrary radii. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01822","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":"1803.01822","created_at":"2026-05-18T00:18:45.630541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01822v2","created_at":"2026-05-18T00:18:45.630541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01822","created_at":"2026-05-18T00:18:45.630541+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOGZZG3VQZOY","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOGZZG3VQZOY7UWK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOGZZG3V","created_at":"2026-05-18T12:32:37.024351+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/MOGZZG3VQZOY7UWKWSJWUSNEMG","json":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG.json","graph_json":"https://pith.science/api/pith-number/MOGZZG3VQZOY7UWKWSJWUSNEMG/graph.json","events_json":"https://pith.science/api/pith-number/MOGZZG3VQZOY7UWKWSJWUSNEMG/events.json","paper":"https://pith.science/paper/MOGZZG3V"},"agent_actions":{"view_html":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG","download_json":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG.json","view_paper":"https://pith.science/paper/MOGZZG3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01822&json=true","fetch_graph":"https://pith.science/api/pith-number/MOGZZG3VQZOY7UWKWSJWUSNEMG/graph.json","fetch_events":"https://pith.science/api/pith-number/MOGZZG3VQZOY7UWKWSJWUSNEMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG/action/storage_attestation","attest_author":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG/action/author_attestation","sign_citation":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG/action/citation_signature","submit_replication":"https://pith.science/pith/MOGZZG3VQZOY7UWKWSJWUSNEMG/action/replication_record"}},"created_at":"2026-05-18T00:18:45.630541+00:00","updated_at":"2026-05-18T00:18:45.630541+00:00"}