{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZGSK3RPA4KKTOWQAD4LW42SRIL","short_pith_number":"pith:ZGSK3RPA","canonical_record":{"source":{"id":"1006.2422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-12T00:01:47Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"091f5c962b551393f8d4253a4fc193eb8adc833c0498c69085b320f4bdca8c4f","abstract_canon_sha256":"91d0c9803bbbd6bedd8e42a95904c4be12b491d3b22fa6eb35c4a47f9d45edf3"},"schema_version":"1.0"},"canonical_sha256":"c9a4adc5e0e295375a001f176e6a5142ed71c24f2b5d68565ee93a23b71c5163","source":{"kind":"arxiv","id":"1006.2422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2422","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2422v1","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2422","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGSK3RPA4KKT","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZGSK3RPA4KKTOWQA","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZGSK3RPA","created_at":"2026-07-04T17:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZGSK3RPA4KKTOWQAD4LW42SRIL","target":"record","payload":{"canonical_record":{"source":{"id":"1006.2422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-12T00:01:47Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"091f5c962b551393f8d4253a4fc193eb8adc833c0498c69085b320f4bdca8c4f","abstract_canon_sha256":"91d0c9803bbbd6bedd8e42a95904c4be12b491d3b22fa6eb35c4a47f9d45edf3"},"schema_version":"1.0"},"canonical_sha256":"c9a4adc5e0e295375a001f176e6a5142ed71c24f2b5d68565ee93a23b71c5163","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:30:25.927708Z","signature_b64":"WPyHf74oN3vF3Fp0kbCp5p4wOY3Q54FFt/ZZh6ViN3M/4UN512zbt+FJRi+37SgZdg3vRl1kmvNDXVfXG3BVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9a4adc5e0e295375a001f176e6a5142ed71c24f2b5d68565ee93a23b71c5163","last_reissued_at":"2026-07-04T17:30:25.927360Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:30:25.927360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.2422","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-04T17:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeGIHySdErNemKGwfbGd1E4jDmPU3Z3nYqwc9lIImXIfA+8MvLnvJkCIUhWGa6kECCkNIQHaPWp39eYFR58NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:14.110648Z"},"content_sha256":"80538bcf9cb4f65273d1ab6606c96ce813bc1b127691045750de49b09f4c4ce6","schema_version":"1.0","event_id":"sha256:80538bcf9cb4f65273d1ab6606c96ce813bc1b127691045750de49b09f4c4ce6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZGSK3RPA4KKTOWQAD4LW42SRIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Multi-Value Byzantine Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2010-06-12T00:01:47Z","abstract_excerpt":"In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. We have proposed a highly efficient Byzantine agreement algorithm on values of length l>1 bits. This algorithm uses error detecting network codes to ensure that fault-free nodes will never disagree, and routing scheme that is adaptive to the result of error detection. Our algorithm has a bit complexity of n(n-1)l/(n-t), which leads to a linear cost (O(n)) per bit agreed upon, and overcomes the quadratic lower bound (Omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2422","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/1006.2422/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-04T17:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khNcbs/TmYsXNopKuwCHKePbszeI8LIlD2VW/2wG2ChvFe+oXfMz0cxMonvh3B+Oqw+Xp1uQmBZehFiUdjZOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:14.111024Z"},"content_sha256":"d8882bf82aad06ee548686db21926709f13a02353050fd5fcac1c290fa763152","schema_version":"1.0","event_id":"sha256:d8882bf82aad06ee548686db21926709f13a02353050fd5fcac1c290fa763152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/bundle.json","state_url":"https://pith.science/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/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-07-05T07:38:14Z","links":{"resolver":"https://pith.science/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL","bundle":"https://pith.science/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/bundle.json","state":"https://pith.science/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGSK3RPA4KKTOWQAD4LW42SRIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZGSK3RPA4KKTOWQAD4LW42SRIL","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":"91d0c9803bbbd6bedd8e42a95904c4be12b491d3b22fa6eb35c4a47f9d45edf3","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-12T00:01:47Z","title_canon_sha256":"091f5c962b551393f8d4253a4fc193eb8adc833c0498c69085b320f4bdca8c4f"},"schema_version":"1.0","source":{"id":"1006.2422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2422","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2422v1","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2422","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGSK3RPA4KKT","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZGSK3RPA4KKTOWQA","created_at":"2026-07-04T17:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZGSK3RPA","created_at":"2026-07-04T17:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:d8882bf82aad06ee548686db21926709f13a02353050fd5fcac1c290fa763152","target":"graph","created_at":"2026-07-04T17:30:25Z","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/1006.2422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. We have proposed a highly efficient Byzantine agreement algorithm on values of length l>1 bits. This algorithm uses error detecting network codes to ensure that fault-free nodes will never disagree, and routing scheme that is adaptive to the result of error detection. Our algorithm has a bit complexity of n(n-1)l/(n-t), which leads to a linear cost (O(n)) per bit agreed upon, and overcomes the quadratic lower bound (Omega","authors_text":"Guanfeng Liang, Nitin Vaidya","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-12T00:01:47Z","title":"Complexity of Multi-Value Byzantine Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2422","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:80538bcf9cb4f65273d1ab6606c96ce813bc1b127691045750de49b09f4c4ce6","target":"record","created_at":"2026-07-04T17:30:25Z","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":"91d0c9803bbbd6bedd8e42a95904c4be12b491d3b22fa6eb35c4a47f9d45edf3","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-12T00:01:47Z","title_canon_sha256":"091f5c962b551393f8d4253a4fc193eb8adc833c0498c69085b320f4bdca8c4f"},"schema_version":"1.0","source":{"id":"1006.2422","kind":"arxiv","version":1}},"canonical_sha256":"c9a4adc5e0e295375a001f176e6a5142ed71c24f2b5d68565ee93a23b71c5163","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9a4adc5e0e295375a001f176e6a5142ed71c24f2b5d68565ee93a23b71c5163","first_computed_at":"2026-07-04T17:30:25.927360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:30:25.927360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WPyHf74oN3vF3Fp0kbCp5p4wOY3Q54FFt/ZZh6ViN3M/4UN512zbt+FJRi+37SgZdg3vRl1kmvNDXVfXG3BVDg==","signature_status":"signed_v1","signed_at":"2026-07-04T17:30:25.927708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.2422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80538bcf9cb4f65273d1ab6606c96ce813bc1b127691045750de49b09f4c4ce6","sha256:d8882bf82aad06ee548686db21926709f13a02353050fd5fcac1c290fa763152"],"state_sha256":"c56884fa269a9fa4e58d4b5ff9f3dcbcd8fcdd685f656f9bda28b4b258c631c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kO9UtflDdiuT1L4gKQ8EWQuTPciwx1NYYzJg2uT+mlBoEbzsiSP2Dk29ldWzpEE5EyvaRYiuvjevL/eaGnR4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:38:14.113168Z","bundle_sha256":"9486b7a9494a27913f65eff7baaed6d62c4d4e84422a4223d7e861ee12055f68"}}