{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A4GHC3VFF7Q5FY6SJOOYTBYVSS","short_pith_number":"pith:A4GHC3VF","schema_version":"1.0","canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","source":{"kind":"arxiv","id":"1711.10891","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Aspects of Semitotal Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arti Pandey, Michael A. Henning","submitted_at":"2017-11-29T14:52:49Z","abstract_excerpt":"For a graph $G=(V,E)$, a set $D \\subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$, and every vertex in $D$ is within distance~$2$ of another vertex of~$D$. The \\textsc{Minimum Semitotal Domination} problem is to find a semitotal dominating set of minimum cardinality. Given a graph $G$ and a positive integer $k$, the \\textsc{Semitotal Domination Decision} problem is to decide whether $G$ has a semitotal dominating set of cardinality at most $k$. The \\textsc{Semitotal Domination Decision} problem is known to be NP-complete for general graphs. In this pape"},"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":"1711.10891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-29T14:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"9a19f5ee87346aa878cd46127af7bfcef527447f10fbaa7e8b266d9a10f9a25c","abstract_canon_sha256":"cffb17683b4db34204ea8c29952507d3dd215bec0fdbbd11ca95c5cf35c8e965"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:16.526878Z","signature_b64":"1kAhePgz7MQKLcvC6WuE3cwmmkFhhTlsujbh3LT+dteGoed9ikbWFOQa4W6AqYNRLL2bMawiejDBDO//UKYgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","last_reissued_at":"2026-05-18T00:29:16.526290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:16.526290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Aspects of Semitotal Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arti Pandey, Michael A. Henning","submitted_at":"2017-11-29T14:52:49Z","abstract_excerpt":"For a graph $G=(V,E)$, a set $D \\subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$, and every vertex in $D$ is within distance~$2$ of another vertex of~$D$. The \\textsc{Minimum Semitotal Domination} problem is to find a semitotal dominating set of minimum cardinality. Given a graph $G$ and a positive integer $k$, the \\textsc{Semitotal Domination Decision} problem is to decide whether $G$ has a semitotal dominating set of cardinality at most $k$. The \\textsc{Semitotal Domination Decision} problem is known to be NP-complete for general graphs. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10891","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":"1711.10891","created_at":"2026-05-18T00:29:16.526398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10891v1","created_at":"2026-05-18T00:29:16.526398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10891","created_at":"2026-05-18T00:29:16.526398+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4GHC3VFF7Q5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4GHC3VFF7Q5FY6S","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4GHC3VF","created_at":"2026-05-18T12:31:05.417338+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/A4GHC3VFF7Q5FY6SJOOYTBYVSS","json":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS.json","graph_json":"https://pith.science/api/pith-number/A4GHC3VFF7Q5FY6SJOOYTBYVSS/graph.json","events_json":"https://pith.science/api/pith-number/A4GHC3VFF7Q5FY6SJOOYTBYVSS/events.json","paper":"https://pith.science/paper/A4GHC3VF"},"agent_actions":{"view_html":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS","download_json":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS.json","view_paper":"https://pith.science/paper/A4GHC3VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10891&json=true","fetch_graph":"https://pith.science/api/pith-number/A4GHC3VFF7Q5FY6SJOOYTBYVSS/graph.json","fetch_events":"https://pith.science/api/pith-number/A4GHC3VFF7Q5FY6SJOOYTBYVSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/action/storage_attestation","attest_author":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/action/author_attestation","sign_citation":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/action/citation_signature","submit_replication":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/action/replication_record"}},"created_at":"2026-05-18T00:29:16.526398+00:00","updated_at":"2026-05-18T00:29:16.526398+00:00"}