{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HMHKIWHWTE74AGPMSEOJTTAEGT","short_pith_number":"pith:HMHKIWHW","schema_version":"1.0","canonical_sha256":"3b0ea458f6993fc019ec911c99cc0434efce6a5afc548874d4e01c2609767bbd","source":{"kind":"arxiv","id":"1108.0809","version":2},"attestation_state":"computed","paper":{"title":"Distributed Agreement in Dynamic Peer-to-Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Eli Upfal, Gopal Pandurangan, John Augustine, Peter Robinson","submitted_at":"2011-08-03T10:09:45Z","abstract_excerpt":"Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node {\\em churn}. Our goal is to design fast algorithms (running in a small number of rounds) that guarantee, despite high node churn rate, that almost all nodes reach a stable agreement. Our main contributions are randomized distributed algorithms that guarantee {\\em stable almost-everywhere agreement} with high probability even under high adversaria"},"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":"1108.0809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:09:45Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ca3b1015b45ce4fd823da374ff58a05060d083cf97719970a612e18d4af74772","abstract_canon_sha256":"d336dbc5ec084860e93bf014d9ada0b06888d59d16cd290201eaa8b6169664ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.480890Z","signature_b64":"IlamsOO7e+cqxzkMpdYOLj4lztWSwIRO9m3HyecYWd2jD/CQZo/2xbcD6vyWwldQd1FqTcHaHMMubJ11SdN0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0ea458f6993fc019ec911c99cc0434efce6a5afc548874d4e01c2609767bbd","last_reissued_at":"2026-05-18T02:21:42.480489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.480489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Agreement in Dynamic Peer-to-Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Eli Upfal, Gopal Pandurangan, John Augustine, Peter Robinson","submitted_at":"2011-08-03T10:09:45Z","abstract_excerpt":"Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node {\\em churn}. Our goal is to design fast algorithms (running in a small number of rounds) that guarantee, despite high node churn rate, that almost all nodes reach a stable agreement. Our main contributions are randomized distributed algorithms that guarantee {\\em stable almost-everywhere agreement} with high probability even under high adversaria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0809","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":"1108.0809","created_at":"2026-05-18T02:21:42.480550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0809v2","created_at":"2026-05-18T02:21:42.480550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0809","created_at":"2026-05-18T02:21:42.480550+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMHKIWHWTE74","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMHKIWHWTE74AGPM","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMHKIWHW","created_at":"2026-05-18T12:26:30.835961+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/HMHKIWHWTE74AGPMSEOJTTAEGT","json":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT.json","graph_json":"https://pith.science/api/pith-number/HMHKIWHWTE74AGPMSEOJTTAEGT/graph.json","events_json":"https://pith.science/api/pith-number/HMHKIWHWTE74AGPMSEOJTTAEGT/events.json","paper":"https://pith.science/paper/HMHKIWHW"},"agent_actions":{"view_html":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT","download_json":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT.json","view_paper":"https://pith.science/paper/HMHKIWHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0809&json=true","fetch_graph":"https://pith.science/api/pith-number/HMHKIWHWTE74AGPMSEOJTTAEGT/graph.json","fetch_events":"https://pith.science/api/pith-number/HMHKIWHWTE74AGPMSEOJTTAEGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT/action/storage_attestation","attest_author":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT/action/author_attestation","sign_citation":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT/action/citation_signature","submit_replication":"https://pith.science/pith/HMHKIWHWTE74AGPMSEOJTTAEGT/action/replication_record"}},"created_at":"2026-05-18T02:21:42.480550+00:00","updated_at":"2026-05-18T02:21:42.480550+00:00"}