{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M5ZEOO4DVLW6TC6TRFKYFOY32Q","short_pith_number":"pith:M5ZEOO4D","schema_version":"1.0","canonical_sha256":"6772473b83aaede98bd3895582bb1bd435b6db15e73c96eda58ac3a362ea5fa4","source":{"kind":"arxiv","id":"1812.10476","version":1},"attestation_state":"computed","paper":{"title":"Propagation time for probabilistic zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jesse Geneson, Leslie Hogben","submitted_at":"2018-12-24T19:42:50Z","abstract_excerpt":"Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing was introduced by Kang and Yi in [Probabilistic zero forcing in graphs, Bull. Inst. Combin. Appl. 67 (2013), 9--16] and yields a discrete dynamical system, which is a better model for some applications. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do"},"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":"1812.10476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-24T19:42:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80cc8d8d14e1330a386a3ff28bc9272cf92d6e1567c9f765e593e11f9667f887","abstract_canon_sha256":"a8e41182c3cf5a7949061c4f22af8768ad80e22d1755eb204d515635d97684af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.985840Z","signature_b64":"hiMdiNmdhLMRoSVjJ80qpyk3Yeyh42/nLvCBTcABFP2KurwVeCyoovO5NIm/b/5eGM86sjUk/joLQ7WM+f4jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6772473b83aaede98bd3895582bb1bd435b6db15e73c96eda58ac3a362ea5fa4","last_reissued_at":"2026-05-17T23:57:20.985383Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.985383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Propagation time for probabilistic zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jesse Geneson, Leslie Hogben","submitted_at":"2018-12-24T19:42:50Z","abstract_excerpt":"Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing was introduced by Kang and Yi in [Probabilistic zero forcing in graphs, Bull. Inst. Combin. Appl. 67 (2013), 9--16] and yields a discrete dynamical system, which is a better model for some applications. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10476","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":"1812.10476","created_at":"2026-05-17T23:57:20.985451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10476v1","created_at":"2026-05-17T23:57:20.985451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10476","created_at":"2026-05-17T23:57:20.985451+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5ZEOO4DVLW6","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5ZEOO4DVLW6TC6T","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5ZEOO4D","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11083","citing_title":"Using Markov chains to determine expected propagation time for probabilistic zero forcing","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q","json":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q.json","graph_json":"https://pith.science/api/pith-number/M5ZEOO4DVLW6TC6TRFKYFOY32Q/graph.json","events_json":"https://pith.science/api/pith-number/M5ZEOO4DVLW6TC6TRFKYFOY32Q/events.json","paper":"https://pith.science/paper/M5ZEOO4D"},"agent_actions":{"view_html":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q","download_json":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q.json","view_paper":"https://pith.science/paper/M5ZEOO4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10476&json=true","fetch_graph":"https://pith.science/api/pith-number/M5ZEOO4DVLW6TC6TRFKYFOY32Q/graph.json","fetch_events":"https://pith.science/api/pith-number/M5ZEOO4DVLW6TC6TRFKYFOY32Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q/action/storage_attestation","attest_author":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q/action/author_attestation","sign_citation":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q/action/citation_signature","submit_replication":"https://pith.science/pith/M5ZEOO4DVLW6TC6TRFKYFOY32Q/action/replication_record"}},"created_at":"2026-05-17T23:57:20.985451+00:00","updated_at":"2026-05-17T23:57:20.985451+00:00"}