{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:77EY4F6EVD6GG2WBWBIZX74RPY","short_pith_number":"pith:77EY4F6E","canonical_record":{"source":{"id":"1911.08787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-11-20T09:32:31Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3281d57a15a4437f09711157bebf7b233fcc0f13b823887d4d173c0f35165d54","abstract_canon_sha256":"67a7d5710bed43700d87d173b843da786e7d9a99642e959556e43a27b3ce245d"},"schema_version":"1.0"},"canonical_sha256":"ffc98e17c4a8fc636ac1b0519bff917e04253e293d0b96a9bcfba0e70c087c77","source":{"kind":"arxiv","id":"1911.08787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08787","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08787v1","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08787","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"77EY4F6EVD6G","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_16","alias_value":"77EY4F6EVD6GG2WB","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_8","alias_value":"77EY4F6E","created_at":"2026-07-05T00:20:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:77EY4F6EVD6GG2WBWBIZX74RPY","target":"record","payload":{"canonical_record":{"source":{"id":"1911.08787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-11-20T09:32:31Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3281d57a15a4437f09711157bebf7b233fcc0f13b823887d4d173c0f35165d54","abstract_canon_sha256":"67a7d5710bed43700d87d173b843da786e7d9a99642e959556e43a27b3ce245d"},"schema_version":"1.0"},"canonical_sha256":"ffc98e17c4a8fc636ac1b0519bff917e04253e293d0b96a9bcfba0e70c087c77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:45.540691Z","signature_b64":"CdBpENgTPSt7kx83Uy1xf+0pnkdmitDCCk9Obtp46eWQAt/MUX85ouFmwN3AIHM2b3juyjcaFnz0ekJAj/0OBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc98e17c4a8fc636ac1b0519bff917e04253e293d0b96a9bcfba0e70c087c77","last_reissued_at":"2026-07-05T00:20:45.540271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:45.540271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.08787","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-07-05T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLDTxC5ePj/L335JfZx8cBnplbKiR4CdLX5Wl8hdJLTndarCOSAGIfpz16cRSTnfp3o7kKqYi/Kg5wG9qtmKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:49:57.908360Z"},"content_sha256":"1ce800f0ad3f53ef7595487582611c13af7a2e91da2d2b1f990f35c3d00f2a42","schema_version":"1.0","event_id":"sha256:1ce800f0ad3f53ef7595487582611c13af7a2e91da2d2b1f990f35c3d00f2a42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:77EY4F6EVD6GG2WBWBIZX74RPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Andreas Penzkofer, Angelo Capossele, Sebastian Mueller","submitted_at":"2019-11-20T09:32:31Z","abstract_excerpt":"This paper investigates leaderless binary majority consensus protocols with low computational complexity in noisy Byzantine infrastructures. Using computer simulations, we show that explicit randomization of the consensus protocol can significantly increase the robustness towards faulty and malicious nodes. We identify the optimal amount of randomness for various Byzantine attack strategies on different kinds of network topologies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08787","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08787/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-05T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtCZGiVg9HFQX3/DqDhI9HP/Du4Wh0lxL60gx516ECMJOhNUrBpEmZus4au3PCo8b5BzVkxo1vSsaI0GTDljAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:49:57.909327Z"},"content_sha256":"7cdb0c5a59f7825c9c0975af75014077c1e1eceb994096a47273280d65cb92dd","schema_version":"1.0","event_id":"sha256:7cdb0c5a59f7825c9c0975af75014077c1e1eceb994096a47273280d65cb92dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77EY4F6EVD6GG2WBWBIZX74RPY/bundle.json","state_url":"https://pith.science/pith/77EY4F6EVD6GG2WBWBIZX74RPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77EY4F6EVD6GG2WBWBIZX74RPY/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-08-15T12:49:57Z","links":{"resolver":"https://pith.science/pith/77EY4F6EVD6GG2WBWBIZX74RPY","bundle":"https://pith.science/pith/77EY4F6EVD6GG2WBWBIZX74RPY/bundle.json","state":"https://pith.science/pith/77EY4F6EVD6GG2WBWBIZX74RPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77EY4F6EVD6GG2WBWBIZX74RPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:77EY4F6EVD6GG2WBWBIZX74RPY","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":"67a7d5710bed43700d87d173b843da786e7d9a99642e959556e43a27b3ce245d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-11-20T09:32:31Z","title_canon_sha256":"3281d57a15a4437f09711157bebf7b233fcc0f13b823887d4d173c0f35165d54"},"schema_version":"1.0","source":{"id":"1911.08787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08787","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08787v1","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08787","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"77EY4F6EVD6G","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_16","alias_value":"77EY4F6EVD6GG2WB","created_at":"2026-07-05T00:20:45Z"},{"alias_kind":"pith_short_8","alias_value":"77EY4F6E","created_at":"2026-07-05T00:20:45Z"}],"graph_snapshots":[{"event_id":"sha256:7cdb0c5a59f7825c9c0975af75014077c1e1eceb994096a47273280d65cb92dd","target":"graph","created_at":"2026-07-05T00:20:45Z","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/1911.08787/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates leaderless binary majority consensus protocols with low computational complexity in noisy Byzantine infrastructures. Using computer simulations, we show that explicit randomization of the consensus protocol can significantly increase the robustness towards faulty and malicious nodes. We identify the optimal amount of randomness for various Byzantine attack strategies on different kinds of network topologies.","authors_text":"Andreas Penzkofer, Angelo Capossele, Sebastian Mueller","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-11-20T09:32:31Z","title":"Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08787","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:1ce800f0ad3f53ef7595487582611c13af7a2e91da2d2b1f990f35c3d00f2a42","target":"record","created_at":"2026-07-05T00:20:45Z","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":"67a7d5710bed43700d87d173b843da786e7d9a99642e959556e43a27b3ce245d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-11-20T09:32:31Z","title_canon_sha256":"3281d57a15a4437f09711157bebf7b233fcc0f13b823887d4d173c0f35165d54"},"schema_version":"1.0","source":{"id":"1911.08787","kind":"arxiv","version":1}},"canonical_sha256":"ffc98e17c4a8fc636ac1b0519bff917e04253e293d0b96a9bcfba0e70c087c77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffc98e17c4a8fc636ac1b0519bff917e04253e293d0b96a9bcfba0e70c087c77","first_computed_at":"2026-07-05T00:20:45.540271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:45.540271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CdBpENgTPSt7kx83Uy1xf+0pnkdmitDCCk9Obtp46eWQAt/MUX85ouFmwN3AIHM2b3juyjcaFnz0ekJAj/0OBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:45.540691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ce800f0ad3f53ef7595487582611c13af7a2e91da2d2b1f990f35c3d00f2a42","sha256:7cdb0c5a59f7825c9c0975af75014077c1e1eceb994096a47273280d65cb92dd"],"state_sha256":"c8716787fd234b0cf6b6a3baaf978374b9320ff4220677cf72f4a176039d1b6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fx0xJRQCEOGeBUiqSwCoEGcl5lIKyMEzm2ubihZ1t1UfEAol56yTaboupxKqNP8TI6aeFWaku5ieJ3N5E7rACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T12:49:57.915377Z","bundle_sha256":"c429762caad61c6aa06e6842ebccb51e45723ff6950849d1080288755ae8330a"}}