{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N6GU4YCX3RAQ56FBKSRTZXLY73","short_pith_number":"pith:N6GU4YCX","schema_version":"1.0","canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","source":{"kind":"arxiv","id":"2605.13264","version":1},"attestation_state":"computed","paper":{"title":"Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Davies-Peck","submitted_at":"2026-05-13T09:45:29Z","abstract_excerpt":"The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\\Omega(\\min\\{\\sqrt{\\frac{\\log n}{\\log\\log n}}, \\frac{\\log \\Delta}{\\log\\log \\Delta}\\})$ rounds, for any polylogarithmic or smaller approximation ratio. As a function of $\\Delta$, this complexity was subsequently matched for constant-approximate weighted vertex cover [Bar-Yehuda, Censor-Hillel and Schwartzman, JACM 2017] and constant-approximate maximum matching [Bar-Yehuda, Censor-Hillel, Ghaffari and Sch"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"747c6329186ea98414002dbbc467e4de09f1f5f2f37dd0c1f9e5365be78953b6","abstract_canon_sha256":"89893655d03c07aab82e493ed435ec0132af8e91be3b7db8b3482b23b997ce8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:49.328349Z","signature_b64":"jyXvZN9kv5lesyI9IwmVK2fVKHLqsDcW8y1Tixfy4TOoHiN+GhhVAYVwawVH95Kwd1RoJzI9ttFZYQgXRslUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","last_reissued_at":"2026-05-18T02:44:49.327891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:49.327891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Davies-Peck","submitted_at":"2026-05-13T09:45:29Z","abstract_excerpt":"The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\\Omega(\\min\\{\\sqrt{\\frac{\\log n}{\\log\\log n}}, \\frac{\\log \\Delta}{\\log\\log \\Delta}\\})$ rounds, for any polylogarithmic or smaller approximation ratio. As a function of $\\Delta$, this complexity was subsequently matched for constant-approximate weighted vertex cover [Bar-Yehuda, Censor-Hillel and Schwartzman, JACM 2017] and constant-approximate maximum matching [Bar-Yehuda, Censor-Hillel, Ghaffari and Sch"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91664b3890cefacf4aced56d95d9fe3e9ac1b093ec7a27209d890cdccd6ab5a0"},"source":{"id":"2605.13264","kind":"arxiv","version":1},"verdict":{"id":"0f44f64b-cb96-464a-8218-d83ed0f5468d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:54:30.384808Z","strongest_claim":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds.","one_line_summary":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model.","pith_extraction_headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model."},"references":{"count":23,"sample":[{"doi":"","year":1989,"title":"B. Awerbuch, M. Luby, A.V. Goldberg, and S.A. Plotkin. Network decomposition and locality in distributed computation. In30th Annual Symposium on Foundations of Computer Science, pages 364– 369, 1989","work_id":"1a10d076-efec-488c-b4df-0dc5451c09c9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Massively parallel minimum spanning tree in general metric spaces","work_id":"48be5ec4-a716-4560-b4ce-e2bd8efdea18","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Distributed approximation of maximum independent set and maximum matching","work_id":"925adcc0-7778-4c31-9e6d-01fe1140478d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"A distributed(2 +ε)- approximation for vertex cover inO(log ∆/εlog log ∆)rounds.J","work_id":"2170eafe-fd17-44ce-8cda-5330beddbaa4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"The locality of distributed symmetry breaking","work_id":"7bdf13b3-86be-4a41-8a48-ca67ffd38dda","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"472c27fd45f1f7a047a3fbe456c080337a08d75eac54cd8999d7d480d3394b12","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.13264","created_at":"2026-05-18T02:44:49.327960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13264v1","created_at":"2026-05-18T02:44:49.327960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13264","created_at":"2026-05-18T02:44:49.327960+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6GU4YCX3RAQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6GU4YCX3RAQ56FB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6GU4YCX","created_at":"2026-05-18T12:33:37.589309+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/N6GU4YCX3RAQ56FBKSRTZXLY73","json":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73.json","graph_json":"https://pith.science/api/pith-number/N6GU4YCX3RAQ56FBKSRTZXLY73/graph.json","events_json":"https://pith.science/api/pith-number/N6GU4YCX3RAQ56FBKSRTZXLY73/events.json","paper":"https://pith.science/paper/N6GU4YCX"},"agent_actions":{"view_html":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73","download_json":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73.json","view_paper":"https://pith.science/paper/N6GU4YCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13264&json=true","fetch_graph":"https://pith.science/api/pith-number/N6GU4YCX3RAQ56FBKSRTZXLY73/graph.json","fetch_events":"https://pith.science/api/pith-number/N6GU4YCX3RAQ56FBKSRTZXLY73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/action/storage_attestation","attest_author":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/action/author_attestation","sign_citation":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/action/citation_signature","submit_replication":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/action/replication_record"}},"created_at":"2026-05-18T02:44:49.327960+00:00","updated_at":"2026-05-18T02:44:49.327960+00:00"}