{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EJEBCUA4MSUCJVCE5WWMYPYHR3","short_pith_number":"pith:EJEBCUA4","canonical_record":{"source":{"id":"1702.06035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T16:00:10Z","cross_cats_sorted":[],"title_canon_sha256":"63e3ac1b4370b7af9dee0ad267e0a0a173b13966424f461b7fec6b304b152956","abstract_canon_sha256":"7124c6f50d7ca1902ca18dcd501f43277a61db4f2e935f18f4eca1a2e936908a"},"schema_version":"1.0"},"canonical_sha256":"224811501c64a824d444edaccc3f078edd6ca11ce5f54065d8d456499a21ce1a","source":{"kind":"arxiv","id":"1702.06035","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EJEBCUA4MSUCJVCE5WWMYPYHR3","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T16:00:10Z","cross_cats_sorted":[],"title_canon_sha256":"63e3ac1b4370b7af9dee0ad267e0a0a173b13966424f461b7fec6b304b152956","abstract_canon_sha256":"7124c6f50d7ca1902ca18dcd501f43277a61db4f2e935f18f4eca1a2e936908a"},"schema_version":"1.0"},"canonical_sha256":"224811501c64a824d444edaccc3f078edd6ca11ce5f54065d8d456499a21ce1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:57.387987Z","signature_b64":"97Ls+782JVJDuPpeVMBt6i0iVyG+zVvxSQdnKl0uVaXPwqrc0AVQ2VJK5eOx4DKDO2zZsTAvAEES3Qib0Pg3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"224811501c64a824d444edaccc3f078edd6ca11ce5f54065d8d456499a21ce1a","last_reissued_at":"2026-05-18T00:49:57.387337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:57.387337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06035","source_version":3,"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:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AokdBFI6o0GAxMIDWLgRiQAuukrXaP98qDyMemZD0HtqfDpFYboTxNc+eKAAYfE4HNBxZGt6lNG7/aA32GiRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:41:15.189003Z"},"content_sha256":"ccc3bcd95f2b8d6035bd6982c246db8ef08d17f0dd3d2a2e7ebd2660d5d05142","schema_version":"1.0","event_id":"sha256:ccc3bcd95f2b8d6035bd6982c246db8ef08d17f0dd3d2a2e7ebd2660d5d05142"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EJEBCUA4MSUCJVCE5WWMYPYHR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Total Forcing Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Randy Davila","submitted_at":"2017-02-20T16:00:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06035","kind":"arxiv","version":3},"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:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQyisqcy194mZEjav2NN5796nRERDO7c0zGQ86OAAQcxmz0qTokpj4BhPuTNhZa2IG+Z/cHZ621ueYfSmjZgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:41:15.189687Z"},"content_sha256":"d3d0c61969c9d7daa11ff51e52895a21b2dfc35a99ee19ed7c97eb23d9399bcb","schema_version":"1.0","event_id":"sha256:d3d0c61969c9d7daa11ff51e52895a21b2dfc35a99ee19ed7c97eb23d9399bcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/bundle.json","state_url":"https://pith.science/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/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-11T02:41:15Z","links":{"resolver":"https://pith.science/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3","bundle":"https://pith.science/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/bundle.json","state":"https://pith.science/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJEBCUA4MSUCJVCE5WWMYPYHR3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch1z8zhYgwlQRaP56cf2S03SYoO6Ce8ZFoK4zwOaCLoRjEhcPdJHnv8YXMSADolOUGi3mSgRHRMTQkfuviJyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:41:15.193125Z","bundle_sha256":"323adb5e317eeadb143d7e72b26e4781e9f671b7af3443658b32cc48eb800bed"}}