{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IVK2OXQGBSL6ZAJ2OLDGOEOKMK","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":"04d437b24d1276a8af92ac0cfe4075a8eef7b624bfa20d0e679ce9ad9c5dd7a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-29T20:44:09Z","title_canon_sha256":"1ec2811cf545413d0f51adc47fc2e57c97dacdddf593069f67f7fadb2c2fafee"},"schema_version":"1.0","source":{"id":"1705.10391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10391","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10391v2","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10391","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"IVK2OXQGBSL6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVK2OXQGBSL6ZAJ2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVK2OXQG","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d787ccb081f4d9fb5894956b8e105cddff1e82ea498f48942875b38800c6fdae","target":"graph","created_at":"2026-05-18T00:43:08Z","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":"A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of $G$ is the minimum cardinality of a forcing set in $G$. In the present paper, we study the forcing number of various classes of graphs, including graphs of large girth, $H$-free graphs for a fixed bipartite graph $H$, random and pseudorandom graphs.","authors_text":"Benny Sudakov, Nina Kam\\v{c}ev, Thomas Kalinowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-29T20:44:09Z","title":"Zero forcing number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10391","kind":"arxiv","version":2},"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:82f5f04ddfee298b6e3bef70ce414281b350cd2938642f46a1a96b9c5713bb7d","target":"record","created_at":"2026-05-18T00:43:08Z","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":"04d437b24d1276a8af92ac0cfe4075a8eef7b624bfa20d0e679ce9ad9c5dd7a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-29T20:44:09Z","title_canon_sha256":"1ec2811cf545413d0f51adc47fc2e57c97dacdddf593069f67f7fadb2c2fafee"},"schema_version":"1.0","source":{"id":"1705.10391","kind":"arxiv","version":2}},"canonical_sha256":"4555a75e060c97ec813a72c66711ca6294e91ce5f33535d63ff3cde08330d973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4555a75e060c97ec813a72c66711ca6294e91ce5f33535d63ff3cde08330d973","first_computed_at":"2026-05-18T00:43:08.055332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:08.055332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/pZyR+/BRYVkeiM3cF0thzhgjbdAi7Qrs6e6O4wVPVkp982GEwZFnF0vYnZKdNoK+34evG8r6U9EzVB0Z86iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:08.056012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82f5f04ddfee298b6e3bef70ce414281b350cd2938642f46a1a96b9c5713bb7d","sha256:d787ccb081f4d9fb5894956b8e105cddff1e82ea498f48942875b38800c6fdae"],"state_sha256":"ef3cda6dd985abdbc5575f2261bc05c53b24c34d74ad9952a2687ad0fbf1d3fe"}