{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P7L7Y4WBXHNF76L3JRK5ANI6JO","short_pith_number":"pith:P7L7Y4WB","schema_version":"1.0","canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","source":{"kind":"arxiv","id":"2405.04762","version":2},"attestation_state":"computed","paper":{"title":"Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jan Olkowski, Mohammad T. Hajiaghayi","submitted_at":"2024-05-08T02:17:10Z","abstract_excerpt":"We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive, full-information, computationally unbounded adversary. We design a randomized algorithm that works in $O(\\sqrt{n}\\log^2 n)$ rounds and sends $O(n^2\\log^3 n)$ communication bits, where the number of faulty parties is $\\Theta(n)$. Our result is simultaneously tight for both these measures within polylogarithmic factors: due to the $\\Omega(n^2)$ lower bound on "},"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":"2405.04762","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-08T02:17:10Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"ab2d792dc4653529b83c2ec3830e6dea6d24a861089686df5d04af08186b6466","abstract_canon_sha256":"44c4d5f3489beed1621f57b86faae48acb976f07f04545895028fccc753977a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:40.323932Z","signature_b64":"8I2WFauMdmHpuzzMgX3AGCyNajzDN8n4T3suHThWl0aqsqyS8PCR1m93KI3bHc8JS/wAwo5X2a8neyYRz36pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","last_reissued_at":"2026-07-05T08:22:40.323497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:40.323497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jan Olkowski, Mohammad T. Hajiaghayi","submitted_at":"2024-05-08T02:17:10Z","abstract_excerpt":"We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive, full-information, computationally unbounded adversary. We design a randomized algorithm that works in $O(\\sqrt{n}\\log^2 n)$ rounds and sends $O(n^2\\log^3 n)$ communication bits, where the number of faulty parties is $\\Theta(n)$. Our result is simultaneously tight for both these measures within polylogarithmic factors: due to the $\\Omega(n^2)$ lower bound on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04762","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.04762/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":"2405.04762","created_at":"2026-07-05T08:22:40.323551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.04762v2","created_at":"2026-07-05T08:22:40.323551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04762","created_at":"2026-07-05T08:22:40.323551+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7L7Y4WBXHNF","created_at":"2026-07-05T08:22:40.323551+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7L7Y4WBXHNF76L3","created_at":"2026-07-05T08:22:40.323551+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7L7Y4WB","created_at":"2026-07-05T08:22:40.323551+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/P7L7Y4WBXHNF76L3JRK5ANI6JO","json":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO.json","graph_json":"https://pith.science/api/pith-number/P7L7Y4WBXHNF76L3JRK5ANI6JO/graph.json","events_json":"https://pith.science/api/pith-number/P7L7Y4WBXHNF76L3JRK5ANI6JO/events.json","paper":"https://pith.science/paper/P7L7Y4WB"},"agent_actions":{"view_html":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO","download_json":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO.json","view_paper":"https://pith.science/paper/P7L7Y4WB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.04762&json=true","fetch_graph":"https://pith.science/api/pith-number/P7L7Y4WBXHNF76L3JRK5ANI6JO/graph.json","fetch_events":"https://pith.science/api/pith-number/P7L7Y4WBXHNF76L3JRK5ANI6JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/action/storage_attestation","attest_author":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/action/author_attestation","sign_citation":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/action/citation_signature","submit_replication":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/action/replication_record"}},"created_at":"2026-07-05T08:22:40.323551+00:00","updated_at":"2026-07-05T08:22:40.323551+00:00"}