{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WEDKVL75M2EEN5YEBUPGMGAZHW","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":"aa0428293bb0fc7762f628dfbac91ae7652da1fa5173694813a4b5370633c72d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T10:49:30Z","title_canon_sha256":"827123e8fd78f6afa4529f97ffd29a5d9e8899a186f925415f74de8234af3de4"},"schema_version":"1.0","source":{"id":"1708.00240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00240","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00240v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00240","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"WEDKVL75M2EE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WEDKVL75M2EEN5YE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WEDKVL75","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:8d675f9a746dd9450c4eeff8918d3801d2e7e17dc22e8e32586b155a47e423ad","target":"graph","created_at":"2026-05-18T00:39:05Z","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 mixed dominating set $S$ of a graph $G=(V,E)$ is a subset $ S \\subseteq V \\cup E$ such that each element $v\\in (V \\cup E) \\setminus S$ is adjacent or incident to at least one element in $S$. The mixed domination number $\\gamma_m(G)$ of a graph $G$ is the minimum cardinality among all mixed dominating sets in $G$. The problem of finding $\\gamma_{m}(G)$ is know to be NP-complete. In this paper, we present an explicit polynomial-time algorithm to construct a mixed dominating set of size $\\gamma_{m}(G)$ by a parse tree when $G$ is a generalized series-parallel graph.","authors_text":"A. Shakiba, M. J. Dinneen, M. Rajaati, M. R. Hooshmandasl, P. Sharifani","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T10:49:30Z","title":"An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00240","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:8bd084f4585f5d42bf3bf7eab9b2ff8444b3975d8afe26d0b3e39a550c6d930c","target":"record","created_at":"2026-05-18T00:39:05Z","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":"aa0428293bb0fc7762f628dfbac91ae7652da1fa5173694813a4b5370633c72d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T10:49:30Z","title_canon_sha256":"827123e8fd78f6afa4529f97ffd29a5d9e8899a186f925415f74de8234af3de4"},"schema_version":"1.0","source":{"id":"1708.00240","kind":"arxiv","version":1}},"canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","first_computed_at":"2026-05-18T00:39:05.714394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:05.714394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zP3pLo1BaPAUM6venVQpteBL/opar1pJsBWQcjMgQdtv6Xb1ZCR986jXJogk8yQ7EjeQlUYMR3yYr/ysuwIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:05.714923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bd084f4585f5d42bf3bf7eab9b2ff8444b3975d8afe26d0b3e39a550c6d930c","sha256:8d675f9a746dd9450c4eeff8918d3801d2e7e17dc22e8e32586b155a47e423ad"],"state_sha256":"e5964d0f18d4d7b93c0c25dbe0bc5621974c0d24b77ec54f6dad9f749a67605c"}