{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NFVVY6QB4UFECB3GDKXXDRTCS7","short_pith_number":"pith:NFVVY6QB","schema_version":"1.0","canonical_sha256":"696b5c7a01e50a4107661aaf71c66297c80e71ce044a81c1b998beef8fa37a8c","source":{"kind":"arxiv","id":"1807.06251","version":1},"attestation_state":"computed","paper":{"title":"Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Mohsen Ghaffari","submitted_at":"2018-07-17T07:01:03Z","abstract_excerpt":"We introduce a method for sparsifying distributed algorithms and exhibit how it leads to improvements that go past known barriers in two algorithmic settings of large-scale graph processing: Massively Parallel Computation (MPC), and Local Computation Algorithms (LCA).\n  - MPC with Strongly Sublinear Memory: Recently, there has been growing interest in obtaining MPC algorithms that are faster than their classic $O(\\log n)$-round parallel counterparts for problems such as MIS, Maximal Matching, 2-Approximation of Minimum Vertex Cover, and $(1+\\epsilon)$-Approximation of Maximum Matching. Current"},"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.06251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T07:01:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"045aa001a20a39cc663ac7f01a0bf5c6c053f98255f66f23fee17d6658060947","abstract_canon_sha256":"007936f37f00505ae30a796d6a721e61e524e4d62f4f526b1319a6726a843f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.583363Z","signature_b64":"OeFyf8mVuJbWjEkvPtp9Hpr8EGvCGzNCokCFh8vf9q28FNVgvXOCrCYEdbvi9NWEnoX0lHl0KmtCsRNfSF05DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"696b5c7a01e50a4107661aaf71c66297c80e71ce044a81c1b998beef8fa37a8c","last_reissued_at":"2026-05-18T00:10:33.582730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.582730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Mohsen Ghaffari","submitted_at":"2018-07-17T07:01:03Z","abstract_excerpt":"We introduce a method for sparsifying distributed algorithms and exhibit how it leads to improvements that go past known barriers in two algorithmic settings of large-scale graph processing: Massively Parallel Computation (MPC), and Local Computation Algorithms (LCA).\n  - MPC with Strongly Sublinear Memory: Recently, there has been growing interest in obtaining MPC algorithms that are faster than their classic $O(\\log n)$-round parallel counterparts for problems such as MIS, Maximal Matching, 2-Approximation of Minimum Vertex Cover, and $(1+\\epsilon)$-Approximation of Maximum Matching. Current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06251","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.06251","created_at":"2026-05-18T00:10:33.582851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06251v1","created_at":"2026-05-18T00:10:33.582851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06251","created_at":"2026-05-18T00:10:33.582851+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFVVY6QB4UFE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFVVY6QB4UFECB3G","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFVVY6QB","created_at":"2026-05-18T12:32:40.477152+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/NFVVY6QB4UFECB3GDKXXDRTCS7","json":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7.json","graph_json":"https://pith.science/api/pith-number/NFVVY6QB4UFECB3GDKXXDRTCS7/graph.json","events_json":"https://pith.science/api/pith-number/NFVVY6QB4UFECB3GDKXXDRTCS7/events.json","paper":"https://pith.science/paper/NFVVY6QB"},"agent_actions":{"view_html":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7","download_json":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7.json","view_paper":"https://pith.science/paper/NFVVY6QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06251&json=true","fetch_graph":"https://pith.science/api/pith-number/NFVVY6QB4UFECB3GDKXXDRTCS7/graph.json","fetch_events":"https://pith.science/api/pith-number/NFVVY6QB4UFECB3GDKXXDRTCS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7/action/storage_attestation","attest_author":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7/action/author_attestation","sign_citation":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7/action/citation_signature","submit_replication":"https://pith.science/pith/NFVVY6QB4UFECB3GDKXXDRTCS7/action/replication_record"}},"created_at":"2026-05-18T00:10:33.582851+00:00","updated_at":"2026-05-18T00:10:33.582851+00:00"}