{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:APZPDX66MXGSNSXVVEHQIBDKGL","short_pith_number":"pith:APZPDX66","schema_version":"1.0","canonical_sha256":"03f2f1dfde65cd26caf5a90f04046a32cdaebdc7d376a779f35b731d9912dc23","source":{"kind":"arxiv","id":"2001.06271","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Byzantine Reliable Broadcast [Technical Report]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Dragos-Adrian Seredinschi, Jovan Komatovic, Petr Kuznetsov, Rachid Guerraoui, Yvonne-Anne Pignolet","submitted_at":"2020-01-17T12:47:31Z","abstract_excerpt":"Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a completely asynchronous environment, unlike stronger primitives like consensus and total-order broadcast, and yet (ii) reliable broadcast is powerful enough to implement important applications like payment systems.\n  The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system. "},"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":"2001.06271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-17T12:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"142ed23a5dbd73e68206bc979148dc9907229a0a88d37b307f5f0cfafacfc262","abstract_canon_sha256":"663c39de0b7da26461ca30bc43c39f0f4088e71d35b17acce5bc5590e53ef76c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:18.820236Z","signature_b64":"2wPmaWNrMpy78nF6Jd/vZ70Hh3cgL7Q7X6thZxO5ElPA94ebkZJMzmqZqWx/u5MpH64dVcekN3JygdPm1ocgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f2f1dfde65cd26caf5a90f04046a32cdaebdc7d376a779f35b731d9912dc23","last_reissued_at":"2026-07-05T01:53:18.819837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:18.819837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Byzantine Reliable Broadcast [Technical Report]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Dragos-Adrian Seredinschi, Jovan Komatovic, Petr Kuznetsov, Rachid Guerraoui, Yvonne-Anne Pignolet","submitted_at":"2020-01-17T12:47:31Z","abstract_excerpt":"Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a completely asynchronous environment, unlike stronger primitives like consensus and total-order broadcast, and yet (ii) reliable broadcast is powerful enough to implement important applications like payment systems.\n  The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.06271","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/2001.06271/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":"2001.06271","created_at":"2026-07-05T01:53:18.819895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.06271v2","created_at":"2026-07-05T01:53:18.819895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.06271","created_at":"2026-07-05T01:53:18.819895+00:00"},{"alias_kind":"pith_short_12","alias_value":"APZPDX66MXGS","created_at":"2026-07-05T01:53:18.819895+00:00"},{"alias_kind":"pith_short_16","alias_value":"APZPDX66MXGSNSXV","created_at":"2026-07-05T01:53:18.819895+00:00"},{"alias_kind":"pith_short_8","alias_value":"APZPDX66","created_at":"2026-07-05T01:53:18.819895+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/APZPDX66MXGSNSXVVEHQIBDKGL","json":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL.json","graph_json":"https://pith.science/api/pith-number/APZPDX66MXGSNSXVVEHQIBDKGL/graph.json","events_json":"https://pith.science/api/pith-number/APZPDX66MXGSNSXVVEHQIBDKGL/events.json","paper":"https://pith.science/paper/APZPDX66"},"agent_actions":{"view_html":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL","download_json":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL.json","view_paper":"https://pith.science/paper/APZPDX66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.06271&json=true","fetch_graph":"https://pith.science/api/pith-number/APZPDX66MXGSNSXVVEHQIBDKGL/graph.json","fetch_events":"https://pith.science/api/pith-number/APZPDX66MXGSNSXVVEHQIBDKGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL/action/storage_attestation","attest_author":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL/action/author_attestation","sign_citation":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL/action/citation_signature","submit_replication":"https://pith.science/pith/APZPDX66MXGSNSXVVEHQIBDKGL/action/replication_record"}},"created_at":"2026-07-05T01:53:18.819895+00:00","updated_at":"2026-07-05T01:53:18.819895+00:00"}