{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B72R2SY5GNQGXU4R7OOJUZGQKM","short_pith_number":"pith:B72R2SY5","schema_version":"1.0","canonical_sha256":"0ff51d4b1d33606bd391fb9c9a64d053334455dac8fbb7a5481fb425dec05fd1","source":{"kind":"arxiv","id":"1410.4191","version":1},"attestation_state":"computed","paper":{"title":"Propagation time for zero forcing on a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leslie Hogben, Michael Young, My Huynh, Nicole Kingsley, Sarah Meyer, Shanise Walker","submitted_at":"2014-10-15T18:51:40Z","abstract_excerpt":"Zero forcing (also called graph infection) on a simple, undirected graph $G$ is based on the color-change rule: If each vertex of $G$ is colored either white or black, and vertex $v$ is a black vertex with only one white neighbor $w$, then change the color of $w$ to black. A minimum zero forcing set is a set of black vertices of minimum cardinality that can color the entire graph black using the color change rule. The propagation time of a zero forcing set $B$ of graph $G$ is the minimum number of steps that it takes to force all the vertices of $G$ black, starting with the vertices in $B$ bla"},"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":"1410.4191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T18:51:40Z","cross_cats_sorted":[],"title_canon_sha256":"d1c0cc964311f2e2cb05ae4a95b8e19e417440fbafe0c844794b64221fb12074","abstract_canon_sha256":"1813b79afbc1d36658b19ba6e1a071f8458a49e5ffec73cafe0d90c59dcd42a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:47.710342Z","signature_b64":"GsJ121+QiWYgVwSBNhAmiocde8RXCBt7tp7JPjWk1WcxYYS0wUcRG1ZUp61mzJpqW5dHZ2hNps8E2YPH3hm4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff51d4b1d33606bd391fb9c9a64d053334455dac8fbb7a5481fb425dec05fd1","last_reissued_at":"2026-05-18T02:39:47.709826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:47.709826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Propagation time for zero forcing on a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leslie Hogben, Michael Young, My Huynh, Nicole Kingsley, Sarah Meyer, Shanise Walker","submitted_at":"2014-10-15T18:51:40Z","abstract_excerpt":"Zero forcing (also called graph infection) on a simple, undirected graph $G$ is based on the color-change rule: If each vertex of $G$ is colored either white or black, and vertex $v$ is a black vertex with only one white neighbor $w$, then change the color of $w$ to black. A minimum zero forcing set is a set of black vertices of minimum cardinality that can color the entire graph black using the color change rule. The propagation time of a zero forcing set $B$ of graph $G$ is the minimum number of steps that it takes to force all the vertices of $G$ black, starting with the vertices in $B$ bla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4191","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":"1410.4191","created_at":"2026-05-18T02:39:47.709901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4191v1","created_at":"2026-05-18T02:39:47.709901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4191","created_at":"2026-05-18T02:39:47.709901+00:00"},{"alias_kind":"pith_short_12","alias_value":"B72R2SY5GNQG","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B72R2SY5GNQGXU4R","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B72R2SY5","created_at":"2026-05-18T12:28:22.404517+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/B72R2SY5GNQGXU4R7OOJUZGQKM","json":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM.json","graph_json":"https://pith.science/api/pith-number/B72R2SY5GNQGXU4R7OOJUZGQKM/graph.json","events_json":"https://pith.science/api/pith-number/B72R2SY5GNQGXU4R7OOJUZGQKM/events.json","paper":"https://pith.science/paper/B72R2SY5"},"agent_actions":{"view_html":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM","download_json":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM.json","view_paper":"https://pith.science/paper/B72R2SY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4191&json=true","fetch_graph":"https://pith.science/api/pith-number/B72R2SY5GNQGXU4R7OOJUZGQKM/graph.json","fetch_events":"https://pith.science/api/pith-number/B72R2SY5GNQGXU4R7OOJUZGQKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM/action/storage_attestation","attest_author":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM/action/author_attestation","sign_citation":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM/action/citation_signature","submit_replication":"https://pith.science/pith/B72R2SY5GNQGXU4R7OOJUZGQKM/action/replication_record"}},"created_at":"2026-05-18T02:39:47.709901+00:00","updated_at":"2026-05-18T02:39:47.709901+00:00"}