{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WEDKVL75M2EEN5YEBUPGMGAZHW","short_pith_number":"pith:WEDKVL75","schema_version":"1.0","canonical_sha256":"b106aaaffd668846f7040d1e6618193d88c5b11da71386186242fc7614c72849","source":{"kind":"arxiv","id":"1708.00240","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.00240","created_at":"2026-05-18T00:39:05.714467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00240v1","created_at":"2026-05-18T00:39:05.714467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00240","created_at":"2026-05-18T00:39:05.714467+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEDKVL75M2EE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEDKVL75M2EEN5YE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEDKVL75","created_at":"2026-05-18T12:31:53.515858+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/WEDKVL75M2EEN5YEBUPGMGAZHW","json":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW.json","graph_json":"https://pith.science/api/pith-number/WEDKVL75M2EEN5YEBUPGMGAZHW/graph.json","events_json":"https://pith.science/api/pith-number/WEDKVL75M2EEN5YEBUPGMGAZHW/events.json","paper":"https://pith.science/paper/WEDKVL75"},"agent_actions":{"view_html":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW","download_json":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW.json","view_paper":"https://pith.science/paper/WEDKVL75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00240&json=true","fetch_graph":"https://pith.science/api/pith-number/WEDKVL75M2EEN5YEBUPGMGAZHW/graph.json","fetch_events":"https://pith.science/api/pith-number/WEDKVL75M2EEN5YEBUPGMGAZHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/action/storage_attestation","attest_author":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/action/author_attestation","sign_citation":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/action/citation_signature","submit_replication":"https://pith.science/pith/WEDKVL75M2EEN5YEBUPGMGAZHW/action/replication_record"}},"created_at":"2026-05-18T00:39:05.714467+00:00","updated_at":"2026-05-18T00:39:05.714467+00:00"}