{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DW5OIJHPF4JBFYCIEWVG2D2CGN","short_pith_number":"pith:DW5OIJHP","schema_version":"1.0","canonical_sha256":"1dbae424ef2f1212e04825aa6d0f423349796c6b96ed58a283d4069532f492fd","source":{"kind":"arxiv","id":"1610.08435","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.08435","created_at":"2026-05-18T01:01:09.670686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08435v1","created_at":"2026-05-18T01:01:09.670686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08435","created_at":"2026-05-18T01:01:09.670686+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW5OIJHPF4JB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW5OIJHPF4JBFYCI","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW5OIJHP","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN","json":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN.json","graph_json":"https://pith.science/api/pith-number/DW5OIJHPF4JBFYCIEWVG2D2CGN/graph.json","events_json":"https://pith.science/api/pith-number/DW5OIJHPF4JBFYCIEWVG2D2CGN/events.json","paper":"https://pith.science/paper/DW5OIJHP"},"agent_actions":{"view_html":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN","download_json":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN.json","view_paper":"https://pith.science/paper/DW5OIJHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08435&json=true","fetch_graph":"https://pith.science/api/pith-number/DW5OIJHPF4JBFYCIEWVG2D2CGN/graph.json","fetch_events":"https://pith.science/api/pith-number/DW5OIJHPF4JBFYCIEWVG2D2CGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/action/storage_attestation","attest_author":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/action/author_attestation","sign_citation":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/action/citation_signature","submit_replication":"https://pith.science/pith/DW5OIJHPF4JBFYCIEWVG2D2CGN/action/replication_record"}},"created_at":"2026-05-18T01:01:09.670686+00:00","updated_at":"2026-05-18T01:01:09.670686+00:00"}