{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:43RJX6WRJHIZAIPIXEDJZIJLNH","short_pith_number":"pith:43RJX6WR","schema_version":"1.0","canonical_sha256":"e6e29bfad149d19021e8b9069ca12b69e1e4a36f5a68be9044aa965d8a0f6aac","source":{"kind":"arxiv","id":"2203.12912","version":1},"attestation_state":"computed","paper":{"title":"Improved Communication Complexity of Fault-Tolerant Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jan Olkowski, MohammadTaghi Hajiaghayi","submitted_at":"2022-03-24T08:03:02Z","abstract_excerpt":"Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the classical message-passing setting with processes' crashes, since the seminal works of Bar-Joseph and Ben-Or [1998] \\cite{Bar-JosephB98} and Aspnes and Waarts [1996, 1998] \\cite{AspnesW-SICOMP-96,Aspnes-JACM-98} in the previous century, there is still a fundamental unresolved question about communication complexity of fast randomized Consensus against a (strong) adaptive adversary crashing processes arbitrarily onlin"},"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":"2203.12912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-03-24T08:03:02Z","cross_cats_sorted":[],"title_canon_sha256":"b7f52f8ece5aeca7966e82ca81e9e6e58fc55b37b7a8641fbb03c786abc058e5","abstract_canon_sha256":"499afee39ded404aa11a90c2422d1da893ada6f37b2b018a9cfec5ace7843557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:18.775621Z","signature_b64":"UVP5vqCbi9t+rCBIywWF7vua3qanppBrOTy6u0S9MLtvP+016b37Zd4UBfWwKgni8CQUYLRYUoOd8mhUNMQpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e29bfad149d19021e8b9069ca12b69e1e4a36f5a68be9044aa965d8a0f6aac","last_reissued_at":"2026-07-05T04:08:18.775169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:18.775169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Communication Complexity of Fault-Tolerant Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jan Olkowski, MohammadTaghi Hajiaghayi","submitted_at":"2022-03-24T08:03:02Z","abstract_excerpt":"Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the classical message-passing setting with processes' crashes, since the seminal works of Bar-Joseph and Ben-Or [1998] \\cite{Bar-JosephB98} and Aspnes and Waarts [1996, 1998] \\cite{AspnesW-SICOMP-96,Aspnes-JACM-98} in the previous century, there is still a fundamental unresolved question about communication complexity of fast randomized Consensus against a (strong) adaptive adversary crashing processes arbitrarily onlin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.12912","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.12912/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.12912","created_at":"2026-07-05T04:08:18.775228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.12912v1","created_at":"2026-07-05T04:08:18.775228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.12912","created_at":"2026-07-05T04:08:18.775228+00:00"},{"alias_kind":"pith_short_12","alias_value":"43RJX6WRJHIZ","created_at":"2026-07-05T04:08:18.775228+00:00"},{"alias_kind":"pith_short_16","alias_value":"43RJX6WRJHIZAIPI","created_at":"2026-07-05T04:08:18.775228+00:00"},{"alias_kind":"pith_short_8","alias_value":"43RJX6WR","created_at":"2026-07-05T04:08:18.775228+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/43RJX6WRJHIZAIPIXEDJZIJLNH","json":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH.json","graph_json":"https://pith.science/api/pith-number/43RJX6WRJHIZAIPIXEDJZIJLNH/graph.json","events_json":"https://pith.science/api/pith-number/43RJX6WRJHIZAIPIXEDJZIJLNH/events.json","paper":"https://pith.science/paper/43RJX6WR"},"agent_actions":{"view_html":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH","download_json":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH.json","view_paper":"https://pith.science/paper/43RJX6WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.12912&json=true","fetch_graph":"https://pith.science/api/pith-number/43RJX6WRJHIZAIPIXEDJZIJLNH/graph.json","fetch_events":"https://pith.science/api/pith-number/43RJX6WRJHIZAIPIXEDJZIJLNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH/action/storage_attestation","attest_author":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH/action/author_attestation","sign_citation":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH/action/citation_signature","submit_replication":"https://pith.science/pith/43RJX6WRJHIZAIPIXEDJZIJLNH/action/replication_record"}},"created_at":"2026-07-05T04:08:18.775228+00:00","updated_at":"2026-07-05T04:08:18.775228+00:00"}