{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ORRZSC4652F5DUYD3Q77FYWS4P","short_pith_number":"pith:ORRZSC46","schema_version":"1.0","canonical_sha256":"7463990b9eee8bd1d303dc3ff2e2d2e3d9f62d1145fc6ca04aad5c616d184ce8","source":{"kind":"arxiv","id":"1402.2549","version":1},"attestation_state":"computed","paper":{"title":"Local Approximability of Minimum Dominating Set on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Jukka Suomela, Miikka Hilke","submitted_at":"2014-02-11T16:24:05Z","abstract_excerpt":"We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a $(7-\\epsilon)$-approximation of a minimum dominating set on planar graphs, for any positive constant $\\epsilon$. In prior work, the best lower bound on the approximation ratio has been $5-\\epsilon$; there is also an upper bound of $52$."},"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":"1402.2549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-11T16:24:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"158f7eeb08bf885ebeae24351018ae679446aa97a2ec95276b8dc508d6a4a873","abstract_canon_sha256":"816920b8f5866efb360ffe75706cda625c109a376d3b0738395c335020b04ce8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.347153Z","signature_b64":"fRetnp1IqNI0zcyoO+lh5bGubgnOqYJECsIUVBkfdkTyQJPGYgqxW93Bzn12Mwy6GQUBcaS7MKzXFcddnKFWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7463990b9eee8bd1d303dc3ff2e2d2e3d9f62d1145fc6ca04aad5c616d184ce8","last_reissued_at":"2026-05-18T02:59:19.346417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.346417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Approximability of Minimum Dominating Set on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Jukka Suomela, Miikka Hilke","submitted_at":"2014-02-11T16:24:05Z","abstract_excerpt":"We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a $(7-\\epsilon)$-approximation of a minimum dominating set on planar graphs, for any positive constant $\\epsilon$. In prior work, the best lower bound on the approximation ratio has been $5-\\epsilon$; there is also an upper bound of $52$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2549","kind":"arxiv","version":1},"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":"1402.2549","created_at":"2026-05-18T02:59:19.346528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2549v1","created_at":"2026-05-18T02:59:19.346528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2549","created_at":"2026-05-18T02:59:19.346528+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORRZSC4652F5","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORRZSC4652F5DUYD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORRZSC46","created_at":"2026-05-18T12:28:43.426989+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/ORRZSC4652F5DUYD3Q77FYWS4P","json":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P.json","graph_json":"https://pith.science/api/pith-number/ORRZSC4652F5DUYD3Q77FYWS4P/graph.json","events_json":"https://pith.science/api/pith-number/ORRZSC4652F5DUYD3Q77FYWS4P/events.json","paper":"https://pith.science/paper/ORRZSC46"},"agent_actions":{"view_html":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P","download_json":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P.json","view_paper":"https://pith.science/paper/ORRZSC46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2549&json=true","fetch_graph":"https://pith.science/api/pith-number/ORRZSC4652F5DUYD3Q77FYWS4P/graph.json","fetch_events":"https://pith.science/api/pith-number/ORRZSC4652F5DUYD3Q77FYWS4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P/action/storage_attestation","attest_author":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P/action/author_attestation","sign_citation":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P/action/citation_signature","submit_replication":"https://pith.science/pith/ORRZSC4652F5DUYD3Q77FYWS4P/action/replication_record"}},"created_at":"2026-05-18T02:59:19.346528+00:00","updated_at":"2026-05-18T02:59:19.346528+00:00"}