{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GBYMCTU4P7NWRZFPISNBKA5AEA","short_pith_number":"pith:GBYMCTU4","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"},"canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","source":{"kind":"arxiv","id":"1901.09877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09877","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09877v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09877","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"GBYMCTU4P7NW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GBYMCTU4P7NWRZFP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GBYMCTU4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GBYMCTU4P7NWRZFPISNBKA5AEA","target":"record","payload":{"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"},"canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","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"},"source_kind":"arxiv","source_id":"1901.09877","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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i094np3tv6/7Cw4PD3dPI6YkWojwexkBqZOQIDZRgPSbF6+aMkgg5zDzSNtN7AOByE7k1Xmgj59ajHg9R5CLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:57:56.799270Z"},"content_sha256":"0063985eaaaaea0182017988a56efe022c170c84c61fc61c779044275117d92b","schema_version":"1.0","event_id":"sha256:0063985eaaaaea0182017988a56efe022c170c84c61fc61c779044275117d92b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GBYMCTU4P7NWRZFPISNBKA5AEA","target":"graph","payload":{"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"},"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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8mZ9YmhJhl4F/j8FbDiRPFD/Ok8T3S28v48egtuASKY5an05ViEfGA6LObBQ4QvYloblJ49/433hF6OHaY6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:57:56.800000Z"},"content_sha256":"da0f430fa567ec7df22f7d98ddeb96a596617cf22e9fc886b68f367169835da4","schema_version":"1.0","event_id":"sha256:da0f430fa567ec7df22f7d98ddeb96a596617cf22e9fc886b68f367169835da4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/bundle.json","state_url":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/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-09T06:57:56Z","links":{"resolver":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA","bundle":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/bundle.json","state":"https://pith.science/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBYMCTU4P7NWRZFPISNBKA5AEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GBYMCTU4P7NWRZFPISNBKA5AEA","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":"14d7fe6d8faf6e21cfd7d30102e23ad2e586225bdb7d2ee956b24eb9d3ba8f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T18:47:22Z","title_canon_sha256":"99a7d364aa9824b9da50be224810f49f36a049ac55be2bed30194896c3c7c5cf"},"schema_version":"1.0","source":{"id":"1901.09877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09877","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09877v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09877","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"GBYMCTU4P7NW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GBYMCTU4P7NWRZFP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GBYMCTU4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:da0f430fa567ec7df22f7d98ddeb96a596617cf22e9fc886b68f367169835da4","target":"graph","created_at":"2026-05-17T23:55:23Z","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":"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","authors_text":"David Saulpic, Giuseppe F. Italiano, Niklas Hjuler, Nikos Parotsidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T18:47:22Z","title":"Dominating Sets and Connected Dominating Sets in Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09877","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:0063985eaaaaea0182017988a56efe022c170c84c61fc61c779044275117d92b","target":"record","created_at":"2026-05-17T23:55:23Z","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":"14d7fe6d8faf6e21cfd7d30102e23ad2e586225bdb7d2ee956b24eb9d3ba8f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T18:47:22Z","title_canon_sha256":"99a7d364aa9824b9da50be224810f49f36a049ac55be2bed30194896c3c7c5cf"},"schema_version":"1.0","source":{"id":"1901.09877","kind":"arxiv","version":1}},"canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3070c14e9c7fdb68e4af449a1503a020031629855bb2a587ded96d0a6f13769f","first_computed_at":"2026-05-17T23:55:23.618539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.618539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGfh7DMgHi7EmhAR2cQEi6UVH3THxSu6V6KiB/oQzA6+UA50v74S/S0g879UAYII4LPC2e+fzQ/sEt5o49jpCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.619021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0063985eaaaaea0182017988a56efe022c170c84c61fc61c779044275117d92b","sha256:da0f430fa567ec7df22f7d98ddeb96a596617cf22e9fc886b68f367169835da4"],"state_sha256":"538e9159949ba642e38a4341d46331af5489c42a645ffd6fcf248aeb81963298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oa3GJHFGD101F1a+4TzRfqONdVtfDmBu1BI6zo5X09o7u2+cClb6KyagP2JYP2NW2M/DpTgZaRhYpyN+D1z0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:57:56.804039Z","bundle_sha256":"32489ba026e0a14df73bbfe967578e6c52347e2ae34f66adf56ce4ead419834c"}}