{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A6RW5OWJAH6ZWA7MHVITT7W2TS","short_pith_number":"pith:A6RW5OWJ","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"},"canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","source":{"kind":"arxiv","id":"1804.08908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08908","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08908v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08908","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"A6RW5OWJAH6Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6RW5OWJAH6ZWA7M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6RW5OWJ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A6RW5OWJAH6ZWA7MHVITT7W2TS","target":"record","payload":{"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"},"canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","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"},"source_kind":"arxiv","source_id":"1804.08908","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oE1M82MRwajkBSAJPlqPlAkzqm8al80wx6a+VSG+JqzcNr8mYtianWhy8JCcf+qmoKuL/w0XYOnYb0sTqT+BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:34:27.348018Z"},"content_sha256":"b0d34c93facdc9fadd98c4c2b943aa996ae2bb467fd7e3211f5cd02e9f903ddc","schema_version":"1.0","event_id":"sha256:b0d34c93facdc9fadd98c4c2b943aa996ae2bb467fd7e3211f5cd02e9f903ddc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A6RW5OWJAH6ZWA7MHVITT7W2TS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+V8h9eZcfPLtrfXLKPtgsSrw49595LUO2xAa/YmnAAnl0/PKuImIqSwi30uw2ZBb8jadl1bwLGJ4Y8JkBNtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:34:27.348380Z"},"content_sha256":"54e25db94fbc80f86abeaf7af3067fde7e3a0245a8bfbbcdc46d06feced8da97","schema_version":"1.0","event_id":"sha256:54e25db94fbc80f86abeaf7af3067fde7e3a0245a8bfbbcdc46d06feced8da97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/bundle.json","state_url":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T07:34:27Z","links":{"resolver":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS","bundle":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/bundle.json","state":"https://pith.science/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6RW5OWJAH6ZWA7MHVITT7W2TS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A6RW5OWJAH6ZWA7MHVITT7W2TS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c1ca7a04419c8739b162c8cfa8c42fb23c80713974df10c3dc2e190fe32dfe0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T09:04:41Z","title_canon_sha256":"002c133a5ccee8f3a46f8c5d6dd1bcc18bd63a004e126554c20c1a21ebcddebc"},"schema_version":"1.0","source":{"id":"1804.08908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08908","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08908v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08908","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"A6RW5OWJAH6Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6RW5OWJAH6ZWA7M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6RW5OWJ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:54e25db94fbc80f86abeaf7af3067fde7e3a0245a8bfbbcdc46d06feced8da97","target":"graph","created_at":"2026-05-18T00:17:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Hengjie Zhang, Yuhao Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T09:04:41Z","title":"Improved Algorithms for Fully Dynamic Maximal Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08908","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0d34c93facdc9fadd98c4c2b943aa996ae2bb467fd7e3211f5cd02e9f903ddc","target":"record","created_at":"2026-05-18T00:17:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c1ca7a04419c8739b162c8cfa8c42fb23c80713974df10c3dc2e190fe32dfe0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T09:04:41Z","title_canon_sha256":"002c133a5ccee8f3a46f8c5d6dd1bcc18bd63a004e126554c20c1a21ebcddebc"},"schema_version":"1.0","source":{"id":"1804.08908","kind":"arxiv","version":1}},"canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07a36ebac901fd9b03ec3d5139feda9cb7989cd769c739267507584de38b6dea","first_computed_at":"2026-05-18T00:17:36.904349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.904349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbjowtN8CnmqMJAIdRTKvUDMIk7r34241m/zS8KNNbp3aXJskizY0ubucWGGcljLdHj5C968I30YpqQPf60SBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.904997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d34c93facdc9fadd98c4c2b943aa996ae2bb467fd7e3211f5cd02e9f903ddc","sha256:54e25db94fbc80f86abeaf7af3067fde7e3a0245a8bfbbcdc46d06feced8da97"],"state_sha256":"19bdf2711c3e72439ffe0ce373d2363183c922f3521c7ad68347a190f9734fda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8L2pYNH5z6tma3Bo+2Hf5HIqv2SDp02eU/zMfVpJllss12N+EXTl0MZayKuCymYwSF4ym39xJTjq+lpelCrCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:34:27.350483Z","bundle_sha256":"1724fd89ec313f58d0e1bf2c74579d4f708ebf48d4dea74fc4782eb959ee226d"}}