{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A6RW5OWJAH6ZWA7MHVITT7W2TS","short_pith_number":"pith:A6RW5OWJ","schema_version":"1.0","canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","source":{"kind":"arxiv","id":"1804.08908","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Fully Dynamic Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Yuhao Du","submitted_at":"2018-04-24T09:04:41Z","abstract_excerpt":"Maintaining maximal independent set in dynamic graph is a fundamental open problem in graph theory and the first sublinear time deterministic algorithm was came up by Assadi, Onak, Schieber and Solomon(STOC'18), which achieves $O(m^{3/4})$ amortized update time. We have two main contributions in this paper. We present a new simple deterministic algorithm with $O(m^{2/3}\\sqrt{\\log m})$ amortized update time, which improves the previous best result. And we also present the first randomized algorithm with expected $O(\\sqrt{m}\\log^{1.5}m)$ amortized time against an oblivious adversary."},"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":"1804.08908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T09:04:41Z","cross_cats_sorted":[],"title_canon_sha256":"002c133a5ccee8f3a46f8c5d6dd1bcc18bd63a004e126554c20c1a21ebcddebc","abstract_canon_sha256":"c1ca7a04419c8739b162c8cfa8c42fb23c80713974df10c3dc2e190fe32dfe0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.904997Z","signature_b64":"BbjowtN8CnmqMJAIdRTKvUDMIk7r34241m/zS8KNNbp3aXJskizY0ubucWGGcljLdHj5C968I30YpqQPf60SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","last_reissued_at":"2026-05-18T00:17:36.904349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.904349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Fully Dynamic Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Yuhao Du","submitted_at":"2018-04-24T09:04:41Z","abstract_excerpt":"Maintaining maximal independent set in dynamic graph is a fundamental open problem in graph theory and the first sublinear time deterministic algorithm was came up by Assadi, Onak, Schieber and Solomon(STOC'18), which achieves $O(m^{3/4})$ amortized update time. We have two main contributions in this paper. We present a new simple deterministic algorithm with $O(m^{2/3}\\sqrt{\\log m})$ amortized update time, which improves the previous best result. And we also present the first randomized algorithm with expected $O(\\sqrt{m}\\log^{1.5}m)$ amortized time against an oblivious adversary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08908","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":"1804.08908","created_at":"2026-05-18T00:17:36.904446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08908v1","created_at":"2026-05-18T00:17:36.904446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08908","created_at":"2026-05-18T00:17:36.904446+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6RW5OWJAH6Z","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6RW5OWJAH6ZWA7M","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6RW5OWJ","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07515","citing_title":"Parallel Batch-Dynamic Maximal Independent Set","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS","json":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS.json","graph_json":"https://pith.science/api/pith-number/A6RW5OWJAH6ZWA7MHVITT7W2TS/graph.json","events_json":"https://pith.science/api/pith-number/A6RW5OWJAH6ZWA7MHVITT7W2TS/events.json","paper":"https://pith.science/paper/A6RW5OWJ"},"agent_actions":{"view_html":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS","download_json":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS.json","view_paper":"https://pith.science/paper/A6RW5OWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08908&json=true","fetch_graph":"https://pith.science/api/pith-number/A6RW5OWJAH6ZWA7MHVITT7W2TS/graph.json","fetch_events":"https://pith.science/api/pith-number/A6RW5OWJAH6ZWA7MHVITT7W2TS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/action/storage_attestation","attest_author":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/action/author_attestation","sign_citation":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/action/citation_signature","submit_replication":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/action/replication_record"}},"created_at":"2026-05-18T00:17:36.904446+00:00","updated_at":"2026-05-18T00:17:36.904446+00:00"}