{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EJEBCUA4MSUCJVCE5WWMYPYHR3","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":"7124c6f50d7ca1902ca18dcd501f43277a61db4f2e935f18f4eca1a2e936908a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T16:00:10Z","title_canon_sha256":"63e3ac1b4370b7af9dee0ad267e0a0a173b13966424f461b7fec6b304b152956"},"schema_version":"1.0","source":{"id":"1702.06035","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06035","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06035v3","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06035","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"EJEBCUA4MSUC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJEBCUA4MSUCJVCE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJEBCUA4","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:d3d0c61969c9d7daa11ff51e52895a21b2dfc35a99ee19ed7c97eb23d9399bcb","target":"graph","created_at":"2026-05-18T00:49:57Z","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":"Let $G$ be a simple and finite graph without isolated vertices. In this paper we study forcing sets (zero forcing sets) which induce a subgraph of $G$ without isolated vertices. Such a set is called a total forcing set, introduced and first studied by Davila \\cite{Davila}. The minimum cardinality of a total forcing set in $G$ is the total forcing number of $G$, denoted $F_t(G)$. We study basic properties of $F_t(G)$, relate $F_t(G)$ to various domination parameters, and establish $NP$-completeness of the associated decision problem for $F_t(G)$. We also prove that if $G$ is a connected graph o","authors_text":"Michael A. Henning, Randy Davila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T16:00:10Z","title":"On the Total Forcing Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06035","kind":"arxiv","version":3},"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:ccc3bcd95f2b8d6035bd6982c246db8ef08d17f0dd3d2a2e7ebd2660d5d05142","target":"record","created_at":"2026-05-18T00:49:57Z","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":"7124c6f50d7ca1902ca18dcd501f43277a61db4f2e935f18f4eca1a2e936908a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T16:00:10Z","title_canon_sha256":"63e3ac1b4370b7af9dee0ad267e0a0a173b13966424f461b7fec6b304b152956"},"schema_version":"1.0","source":{"id":"1702.06035","kind":"arxiv","version":3}},"canonical_sha256":"224811501c64a824d444edaccc3f078edd6ca11ce5f54065d8d456499a21ce1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"224811501c64a824d444edaccc3f078edd6ca11ce5f54065d8d456499a21ce1a","first_computed_at":"2026-05-18T00:49:57.387337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:57.387337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"97Ls+782JVJDuPpeVMBt6i0iVyG+zVvxSQdnKl0uVaXPwqrc0AVQ2VJK5eOx4DKDO2zZsTAvAEES3Qib0Pg3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:57.387987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06035","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccc3bcd95f2b8d6035bd6982c246db8ef08d17f0dd3d2a2e7ebd2660d5d05142","sha256:d3d0c61969c9d7daa11ff51e52895a21b2dfc35a99ee19ed7c97eb23d9399bcb"],"state_sha256":"b362234740b8de03adf3c375a10bc908e3594cca047b28904db571ac986083ac"}