{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7IDXIGVHE4QNFCV6WVEDNXGLPI","short_pith_number":"pith:7IDXIGVH","schema_version":"1.0","canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","source":{"kind":"arxiv","id":"1709.04599","version":1},"attestation_state":"computed","paper":{"title":"Simple Round Compression for Parallel Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi","submitted_at":"2017-09-14T02:49:01Z","abstract_excerpt":"Recently, Czumaj et.al. (arXiv 2017) presented a parallel (almost) $2$-approximation algorithm for the maximum matching problem in only $O({(\\log\\log{n})^2})$ rounds of the massive parallel computation (MPC) framework, when the memory per machine is $O(n)$. The main approach in their work is a way of compressing $O(\\log{n})$ rounds of a distributed algorithm for maximum matching into only $O({(\\log\\log{n})^2})$ MPC rounds.\n  In this note, we present a similar algorithm for the closely related problem of approximating the minimum vertex cover in the MPC framework. We show that one can achieve a"},"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":"1709.04599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-14T02:49:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"da784cc656dc3d5addcdb8e0d25635adcc149606c1fac5b21b37af6b0ddafb81","abstract_canon_sha256":"4d5d34d05645fac61947ff36293a8b213ee36051429e11b66ade18331d445ef3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:11.175307Z","signature_b64":"Mb1aOnh07KbiXoC6i8ARlHc54yFD0K2HrcmbisTc0rMvciH9vh8mUd4NDl/x6/s/k4d4zd0GC/ARguGh09E7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","last_reissued_at":"2026-05-18T00:35:11.174821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:11.174821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Round Compression for Parallel Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi","submitted_at":"2017-09-14T02:49:01Z","abstract_excerpt":"Recently, Czumaj et.al. (arXiv 2017) presented a parallel (almost) $2$-approximation algorithm for the maximum matching problem in only $O({(\\log\\log{n})^2})$ rounds of the massive parallel computation (MPC) framework, when the memory per machine is $O(n)$. The main approach in their work is a way of compressing $O(\\log{n})$ rounds of a distributed algorithm for maximum matching into only $O({(\\log\\log{n})^2})$ MPC rounds.\n  In this note, we present a similar algorithm for the closely related problem of approximating the minimum vertex cover in the MPC framework. We show that one can achieve a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04599","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":"1709.04599","created_at":"2026-05-18T00:35:11.174896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04599v1","created_at":"2026-05-18T00:35:11.174896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04599","created_at":"2026-05-18T00:35:11.174896+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IDXIGVHE4QN","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IDXIGVHE4QNFCV6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IDXIGVH","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01956","citing_title":"Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds","ref_index":2014,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI","json":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI.json","graph_json":"https://pith.science/api/pith-number/7IDXIGVHE4QNFCV6WVEDNXGLPI/graph.json","events_json":"https://pith.science/api/pith-number/7IDXIGVHE4QNFCV6WVEDNXGLPI/events.json","paper":"https://pith.science/paper/7IDXIGVH"},"agent_actions":{"view_html":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI","download_json":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI.json","view_paper":"https://pith.science/paper/7IDXIGVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04599&json=true","fetch_graph":"https://pith.science/api/pith-number/7IDXIGVHE4QNFCV6WVEDNXGLPI/graph.json","fetch_events":"https://pith.science/api/pith-number/7IDXIGVHE4QNFCV6WVEDNXGLPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/action/storage_attestation","attest_author":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/action/author_attestation","sign_citation":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/action/citation_signature","submit_replication":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/action/replication_record"}},"created_at":"2026-05-18T00:35:11.174896+00:00","updated_at":"2026-05-18T00:35:11.174896+00:00"}