{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CO4ANYAEX7VBCFFJSJVKTR22A7","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":"e947c56dd93e2f81eaba92939726dbfcea7ea6edbe817079085d0a0fcab93b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-23T22:33:22Z","title_canon_sha256":"f0138b89b2a1ca52bae90e7835039b2f7938f513dedc55d00bd95a059a5aa27b"},"schema_version":"1.0","source":{"id":"1401.6206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6206","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6206v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6206","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"CO4ANYAEX7VB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CO4ANYAEX7VBCFFJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CO4ANYAE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:7c17c0ae9f22f4633b5ec15e59952e0bc748b6d3fc7ed5bc6a8896ef73673337","target":"graph","created_at":"2026-05-18T03:01:12Z","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":"Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete dynamical process described by the following rule. Starting from an initial set of colored vertices and stopping when all vertices are colored: if a colored vertex has at most $k$ non-colored neighbors, then each of its non-colored neighbors becomes colored. When $k=1$, this is equivalent to the zero forcing number, usually denoted with $Z(G)$, a rec","authors_text":"David Amos, Randy Davila, Ryan Pepper, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-23T22:33:22Z","title":"Upper bounds on the k-forcing number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6206","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:43e52e04533aec303fec6fa8a9bc2ee5d61886058f3ba76313efdc32efeffee3","target":"record","created_at":"2026-05-18T03:01:12Z","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":"e947c56dd93e2f81eaba92939726dbfcea7ea6edbe817079085d0a0fcab93b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-23T22:33:22Z","title_canon_sha256":"f0138b89b2a1ca52bae90e7835039b2f7938f513dedc55d00bd95a059a5aa27b"},"schema_version":"1.0","source":{"id":"1401.6206","kind":"arxiv","version":1}},"canonical_sha256":"13b806e004bfea1114a9926aa9c75a07deee8fcdeeb8765458dec9caa2fa9510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b806e004bfea1114a9926aa9c75a07deee8fcdeeb8765458dec9caa2fa9510","first_computed_at":"2026-05-18T03:01:12.889072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:12.889072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9TNBEUfSdRvSTs6CWd+ei5ZASkKjWIQi6WT9FnvhGF1ORhtjmB5e09HbngAuFTWJr8+nuR+eM6idtN8AqvXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:12.889829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e52e04533aec303fec6fa8a9bc2ee5d61886058f3ba76313efdc32efeffee3","sha256:7c17c0ae9f22f4633b5ec15e59952e0bc748b6d3fc7ed5bc6a8896ef73673337"],"state_sha256":"3c158f5d5360da8ae08ae756432029a4ab17aac43483552a897605ae1797a93a"}