{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MI2RW72NEXM5D46B5KHRMZVTFY","short_pith_number":"pith:MI2RW72N","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"},"canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","source":{"kind":"arxiv","id":"1808.10316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10316","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10316v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10316","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"MI2RW72NEXM5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MI2RW72NEXM5D46B","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MI2RW72N","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MI2RW72NEXM5D46B5KHRMZVTFY","target":"record","payload":{"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"},"canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","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"},"source_kind":"arxiv","source_id":"1808.10316","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:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKDi+cjr5D+eQiGdnAzfosXQNwNX3K5xSs27tOTTQwo/OQaJbNoxnV8xzzt8gfS5psnuZei1XJli5HYgNx55Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:51.145328Z"},"content_sha256":"0998f043ed6999b797d1189f5ba524cd75488dc625a95bea861a47cca2665f22","schema_version":"1.0","event_id":"sha256:0998f043ed6999b797d1189f5ba524cd75488dc625a95bea861a47cca2665f22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MI2RW72NEXM5D46B5KHRMZVTFY","target":"graph","payload":{"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"},"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:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73IJY9rClwAE9S+KfWYutMvXe7Gd4M3ocSjWSr/QndKhhdtxTNLufRj6X2LjTj4FgZZ6QXZ9bbgRHvUNi51zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:51.145746Z"},"content_sha256":"991fe603dd00466c198c9b8c043e299f9252e074722e28fd1945963f572e173a","schema_version":"1.0","event_id":"sha256:991fe603dd00466c198c9b8c043e299f9252e074722e28fd1945963f572e173a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/bundle.json","state_url":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MI2RW72NEXM5D46B5KHRMZVTFY/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-27T01:14:51Z","links":{"resolver":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY","bundle":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/bundle.json","state":"https://pith.science/pith/MI2RW72NEXM5D46B5KHRMZVTFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MI2RW72NEXM5D46B5KHRMZVTFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MI2RW72NEXM5D46B5KHRMZVTFY","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":"6a0dd0c0f6305d8c4ca86a3d516dced260c78fc24cdd639e4c0b1ff2204dfff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T14:33:29Z","title_canon_sha256":"3539d855d2ac38f6ea2dcd0eb8fad05da178f1ee569b829a14d3e6b9e40b3735"},"schema_version":"1.0","source":{"id":"1808.10316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10316","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10316v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10316","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"MI2RW72NEXM5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MI2RW72NEXM5D46B","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MI2RW72N","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:991fe603dd00466c198c9b8c043e299f9252e074722e28fd1945963f572e173a","target":"graph","created_at":"2026-05-18T00:06:49Z","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":"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","authors_text":"Baruch Schieber, Krzysztof Onak, Nicole Wein, Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T14:33:29Z","title":"Fully Dynamic MIS in Uniformly Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10316","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:0998f043ed6999b797d1189f5ba524cd75488dc625a95bea861a47cca2665f22","target":"record","created_at":"2026-05-18T00:06:49Z","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":"6a0dd0c0f6305d8c4ca86a3d516dced260c78fc24cdd639e4c0b1ff2204dfff7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T14:33:29Z","title_canon_sha256":"3539d855d2ac38f6ea2dcd0eb8fad05da178f1ee569b829a14d3e6b9e40b3735"},"schema_version":"1.0","source":{"id":"1808.10316","kind":"arxiv","version":1}},"canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62351b7f4d25d9d1f3c1ea8f1666b32e3dee8d2d9a5ba7111b3e4926e5a1edb2","first_computed_at":"2026-05-18T00:06:49.175010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:49.175010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2RAmhAtUJZbSQyOgZ+qVgHPa/GBYY777uuo2SxLR3dAS9sPtxplysvV49J4VMxTLgqvcZMT+aR3nZWJ3e24uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:49.175641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0998f043ed6999b797d1189f5ba524cd75488dc625a95bea861a47cca2665f22","sha256:991fe603dd00466c198c9b8c043e299f9252e074722e28fd1945963f572e173a"],"state_sha256":"2aaadbaf7e4a401ef669339b3bb42377f5c6790a21d968462891d9851d42cbfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nkH81WHJOX/x94UBDVMAG6iHj8K34lROL4XsDKJ3b6vEjH3gvua+mFAwZLszbsMwXF9pdZr4RXnmELlLsJpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:14:51.148045Z","bundle_sha256":"27ea0a24d287b0b655d443cf58448e05ce6cf9d34d3843e475a5bb349425bffe"}}