{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BD77NJYRGMLV7EMMBROVJTXSVP","short_pith_number":"pith:BD77NJYR","schema_version":"1.0","canonical_sha256":"08fff6a71133175f918c0c5d54cef2abcfe50686aa4732eba936c84e120c432a","source":{"kind":"arxiv","id":"1810.05256","version":2},"attestation_state":"computed","paper":{"title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam G\\k{a}gol, Micha{\\l} \\'Swi\\k{e}tek","submitted_at":"2018-10-11T21:27:45Z","abstract_excerpt":"In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the algorithm for reaching a consensus on its extension to a total order. To achieve the consensus, the processes perform computations based only on a local copy of the data structure, however, they are bound to end with the same results. Our algorithm uses a dual-threshold coin-tossing scheme as a randomization strategy and establishes the agreement in an expected "},"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":"1810.05256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-11T21:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"2c0a71afd4c09a824ee257a890b339192d32d61c4d96936497d9a21461484127","abstract_canon_sha256":"4b55822c58e372b6ad70fe7d87514b59c5c5c9ee66f63051f52b03eff9fce34d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:23.504524Z","signature_b64":"OHhozsxJ40Wa9gy6mjx/KGhxmPuhxJ2aUsHuiNUakn2+GCThUW1IBdZPe98RZV0dZtm8VukCZRwjpLpDMbCpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08fff6a71133175f918c0c5d54cef2abcfe50686aa4732eba936c84e120c432a","last_reissued_at":"2026-07-05T00:00:23.504105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:23.504105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam G\\k{a}gol, Micha{\\l} \\'Swi\\k{e}tek","submitted_at":"2018-10-11T21:27:45Z","abstract_excerpt":"In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the algorithm for reaching a consensus on its extension to a total order. To achieve the consensus, the processes perform computations based only on a local copy of the data structure, however, they are bound to end with the same results. Our algorithm uses a dual-threshold coin-tossing scheme as a randomization strategy and establishes the agreement in an expected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05256","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/1810.05256/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":"1810.05256","created_at":"2026-07-05T00:00:23.504168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05256v2","created_at":"2026-07-05T00:00:23.504168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05256","created_at":"2026-07-05T00:00:23.504168+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD77NJYRGMLV","created_at":"2026-07-05T00:00:23.504168+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD77NJYRGMLV7EMM","created_at":"2026-07-05T00:00:23.504168+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD77NJYR","created_at":"2026-07-05T00:00:23.504168+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/BD77NJYRGMLV7EMMBROVJTXSVP","json":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP.json","graph_json":"https://pith.science/api/pith-number/BD77NJYRGMLV7EMMBROVJTXSVP/graph.json","events_json":"https://pith.science/api/pith-number/BD77NJYRGMLV7EMMBROVJTXSVP/events.json","paper":"https://pith.science/paper/BD77NJYR"},"agent_actions":{"view_html":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP","download_json":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP.json","view_paper":"https://pith.science/paper/BD77NJYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05256&json=true","fetch_graph":"https://pith.science/api/pith-number/BD77NJYRGMLV7EMMBROVJTXSVP/graph.json","fetch_events":"https://pith.science/api/pith-number/BD77NJYRGMLV7EMMBROVJTXSVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP/action/storage_attestation","attest_author":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP/action/author_attestation","sign_citation":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP/action/citation_signature","submit_replication":"https://pith.science/pith/BD77NJYRGMLV7EMMBROVJTXSVP/action/replication_record"}},"created_at":"2026-07-05T00:00:23.504168+00:00","updated_at":"2026-07-05T00:00:23.504168+00:00"}