{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:P7L7Y4WBXHNF76L3JRK5ANI6JO","short_pith_number":"pith:P7L7Y4WB","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"},"canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","source":{"kind":"arxiv","id":"2405.04762","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04762","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04762v2","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04762","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"P7L7Y4WBXHNF","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_16","alias_value":"P7L7Y4WBXHNF76L3","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_8","alias_value":"P7L7Y4WB","created_at":"2026-07-05T08:22:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:P7L7Y4WBXHNF76L3JRK5ANI6JO","target":"record","payload":{"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"},"canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","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"},"source_kind":"arxiv","source_id":"2405.04762","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+SG65mEuKJm9i9yB7137xg7ezMKLpUZURw7fuQ+sTT69c62U3KTKhgfPWNBIggfyjT/rLufmNqsbMmQDXPSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:10:27.426243Z"},"content_sha256":"e3ea0cb701b4be5722101d3afd5d51e667e0363f4c2e114a37ed0d4a2746f3da","schema_version":"1.0","event_id":"sha256:e3ea0cb701b4be5722101d3afd5d51e667e0363f4c2e114a37ed0d4a2746f3da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:P7L7Y4WBXHNF76L3JRK5ANI6JO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKzM8BniLlXdbVDCr5XYCSomChxiG/THGxsjVuAsuQz8KJOBFK3iQCouYQ6u6Zz3XTmJV+rcUCZk+f/i9OO/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:10:27.426636Z"},"content_sha256":"7a4afb16d0c98e07807e86f758f95bf451928fd1594e420a0ee8905731593757","schema_version":"1.0","event_id":"sha256:7a4afb16d0c98e07807e86f758f95bf451928fd1594e420a0ee8905731593757"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/bundle.json","state_url":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T15:10:27Z","links":{"resolver":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO","bundle":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/bundle.json","state":"https://pith.science/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7L7Y4WBXHNF76L3JRK5ANI6JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:P7L7Y4WBXHNF76L3JRK5ANI6JO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44c4d5f3489beed1621f57b86faae48acb976f07f04545895028fccc753977a4","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-08T02:17:10Z","title_canon_sha256":"ab2d792dc4653529b83c2ec3830e6dea6d24a861089686df5d04af08186b6466"},"schema_version":"1.0","source":{"id":"2405.04762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04762","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04762v2","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04762","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"P7L7Y4WBXHNF","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_16","alias_value":"P7L7Y4WBXHNF76L3","created_at":"2026-07-05T08:22:40Z"},{"alias_kind":"pith_short_8","alias_value":"P7L7Y4WB","created_at":"2026-07-05T08:22:40Z"}],"graph_snapshots":[{"event_id":"sha256:7a4afb16d0c98e07807e86f758f95bf451928fd1594e420a0ee8905731593757","target":"graph","created_at":"2026-07-05T08:22:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.04762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Dariusz R. Kowalski, Jan Olkowski, Mohammad T. Hajiaghayi","cross_cats":["cs.CR","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-08T02:17:10Z","title":"Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04762","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e3ea0cb701b4be5722101d3afd5d51e667e0363f4c2e114a37ed0d4a2746f3da","target":"record","created_at":"2026-07-05T08:22:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44c4d5f3489beed1621f57b86faae48acb976f07f04545895028fccc753977a4","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-08T02:17:10Z","title_canon_sha256":"ab2d792dc4653529b83c2ec3830e6dea6d24a861089686df5d04af08186b6466"},"schema_version":"1.0","source":{"id":"2405.04762","kind":"arxiv","version":2}},"canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fd7fc72c1b9da5ff97b4c55d0351e4b90bdea86131626ae2f65033e3a7adb41","first_computed_at":"2026-07-05T08:22:40.323497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:40.323497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8I2WFauMdmHpuzzMgX3AGCyNajzDN8n4T3suHThWl0aqsqyS8PCR1m93KI3bHc8JS/wAwo5X2a8neyYRz36pCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:40.323932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3ea0cb701b4be5722101d3afd5d51e667e0363f4c2e114a37ed0d4a2746f3da","sha256:7a4afb16d0c98e07807e86f758f95bf451928fd1594e420a0ee8905731593757"],"state_sha256":"a2d5fd711db48b59b9df586a5269f646bf070afaafd15901d5c2545d90571063"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VeNE1LRMVYIEvaL6M53NI02WO9XLFuMmR68dDq0P5ykG2KjJwQrIblo1aMNHiDbqkyDeE3ZV4Cl4coKvIqADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:10:27.428524Z","bundle_sha256":"595b6405f558801c6a98c866abab3d1a23d21696e9be66d72d18cb29aaec3612"}}