{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BQUA54IX7GJQ4JGRJ23LB64IR5","short_pith_number":"pith:BQUA54IX","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"},"canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","source":{"kind":"arxiv","id":"1204.6237","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6237","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6237v3","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6237","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"BQUA54IX7GJQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BQUA54IX7GJQ4JGR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BQUA54IX","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BQUA54IX7GJQ4JGRJ23LB64IR5","target":"record","payload":{"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"},"canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","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"},"source_kind":"arxiv","source_id":"1204.6237","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V41ZgX5WvevW4lNgALI5p+yw5e0jdhVTEmS2zrHAGMUQaWLQbyg2iOaXf7C2faYoG7U4AOVANnHioWenJqRhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:11:39.550507Z"},"content_sha256":"b0cabe6a2f9433aa3e29766160c3b48128abbd2517982a88fecc3ce1cf31a202","schema_version":"1.0","event_id":"sha256:b0cabe6a2f9433aa3e29766160c3b48128abbd2517982a88fecc3ce1cf31a202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BQUA54IX7GJQ4JGRJ23LB64IR5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TF1UsvtObM9lZr/N9u/sXrnsO/QspnbxLxvwE/wOUYVyo/gySlcyHmEdKZZaGiPPXtGtZaufKcKAkIR5X/CAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:11:39.550862Z"},"content_sha256":"f4b318aa1316a4ad0c08e73bfae4ef1cb6a176b0efe50fa91db976e1b90eb346","schema_version":"1.0","event_id":"sha256:f4b318aa1316a4ad0c08e73bfae4ef1cb6a176b0efe50fa91db976e1b90eb346"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/bundle.json","state_url":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T19:11:39Z","links":{"resolver":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5","bundle":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/bundle.json","state":"https://pith.science/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQUA54IX7GJQ4JGRJ23LB64IR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BQUA54IX7GJQ4JGRJ23LB64IR5","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":"4330acd87badf4f0f7f154ecbb2deae220c1962dd0767b5c038d851cdeaab040","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T15:07:37Z","title_canon_sha256":"81614236787406d660496fee5fa2d16ffc222a6bed6545333ac9a393d50b7d1f"},"schema_version":"1.0","source":{"id":"1204.6237","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6237","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6237v3","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6237","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"BQUA54IX7GJQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BQUA54IX7GJQ4JGR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BQUA54IX","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:f4b318aa1316a4ad0c08e73bfae4ef1cb6a176b0efe50fa91db976e1b90eb346","target":"graph","created_at":"2026-05-18T03:48:35Z","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":"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 ","authors_text":"Cong X. Kang, Eunjeong Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T15:07:37Z","title":"Probabilistic Zero Forcing in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6237","kind":"arxiv","version":3},"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:b0cabe6a2f9433aa3e29766160c3b48128abbd2517982a88fecc3ce1cf31a202","target":"record","created_at":"2026-05-18T03:48:35Z","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":"4330acd87badf4f0f7f154ecbb2deae220c1962dd0767b5c038d851cdeaab040","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-27T15:07:37Z","title_canon_sha256":"81614236787406d660496fee5fa2d16ffc222a6bed6545333ac9a393d50b7d1f"},"schema_version":"1.0","source":{"id":"1204.6237","kind":"arxiv","version":3}},"canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c280ef117f9930e24d14eb6b0fb888f42f37d485928578ad7786c308b439907","first_computed_at":"2026-05-18T03:48:35.333806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:35.333806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8qlLlWKJ2X3kvWNw0xNfZPSIi5CkGB6XHibBYKWvtzR2dIVmOJYChthvZhHc9RZQJBB0pSzFKv7ceQNQt+ooDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:35.334434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6237","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0cabe6a2f9433aa3e29766160c3b48128abbd2517982a88fecc3ce1cf31a202","sha256:f4b318aa1316a4ad0c08e73bfae4ef1cb6a176b0efe50fa91db976e1b90eb346"],"state_sha256":"7ed845e68515f573ba5d4831bbe871e88f3b74327a3f26c4b2270ddbddf60ea0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99aheEygSWujEJYEcpA3zJy15FtZtpn5FACiOyvYLRyz/w3k0fm9gDjQzIsmKHUOztzrXuypQQEWoxkgq7xADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:11:39.553060Z","bundle_sha256":"063a2aa6580826b6360dd010916e975c333f78bedba9cc98598ae6b5659030a3"}}