{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:PUVBKYB66MROM35AXS5W4WD7UE","short_pith_number":"pith:PUVBKYB6","canonical_record":{"source":{"id":"2010.12343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-22T03:27:05Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"331e0f331e0e682d7345c709f485f74f2c693b8ca25d743a523b1609bea39d42","abstract_canon_sha256":"2899353390782f55386a654bd0de9f9115d05738908f4234b673468d2e7b0b82"},"schema_version":"1.0"},"canonical_sha256":"7d2a15603ef322e66fa0bcbb6e587fa129f55325bc64a647fb936d44edb8bf4a","source":{"kind":"arxiv","id":"2010.12343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12343","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12343v1","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12343","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"PUVBKYB66MRO","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"PUVBKYB66MROM35A","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"PUVBKYB6","created_at":"2026-06-25T00:18:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:PUVBKYB66MROM35AXS5W4WD7UE","target":"record","payload":{"canonical_record":{"source":{"id":"2010.12343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-22T03:27:05Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"331e0f331e0e682d7345c709f485f74f2c693b8ca25d743a523b1609bea39d42","abstract_canon_sha256":"2899353390782f55386a654bd0de9f9115d05738908f4234b673468d2e7b0b82"},"schema_version":"1.0"},"canonical_sha256":"7d2a15603ef322e66fa0bcbb6e587fa129f55325bc64a647fb936d44edb8bf4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:10.253262Z","signature_b64":"AT7d3VC3aRI9Gak1fNI3n+uegGjt1W0ChHD42A7SiSu/zX9gkUGI607EiRO5Gf0+wVJyhc7Cy/ezI1VhmENTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d2a15603ef322e66fa0bcbb6e587fa129f55325bc64a647fb936d44edb8bf4a","last_reissued_at":"2026-06-25T00:18:10.252917Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:10.252917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.12343","source_version":1,"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-06-25T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+SXli9n5/o2gzvxLeTu0GDS5QRNJABWhIONszqRrodFD5fMvVfddODZdN3KtuiGPCatN89WpZYFO8wNn/znBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:25:11.327808Z"},"content_sha256":"f3cf1b4ef9323b3397aa34de0fc278187e4c0aa8a7df6607f83dfb00464832b1","schema_version":"1.0","event_id":"sha256:f3cf1b4ef9323b3397aa34de0fc278187e4c0aa8a7df6607f83dfb00464832b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:PUVBKYB66MROM35AXS5W4WD7UE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alec Sun, David Hu","submitted_at":"2020-10-22T03:27:05Z","abstract_excerpt":"Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time step, blue vertices have a non-zero probability of forcing white neighbors to blue. The expected propagation time is the expected amount of time needed for every vertex to be colored blue. We derive asymptotic bounds for the expected propagation time of several families of graphs. We prove the optimal asymptotic bound of $\\Theta(m+n)$ for $m\\times n$ grid graphs. We prove an upper bound of $O \\left(\\frac{\\log d}{d} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12343","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.12343/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-25T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RupjaaMrC+RYwIfY+uCUez6KccGdfTtywdxpNHr3Iy1y7prawr0VXfzSrD/UyII+RkZfj3vLgtXCfWzt21aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:25:11.328209Z"},"content_sha256":"acbc08a05730b488ff6dd917415b8e3bd81a3dcff70c7e09867803bf78f0be87","schema_version":"1.0","event_id":"sha256:acbc08a05730b488ff6dd917415b8e3bd81a3dcff70c7e09867803bf78f0be87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUVBKYB66MROM35AXS5W4WD7UE/bundle.json","state_url":"https://pith.science/pith/PUVBKYB66MROM35AXS5W4WD7UE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUVBKYB66MROM35AXS5W4WD7UE/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-07-03T19:25:11Z","links":{"resolver":"https://pith.science/pith/PUVBKYB66MROM35AXS5W4WD7UE","bundle":"https://pith.science/pith/PUVBKYB66MROM35AXS5W4WD7UE/bundle.json","state":"https://pith.science/pith/PUVBKYB66MROM35AXS5W4WD7UE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUVBKYB66MROM35AXS5W4WD7UE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PUVBKYB66MROM35AXS5W4WD7UE","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":"2899353390782f55386a654bd0de9f9115d05738908f4234b673468d2e7b0b82","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-22T03:27:05Z","title_canon_sha256":"331e0f331e0e682d7345c709f485f74f2c693b8ca25d743a523b1609bea39d42"},"schema_version":"1.0","source":{"id":"2010.12343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12343","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12343v1","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12343","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"PUVBKYB66MRO","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"PUVBKYB66MROM35A","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"PUVBKYB6","created_at":"2026-06-25T00:18:10Z"}],"graph_snapshots":[{"event_id":"sha256:acbc08a05730b488ff6dd917415b8e3bd81a3dcff70c7e09867803bf78f0be87","target":"graph","created_at":"2026-06-25T00:18:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.12343/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time step, blue vertices have a non-zero probability of forcing white neighbors to blue. The expected propagation time is the expected amount of time needed for every vertex to be colored blue. We derive asymptotic bounds for the expected propagation time of several families of graphs. We prove the optimal asymptotic bound of $\\Theta(m+n)$ for $m\\times n$ grid graphs. We prove an upper bound of $O \\left(\\frac{\\log d}{d} ","authors_text":"Alec Sun, David Hu","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-22T03:27:05Z","title":"Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12343","kind":"arxiv","version":1},"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:f3cf1b4ef9323b3397aa34de0fc278187e4c0aa8a7df6607f83dfb00464832b1","target":"record","created_at":"2026-06-25T00:18:10Z","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":"2899353390782f55386a654bd0de9f9115d05738908f4234b673468d2e7b0b82","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-22T03:27:05Z","title_canon_sha256":"331e0f331e0e682d7345c709f485f74f2c693b8ca25d743a523b1609bea39d42"},"schema_version":"1.0","source":{"id":"2010.12343","kind":"arxiv","version":1}},"canonical_sha256":"7d2a15603ef322e66fa0bcbb6e587fa129f55325bc64a647fb936d44edb8bf4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d2a15603ef322e66fa0bcbb6e587fa129f55325bc64a647fb936d44edb8bf4a","first_computed_at":"2026-06-25T00:18:10.252917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:10.252917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AT7d3VC3aRI9Gak1fNI3n+uegGjt1W0ChHD42A7SiSu/zX9gkUGI607EiRO5Gf0+wVJyhc7Cy/ezI1VhmENTDg==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:10.253262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3cf1b4ef9323b3397aa34de0fc278187e4c0aa8a7df6607f83dfb00464832b1","sha256:acbc08a05730b488ff6dd917415b8e3bd81a3dcff70c7e09867803bf78f0be87"],"state_sha256":"f2bb04fc19830816ba967f9493be0a7ca742c4d03b3e5212d8244fc2f7d2484c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oT33hToVW+FO/lNiF40r5B/+/+SGVNgtg5Sg4vyorf2U/Q4kHzL/kTYFs5MypEvuYjypk5chZtwHZdOPEYi1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:25:11.330383Z","bundle_sha256":"c9ef907dd8d828be5763c597a6ff4a871cb56782bd7ce619c1caf2cd49adb9c0"}}