{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NJR7E2FHBGZGKCXHSSXSUZ3RSU","short_pith_number":"pith:NJR7E2FH","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"},"canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","source":{"kind":"arxiv","id":"1807.08745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08745","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08745v1","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08745","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"pith_short_12","alias_value":"NJR7E2FHBGZG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJR7E2FHBGZGKCXH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJR7E2FH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NJR7E2FHBGZGKCXHSSXSUZ3RSU","target":"record","payload":{"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"},"canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","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"},"source_kind":"arxiv","source_id":"1807.08745","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:10:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeognH9VkocoOaAs1LPxBrq9aKiON42mQarpGuWa1tVGYZg1TrhMBdEj+QInlIjKZLb8iqN+KqxNYENgbctWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:48:00.349347Z"},"content_sha256":"832e096af97b6423c71762e609135ab9b4d1d5137fb5530986d0f96b4bd927b5","schema_version":"1.0","event_id":"sha256:832e096af97b6423c71762e609135ab9b4d1d5137fb5530986d0f96b4bd927b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NJR7E2FHBGZGKCXHSSXSUZ3RSU","target":"graph","payload":{"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"},"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:10:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0j9NjEPix3QEI77i7vEhUxK0pr2LyzhAKoFYJrEBM5YqXy9ElcFwNA24la/di3ZWNLfVCyjyBvMRfoQJO7OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:48:00.349832Z"},"content_sha256":"a65184bdfc147ab0d9dbaea7e8da23474d7a220f03bfb1a94cd9489c44019f10","schema_version":"1.0","event_id":"sha256:a65184bdfc147ab0d9dbaea7e8da23474d7a220f03bfb1a94cd9489c44019f10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/bundle.json","state_url":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/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-16T14:48:00Z","links":{"resolver":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU","bundle":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/bundle.json","state":"https://pith.science/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJR7E2FHBGZGKCXHSSXSUZ3RSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NJR7E2FHBGZGKCXHSSXSUZ3RSU","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":"4c1e2bd75c45cd71a6463062b640de69398e9fa079a028e7a2be7bca374992e6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T17:49:03Z","title_canon_sha256":"2c712a9b77af3a33aef125626f19906441b221a941c0b254b2cad10dfc5f016c"},"schema_version":"1.0","source":{"id":"1807.08745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08745","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08745v1","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08745","created_at":"2026-05-18T00:10:04Z"},{"alias_kind":"pith_short_12","alias_value":"NJR7E2FHBGZG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJR7E2FHBGZGKCXH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJR7E2FH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a65184bdfc147ab0d9dbaea7e8da23474d7a220f03bfb1a94cd9489c44019f10","target":"graph","created_at":"2026-05-18T00:10:04Z","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":"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 $","authors_text":"Krzysztof Onak","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08745","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:832e096af97b6423c71762e609135ab9b4d1d5137fb5530986d0f96b4bd927b5","target":"record","created_at":"2026-05-18T00:10:04Z","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":"4c1e2bd75c45cd71a6463062b640de69398e9fa079a028e7a2be7bca374992e6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T17:49:03Z","title_canon_sha256":"2c712a9b77af3a33aef125626f19906441b221a941c0b254b2cad10dfc5f016c"},"schema_version":"1.0","source":{"id":"1807.08745","kind":"arxiv","version":1}},"canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a63f268a709b2650ae794af2a67719533afd7ffe1fb71debcbe04b98fea3416","first_computed_at":"2026-05-18T00:10:04.839050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:04.839050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/9S9+3YL8orTCUHhVHVo2q9V/z8WEPIH9HO5Vt+y05Q2U4960iPliatOVuEOOI2fv0l0aQSVndR/GzuYlfQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:04.839783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:832e096af97b6423c71762e609135ab9b4d1d5137fb5530986d0f96b4bd927b5","sha256:a65184bdfc147ab0d9dbaea7e8da23474d7a220f03bfb1a94cd9489c44019f10"],"state_sha256":"619b54010a7dbc726642207defba968f19f309fdd28cde3f1cb24233996d50b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8qXgsRriqIL8EMUFw9I4aaSQ+6RMpD22yiprqWjvxYYo6rj032KCJmtwiotMxqiYabrvNvYfHuzVuaY0ukvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:48:00.355377Z","bundle_sha256":"3d75c1ff553270e264b6b4b275354b168904ae21fa92c7c6f6e8a65b27deaa4f"}}