{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AEZXEK4NYYSKYQFE5K6RH2EEPF","short_pith_number":"pith:AEZXEK4N","schema_version":"1.0","canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","source":{"kind":"arxiv","id":"1805.00774","version":1},"attestation_state":"computed","paper":{"title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler, Peter Robinson","submitted_at":"2018-05-02T12:54:40Z","abstract_excerpt":"We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt{n})$ rounds in an $n$-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beg"},"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":"1805.00774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T12:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"709f142663422fab5339c1e6550f2285f8b131d5bbc18c5a25feffa48ef367e9","abstract_canon_sha256":"63a0d6a766708cfcd37d4acffb1dade0600c96fb15eebafda94aa6821bc32cf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:57.760756Z","signature_b64":"6ELxIxGDqyLpQspNzH0h0IUeAUYyQ6cvcT11xKoeYmFijGQMvj/omwtYZfSi76QKjP3kJ1cUjWGkAJzibvLUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","last_reissued_at":"2026-05-18T00:16:57.760123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:57.760123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler, Peter Robinson","submitted_at":"2018-05-02T12:54:40Z","abstract_excerpt":"We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt{n})$ rounds in an $n$-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00774","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":"1805.00774","created_at":"2026-05-18T00:16:57.760224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00774v1","created_at":"2026-05-18T00:16:57.760224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00774","created_at":"2026-05-18T00:16:57.760224+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEZXEK4NYYSK","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEZXEK4NYYSKYQFE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEZXEK4N","created_at":"2026-05-18T12:32:13.499390+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/AEZXEK4NYYSKYQFE5K6RH2EEPF","json":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF.json","graph_json":"https://pith.science/api/pith-number/AEZXEK4NYYSKYQFE5K6RH2EEPF/graph.json","events_json":"https://pith.science/api/pith-number/AEZXEK4NYYSKYQFE5K6RH2EEPF/events.json","paper":"https://pith.science/paper/AEZXEK4N"},"agent_actions":{"view_html":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF","download_json":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF.json","view_paper":"https://pith.science/paper/AEZXEK4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00774&json=true","fetch_graph":"https://pith.science/api/pith-number/AEZXEK4NYYSKYQFE5K6RH2EEPF/graph.json","fetch_events":"https://pith.science/api/pith-number/AEZXEK4NYYSKYQFE5K6RH2EEPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/action/storage_attestation","attest_author":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/action/author_attestation","sign_citation":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/action/citation_signature","submit_replication":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/action/replication_record"}},"created_at":"2026-05-18T00:16:57.760224+00:00","updated_at":"2026-05-18T00:16:57.760224+00:00"}