{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DW5OIJHPF4JBFYCIEWVG2D2CGN","short_pith_number":"pith:DW5OIJHP","canonical_record":{"source":{"id":"1610.08435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T17:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"736f79666dbcd095d24db82e1c0c05cf5572c714642380769e102d8d93c268d4","abstract_canon_sha256":"be4557b614263e6177c06b7fd1aded8f028766daf708bd74b82ee9f23788ff44"},"schema_version":"1.0"},"canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","source":{"kind":"arxiv","id":"1610.08435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08435","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08435v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08435","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"DW5OIJHPF4JB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DW5OIJHPF4JBFYCI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DW5OIJHP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DW5OIJHPF4JBFYCIEWVG2D2CGN","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T17:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"736f79666dbcd095d24db82e1c0c05cf5572c714642380769e102d8d93c268d4","abstract_canon_sha256":"be4557b614263e6177c06b7fd1aded8f028766daf708bd74b82ee9f23788ff44"},"schema_version":"1.0"},"canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.671233Z","signature_b64":"NktTsZJhpe/9dsl957PBDiF5GE0XH/muSel0BJ5KOgn2595fK+Mwa48Lvu68IPOUHLtAEs+aWERd55B6hYIHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","last_reissued_at":"2026-05-18T01:01:09.670601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.670601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08435","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:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOvXrMFr+/Xe2BLn/DQuqsPwV8e9d4+KWvQYfjStHDld3mmKXHTXwZVVNZjTLXt2qqtFjTeuuaEXwrRBw0MtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:25:19.805894Z"},"content_sha256":"940e9b53b6867313262e40ca8790c403aaa6307c1e5819e3bd04144b2adf215f","schema_version":"1.0","event_id":"sha256:940e9b53b6867313262e40ca8790c403aaa6307c1e5819e3bd04144b2adf215f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DW5OIJHPF4JBFYCIEWVG2D2CGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The forcing number of graphs with a given girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Henning, Randy Davila","submitted_at":"2016-10-26T17:46:13Z","abstract_excerpt":"In this paper, we study a dynamic coloring of the vertices of a graph $G$ that 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 of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. The forcing number, originally known as the \\emph{zero forcing number}, and denoted $F(G)$, of $G$ is the cardinality of a smallest forcing set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08435","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:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLHDOfYtqy5KX8kGlj5tUZA174HCuDo6Ak/JulU9O6ievLMod3CiLqgMa4tq/cKNYNAr9LsRvtx3b8wdIvMSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:25:19.806271Z"},"content_sha256":"43fa384bc8065130570cb1d0993782916c9c04059f1c022c99a01b414d65787d","schema_version":"1.0","event_id":"sha256:43fa384bc8065130570cb1d0993782916c9c04059f1c022c99a01b414d65787d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/bundle.json","state_url":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/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-27T09:25:19Z","links":{"resolver":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN","bundle":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/bundle.json","state":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DW5OIJHPF4JBFYCIEWVG2D2CGN","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":"be4557b614263e6177c06b7fd1aded8f028766daf708bd74b82ee9f23788ff44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T17:46:13Z","title_canon_sha256":"736f79666dbcd095d24db82e1c0c05cf5572c714642380769e102d8d93c268d4"},"schema_version":"1.0","source":{"id":"1610.08435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08435","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08435v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08435","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"DW5OIJHPF4JB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DW5OIJHPF4JBFYCI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DW5OIJHP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:43fa384bc8065130570cb1d0993782916c9c04059f1c022c99a01b414d65787d","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"In this paper, we study a dynamic coloring of the vertices of a graph $G$ that 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 of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. The forcing number, originally known as the \\emph{zero forcing number}, and denoted $F(G)$, of $G$ is the cardinality of a smallest forcing set of ","authors_text":"Michael Henning, Randy Davila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T17:46:13Z","title":"The forcing number of graphs with a given girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08435","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:940e9b53b6867313262e40ca8790c403aaa6307c1e5819e3bd04144b2adf215f","target":"record","created_at":"2026-05-18T01:01:09Z","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":"be4557b614263e6177c06b7fd1aded8f028766daf708bd74b82ee9f23788ff44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T17:46:13Z","title_canon_sha256":"736f79666dbcd095d24db82e1c0c05cf5572c714642380769e102d8d93c268d4"},"schema_version":"1.0","source":{"id":"1610.08435","kind":"arxiv","version":1}},"canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","first_computed_at":"2026-05-18T01:01:09.670601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.670601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NktTsZJhpe/9dsl957PBDiF5GE0XH/muSel0BJ5KOgn2595fK+Mwa48Lvu68IPOUHLtAEs+aWERd55B6hYIHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.671233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:940e9b53b6867313262e40ca8790c403aaa6307c1e5819e3bd04144b2adf215f","sha256:43fa384bc8065130570cb1d0993782916c9c04059f1c022c99a01b414d65787d"],"state_sha256":"15ee00c6f2c91a828961e4bab9cf966fa21dfb95f825e253a02228b9d92bf5c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nn6OJSNJgG331jiZEkNfpA2cYW2xJSTFKjBhMoD/kHkqhIo8ef/MPL5sHaC9nuJcXZ1NlqkhngnJJL91CXIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:25:19.809192Z","bundle_sha256":"7e6a26b89810f6bb54e2bf80dafdffc7d0c8e6e5b18194517fde5e8639188c37"}}