{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MI2RW72NEXM5D46B5KHRMZVTFY","short_pith_number":"pith:MI2RW72N","schema_version":"1.0","canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","source":{"kind":"arxiv","id":"1808.10316","version":1},"attestation_state":"computed","paper":{"title":"Fully Dynamic MIS in Uniformly Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Krzysztof Onak, Nicole Wein, Shay Solomon","submitted_at":"2018-08-30T14:33:29Z","abstract_excerpt":"We consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (STOC 2018) showed that an MIS can be maintained in sublinear (in the dynamically changing number of edges) amortized update time. In this paper we significantly improve the update time for uniformly sparse graphs. Specifically, for graphs with arboricity $\\alpha$, the amortized update time of our algorithm is $O(\\alpha^2 \\cdot \\log^2 n)$, where $n$ is the number of vertices. For low arboricity graphs, which include, fo"},"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":"1808.10316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T14:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"3539d855d2ac38f6ea2dcd0eb8fad05da178f1ee569b829a14d3e6b9e40b3735","abstract_canon_sha256":"6a0dd0c0f6305d8c4ca86a3d516dced260c78fc24cdd639e4c0b1ff2204dfff7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.175641Z","signature_b64":"2RAmhAtUJZbSQyOgZ+qVgHPa/GBYY777uuo2SxLR3dAS9sPtxplysvV49J4VMxTLgqvcZMT+aR3nZWJ3e24uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","last_reissued_at":"2026-05-18T00:06:49.175010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.175010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Dynamic MIS in Uniformly Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Krzysztof Onak, Nicole Wein, Shay Solomon","submitted_at":"2018-08-30T14:33:29Z","abstract_excerpt":"We consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (STOC 2018) showed that an MIS can be maintained in sublinear (in the dynamically changing number of edges) amortized update time. In this paper we significantly improve the update time for uniformly sparse graphs. Specifically, for graphs with arboricity $\\alpha$, the amortized update time of our algorithm is $O(\\alpha^2 \\cdot \\log^2 n)$, where $n$ is the number of vertices. For low arboricity graphs, which include, fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10316","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":"1808.10316","created_at":"2026-05-18T00:06:49.175103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10316v1","created_at":"2026-05-18T00:06:49.175103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10316","created_at":"2026-05-18T00:06:49.175103+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI2RW72NEXM5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI2RW72NEXM5D46B","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI2RW72N","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/MI2RW72NEXM5D46B5KHRMZVTFY","json":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY.json","graph_json":"https://pith.science/api/pith-number/MI2RW72NEXM5D46B5KHRMZVTFY/graph.json","events_json":"https://pith.science/api/pith-number/MI2RW72NEXM5D46B5KHRMZVTFY/events.json","paper":"https://pith.science/paper/MI2RW72N"},"agent_actions":{"view_html":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY","download_json":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY.json","view_paper":"https://pith.science/paper/MI2RW72N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10316&json=true","fetch_graph":"https://pith.science/api/pith-number/MI2RW72NEXM5D46B5KHRMZVTFY/graph.json","fetch_events":"https://pith.science/api/pith-number/MI2RW72NEXM5D46B5KHRMZVTFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/action/storage_attestation","attest_author":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/action/author_attestation","sign_citation":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/action/citation_signature","submit_replication":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/action/replication_record"}},"created_at":"2026-05-18T00:06:49.175103+00:00","updated_at":"2026-05-18T00:06:49.175103+00:00"}