{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6M4MOBSVIEJTTQXYHKNC2IKBFE","short_pith_number":"pith:6M4MOBSV","schema_version":"1.0","canonical_sha256":"f338c70655411339c2f83a9a2d2141290ff70c65d6a4d1e158ed9fe0e02ce72b","source":{"kind":"arxiv","id":"1906.11083","version":1},"attestation_state":"computed","paper":{"title":"Using Markov chains to determine expected propagation time for probabilistic zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emelie Curl, Issac Odegard, Jesse Geneson, Kevin Liu, Leslie Hogben, Michael S. Ross, Yu Chan","submitted_at":"2019-06-25T16:54:04Z","abstract_excerpt":"Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (deterministic) color change rule starting with as few blue vertices as possible. Probabilistic zero forcing yields a discrete dynamical system governed by a Markov chain. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do this studied. Given a Markov transition matrix for a probabilistic zero forcing process, we establish an exact for"},"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":"1906.11083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-25T16:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"8b008a0e2945bd75b0221b40f4d46fa73645ceb89071da6c56d6d16239a6c81d","abstract_canon_sha256":"20599cab8edf521d023e9f6b12e5bea85ab458b75252a1abd32a49ffcab688d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:09.899495Z","signature_b64":"abKtjx1gRrEGZz4MtA8QrxmcrxvLsYx1RuFeHOeOhzDNCVc1vhCwstJetxXnCxe3nF5YMFH9X973YrkMD0khDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f338c70655411339c2f83a9a2d2141290ff70c65d6a4d1e158ed9fe0e02ce72b","last_reissued_at":"2026-05-17T23:42:09.898834Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:09.898834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Markov chains to determine expected propagation time for probabilistic zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emelie Curl, Issac Odegard, Jesse Geneson, Kevin Liu, Leslie Hogben, Michael S. Ross, Yu Chan","submitted_at":"2019-06-25T16:54:04Z","abstract_excerpt":"Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (deterministic) color change rule starting with as few blue vertices as possible. Probabilistic zero forcing yields a discrete dynamical system governed by a Markov chain. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do this studied. Given a Markov transition matrix for a probabilistic zero forcing process, we establish an exact for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11083","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":"1906.11083","created_at":"2026-05-17T23:42:09.898928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11083v1","created_at":"2026-05-17T23:42:09.898928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11083","created_at":"2026-05-17T23:42:09.898928+00:00"},{"alias_kind":"pith_short_12","alias_value":"6M4MOBSVIEJT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6M4MOBSVIEJTTQXY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6M4MOBSV","created_at":"2026-05-18T12:33:10.108867+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/6M4MOBSVIEJTTQXYHKNC2IKBFE","json":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE.json","graph_json":"https://pith.science/api/pith-number/6M4MOBSVIEJTTQXYHKNC2IKBFE/graph.json","events_json":"https://pith.science/api/pith-number/6M4MOBSVIEJTTQXYHKNC2IKBFE/events.json","paper":"https://pith.science/paper/6M4MOBSV"},"agent_actions":{"view_html":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE","download_json":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE.json","view_paper":"https://pith.science/paper/6M4MOBSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11083&json=true","fetch_graph":"https://pith.science/api/pith-number/6M4MOBSVIEJTTQXYHKNC2IKBFE/graph.json","fetch_events":"https://pith.science/api/pith-number/6M4MOBSVIEJTTQXYHKNC2IKBFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE/action/storage_attestation","attest_author":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE/action/author_attestation","sign_citation":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE/action/citation_signature","submit_replication":"https://pith.science/pith/6M4MOBSVIEJTTQXYHKNC2IKBFE/action/replication_record"}},"created_at":"2026-05-17T23:42:09.898928+00:00","updated_at":"2026-05-17T23:42:09.898928+00:00"}