{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:BE35VNCXYGJRZEZXFZP5VE25EX","short_pith_number":"pith:BE35VNCX","canonical_record":{"source":{"id":"2106.14312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-27T19:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"f1ab6735c19be16871427f4744fff37a8d43bedc8b1979e8c4f48fa2f2d3ef0f","abstract_canon_sha256":"91262562a9b9abde2cbafae77f085be09e711b8bf88f5f376721dba78b8cd07d"},"schema_version":"1.0"},"canonical_sha256":"0937dab457c1931c93372e5fda935d25cea69b9ee11db89e5c52a0e17df968b3","source":{"kind":"arxiv","id":"2106.14312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14312","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14312v1","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14312","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"BE35VNCXYGJR","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_16","alias_value":"BE35VNCXYGJRZEZX","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_8","alias_value":"BE35VNCX","created_at":"2026-07-05T04:20:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:BE35VNCXYGJRZEZXFZP5VE25EX","target":"record","payload":{"canonical_record":{"source":{"id":"2106.14312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-27T19:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"f1ab6735c19be16871427f4744fff37a8d43bedc8b1979e8c4f48fa2f2d3ef0f","abstract_canon_sha256":"91262562a9b9abde2cbafae77f085be09e711b8bf88f5f376721dba78b8cd07d"},"schema_version":"1.0"},"canonical_sha256":"0937dab457c1931c93372e5fda935d25cea69b9ee11db89e5c52a0e17df968b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:28.612151Z","signature_b64":"9H73iq8qZWFyAmkUuamgl6wy3Q9vRKrRhww1HTYmMkIHQQ8FOChgvv8pMq09Ts1yiadmuQFHg+h6DBkLWNx5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0937dab457c1931c93372e5fda935d25cea69b9ee11db89e5c52a0e17df968b3","last_reissued_at":"2026-07-05T04:20:28.611634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:28.611634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.14312","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-05T04:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OwRTmnW+uMLESv+5rPb+v/AUD7xXrOwY3DcXX0QcJAau9wRTM52VWvrcWnXELLLIBsUBF86N55oPx3m0M5hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:22:28.248092Z"},"content_sha256":"31c4073b06371ced4a77eb868f502dd3d0ece2e30e2d72c78dde5329dc3fa59a","schema_version":"1.0","event_id":"sha256:31c4073b06371ced4a77eb868f502dd3d0ece2e30e2d72c78dde5329dc3fa59a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:BE35VNCXYGJRZEZXFZP5VE25EX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Matthew Ding","submitted_at":"2021-06-27T19:16:47Z","abstract_excerpt":"Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of fault-tolerant distributed computing where machines seek to achieve approximate consensus to arbitrary exactness in the presence of Byzantine failures. We present a novel algorithm for this problem, named Relay-IABC, which relies on the usage of a multi-hop relayed messaging system and crytographically secure message signatures. The use of signatures and relays allows the strict necessary network conditions of traditional IABC algorithms to be circumvented. In addition, we show evidence that Relay-IABC achieves faster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14312","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/2106.14312/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-05T04:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8aBWZV1DRHUFLTxy9qSl+KDP/rysTLQwMQMQz+Ejj7gvy86PP7eT19nnphuma93bJJK72IvjgHicmTo0wlwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:22:28.248844Z"},"content_sha256":"7eadd829d33f75d8d3dea0ce0a3f10d5f382d88fa3983396a0c556e8f56df265","schema_version":"1.0","event_id":"sha256:7eadd829d33f75d8d3dea0ce0a3f10d5f382d88fa3983396a0c556e8f56df265"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BE35VNCXYGJRZEZXFZP5VE25EX/bundle.json","state_url":"https://pith.science/pith/BE35VNCXYGJRZEZXFZP5VE25EX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BE35VNCXYGJRZEZXFZP5VE25EX/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-16T11:22:28Z","links":{"resolver":"https://pith.science/pith/BE35VNCXYGJRZEZXFZP5VE25EX","bundle":"https://pith.science/pith/BE35VNCXYGJRZEZXFZP5VE25EX/bundle.json","state":"https://pith.science/pith/BE35VNCXYGJRZEZXFZP5VE25EX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BE35VNCXYGJRZEZXFZP5VE25EX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BE35VNCXYGJRZEZXFZP5VE25EX","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":"91262562a9b9abde2cbafae77f085be09e711b8bf88f5f376721dba78b8cd07d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-27T19:16:47Z","title_canon_sha256":"f1ab6735c19be16871427f4744fff37a8d43bedc8b1979e8c4f48fa2f2d3ef0f"},"schema_version":"1.0","source":{"id":"2106.14312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14312","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14312v1","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14312","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"BE35VNCXYGJR","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_16","alias_value":"BE35VNCXYGJRZEZX","created_at":"2026-07-05T04:20:28Z"},{"alias_kind":"pith_short_8","alias_value":"BE35VNCX","created_at":"2026-07-05T04:20:28Z"}],"graph_snapshots":[{"event_id":"sha256:7eadd829d33f75d8d3dea0ce0a3f10d5f382d88fa3983396a0c556e8f56df265","target":"graph","created_at":"2026-07-05T04:20:28Z","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/2106.14312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of fault-tolerant distributed computing where machines seek to achieve approximate consensus to arbitrary exactness in the presence of Byzantine failures. We present a novel algorithm for this problem, named Relay-IABC, which relies on the usage of a multi-hop relayed messaging system and crytographically secure message signatures. The use of signatures and relays allows the strict necessary network conditions of traditional IABC algorithms to be circumvented. In addition, we show evidence that Relay-IABC achieves faster","authors_text":"Matthew Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-27T19:16:47Z","title":"An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14312","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:31c4073b06371ced4a77eb868f502dd3d0ece2e30e2d72c78dde5329dc3fa59a","target":"record","created_at":"2026-07-05T04:20:28Z","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":"91262562a9b9abde2cbafae77f085be09e711b8bf88f5f376721dba78b8cd07d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-27T19:16:47Z","title_canon_sha256":"f1ab6735c19be16871427f4744fff37a8d43bedc8b1979e8c4f48fa2f2d3ef0f"},"schema_version":"1.0","source":{"id":"2106.14312","kind":"arxiv","version":1}},"canonical_sha256":"0937dab457c1931c93372e5fda935d25cea69b9ee11db89e5c52a0e17df968b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0937dab457c1931c93372e5fda935d25cea69b9ee11db89e5c52a0e17df968b3","first_computed_at":"2026-07-05T04:20:28.611634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:20:28.611634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9H73iq8qZWFyAmkUuamgl6wy3Q9vRKrRhww1HTYmMkIHQQ8FOChgvv8pMq09Ts1yiadmuQFHg+h6DBkLWNx5CA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:20:28.612151Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.14312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31c4073b06371ced4a77eb868f502dd3d0ece2e30e2d72c78dde5329dc3fa59a","sha256:7eadd829d33f75d8d3dea0ce0a3f10d5f382d88fa3983396a0c556e8f56df265"],"state_sha256":"48d6fb95bfd59d1b756594a017ef4d17c32bf29ef2699bf341953eff83df6c2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jAU6VA9IlTZJB3AQ3SGIS0uF4lISvJhAU4PhLPSmqHjHAopOY6D086bRxl2wOf4uAYvP8IQRTZsjQgfjykhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:22:28.301080Z","bundle_sha256":"6a7988a914a90e01eadba4e1538040e186768ab4a463040cd419c878eaba14ac"}}