{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WEDKVL75M2EEN5YEBUPGMGAZHW","short_pith_number":"pith:WEDKVL75","canonical_record":{"source":{"id":"1708.00240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T10:49:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"827123e8fd78f6afa4529f97ffd29a5d9e8899a186f925415f74de8234af3de4","abstract_canon_sha256":"aa0428293bb0fc7762f628dfbac91ae7652da1fa5173694813a4b5370633c72d"},"schema_version":"1.0"},"canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","source":{"kind":"arxiv","id":"1708.00240","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WEDKVL75M2EEN5YEBUPGMGAZHW","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T10:49:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"827123e8fd78f6afa4529f97ffd29a5d9e8899a186f925415f74de8234af3de4","abstract_canon_sha256":"aa0428293bb0fc7762f628dfbac91ae7652da1fa5173694813a4b5370633c72d"},"schema_version":"1.0"},"canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.714923Z","signature_b64":"5zP3pLo1BaPAUM6venVQpteBL/opar1pJsBWQcjMgQdtv6Xb1ZCR986jXJogk8yQ7EjeQlUYMR3yYr/ysuwIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","last_reissued_at":"2026-05-18T00:39:05.714394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.714394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00240","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:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvDWUVB4YJGCXoct5pkmn6+6u6OtAazcGspKxBaObX/FNamDu+CZ6MW5YwZGfmVpI4Ml3OjjI7+e0SOxidhWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:24:13.314237Z"},"content_sha256":"8bd084f4585f5d42bf3bf7eab9b2ff8444b3975d8afe26d0b3e39a550c6d930c","schema_version":"1.0","event_id":"sha256:8bd084f4585f5d42bf3bf7eab9b2ff8444b3975d8afe26d0b3e39a550c6d930c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WEDKVL75M2EEN5YEBUPGMGAZHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. J. Dinneen, M. Rajaati, M. R. Hooshmandasl, P. Sharifani","submitted_at":"2017-08-01T10:49:30Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00240","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:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQnP2H+eCIRz5WwvWJIg6JuSuJAPVIwx7Nwo8ZoYj/56/IV8kuyMyjnWq/wZR926NYq6AloV+LnSfBE2STVeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:24:13.314601Z"},"content_sha256":"8d675f9a746dd9450c4eeff8918d3801d2e7e17dc22e8e32586b155a47e423ad","schema_version":"1.0","event_id":"sha256:8d675f9a746dd9450c4eeff8918d3801d2e7e17dc22e8e32586b155a47e423ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/bundle.json","state_url":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/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-27T17:24:13Z","links":{"resolver":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW","bundle":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/bundle.json","state":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Yao1860R+S+70LFCmDW7DpIz4eqRxVIjq6o9VREfMfTZvoSbRFSkeQXZKNRtbrbvxM/5JSqfDsisbiJW2WcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:24:13.316454Z","bundle_sha256":"0275f46b2de50166990b40a67b70b84e7ead62d1ee835f64e0d4ba4c015bd56c"}}