{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AEZXEK4NYYSKYQFE5K6RH2EEPF","short_pith_number":"pith:AEZXEK4N","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"},"canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","source":{"kind":"arxiv","id":"1805.00774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00774","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00774v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00774","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"AEZXEK4NYYSK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AEZXEK4NYYSKYQFE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AEZXEK4N","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AEZXEK4NYYSKYQFE5K6RH2EEPF","target":"record","payload":{"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"},"canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","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"},"source_kind":"arxiv","source_id":"1805.00774","source_version":1,"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-05-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96ywk5uUZzwl/0VWExsoGFW7gXpaaxWOGViqPKWVjct74yrV8vaXW+9PcFuzp50If4syleP/A55gWW8H3EvcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:26.326533Z"},"content_sha256":"98e8b90e15104eb050e2b97913b41b46364a58b580ef12ba072a15976acddaca","schema_version":"1.0","event_id":"sha256:98e8b90e15104eb050e2b97913b41b46364a58b580ef12ba072a15976acddaca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AEZXEK4NYYSKYQFE5K6RH2EEPF","target":"graph","payload":{"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"},"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-05-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koGpbcS9wzOoCSMHEMP3t1jsVVeNH4NrbFvyHzfRyBrAA9OJg6eJfe5eO6DmpP7PMp4rgzM4S958O7hKvwOKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:26.327172Z"},"content_sha256":"19a48b28ab0fab1cf62b8c8cce56124d138a0cc6a10e0ad075bcc163e873b243","schema_version":"1.0","event_id":"sha256:19a48b28ab0fab1cf62b8c8cce56124d138a0cc6a10e0ad075bcc163e873b243"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/bundle.json","state_url":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/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-05-28T13:34:26Z","links":{"resolver":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF","bundle":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/bundle.json","state":"https://pith.science/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEZXEK4NYYSKYQFE5K6RH2EEPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AEZXEK4NYYSKYQFE5K6RH2EEPF","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":"63a0d6a766708cfcd37d4acffb1dade0600c96fb15eebafda94aa6821bc32cf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T12:54:40Z","title_canon_sha256":"709f142663422fab5339c1e6550f2285f8b131d5bbc18c5a25feffa48ef367e9"},"schema_version":"1.0","source":{"id":"1805.00774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00774","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00774v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00774","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"AEZXEK4NYYSK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AEZXEK4NYYSKYQFE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AEZXEK4N","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:19a48b28ab0fab1cf62b8c8cce56124d138a0cc6a10e0ad075bcc163e873b243","target":"graph","created_at":"2026-05-18T00:16:57Z","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"},"paper":{"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","authors_text":"Alexander Setzer, Christian Scheideler, Peter Robinson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T12:54:40Z","title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00774","kind":"arxiv","version":1},"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:98e8b90e15104eb050e2b97913b41b46364a58b580ef12ba072a15976acddaca","target":"record","created_at":"2026-05-18T00:16:57Z","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":"63a0d6a766708cfcd37d4acffb1dade0600c96fb15eebafda94aa6821bc32cf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T12:54:40Z","title_canon_sha256":"709f142663422fab5339c1e6550f2285f8b131d5bbc18c5a25feffa48ef367e9"},"schema_version":"1.0","source":{"id":"1805.00774","kind":"arxiv","version":1}},"canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0133722b8dc624ac40a4eabd13e884797a309bff38826002c19131ae004dab4e","first_computed_at":"2026-05-18T00:16:57.760123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:57.760123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ELxIxGDqyLpQspNzH0h0IUeAUYyQ6cvcT11xKoeYmFijGQMvj/omwtYZfSi76QKjP3kJ1cUjWGkAJzibvLUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:57.760756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98e8b90e15104eb050e2b97913b41b46364a58b580ef12ba072a15976acddaca","sha256:19a48b28ab0fab1cf62b8c8cce56124d138a0cc6a10e0ad075bcc163e873b243"],"state_sha256":"fb5f424b4d3614124870ce1ff593bcd7c9c20a0977782fe1d7d9a6ecd7e03aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65OSKP0i+UERXNGO7jdX/rol7th9+P5nOgHidOIBIGY6CWEtf0mrxHsUnjbsfzdI0tI2WYEjqA9J8RxzqBMYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:34:26.330599Z","bundle_sha256":"39512359dd7efc51e66c395074e2cbf31d2778c87f06212a07637fd729a57557"}}