{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F2RST3J7T5NYOZ6QWDSXRMMFOA","short_pith_number":"pith:F2RST3J7","schema_version":"1.0","canonical_sha256":"2ea329ed3f9f5b8767d0b0e578b18570192f2caab647e65b4f5aac5fd700cf1e","source":{"kind":"arxiv","id":"1008.2081","version":2},"attestation_state":"computed","paper":{"title":"Random Information Spread in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.PR"],"primary_cat":"math.CO","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","submitted_at":"2010-08-12T10:04:36Z","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 "},"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":"1008.2081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-12T10:04:36Z","cross_cats_sorted":["cs.DM","cs.SI","math.PR"],"title_canon_sha256":"1e062802ff2f16492b9742fae85a0134f491cfb1a0da3de7b194f13980406b8a","abstract_canon_sha256":"c02d13c06fa135f3b317b06e224c1c15c1dd0fa24ba24e2af935cdc399db0465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:56.930695Z","signature_b64":"IJcryhA7NwjOECYZ+DjajclbiVs1mgyxxg3wVtBhMNnUy/FeoUNFP87riLmKm1Lc/zAyWXbeXSn7hJ3bsZ6KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea329ed3f9f5b8767d0b0e578b18570192f2caab647e65b4f5aac5fd700cf1e","last_reissued_at":"2026-05-18T04:13:56.930192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:56.930192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Information Spread in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.PR"],"primary_cat":"math.CO","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","submitted_at":"2010-08-12T10:04:36Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2081","kind":"arxiv","version":2},"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":"1008.2081","created_at":"2026-05-18T04:13:56.930270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2081v2","created_at":"2026-05-18T04:13:56.930270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2081","created_at":"2026-05-18T04:13:56.930270+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2RST3J7T5NY","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2RST3J7T5NYOZ6Q","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2RST3J7","created_at":"2026-05-18T12:26:06.534383+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/F2RST3J7T5NYOZ6QWDSXRMMFOA","json":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA.json","graph_json":"https://pith.science/api/pith-number/F2RST3J7T5NYOZ6QWDSXRMMFOA/graph.json","events_json":"https://pith.science/api/pith-number/F2RST3J7T5NYOZ6QWDSXRMMFOA/events.json","paper":"https://pith.science/paper/F2RST3J7"},"agent_actions":{"view_html":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA","download_json":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA.json","view_paper":"https://pith.science/paper/F2RST3J7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2081&json=true","fetch_graph":"https://pith.science/api/pith-number/F2RST3J7T5NYOZ6QWDSXRMMFOA/graph.json","fetch_events":"https://pith.science/api/pith-number/F2RST3J7T5NYOZ6QWDSXRMMFOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA/action/storage_attestation","attest_author":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA/action/author_attestation","sign_citation":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA/action/citation_signature","submit_replication":"https://pith.science/pith/F2RST3J7T5NYOZ6QWDSXRMMFOA/action/replication_record"}},"created_at":"2026-05-18T04:13:56.930270+00:00","updated_at":"2026-05-18T04:13:56.930270+00:00"}