{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KGOTWOTILAE6MHF7YU6M6SAAA3","short_pith_number":"pith:KGOTWOTI","canonical_record":{"source":{"id":"1507.01364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T09:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"e806bbb677a9ad5412c446940803fdde9d2870947dd454ebd19970e4f95aa68f","abstract_canon_sha256":"87d8371e531e6b534784994859c4eba44e15b0419284382e888163a27d897b0c"},"schema_version":"1.0"},"canonical_sha256":"519d3b3a685809e61cbfc53ccf480006eca158b3dc03ad311e5dc08c0bb9946b","source":{"kind":"arxiv","id":"1507.01364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01364","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01364v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01364","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"KGOTWOTILAE6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KGOTWOTILAE6MHF7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KGOTWOTI","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KGOTWOTILAE6MHF7YU6M6SAAA3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T09:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"e806bbb677a9ad5412c446940803fdde9d2870947dd454ebd19970e4f95aa68f","abstract_canon_sha256":"87d8371e531e6b534784994859c4eba44e15b0419284382e888163a27d897b0c"},"schema_version":"1.0"},"canonical_sha256":"519d3b3a685809e61cbfc53ccf480006eca158b3dc03ad311e5dc08c0bb9946b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:17.168183Z","signature_b64":"tfvlP3L7lBelwEN+n2ksM1Kt7cgo69dhpEjVdyNmyCnQGcFaU1B+4rjYnkqWmwvuspFfud080rzLmoMJrY58DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"519d3b3a685809e61cbfc53ccf480006eca158b3dc03ad311e5dc08c0bb9946b","last_reissued_at":"2026-05-18T01:37:17.167374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:17.167374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01364","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-18T01:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tbhl1L011Vzalkr+I3kQ9xAyG4MG1Ue06NJaJ90gm5pvVKQ6uwR1edwCZtU4m8VesexFb8l95e0mAdAL2co4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:48.849812Z"},"content_sha256":"04a07c7e899bf6483e461aeb118593fbfbd16ce3164ec78ee46252b6430666b7","schema_version":"1.0","event_id":"sha256:04a07c7e899bf6483e461aeb118593fbfbd16ce3164ec78ee46252b6430666b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KGOTWOTILAE6MHF7YU6M6SAAA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of a conjecture on the zero forcing number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Leihao Lu, Zixing Tang","submitted_at":"2015-07-06T09:30:55Z","abstract_excerpt":"Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$-forcing number of graph for a positive integer $k$ as the generalization of the zero forcing number of a graph. The $k$-forcing number of a simple graph $G$, denoted by $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 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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01364","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-18T01:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrxY41bT6o7ELsHykarUCmUl1FZClBrBJT0CvbDiYb7xOyEUqFfM0kxchnDAln1kvp6nJ2+OFUNAQL8ocPEEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:48.850155Z"},"content_sha256":"4636d5c0fe02df54e15a5e386664238b2c8e05d561f7da23c68bf5991abae971","schema_version":"1.0","event_id":"sha256:4636d5c0fe02df54e15a5e386664238b2c8e05d561f7da23c68bf5991abae971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/bundle.json","state_url":"https://pith.science/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/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-02T22:19:48Z","links":{"resolver":"https://pith.science/pith/KGOTWOTILAE6MHF7YU6M6SAAA3","bundle":"https://pith.science/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/bundle.json","state":"https://pith.science/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGOTWOTILAE6MHF7YU6M6SAAA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KGOTWOTILAE6MHF7YU6M6SAAA3","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":"87d8371e531e6b534784994859c4eba44e15b0419284382e888163a27d897b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T09:30:55Z","title_canon_sha256":"e806bbb677a9ad5412c446940803fdde9d2870947dd454ebd19970e4f95aa68f"},"schema_version":"1.0","source":{"id":"1507.01364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01364","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01364v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01364","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"KGOTWOTILAE6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KGOTWOTILAE6MHF7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KGOTWOTI","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:4636d5c0fe02df54e15a5e386664238b2c8e05d561f7da23c68bf5991abae971","target":"graph","created_at":"2026-05-18T01:37:17Z","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":"Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$-forcing number of graph for a positive integer $k$ as the generalization of the zero forcing number of a graph. The $k$-forcing number of a simple graph $G$, denoted by $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 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","authors_text":"Baoyindureng Wu, Leihao Lu, Zixing Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T09:30:55Z","title":"Proof of a conjecture on the zero forcing number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01364","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:04a07c7e899bf6483e461aeb118593fbfbd16ce3164ec78ee46252b6430666b7","target":"record","created_at":"2026-05-18T01:37:17Z","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":"87d8371e531e6b534784994859c4eba44e15b0419284382e888163a27d897b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T09:30:55Z","title_canon_sha256":"e806bbb677a9ad5412c446940803fdde9d2870947dd454ebd19970e4f95aa68f"},"schema_version":"1.0","source":{"id":"1507.01364","kind":"arxiv","version":1}},"canonical_sha256":"519d3b3a685809e61cbfc53ccf480006eca158b3dc03ad311e5dc08c0bb9946b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"519d3b3a685809e61cbfc53ccf480006eca158b3dc03ad311e5dc08c0bb9946b","first_computed_at":"2026-05-18T01:37:17.167374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:17.167374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tfvlP3L7lBelwEN+n2ksM1Kt7cgo69dhpEjVdyNmyCnQGcFaU1B+4rjYnkqWmwvuspFfud080rzLmoMJrY58DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:17.168183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04a07c7e899bf6483e461aeb118593fbfbd16ce3164ec78ee46252b6430666b7","sha256:4636d5c0fe02df54e15a5e386664238b2c8e05d561f7da23c68bf5991abae971"],"state_sha256":"fe9ec91eb1d442063e86593722b3c705e5dae4ac098e6440965bb33a65883d15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XnXjUSYwWja6ri9AExGW5+tjEUaB6NVhgc3VDzMHpd6GLLKYtwP774KwKsZrgnSzAXgnL3qilMzLuW+Lbr2FCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:19:48.852159Z","bundle_sha256":"2f8ca9e19eabab91a567b02cca93692f7c7156d011bbe2ee97c48b843cca73ba"}}