{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7QGAQ7GX2XUOU3L6KFPOJ6EOHH","short_pith_number":"pith:7QGAQ7GX","schema_version":"1.0","canonical_sha256":"fc0c087cd7d5e8ea6d7e515ee4f88e39f7b201fc87e3b1fa533172acff7cb22d","source":{"kind":"arxiv","id":"1806.10051","version":1},"attestation_state":"computed","paper":{"title":"Fully Dynamic Maximal Independent Set with Sublinear in n Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Krzysztof Onak, Sepehr Assadi, Shay Solomon","submitted_at":"2018-06-26T15:07:47Z","abstract_excerpt":"The first fully dynamic algorithm for maintaining a maximal independent set (MIS) with update time that is sublinear in the number of edges was presented recently by the authors of this paper [Assadi et.al. STOC'18]. The algorithm is deterministic and its update time is $O(m^{3/4})$, where $m$ is the (dynamically changing) number of edges. Subsequently, Gupta and Khan and independently Du and Zhang [arXiv, April 2018] presented deterministic algorithms for dynamic MIS with update times of $O(m^{2/3})$ and $O(m^{2/3} \\sqrt{\\log m})$, respectively. Du and Zhang also gave a randomized algorithm 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":"1806.10051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T15:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"d3d2bc192d71a8edc419e039a315c7c0adf2fd3694e5be4da725f95915d3dfc9","abstract_canon_sha256":"d2c5688e2e232e4651c851bed24f3640eb16aaa050e29b2807c2f467c6bff5f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:20.098951Z","signature_b64":"oWyCCbCM9eOBkMMwjrjq7yxyY7jZAR7JVPP/ZFB7+3YbeMW6nmrl5m54Ffkg/xgo93xc7038E1KFrOL7/FQoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0c087cd7d5e8ea6d7e515ee4f88e39f7b201fc87e3b1fa533172acff7cb22d","last_reissued_at":"2026-05-18T00:12:20.098291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:20.098291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Dynamic Maximal Independent Set with Sublinear in n Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Krzysztof Onak, Sepehr Assadi, Shay Solomon","submitted_at":"2018-06-26T15:07:47Z","abstract_excerpt":"The first fully dynamic algorithm for maintaining a maximal independent set (MIS) with update time that is sublinear in the number of edges was presented recently by the authors of this paper [Assadi et.al. STOC'18]. The algorithm is deterministic and its update time is $O(m^{3/4})$, where $m$ is the (dynamically changing) number of edges. Subsequently, Gupta and Khan and independently Du and Zhang [arXiv, April 2018] presented deterministic algorithms for dynamic MIS with update times of $O(m^{2/3})$ and $O(m^{2/3} \\sqrt{\\log m})$, respectively. Du and Zhang also gave a randomized algorithm w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10051","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":"1806.10051","created_at":"2026-05-18T00:12:20.098396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10051v1","created_at":"2026-05-18T00:12:20.098396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10051","created_at":"2026-05-18T00:12:20.098396+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QGAQ7GX2XUO","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QGAQ7GX2XUOU3L6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QGAQ7GX","created_at":"2026-05-18T12:32:11.075285+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/7QGAQ7GX2XUOU3L6KFPOJ6EOHH","json":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH.json","graph_json":"https://pith.science/api/pith-number/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/graph.json","events_json":"https://pith.science/api/pith-number/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/events.json","paper":"https://pith.science/paper/7QGAQ7GX"},"agent_actions":{"view_html":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH","download_json":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH.json","view_paper":"https://pith.science/paper/7QGAQ7GX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10051&json=true","fetch_graph":"https://pith.science/api/pith-number/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/graph.json","fetch_events":"https://pith.science/api/pith-number/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/action/storage_attestation","attest_author":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/action/author_attestation","sign_citation":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/action/citation_signature","submit_replication":"https://pith.science/pith/7QGAQ7GX2XUOU3L6KFPOJ6EOHH/action/replication_record"}},"created_at":"2026-05-18T00:12:20.098396+00:00","updated_at":"2026-05-18T00:12:20.098396+00:00"}