{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:AW3IJUDMCNL7ORMK3H7FEN4CSS","short_pith_number":"pith:AW3IJUDM","schema_version":"1.0","canonical_sha256":"05b684d06c1357f7458ad9fe52378294b764a13eef8bebc40c0850813a271778","source":{"kind":"arxiv","id":"math/9409221","version":1},"attestation_state":"computed","paper":{"title":"Proving time bounds for randomized distributed algorithms","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Isaac Saias, Nancy Lynch, Roberto Segala","submitted_at":"1994-09-19T00:00:00Z","abstract_excerpt":"A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements of the form U (t)->(p) U', which means that whenever the algorithm begins in a state in set U, with probability p, it will reach a state in set U' within time t. The power of the method is illustrated by its use in proving a constant upper bound on the expected time for some process to reach its critical region, in Lehmann and Rabin's Dining Philosophers a"},"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":"math/9409221","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-19T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"be0ae9e21f8fc69d4448559a0b1cc931871805f1e9d4a81ff02e6d569bb610c1","abstract_canon_sha256":"a9f5766224596317584438824a8c773d760e8a375e410b9b91a5f26e9113d952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.077609Z","signature_b64":"kxOQl20gxc2vaTCHtYxXJ/uD2fQNbuAJRdEclp7+J1NPZU+inQrA3Xk1+Q6tfqRa6JZ8ba/tt20Ww3tYcbzFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05b684d06c1357f7458ad9fe52378294b764a13eef8bebc40c0850813a271778","last_reissued_at":"2026-05-18T01:05:51.077081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.077081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving time bounds for randomized distributed algorithms","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Isaac Saias, Nancy Lynch, Roberto Segala","submitted_at":"1994-09-19T00:00:00Z","abstract_excerpt":"A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements of the form U (t)->(p) U', which means that whenever the algorithm begins in a state in set U, with probability p, it will reach a state in set U' within time t. The power of the method is illustrated by its use in proving a constant upper bound on the expected time for some process to reach its critical region, in Lehmann and Rabin's Dining Philosophers a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409221","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":""},"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":"math/9409221","created_at":"2026-05-18T01:05:51.077167+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9409221v1","created_at":"2026-05-18T01:05:51.077167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409221","created_at":"2026-05-18T01:05:51.077167+00:00"},{"alias_kind":"pith_short_12","alias_value":"AW3IJUDMCNL7","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"AW3IJUDMCNL7ORMK","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"AW3IJUDM","created_at":"2026-05-18T12:25:47.102015+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/AW3IJUDMCNL7ORMK3H7FEN4CSS","json":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS.json","graph_json":"https://pith.science/api/pith-number/AW3IJUDMCNL7ORMK3H7FEN4CSS/graph.json","events_json":"https://pith.science/api/pith-number/AW3IJUDMCNL7ORMK3H7FEN4CSS/events.json","paper":"https://pith.science/paper/AW3IJUDM"},"agent_actions":{"view_html":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS","download_json":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS.json","view_paper":"https://pith.science/paper/AW3IJUDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9409221&json=true","fetch_graph":"https://pith.science/api/pith-number/AW3IJUDMCNL7ORMK3H7FEN4CSS/graph.json","fetch_events":"https://pith.science/api/pith-number/AW3IJUDMCNL7ORMK3H7FEN4CSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS/action/storage_attestation","attest_author":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS/action/author_attestation","sign_citation":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS/action/citation_signature","submit_replication":"https://pith.science/pith/AW3IJUDMCNL7ORMK3H7FEN4CSS/action/replication_record"}},"created_at":"2026-05-18T01:05:51.077167+00:00","updated_at":"2026-05-18T01:05:51.077167+00:00"}