{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GBYMCTU4P7NWRZFPISNBKA5AEA","short_pith_number":"pith:GBYMCTU4","schema_version":"1.0","canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","source":{"kind":"arxiv","id":"1901.09877","version":1},"attestation_state":"computed","paper":{"title":"Dominating Sets and Connected Dominating Sets in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Saulpic, Giuseppe F. Italiano, Niklas Hjuler, Nikos Parotsidis","submitted_at":"2019-01-28T18:47:22Z","abstract_excerpt":"In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time $O(\\Delta\\cdot \\text{polylog}~n)$ per update, where $\\Delta$ is the maximum vertex degree in the graph. In both cases, we achieve an approximation ratio of $O(\\log n)$, which is optimal up to a constant factor (under the assumption that $P \\ne NP$). Although those two problems have been widely studied in the static and in the distri"},"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":"1901.09877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T18:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"99a7d364aa9824b9da50be224810f49f36a049ac55be2bed30194896c3c7c5cf","abstract_canon_sha256":"14d7fe6d8faf6e21cfd7d30102e23ad2e586225bdb7d2ee956b24eb9d3ba8f74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.619021Z","signature_b64":"uGfh7DMgHi7EmhAR2cQEi6UVH3THxSu6V6KiB/oQzA6+UA50v74S/S0g879UAYII4LPC2e+fzQ/sEt5o49jpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","last_reissued_at":"2026-05-17T23:55:23.618539Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.618539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating Sets and Connected Dominating Sets in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Saulpic, Giuseppe F. Italiano, Niklas Hjuler, Nikos Parotsidis","submitted_at":"2019-01-28T18:47:22Z","abstract_excerpt":"In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time $O(\\Delta\\cdot \\text{polylog}~n)$ per update, where $\\Delta$ is the maximum vertex degree in the graph. In both cases, we achieve an approximation ratio of $O(\\log n)$, which is optimal up to a constant factor (under the assumption that $P \\ne NP$). Although those two problems have been widely studied in the static and in the distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09877","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":"1901.09877","created_at":"2026-05-17T23:55:23.618614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09877v1","created_at":"2026-05-17T23:55:23.618614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09877","created_at":"2026-05-17T23:55:23.618614+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBYMCTU4P7NW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBYMCTU4P7NWRZFP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBYMCTU4","created_at":"2026-05-18T12:33:18.533446+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/GBYMCTU4P7NWRZFPISNBKA5AEA","json":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA.json","graph_json":"https://pith.science/api/pith-number/GBYMCTU4P7NWRZFPISNBKA5AEA/graph.json","events_json":"https://pith.science/api/pith-number/GBYMCTU4P7NWRZFPISNBKA5AEA/events.json","paper":"https://pith.science/paper/GBYMCTU4"},"agent_actions":{"view_html":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA","download_json":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA.json","view_paper":"https://pith.science/paper/GBYMCTU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09877&json=true","fetch_graph":"https://pith.science/api/pith-number/GBYMCTU4P7NWRZFPISNBKA5AEA/graph.json","fetch_events":"https://pith.science/api/pith-number/GBYMCTU4P7NWRZFPISNBKA5AEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/action/storage_attestation","attest_author":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/action/author_attestation","sign_citation":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/action/citation_signature","submit_replication":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/action/replication_record"}},"created_at":"2026-05-17T23:55:23.618614+00:00","updated_at":"2026-05-17T23:55:23.618614+00:00"}