{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CO4ANYAEX7VBCFFJSJVKTR22A7","short_pith_number":"pith:CO4ANYAE","canonical_record":{"source":{"id":"1401.6206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-23T22:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"f0138b89b2a1ca52bae90e7835039b2f7938f513dedc55d00bd95a059a5aa27b","abstract_canon_sha256":"e947c56dd93e2f81eaba92939726dbfcea7ea6edbe817079085d0a0fcab93b4d"},"schema_version":"1.0"},"canonical_sha256":"13b806e004bfea1114a9926aa9c75a07deee8fcdeeb8765458dec9caa2fa9510","source":{"kind":"arxiv","id":"1401.6206","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CO4ANYAEX7VBCFFJSJVKTR22A7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-23T22:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"f0138b89b2a1ca52bae90e7835039b2f7938f513dedc55d00bd95a059a5aa27b","abstract_canon_sha256":"e947c56dd93e2f81eaba92939726dbfcea7ea6edbe817079085d0a0fcab93b4d"},"schema_version":"1.0"},"canonical_sha256":"13b806e004bfea1114a9926aa9c75a07deee8fcdeeb8765458dec9caa2fa9510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.889829Z","signature_b64":"t9TNBEUfSdRvSTs6CWd+ei5ZASkKjWIQi6WT9FnvhGF1ORhtjmB5e09HbngAuFTWJr8+nuR+eM6idtN8AqvXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b806e004bfea1114a9926aa9c75a07deee8fcdeeb8765458dec9caa2fa9510","last_reissued_at":"2026-05-18T03:01:12.889072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.889072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6206","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL5CbD3/GFWtL2/CzjFtY9SyjZdc01BktOnLmCnOkOXQYFkgDpVdh2eRsM7V8vcj1rdtQ7cT9fQ4sf/xofMrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:49.096136Z"},"content_sha256":"43e52e04533aec303fec6fa8a9bc2ee5d61886058f3ba76313efdc32efeffee3","schema_version":"1.0","event_id":"sha256:43e52e04533aec303fec6fa8a9bc2ee5d61886058f3ba76313efdc32efeffee3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CO4ANYAEX7VBCFFJSJVKTR22A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on the k-forcing number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Amos, Randy Davila, Ryan Pepper, Yair Caro","submitted_at":"2014-01-23T22:33:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6206","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PWxrbLjwUdgggThshYr2Q3sCFGIeIyAbpsv40A53NITv6mG2C+DMlC2sjLjLHygwEpBlzZ2Pbwoff0BJM01BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:49.096490Z"},"content_sha256":"7c17c0ae9f22f4633b5ec15e59952e0bc748b6d3fc7ed5bc6a8896ef73673337","schema_version":"1.0","event_id":"sha256:7c17c0ae9f22f4633b5ec15e59952e0bc748b6d3fc7ed5bc6a8896ef73673337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/bundle.json","state_url":"https://pith.science/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/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-03T02:32:49Z","links":{"resolver":"https://pith.science/pith/CO4ANYAEX7VBCFFJSJVKTR22A7","bundle":"https://pith.science/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/bundle.json","state":"https://pith.science/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO4ANYAEX7VBCFFJSJVKTR22A7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mn3pSOOYGtu6mqXHOw9fym9HVavSnktjD30naKmIs5wI7dUNxmc4Kwp5hQKSfKfcLjy3nlp1hbIiAKygIt3GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:32:49.098403Z","bundle_sha256":"81a47b13e4a3f1826ec6815fc20a18a0b51be5fed9d5df716cf85391e125ba12"}}