{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7IDXIGVHE4QNFCV6WVEDNXGLPI","short_pith_number":"pith:7IDXIGVH","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"},"canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","source":{"kind":"arxiv","id":"1709.04599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04599","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04599v1","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04599","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"7IDXIGVHE4QN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7IDXIGVHE4QNFCV6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7IDXIGVH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7IDXIGVHE4QNFCV6WVEDNXGLPI","target":"record","payload":{"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"},"canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","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"},"source_kind":"arxiv","source_id":"1709.04599","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jm9Mx7UzdXIEEkOeBi34S9US26Q/E33RD19h4iz+WxE6vwDN3r67XrY4TdD5mefKD3+WcCHtePJuSku4y9/BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:19:46.773926Z"},"content_sha256":"30e5d2dd4ee258253870e75c2fa552b8ef9bc8fba0ae97efe09753f16bf5f7de","schema_version":"1.0","event_id":"sha256:30e5d2dd4ee258253870e75c2fa552b8ef9bc8fba0ae97efe09753f16bf5f7de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7IDXIGVHE4QNFCV6WVEDNXGLPI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlRJCmed3/R55wAHE1P3nOm5esnHUm8ERQwBjYgfpEK9p6ft47KdvZahTGGZd1FXpcCt5YnOLwq8SumZ2pTWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:19:46.774737Z"},"content_sha256":"8beb2ff903cf4d1cd4758940c86b1c36db19aff1f1d50acab0a6a1ba787c7484","schema_version":"1.0","event_id":"sha256:8beb2ff903cf4d1cd4758940c86b1c36db19aff1f1d50acab0a6a1ba787c7484"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/bundle.json","state_url":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T13:19:46Z","links":{"resolver":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI","bundle":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/bundle.json","state":"https://pith.science/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IDXIGVHE4QNFCV6WVEDNXGLPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7IDXIGVHE4QNFCV6WVEDNXGLPI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4d5d34d05645fac61947ff36293a8b213ee36051429e11b66ade18331d445ef3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-14T02:49:01Z","title_canon_sha256":"da784cc656dc3d5addcdb8e0d25635adcc149606c1fac5b21b37af6b0ddafb81"},"schema_version":"1.0","source":{"id":"1709.04599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04599","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04599v1","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04599","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"7IDXIGVHE4QN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7IDXIGVHE4QNFCV6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7IDXIGVH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:8beb2ff903cf4d1cd4758940c86b1c36db19aff1f1d50acab0a6a1ba787c7484","target":"graph","created_at":"2026-05-18T00:35:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Sepehr Assadi","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-14T02:49:01Z","title":"Simple Round Compression for Parallel Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04599","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30e5d2dd4ee258253870e75c2fa552b8ef9bc8fba0ae97efe09753f16bf5f7de","target":"record","created_at":"2026-05-18T00:35:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4d5d34d05645fac61947ff36293a8b213ee36051429e11b66ade18331d445ef3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-14T02:49:01Z","title_canon_sha256":"da784cc656dc3d5addcdb8e0d25635adcc149606c1fac5b21b37af6b0ddafb81"},"schema_version":"1.0","source":{"id":"1709.04599","kind":"arxiv","version":1}},"canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa07741aa72720d28abeb54836dccb7a0d421a607055325f9793eb5d79340232","first_computed_at":"2026-05-18T00:35:11.174821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:11.174821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mb1aOnh07KbiXoC6i8ARlHc54yFD0K2HrcmbisTc0rMvciH9vh8mUd4NDl/x6/s/k4d4zd0GC/ARguGh09E7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:11.175307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30e5d2dd4ee258253870e75c2fa552b8ef9bc8fba0ae97efe09753f16bf5f7de","sha256:8beb2ff903cf4d1cd4758940c86b1c36db19aff1f1d50acab0a6a1ba787c7484"],"state_sha256":"0c5dcbfe06af68d9c2fffb932920b9876ca6c7d8dc35849b668066aefd5a7945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWoKxjEl2rp5kt5YT1eXW2jeNDwqnXutb7rYuBalf2dzAb0wwpLSOPzOkKT+TmMbJCxM1O0SQTs4iFRvcMdmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:19:46.780669Z","bundle_sha256":"23ff720be705b87b604330087fa80bf40adba6de403933b97615d304745edeb9"}}