{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DJB2CZT4MNOBB2N6OWW5YUZS44","short_pith_number":"pith:DJB2CZT4","schema_version":"1.0","canonical_sha256":"1a43a1667c635c10e9be75addc5332e70f6f893df244f89b5dfb0d99986837a1","source":{"kind":"arxiv","id":"1507.04330","version":2},"attestation_state":"computed","paper":{"title":"Optimal Dynamic Distributed MIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Elad Haramaty, Keren Censor-Hillel, Zohar Karnin","submitted_at":"2015-07-15T19:09:35Z","abstract_excerpt":"Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed computing. The local nature of an MIS allows for fast solutions in a static distributed setting, which are logarithmic in the number of nodes or in their degrees. The result trivially applies for the dynamic distributed model, in which edges or nodes may be inserted or deleted. In this paper, we take a different approach which exploits locality to the extreme, and show how to update an MIS in a dynamic distributed setting, either \\emph{synchronous} or \\emph{asynchronous}, with only \\emph{a single adjustment"},"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":"1507.04330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T19:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"4eaea19c806e805dcf712b09517f7f4bbd44cd395cb17fc9ef0942c144a761c1","abstract_canon_sha256":"67dbea86563ba949ad5505db5a1d666b2b179347d962ba390ffbffbceb240883"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.618841Z","signature_b64":"artUKr8p7gpOzOKz9UuEUzX3pJH8HqkoQeyXMmIpZXPrje7tZNaqETi5nXPBDk/mIfALpl6wJmjYqPTIAKcAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a43a1667c635c10e9be75addc5332e70f6f893df244f89b5dfb0d99986837a1","last_reissued_at":"2026-05-18T01:36:47.618103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.618103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Dynamic Distributed MIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Elad Haramaty, Keren Censor-Hillel, Zohar Karnin","submitted_at":"2015-07-15T19:09:35Z","abstract_excerpt":"Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed computing. The local nature of an MIS allows for fast solutions in a static distributed setting, which are logarithmic in the number of nodes or in their degrees. The result trivially applies for the dynamic distributed model, in which edges or nodes may be inserted or deleted. In this paper, we take a different approach which exploits locality to the extreme, and show how to update an MIS in a dynamic distributed setting, either \\emph{synchronous} or \\emph{asynchronous}, with only \\emph{a single adjustment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04330","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":"1507.04330","created_at":"2026-05-18T01:36:47.618223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04330v2","created_at":"2026-05-18T01:36:47.618223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04330","created_at":"2026-05-18T01:36:47.618223+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJB2CZT4MNOB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJB2CZT4MNOBB2N6","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJB2CZT4","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/DJB2CZT4MNOBB2N6OWW5YUZS44","json":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44.json","graph_json":"https://pith.science/api/pith-number/DJB2CZT4MNOBB2N6OWW5YUZS44/graph.json","events_json":"https://pith.science/api/pith-number/DJB2CZT4MNOBB2N6OWW5YUZS44/events.json","paper":"https://pith.science/paper/DJB2CZT4"},"agent_actions":{"view_html":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44","download_json":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44.json","view_paper":"https://pith.science/paper/DJB2CZT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04330&json=true","fetch_graph":"https://pith.science/api/pith-number/DJB2CZT4MNOBB2N6OWW5YUZS44/graph.json","fetch_events":"https://pith.science/api/pith-number/DJB2CZT4MNOBB2N6OWW5YUZS44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44/action/storage_attestation","attest_author":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44/action/author_attestation","sign_citation":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44/action/citation_signature","submit_replication":"https://pith.science/pith/DJB2CZT4MNOBB2N6OWW5YUZS44/action/replication_record"}},"created_at":"2026-05-18T01:36:47.618223+00:00","updated_at":"2026-05-18T01:36:47.618223+00:00"}