{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EA4YQKZGL7EXOQGZJTW4AEMPPY","short_pith_number":"pith:EA4YQKZG","canonical_record":{"source":{"id":"1802.09709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T03:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"753bf3c39313fd470527bf85520426cc31627eaa7877cfe834fb82dbe6ff7428","abstract_canon_sha256":"763a29d5343297e9401545c13638125b8867910966e58bb3ee11e95a4bb1d450"},"schema_version":"1.0"},"canonical_sha256":"2039882b265fc97740d94cedc0118f7e11aa79917fde726569b3a625029dcfd2","source":{"kind":"arxiv","id":"1802.09709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09709","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09709v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09709","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"EA4YQKZGL7EX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EA4YQKZGL7EXOQGZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EA4YQKZG","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EA4YQKZGL7EXOQGZJTW4AEMPPY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T03:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"753bf3c39313fd470527bf85520426cc31627eaa7877cfe834fb82dbe6ff7428","abstract_canon_sha256":"763a29d5343297e9401545c13638125b8867910966e58bb3ee11e95a4bb1d450"},"schema_version":"1.0"},"canonical_sha256":"2039882b265fc97740d94cedc0118f7e11aa79917fde726569b3a625029dcfd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:30.306041Z","signature_b64":"cVuBTcxySSHBTHf+v4/7wtxDwlggq9gKd3lyyohbNy8DpRD3/P27sOWdfAVCHRPlK8uG4ZFfUsvfyvem/+hVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2039882b265fc97740d94cedc0118f7e11aa79917fde726569b3a625029dcfd2","last_reissued_at":"2026-05-18T00:22:30.305348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:30.305348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09709","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:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obJDag6/ShBhhb7bCnsxSrJwdWkp9gSv3Jblj0mBAGHLbOysK71ZW7JmUVP66ZogFu6pjEsPk8tc8LndcGdmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:59:56.703519Z"},"content_sha256":"5061b701cfee85b594d7c7a661a79fb2167ca39a0514889ed344bf6446e29b50","schema_version":"1.0","event_id":"sha256:5061b701cfee85b594d7c7a661a79fb2167ca39a0514889ed344bf6446e29b50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EA4YQKZGL7EXOQGZJTW4AEMPPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Maximal Independent Set with Sublinear 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-02-27T03:56:48Z","abstract_excerpt":"A maximal independent set (MIS) can be maintained in an evolving $m$-edge graph by simply recomputing it from scratch in $O(m)$ time after each update. But can it be maintained in time sublinear in $m$ in fully dynamic graphs?\n  We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time $O(\\min\\{\\Delta,m^{3/4}\\})$, where $\\Delta$ is a fixed bound on the maximum degree in the graph and $m$ is the (dynamically changing) number of edges.\n  We further present a distributed implementation of our algorithm with $O(\\min\\{\\Delta,m^{3/4}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09709","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:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjtzQuq4mBaNr3Ja0zOAnbBz/e65Yw5kv4FGNLH2tRtp2UpZr2/Fp0qtAKg4nKpIAWoB/2N6bW5OlY2OUGFYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:59:56.704245Z"},"content_sha256":"c234ff212721bd27813113a5223891b9834d87a6e1e3ff1bae9c2a532d5f2836","schema_version":"1.0","event_id":"sha256:c234ff212721bd27813113a5223891b9834d87a6e1e3ff1bae9c2a532d5f2836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/bundle.json","state_url":"https://pith.science/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/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-06-01T04:59:56Z","links":{"resolver":"https://pith.science/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY","bundle":"https://pith.science/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/bundle.json","state":"https://pith.science/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EA4YQKZGL7EXOQGZJTW4AEMPPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EA4YQKZGL7EXOQGZJTW4AEMPPY","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":"763a29d5343297e9401545c13638125b8867910966e58bb3ee11e95a4bb1d450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T03:56:48Z","title_canon_sha256":"753bf3c39313fd470527bf85520426cc31627eaa7877cfe834fb82dbe6ff7428"},"schema_version":"1.0","source":{"id":"1802.09709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09709","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09709v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09709","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"EA4YQKZGL7EX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EA4YQKZGL7EXOQGZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EA4YQKZG","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:c234ff212721bd27813113a5223891b9834d87a6e1e3ff1bae9c2a532d5f2836","target":"graph","created_at":"2026-05-18T00:22:30Z","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":"A maximal independent set (MIS) can be maintained in an evolving $m$-edge graph by simply recomputing it from scratch in $O(m)$ time after each update. But can it be maintained in time sublinear in $m$ in fully dynamic graphs?\n  We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time $O(\\min\\{\\Delta,m^{3/4}\\})$, where $\\Delta$ is a fixed bound on the maximum degree in the graph and $m$ is the (dynamically changing) number of edges.\n  We further present a distributed implementation of our algorithm with $O(\\min\\{\\Delta,m^{3/4}","authors_text":"Baruch Schieber, Krzysztof Onak, Sepehr Assadi, Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T03:56:48Z","title":"Fully Dynamic Maximal Independent Set with Sublinear Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09709","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:5061b701cfee85b594d7c7a661a79fb2167ca39a0514889ed344bf6446e29b50","target":"record","created_at":"2026-05-18T00:22:30Z","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":"763a29d5343297e9401545c13638125b8867910966e58bb3ee11e95a4bb1d450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T03:56:48Z","title_canon_sha256":"753bf3c39313fd470527bf85520426cc31627eaa7877cfe834fb82dbe6ff7428"},"schema_version":"1.0","source":{"id":"1802.09709","kind":"arxiv","version":1}},"canonical_sha256":"2039882b265fc97740d94cedc0118f7e11aa79917fde726569b3a625029dcfd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2039882b265fc97740d94cedc0118f7e11aa79917fde726569b3a625029dcfd2","first_computed_at":"2026-05-18T00:22:30.305348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:30.305348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVuBTcxySSHBTHf+v4/7wtxDwlggq9gKd3lyyohbNy8DpRD3/P27sOWdfAVCHRPlK8uG4ZFfUsvfyvem/+hVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:30.306041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5061b701cfee85b594d7c7a661a79fb2167ca39a0514889ed344bf6446e29b50","sha256:c234ff212721bd27813113a5223891b9834d87a6e1e3ff1bae9c2a532d5f2836"],"state_sha256":"8267d983d6ca98be48442fb7386558b26bc96ad6fefc30d58fe2a6c3fd306c3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmmvq+pVU6Uq2xPCei8SnFG5aMVk9j/YJx529OUoW9QqGe18y0WefQRhdmJWljCPJPrw2ar2eqMprd+dFqUpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:59:56.707689Z","bundle_sha256":"7f606a729263236f75ad1650b0c32093a79a8f63171bd8e672a7ac46ec7cdf25"}}