{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CVH5OFVXJZUBVAT44KHV7WR6RD","short_pith_number":"pith:CVH5OFVX","schema_version":"1.0","canonical_sha256":"154fd716b74e681a827ce28f5fda3e88d3a633983095cf631895b650895cc0d1","source":{"kind":"arxiv","id":"1506.05093","version":2},"attestation_state":"computed","paper":{"title":"An Improved Distributed Algorithm for Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohsen Ghaffari","submitted_at":"2015-06-16T19:38:40Z","abstract_excerpt":"The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents an extremely simple randomized algorithm providing a near-optimal local complexity for this problem, which incidentally, when combined with some recent techniques, also leads to a near-optimal global complexity.\n  Classical algorithms of Luby [STOC'85] and Alon, Babai and Itai [JALG'86] provide the global complexity guarantee that, with high probability, all nodes terminate after $O(\\log n)$ rounds. In contrast, our initial focus is on the local complexit"},"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":"1506.05093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T19:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"22cfebe9875793f6d0fccec895f02d823720e11ed88325d10cf88f4f11b93c07","abstract_canon_sha256":"341ea1a8fc53d8eb582dbf4c11a76613143e1fe45d40d3dea3d3068a3fc35e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:01.372070Z","signature_b64":"sPwHoXgp6YSRRAGtKtebsTuI/5JW/6+4JQYKGG7dPkuWNEvtjUe4QRr8ZzasFay5zJSzm3bHzHYb7jmNR4TkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154fd716b74e681a827ce28f5fda3e88d3a633983095cf631895b650895cc0d1","last_reissued_at":"2026-05-18T01:37:01.371572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:01.371572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Distributed Algorithm for Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohsen Ghaffari","submitted_at":"2015-06-16T19:38:40Z","abstract_excerpt":"The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents an extremely simple randomized algorithm providing a near-optimal local complexity for this problem, which incidentally, when combined with some recent techniques, also leads to a near-optimal global complexity.\n  Classical algorithms of Luby [STOC'85] and Alon, Babai and Itai [JALG'86] provide the global complexity guarantee that, with high probability, all nodes terminate after $O(\\log n)$ rounds. In contrast, our initial focus is on the local complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05093","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":"1506.05093","created_at":"2026-05-18T01:37:01.371639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05093v2","created_at":"2026-05-18T01:37:01.371639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05093","created_at":"2026-05-18T01:37:01.371639+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVH5OFVXJZUB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVH5OFVXJZUBVAT4","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVH5OFVX","created_at":"2026-05-18T12:29:17.054201+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/CVH5OFVXJZUBVAT44KHV7WR6RD","json":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD.json","graph_json":"https://pith.science/api/pith-number/CVH5OFVXJZUBVAT44KHV7WR6RD/graph.json","events_json":"https://pith.science/api/pith-number/CVH5OFVXJZUBVAT44KHV7WR6RD/events.json","paper":"https://pith.science/paper/CVH5OFVX"},"agent_actions":{"view_html":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD","download_json":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD.json","view_paper":"https://pith.science/paper/CVH5OFVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05093&json=true","fetch_graph":"https://pith.science/api/pith-number/CVH5OFVXJZUBVAT44KHV7WR6RD/graph.json","fetch_events":"https://pith.science/api/pith-number/CVH5OFVXJZUBVAT44KHV7WR6RD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD/action/storage_attestation","attest_author":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD/action/author_attestation","sign_citation":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD/action/citation_signature","submit_replication":"https://pith.science/pith/CVH5OFVXJZUBVAT44KHV7WR6RD/action/replication_record"}},"created_at":"2026-05-18T01:37:01.371639+00:00","updated_at":"2026-05-18T01:37:01.371639+00:00"}