{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G6NVTSPZWRIPT45JT2GZBJ7NKL","short_pith_number":"pith:G6NVTSPZ","schema_version":"1.0","canonical_sha256":"379b59c9f9b450f9f3a99e8d90a7ed52d5780d872c6aaa01a474980fe37801de","source":{"kind":"arxiv","id":"2605.19157","version":1},"attestation_state":"computed","paper":{"title":"Meta-Theorems for Cuttable Distributed Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandra Wesolek, Avinandan Das, Cyril Gavoille, Jukka Suomela, Marthe Bonamy, Timoth\\'e Picavet","submitted_at":"2026-05-18T22:23:26Z","abstract_excerpt":"We prove that given any $\\alpha$-approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an $f(g)$-round $(3\\alpha+1)$-approximation LOCAL algorithm for MDS on graphs embeddable in a given Euler genus-$g$ surface. Heydt et al. [European Journal of Combinatorics (2025)] gave an algorithm with $\\alpha=11+\\varepsilon$, from which we derive a $(34 +\\varepsilon)$-approximation algorithm for graphs of genus $g$, therefore improving upon the current state of the art of $24g+O(1)$ due to Amiri et al. [ACM Transactions on Algorithms (2019)]. It also improves th"},"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":"2605.19157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T22:23:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"70b04cb6c3b8580e5d9af556b7633040cd585cad055c59a862a2bc6da6027f04","abstract_canon_sha256":"33672f366ec2e0b261a3fea478b8bcfbb84985a637e59597b053be7e0402db8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:30.759152Z","signature_b64":"hqwig2bBROyrJyEgm5hR9pDoHHWMIdgrErmIrM8C4Ef2uITU+CDb1Jk0s2OLRL98gPL/mGtbHiNlnNTw/8tGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"379b59c9f9b450f9f3a99e8d90a7ed52d5780d872c6aaa01a474980fe37801de","last_reissued_at":"2026-05-20T01:05:30.758370Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:30.758370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Theorems for Cuttable Distributed Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandra Wesolek, Avinandan Das, Cyril Gavoille, Jukka Suomela, Marthe Bonamy, Timoth\\'e Picavet","submitted_at":"2026-05-18T22:23:26Z","abstract_excerpt":"We prove that given any $\\alpha$-approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an $f(g)$-round $(3\\alpha+1)$-approximation LOCAL algorithm for MDS on graphs embeddable in a given Euler genus-$g$ surface. Heydt et al. [European Journal of Combinatorics (2025)] gave an algorithm with $\\alpha=11+\\varepsilon$, from which we derive a $(34 +\\varepsilon)$-approximation algorithm for graphs of genus $g$, therefore improving upon the current state of the art of $24g+O(1)$ due to Amiri et al. [ACM Transactions on Algorithms (2019)]. It also improves th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19157","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19157/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19157","created_at":"2026-05-20T01:05:30.758501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19157v1","created_at":"2026-05-20T01:05:30.758501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19157","created_at":"2026-05-20T01:05:30.758501+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6NVTSPZWRIP","created_at":"2026-05-20T01:05:30.758501+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6NVTSPZWRIPT45J","created_at":"2026-05-20T01:05:30.758501+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6NVTSPZ","created_at":"2026-05-20T01:05:30.758501+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/G6NVTSPZWRIPT45JT2GZBJ7NKL","json":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL.json","graph_json":"https://pith.science/api/pith-number/G6NVTSPZWRIPT45JT2GZBJ7NKL/graph.json","events_json":"https://pith.science/api/pith-number/G6NVTSPZWRIPT45JT2GZBJ7NKL/events.json","paper":"https://pith.science/paper/G6NVTSPZ"},"agent_actions":{"view_html":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL","download_json":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL.json","view_paper":"https://pith.science/paper/G6NVTSPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19157&json=true","fetch_graph":"https://pith.science/api/pith-number/G6NVTSPZWRIPT45JT2GZBJ7NKL/graph.json","fetch_events":"https://pith.science/api/pith-number/G6NVTSPZWRIPT45JT2GZBJ7NKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL/action/storage_attestation","attest_author":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL/action/author_attestation","sign_citation":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL/action/citation_signature","submit_replication":"https://pith.science/pith/G6NVTSPZWRIPT45JT2GZBJ7NKL/action/replication_record"}},"created_at":"2026-05-20T01:05:30.758501+00:00","updated_at":"2026-05-20T01:05:30.758501+00:00"}