{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NVW52BLUH5A36XS3VYUPW5KTAP","short_pith_number":"pith:NVW52BLU","schema_version":"1.0","canonical_sha256":"6d6ddd05743f41bf5e5bae28fb755303e9f85d9cdbc98ab654fb07bab6660c03","source":{"kind":"arxiv","id":"1906.09595","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morteza Monemizadeh","submitted_at":"2019-06-23T13:19:05Z","abstract_excerpt":"Given a stream $\\mathcal{S}$ of insertions and deletions of edges of an underlying graph $G$ (with fixed vertex set $V$ where $n=|V|$ is the number of vertices of $G$), we propose a dynamic algorithm that maintains a maximal independent set (MIS) of $G$ (at any time $t$ of the stream $\\mathcal{S}$) with amortized update time $O(\\log^3 n)$."},"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":"1906.09595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-23T13:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"142b30d924451b3a702acb7e8421d6f07b708380013339bbff2a7f6e5c7ce401","abstract_canon_sha256":"347320926b69c4ff1b46fd594fc50ac74e8456d7e66def15cb6d10fb53dd45c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:37.444734Z","signature_b64":"XjuNT5o9bueCQnRJCfn6cyf4DRpC/03uK0l9WvOKDqXbsH5YLGoZX1/bInVKv2L3WNDl5uEu5XinOj1mZ5VRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d6ddd05743f41bf5e5bae28fb755303e9f85d9cdbc98ab654fb07bab6660c03","last_reissued_at":"2026-05-17T23:42:37.444007Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:37.444007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morteza Monemizadeh","submitted_at":"2019-06-23T13:19:05Z","abstract_excerpt":"Given a stream $\\mathcal{S}$ of insertions and deletions of edges of an underlying graph $G$ (with fixed vertex set $V$ where $n=|V|$ is the number of vertices of $G$), we propose a dynamic algorithm that maintains a maximal independent set (MIS) of $G$ (at any time $t$ of the stream $\\mathcal{S}$) with amortized update time $O(\\log^3 n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09595","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":"1906.09595","created_at":"2026-05-17T23:42:37.444119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09595v1","created_at":"2026-05-17T23:42:37.444119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09595","created_at":"2026-05-17T23:42:37.444119+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVW52BLUH5A3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVW52BLUH5A36XS3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVW52BLU","created_at":"2026-05-18T12:33:24.271573+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/NVW52BLUH5A36XS3VYUPW5KTAP","json":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP.json","graph_json":"https://pith.science/api/pith-number/NVW52BLUH5A36XS3VYUPW5KTAP/graph.json","events_json":"https://pith.science/api/pith-number/NVW52BLUH5A36XS3VYUPW5KTAP/events.json","paper":"https://pith.science/paper/NVW52BLU"},"agent_actions":{"view_html":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP","download_json":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP.json","view_paper":"https://pith.science/paper/NVW52BLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09595&json=true","fetch_graph":"https://pith.science/api/pith-number/NVW52BLUH5A36XS3VYUPW5KTAP/graph.json","fetch_events":"https://pith.science/api/pith-number/NVW52BLUH5A36XS3VYUPW5KTAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP/action/storage_attestation","attest_author":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP/action/author_attestation","sign_citation":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP/action/citation_signature","submit_replication":"https://pith.science/pith/NVW52BLUH5A36XS3VYUPW5KTAP/action/replication_record"}},"created_at":"2026-05-17T23:42:37.444119+00:00","updated_at":"2026-05-17T23:42:37.444119+00:00"}