{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VHV622XELQBWQO5S7CW7IW6P4T","short_pith_number":"pith:VHV622XE","canonical_record":{"source":{"id":"1708.05041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T19:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"72298886162a66fb4afddec465ff81816399c2914d5413604b52c3638b58bad0","abstract_canon_sha256":"2bf27decaf3a1c0f7c8fddee56fc6937311fa01ba6e742a0f7e3260d510548ce"},"schema_version":"1.0"},"canonical_sha256":"a9ebed6ae45c03683bb2f8adf45bcfe4d40a1749a6eb7907af2adc7552b890e7","source":{"kind":"arxiv","id":"1708.05041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05041","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05041v1","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05041","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"VHV622XELQBW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHV622XELQBWQO5S","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHV622XE","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VHV622XELQBWQO5S7CW7IW6P4T","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T19:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"72298886162a66fb4afddec465ff81816399c2914d5413604b52c3638b58bad0","abstract_canon_sha256":"2bf27decaf3a1c0f7c8fddee56fc6937311fa01ba6e742a0f7e3260d510548ce"},"schema_version":"1.0"},"canonical_sha256":"a9ebed6ae45c03683bb2f8adf45bcfe4d40a1749a6eb7907af2adc7552b890e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:54.035015Z","signature_b64":"N3+sGBLEpmXbtwCelDB74JyJ3k+2pjXhxsTp8iWVO5LEwNyQLy9FgB/faltzirP2LbbHNQirPQP9iul4hAF5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ebed6ae45c03683bb2f8adf45bcfe4d40a1749a6eb7907af2adc7552b890e7","last_reissued_at":"2026-05-18T00:37:54.034555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:54.034555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05041","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:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcZa3qf/64ZfyZK2NFNimJS43h3JmAcvaWbqyhgY+1ftw+XVNZ1Euzao5lRIyxlgLLMPC0aAQTWp92O/SmQmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:49:52.209186Z"},"content_sha256":"d94ae7ff5399b10c9d2ac99da1794c1f403fb259617ff57f145c49ae81f08ba9","schema_version":"1.0","event_id":"sha256:d94ae7ff5399b10c9d2ac99da1794c1f403fb259617ff57f145c49ae81f08ba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VHV622XELQBWQO5S7CW7IW6P4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total Forcing and Zero Forcing in Claw-Free Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Henning, Randy Davila","submitted_at":"2017-08-16T19:09:04Z","abstract_excerpt":"A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set $S$ is called a forcing set (zero forcing set) of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. If the initial set $S$ has the added property that it induces a subgraph of $G$ without isolated vertices, then $S$ is called a total forcing set in $G$. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05041","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:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOlQM+wgQzmcSVdGlMDLhNQuEsMetfmXSV6tVFmNRV3roijhT716WrWujJBMOGg/ntrIH6hkfjoGS6DcOHcbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:49:52.209811Z"},"content_sha256":"bdc2c9944e62534afd55bae39ccfb53ba0168e8aa7be65f37e174b38efb15e77","schema_version":"1.0","event_id":"sha256:bdc2c9944e62534afd55bae39ccfb53ba0168e8aa7be65f37e174b38efb15e77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHV622XELQBWQO5S7CW7IW6P4T/bundle.json","state_url":"https://pith.science/pith/VHV622XELQBWQO5S7CW7IW6P4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHV622XELQBWQO5S7CW7IW6P4T/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-05-27T22:49:52Z","links":{"resolver":"https://pith.science/pith/VHV622XELQBWQO5S7CW7IW6P4T","bundle":"https://pith.science/pith/VHV622XELQBWQO5S7CW7IW6P4T/bundle.json","state":"https://pith.science/pith/VHV622XELQBWQO5S7CW7IW6P4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHV622XELQBWQO5S7CW7IW6P4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VHV622XELQBWQO5S7CW7IW6P4T","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":"2bf27decaf3a1c0f7c8fddee56fc6937311fa01ba6e742a0f7e3260d510548ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T19:09:04Z","title_canon_sha256":"72298886162a66fb4afddec465ff81816399c2914d5413604b52c3638b58bad0"},"schema_version":"1.0","source":{"id":"1708.05041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05041","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05041v1","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05041","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"VHV622XELQBW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHV622XELQBWQO5S","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHV622XE","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:bdc2c9944e62534afd55bae39ccfb53ba0168e8aa7be65f37e174b38efb15e77","target":"graph","created_at":"2026-05-18T00:37:54Z","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":"A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set $S$ is called a forcing set (zero forcing set) of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. If the initial set $S$ has the added property that it induces a subgraph of $G$ without isolated vertices, then $S$ is called a total forcing set in $G$. The","authors_text":"Michael Henning, Randy Davila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T19:09:04Z","title":"Total Forcing and Zero Forcing in Claw-Free Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05041","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:d94ae7ff5399b10c9d2ac99da1794c1f403fb259617ff57f145c49ae81f08ba9","target":"record","created_at":"2026-05-18T00:37:54Z","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":"2bf27decaf3a1c0f7c8fddee56fc6937311fa01ba6e742a0f7e3260d510548ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T19:09:04Z","title_canon_sha256":"72298886162a66fb4afddec465ff81816399c2914d5413604b52c3638b58bad0"},"schema_version":"1.0","source":{"id":"1708.05041","kind":"arxiv","version":1}},"canonical_sha256":"a9ebed6ae45c03683bb2f8adf45bcfe4d40a1749a6eb7907af2adc7552b890e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ebed6ae45c03683bb2f8adf45bcfe4d40a1749a6eb7907af2adc7552b890e7","first_computed_at":"2026-05-18T00:37:54.034555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:54.034555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N3+sGBLEpmXbtwCelDB74JyJ3k+2pjXhxsTp8iWVO5LEwNyQLy9FgB/faltzirP2LbbHNQirPQP9iul4hAF5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:54.035015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d94ae7ff5399b10c9d2ac99da1794c1f403fb259617ff57f145c49ae81f08ba9","sha256:bdc2c9944e62534afd55bae39ccfb53ba0168e8aa7be65f37e174b38efb15e77"],"state_sha256":"57501d54dbdd71f8b97495179147f99f62783818d17ce710b138e38237287d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPSXzjMCOMG6sD4YntJv+MecbFYV4psY7R5ziiRsa6gHJ3HrqYKVJgiVEZeR/pzqVVYLgDyqzs9RS7tpfXrlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:49:52.212926Z","bundle_sha256":"b8e619643ef55b09ffd4867e179f004dd6ca7417dcec0bdbfddaab3d70ada4e9"}}