{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M275UMOQFRNCMHPTJKKT3KHDTL","short_pith_number":"pith:M275UMOQ","schema_version":"1.0","canonical_sha256":"66bfda31d02c5a261df34a953da8e39aede1b1fa7ca9de1041ab8173194995b0","source":{"kind":"arxiv","id":"1807.05374","version":2},"attestation_state":"computed","paper":{"title":"Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Manuela Fischer, Sebastian Brandt","submitted_at":"2018-07-14T10:33:21Z","abstract_excerpt":"The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained a lot of importance, especially in the context of classic graph problems. Unsatisfactorily, all current $\\text{poly} (\\log \\log n)$-round MPC algorithms seem to get fundamentally stuck at the linear-memory barrier: their efficiency crucially relies on each machine having space at least linear in the number $n$ of nodes. As this might not only be prohibitively large, but also allows for easy if not trivial solutions for sparse graphs, w"},"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.05374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T10:33:21Z","cross_cats_sorted":[],"title_canon_sha256":"5eeb71528315c82a3758a587a48ded3a3052702dec53dfc2e07b6612040493c4","abstract_canon_sha256":"b589b01b57a09fcb2590038ddc9d56af1539f460281e781e0aa24adf1dfb52a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:21.446221Z","signature_b64":"jCRpASsV1F+bXDmXTKr/q4w9OlEYEFVZu/RsImDwW5G4YV9VdAVKHqHfBCwnUgNowAByJ4lBsCvM9RcILaH3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bfda31d02c5a261df34a953da8e39aede1b1fa7ca9de1041ab8173194995b0","last_reissued_at":"2026-05-18T00:10:21.445692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:21.445692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Manuela Fischer, Sebastian Brandt","submitted_at":"2018-07-14T10:33:21Z","abstract_excerpt":"The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained a lot of importance, especially in the context of classic graph problems. Unsatisfactorily, all current $\\text{poly} (\\log \\log n)$-round MPC algorithms seem to get fundamentally stuck at the linear-memory barrier: their efficiency crucially relies on each machine having space at least linear in the number $n$ of nodes. As this might not only be prohibitively large, but also allows for easy if not trivial solutions for sparse graphs, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05374","kind":"arxiv","version":2},"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.05374","created_at":"2026-05-18T00:10:21.445776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05374v2","created_at":"2026-05-18T00:10:21.445776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05374","created_at":"2026-05-18T00:10:21.445776+00:00"},{"alias_kind":"pith_short_12","alias_value":"M275UMOQFRNC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M275UMOQFRNCMHPT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M275UMOQ","created_at":"2026-05-18T12:32:37.024351+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/M275UMOQFRNCMHPTJKKT3KHDTL","json":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL.json","graph_json":"https://pith.science/api/pith-number/M275UMOQFRNCMHPTJKKT3KHDTL/graph.json","events_json":"https://pith.science/api/pith-number/M275UMOQFRNCMHPTJKKT3KHDTL/events.json","paper":"https://pith.science/paper/M275UMOQ"},"agent_actions":{"view_html":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL","download_json":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL.json","view_paper":"https://pith.science/paper/M275UMOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05374&json=true","fetch_graph":"https://pith.science/api/pith-number/M275UMOQFRNCMHPTJKKT3KHDTL/graph.json","fetch_events":"https://pith.science/api/pith-number/M275UMOQFRNCMHPTJKKT3KHDTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL/action/storage_attestation","attest_author":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL/action/author_attestation","sign_citation":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL/action/citation_signature","submit_replication":"https://pith.science/pith/M275UMOQFRNCMHPTJKKT3KHDTL/action/replication_record"}},"created_at":"2026-05-18T00:10:21.445776+00:00","updated_at":"2026-05-18T00:10:21.445776+00:00"}