{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BQUA54IX7GJQ4JGRJ23LB64IR5","short_pith_number":"pith:BQUA54IX","schema_version":"1.0","canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","source":{"kind":"arxiv","id":"1204.6237","version":3},"attestation_state":"computed","paper":{"title":"Probabilistic Zero Forcing in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi","submitted_at":"2012-04-27T15:07:37Z","abstract_excerpt":"The \\emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\\setminusS$ are colored white) such that $V(G)$ is turned black after finitely many applications of \"the (classical) color change rule\": a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Zero forcing number was introduced and used to bound the minimum rank of graphs by the \"AIM Minimum Rank - Special Graphs Work Group\". We introduce here a probabilistic color change rule (pccr) which is a natural generalization "},"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":"1204.6237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T15:07:37Z","cross_cats_sorted":[],"title_canon_sha256":"81614236787406d660496fee5fa2d16ffc222a6bed6545333ac9a393d50b7d1f","abstract_canon_sha256":"4330acd87badf4f0f7f154ecbb2deae220c1962dd0767b5c038d851cdeaab040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.334434Z","signature_b64":"8qlLlWKJ2X3kvWNw0xNfZPSIi5CkGB6XHibBYKWvtzR2dIVmOJYChthvZhHc9RZQJBB0pSzFKv7ceQNQt+ooDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","last_reissued_at":"2026-05-18T03:48:35.333806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.333806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Zero Forcing in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi","submitted_at":"2012-04-27T15:07:37Z","abstract_excerpt":"The \\emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\\setminusS$ are colored white) such that $V(G)$ is turned black after finitely many applications of \"the (classical) color change rule\": a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Zero forcing number was introduced and used to bound the minimum rank of graphs by the \"AIM Minimum Rank - Special Graphs Work Group\". We introduce here a probabilistic color change rule (pccr) which is a natural generalization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6237","kind":"arxiv","version":3},"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":"1204.6237","created_at":"2026-05-18T03:48:35.333887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6237v3","created_at":"2026-05-18T03:48:35.333887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6237","created_at":"2026-05-18T03:48:35.333887+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQUA54IX7GJQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQUA54IX7GJQ4JGR","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQUA54IX","created_at":"2026-05-18T12:27:01.376967+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/BQUA54IX7GJQ4JGRJ23LB64IR5","json":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5.json","graph_json":"https://pith.science/api/pith-number/BQUA54IX7GJQ4JGRJ23LB64IR5/graph.json","events_json":"https://pith.science/api/pith-number/BQUA54IX7GJQ4JGRJ23LB64IR5/events.json","paper":"https://pith.science/paper/BQUA54IX"},"agent_actions":{"view_html":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5","download_json":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5.json","view_paper":"https://pith.science/paper/BQUA54IX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6237&json=true","fetch_graph":"https://pith.science/api/pith-number/BQUA54IX7GJQ4JGRJ23LB64IR5/graph.json","fetch_events":"https://pith.science/api/pith-number/BQUA54IX7GJQ4JGRJ23LB64IR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/action/storage_attestation","attest_author":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/action/author_attestation","sign_citation":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/action/citation_signature","submit_replication":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/action/replication_record"}},"created_at":"2026-05-18T03:48:35.333887+00:00","updated_at":"2026-05-18T03:48:35.333887+00:00"}