{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A4GHC3VFF7Q5FY6SJOOYTBYVSS","short_pith_number":"pith:A4GHC3VF","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"},"canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","source":{"kind":"arxiv","id":"1711.10891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10891","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10891v1","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10891","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"A4GHC3VFF7Q5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4GHC3VFF7Q5FY6S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4GHC3VF","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A4GHC3VFF7Q5FY6SJOOYTBYVSS","target":"record","payload":{"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"},"canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","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"},"source_kind":"arxiv","source_id":"1711.10891","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:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WG9QQkCGbJ0by7z5a+CKKS2JzRRUZQfjlUxofmc8vF7e8Hs6DhUPIpFmsRZUy80nH/hw14swDtFCPQCSJ10nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:58:51.534372Z"},"content_sha256":"0530d9617e25313d584207c1df0a89286ed5032f7ba8c8622fd534cd07402ec3","schema_version":"1.0","event_id":"sha256:0530d9617e25313d584207c1df0a89286ed5032f7ba8c8622fd534cd07402ec3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A4GHC3VFF7Q5FY6SJOOYTBYVSS","target":"graph","payload":{"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"},"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:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/g+fEXYk8a+OcixwhXDA6aSzV46SJ78d66nSNQRvZ+Bo2BN99TdrbhwuE9DOXaC9Gl/d5zn4EWwQCM3VuFcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:58:51.534974Z"},"content_sha256":"67577fa6c85bf3746679be098226959070d7a05f2864a2fe14bc447a66241fc2","schema_version":"1.0","event_id":"sha256:67577fa6c85bf3746679be098226959070d7a05f2864a2fe14bc447a66241fc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/bundle.json","state_url":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/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-11T03:58:51Z","links":{"resolver":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS","bundle":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/bundle.json","state":"https://pith.science/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4GHC3VFF7Q5FY6SJOOYTBYVSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A4GHC3VFF7Q5FY6SJOOYTBYVSS","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":"cffb17683b4db34204ea8c29952507d3dd215bec0fdbbd11ca95c5cf35c8e965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-29T14:52:49Z","title_canon_sha256":"9a19f5ee87346aa878cd46127af7bfcef527447f10fbaa7e8b266d9a10f9a25c"},"schema_version":"1.0","source":{"id":"1711.10891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10891","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10891v1","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10891","created_at":"2026-05-18T00:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"A4GHC3VFF7Q5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4GHC3VFF7Q5FY6S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4GHC3VF","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:67577fa6c85bf3746679be098226959070d7a05f2864a2fe14bc447a66241fc2","target":"graph","created_at":"2026-05-18T00:29:16Z","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":"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","authors_text":"Arti Pandey, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-29T14:52:49Z","title":"Algorithmic Aspects of Semitotal Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10891","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:0530d9617e25313d584207c1df0a89286ed5032f7ba8c8622fd534cd07402ec3","target":"record","created_at":"2026-05-18T00:29:16Z","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":"cffb17683b4db34204ea8c29952507d3dd215bec0fdbbd11ca95c5cf35c8e965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-29T14:52:49Z","title_canon_sha256":"9a19f5ee87346aa878cd46127af7bfcef527447f10fbaa7e8b266d9a10f9a25c"},"schema_version":"1.0","source":{"id":"1711.10891","kind":"arxiv","version":1}},"canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"070c716ea52fe1d2e3d24b9d89871594a9c0bd8292365352aae47cdd6daf32b5","first_computed_at":"2026-05-18T00:29:16.526290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:16.526290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1kAhePgz7MQKLcvC6WuE3cwmmkFhhTlsujbh3LT+dteGoed9ikbWFOQa4W6AqYNRLL2bMawiejDBDO//UKYgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:16.526878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0530d9617e25313d584207c1df0a89286ed5032f7ba8c8622fd534cd07402ec3","sha256:67577fa6c85bf3746679be098226959070d7a05f2864a2fe14bc447a66241fc2"],"state_sha256":"66c83fe0c603138a1d00b76e1808e09a2c4808583633351a5ff5f314f271bb76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uh/4C9Fp4vIeT5mA+4kADtzFUGX4cC4bbOLU/idPNN1kyTDjy6SbAd3vO6Fk1iCdvZPRYzkCdVNMITGXNyq0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:58:51.540532Z","bundle_sha256":"f601bd5fff865d4af0999970ddf2c82d3ae73e45032ed620f0f5d28ac0990e0a"}}