{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F2RST3J7T5NYOZ6QWDSXRMMFOA","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":"c02d13c06fa135f3b317b06e224c1c15c1dd0fa24ba24e2af935cdc399db0465","cross_cats_sorted":["cs.DM","cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-12T10:04:36Z","title_canon_sha256":"1e062802ff2f16492b9742fae85a0134f491cfb1a0da3de7b194f13980406b8a"},"schema_version":"1.0","source":{"id":"1008.2081","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2081","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2081v2","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2081","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"F2RST3J7T5NY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F2RST3J7T5NYOZ6Q","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F2RST3J7","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:33396a415a8ca6ee1db1962425c1eef2127434bed6b79e8626735705345021c6","target":"graph","created_at":"2026-05-18T04:13:56Z","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":"Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring vertices along edges with one labelled endpoint independently with probability p in one time step. In this paper, we establish the equivalence between the expected s-t first arrival time of the above spread process and the notion of the stochastic shortest s-t path. Moreover, we give a short discussion of analytical results on special graphs including the complete ","authors_text":"2), (2) Mittweida University of Applied Sciences, Frank Simon (2), Germany), Manila, Mittweida, Peter Tittmann (2) ((1) De La Salle University, Philippines, Raymond Lapus (1","cross_cats":["cs.DM","cs.SI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-12T10:04:36Z","title":"Random Information Spread in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2081","kind":"arxiv","version":2},"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:d1b50ee485044221c3272209be6ffdbb702251f60c652346b2a33dd70010f566","target":"record","created_at":"2026-05-18T04:13:56Z","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":"c02d13c06fa135f3b317b06e224c1c15c1dd0fa24ba24e2af935cdc399db0465","cross_cats_sorted":["cs.DM","cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-12T10:04:36Z","title_canon_sha256":"1e062802ff2f16492b9742fae85a0134f491cfb1a0da3de7b194f13980406b8a"},"schema_version":"1.0","source":{"id":"1008.2081","kind":"arxiv","version":2}},"canonical_sha256":"2ea329ed3f9f5b8767d0b0e578b18570192f2caab647e65b4f5aac5fd700cf1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea329ed3f9f5b8767d0b0e578b18570192f2caab647e65b4f5aac5fd700cf1e","first_computed_at":"2026-05-18T04:13:56.930192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:56.930192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IJcryhA7NwjOECYZ+DjajclbiVs1mgyxxg3wVtBhMNnUy/FeoUNFP87riLmKm1Lc/zAyWXbeXSn7hJ3bsZ6KDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:56.930695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2081","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1b50ee485044221c3272209be6ffdbb702251f60c652346b2a33dd70010f566","sha256:33396a415a8ca6ee1db1962425c1eef2127434bed6b79e8626735705345021c6"],"state_sha256":"ce91cdf15342b1a777ca1e2db77672c43c0d02a08ec35653851d0b748f9d415c"}