{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NJR7E2FHBGZGKCXHSSXSUZ3RSU","short_pith_number":"pith:NJR7E2FH","schema_version":"1.0","canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","source":{"kind":"arxiv","id":"1807.08745","version":1},"attestation_state":"computed","paper":{"title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Krzysztof Onak","submitted_at":"2018-07-23T17:49:03Z","abstract_excerpt":"The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this model when the space per machine is $n^\\delta$ for $\\delta \\in (0,1)$, where $n$ is the number of vertices in the input graph. A direct simulation of classic PRAM and distributed algorithms from the 1980s results in algorithms that require at least a logarithmic number of MPC rounds. We give the first algorithm that breaks this logarithmic barrier and runs in $"},"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":"1807.08745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T17:49:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2c712a9b77af3a33aef125626f19906441b221a941c0b254b2cad10dfc5f016c","abstract_canon_sha256":"4c1e2bd75c45cd71a6463062b640de69398e9fa079a028e7a2be7bca374992e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:04.839783Z","signature_b64":"I/9S9+3YL8orTCUHhVHVo2q9V/z8WEPIH9HO5Vt+y05Q2U4960iPliatOVuEOOI2fv0l0aQSVndR/GzuYlfQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","last_reissued_at":"2026-05-18T00:10:04.839050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:04.839050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Krzysztof Onak","submitted_at":"2018-07-23T17:49:03Z","abstract_excerpt":"The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this model when the space per machine is $n^\\delta$ for $\\delta \\in (0,1)$, where $n$ is the number of vertices in the input graph. A direct simulation of classic PRAM and distributed algorithms from the 1980s results in algorithms that require at least a logarithmic number of MPC rounds. We give the first algorithm that breaks this logarithmic barrier and runs in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08745","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":"1807.08745","created_at":"2026-05-18T00:10:04.839168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08745v1","created_at":"2026-05-18T00:10:04.839168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08745","created_at":"2026-05-18T00:10:04.839168+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJR7E2FHBGZG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJR7E2FHBGZGKCXH","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJR7E2FH","created_at":"2026-05-18T12:32:40.477152+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":2017,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU","json":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU.json","graph_json":"https://pith.science/api/pith-number/NJR7E2FHBGZGKCXHSSXSUZ3RSU/graph.json","events_json":"https://pith.science/api/pith-number/NJR7E2FHBGZGKCXHSSXSUZ3RSU/events.json","paper":"https://pith.science/paper/NJR7E2FH"},"agent_actions":{"view_html":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU","download_json":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU.json","view_paper":"https://pith.science/paper/NJR7E2FH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08745&json=true","fetch_graph":"https://pith.science/api/pith-number/NJR7E2FHBGZGKCXHSSXSUZ3RSU/graph.json","fetch_events":"https://pith.science/api/pith-number/NJR7E2FHBGZGKCXHSSXSUZ3RSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/action/storage_attestation","attest_author":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/action/author_attestation","sign_citation":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/action/citation_signature","submit_replication":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/action/replication_record"}},"created_at":"2026-05-18T00:10:04.839168+00:00","updated_at":"2026-05-18T00:10:04.839168+00:00"}