{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZXHOMJFHPQZJBAL6KJ2JV453H","short_pith_number":"pith:OZXHOMJF","schema_version":"1.0","canonical_sha256":"766e7731253be194840bf293a4d79dd9cd0b59bbfc2ad84b55c8533ab0a19720","source":{"kind":"arxiv","id":"1810.06872","version":1},"attestation_state":"computed","paper":{"title":"Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrea Munaro, Bernard Ries, Esther Galby","submitted_at":"2018-10-16T08:26:17Z","abstract_excerpt":"A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\\gamma_{t2}(G)$ of a semitotal dominating set of $G$ is squeezed between the domination number $\\gamma(G)$ and the total domination number $\\gamma_{t}(G)$.\n  \\textsc{Semitotal Dominating Set} is the problem of finding, given a graph $G$, a semitotal dominating set of $G$ of size $\\gamma_{t2}(G)$. In this paper, we continue the systematic study on the computational complexity of this problem when restric"},"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":"1810.06872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-16T08:26:17Z","cross_cats_sorted":[],"title_canon_sha256":"67c99a1de9cc1e84c32f4e65cfbed509c5d892505415c1ace659fe8d4de23855","abstract_canon_sha256":"e301d74464a62edf5437968da5258eaf03a55cc24d5d9f7dbaa0f6717dcb9a7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:11.254113Z","signature_b64":"jfhpYIYAZsIL/N4Rb9TljLJDWeGgQlFzfZEE6je46gzHYOO6Z1YzAGLbpzQmYG7sYpKSYtmGVs6M0HyEOIDWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766e7731253be194840bf293a4d79dd9cd0b59bbfc2ad84b55c8533ab0a19720","last_reissued_at":"2026-05-18T00:03:11.253462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:11.253462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrea Munaro, Bernard Ries, Esther Galby","submitted_at":"2018-10-16T08:26:17Z","abstract_excerpt":"A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\\gamma_{t2}(G)$ of a semitotal dominating set of $G$ is squeezed between the domination number $\\gamma(G)$ and the total domination number $\\gamma_{t}(G)$.\n  \\textsc{Semitotal Dominating Set} is the problem of finding, given a graph $G$, a semitotal dominating set of $G$ of size $\\gamma_{t2}(G)$. In this paper, we continue the systematic study on the computational complexity of this problem when restric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06872","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":"1810.06872","created_at":"2026-05-18T00:03:11.253568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06872v1","created_at":"2026-05-18T00:03:11.253568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06872","created_at":"2026-05-18T00:03:11.253568+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZXHOMJFHPQZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZXHOMJFHPQZJBAL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZXHOMJF","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04132","citing_title":"Linear MIM-Width of Trees","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H","json":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H.json","graph_json":"https://pith.science/api/pith-number/OZXHOMJFHPQZJBAL6KJ2JV453H/graph.json","events_json":"https://pith.science/api/pith-number/OZXHOMJFHPQZJBAL6KJ2JV453H/events.json","paper":"https://pith.science/paper/OZXHOMJF"},"agent_actions":{"view_html":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H","download_json":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H.json","view_paper":"https://pith.science/paper/OZXHOMJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06872&json=true","fetch_graph":"https://pith.science/api/pith-number/OZXHOMJFHPQZJBAL6KJ2JV453H/graph.json","fetch_events":"https://pith.science/api/pith-number/OZXHOMJFHPQZJBAL6KJ2JV453H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H/action/storage_attestation","attest_author":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H/action/author_attestation","sign_citation":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H/action/citation_signature","submit_replication":"https://pith.science/pith/OZXHOMJFHPQZJBAL6KJ2JV453H/action/replication_record"}},"created_at":"2026-05-18T00:03:11.253568+00:00","updated_at":"2026-05-18T00:03:11.253568+00:00"}