{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6TWM3QPBGIN3YXICGHYODAJKJ3","short_pith_number":"pith:6TWM3QPB","canonical_record":{"source":{"id":"1106.1845","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-09T16:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"18acfb91d9bb0fbc6f552b335d7b865e168e7a80f53f865d2ea8a9bd1364ee0a","abstract_canon_sha256":"5ebcb8f1d2efef9fd3b36fec33a3d5c2b48a4356ce6a4423868c0c0b452f2ca5"},"schema_version":"1.0"},"canonical_sha256":"f4eccdc1e1321bbc5d0231f0e1812a4ef32f802b18d5498975a99c46df05510d","source":{"kind":"arxiv","id":"1106.1845","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1845","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1845v3","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1845","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"6TWM3QPBGIN3","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TWM3QPBGIN3YXIC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TWM3QPB","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6TWM3QPBGIN3YXICGHYODAJKJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1845","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-09T16:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"18acfb91d9bb0fbc6f552b335d7b865e168e7a80f53f865d2ea8a9bd1364ee0a","abstract_canon_sha256":"5ebcb8f1d2efef9fd3b36fec33a3d5c2b48a4356ce6a4423868c0c0b452f2ca5"},"schema_version":"1.0"},"canonical_sha256":"f4eccdc1e1321bbc5d0231f0e1812a4ef32f802b18d5498975a99c46df05510d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.382507Z","signature_b64":"dVeS59X3Pe1l0RyDy50nsJDHBNUMPIBPpCfrzQeMSKacyNmZBJdnENt7u4kEiPLV7UyjUj4hC/fomWho0kWoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4eccdc1e1321bbc5d0231f0e1812a4ef32f802b18d5498975a99c46df05510d","last_reissued_at":"2026-05-18T03:56:35.382079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.382079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1845","source_version":3,"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-05-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QncATxGpGLMQtI/XPj82G9L4QUhXLwesbDKDxRNNT7mUHrB0tuzsMTBWWyfZrvTeZ7eY24jjoQqoseKy3N4XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:21:39.607202Z"},"content_sha256":"b93f5923b45c19a1e7bf3f25ea421d81fcba9ee57f8b1f8215a8dfc3f5969868","schema_version":"1.0","event_id":"sha256:b93f5923b45c19a1e7bf3f25ea421d81fcba9ee57f8b1f8215a8dfc3f5969868"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6TWM3QPBGIN3YXICGHYODAJKJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byzantine Broadcast in Point-to-Point Networks using Local Linear Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2011-06-09T16:07:57Z","abstract_excerpt":"The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faulty nodes. We consider design of efficient algorithms for BB in {\\em synchronous} point-to-point networks, where the rate of transmission over each communication link is limited by its \"link capacity\". The throughput of a particular BB algorithm is defined as the average number of bits that can be reliably broadcast to all fault-free nodes per unit time using the algorithm without violating the link capacity constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1845","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OliScHDt0UHNhyyL8CPcZYi3G8F5rCIh2VAezC53dYEnoGK7WYbk+IcPSBDhzKwKB+ShlLq/KoZS++xDc9DsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:21:39.607558Z"},"content_sha256":"08f5c7153286308e625816b5618b2e4d278071bab58481fc0b8e4afc9f295f26","schema_version":"1.0","event_id":"sha256:08f5c7153286308e625816b5618b2e4d278071bab58481fc0b8e4afc9f295f26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/bundle.json","state_url":"https://pith.science/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/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-03T12:21:39Z","links":{"resolver":"https://pith.science/pith/6TWM3QPBGIN3YXICGHYODAJKJ3","bundle":"https://pith.science/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/bundle.json","state":"https://pith.science/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TWM3QPBGIN3YXICGHYODAJKJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6TWM3QPBGIN3YXICGHYODAJKJ3","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":"5ebcb8f1d2efef9fd3b36fec33a3d5c2b48a4356ce6a4423868c0c0b452f2ca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-09T16:07:57Z","title_canon_sha256":"18acfb91d9bb0fbc6f552b335d7b865e168e7a80f53f865d2ea8a9bd1364ee0a"},"schema_version":"1.0","source":{"id":"1106.1845","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1845","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1845v3","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1845","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"6TWM3QPBGIN3","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TWM3QPBGIN3YXIC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TWM3QPB","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:08f5c7153286308e625816b5618b2e4d278071bab58481fc0b8e4afc9f295f26","target":"graph","created_at":"2026-05-18T03:56:35Z","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"},"paper":{"abstract_excerpt":"The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faulty nodes. We consider design of efficient algorithms for BB in {\\em synchronous} point-to-point networks, where the rate of transmission over each communication link is limited by its \"link capacity\". The throughput of a particular BB algorithm is defined as the average number of bits that can be reliably broadcast to all fault-free nodes per unit time using the algorithm without violating the link capacity constraint","authors_text":"Guanfeng Liang, Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-09T16:07:57Z","title":"Byzantine Broadcast in Point-to-Point Networks using Local Linear Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1845","kind":"arxiv","version":3},"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:b93f5923b45c19a1e7bf3f25ea421d81fcba9ee57f8b1f8215a8dfc3f5969868","target":"record","created_at":"2026-05-18T03:56:35Z","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":"5ebcb8f1d2efef9fd3b36fec33a3d5c2b48a4356ce6a4423868c0c0b452f2ca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-09T16:07:57Z","title_canon_sha256":"18acfb91d9bb0fbc6f552b335d7b865e168e7a80f53f865d2ea8a9bd1364ee0a"},"schema_version":"1.0","source":{"id":"1106.1845","kind":"arxiv","version":3}},"canonical_sha256":"f4eccdc1e1321bbc5d0231f0e1812a4ef32f802b18d5498975a99c46df05510d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4eccdc1e1321bbc5d0231f0e1812a4ef32f802b18d5498975a99c46df05510d","first_computed_at":"2026-05-18T03:56:35.382079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:35.382079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVeS59X3Pe1l0RyDy50nsJDHBNUMPIBPpCfrzQeMSKacyNmZBJdnENt7u4kEiPLV7UyjUj4hC/fomWho0kWoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:35.382507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1845","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b93f5923b45c19a1e7bf3f25ea421d81fcba9ee57f8b1f8215a8dfc3f5969868","sha256:08f5c7153286308e625816b5618b2e4d278071bab58481fc0b8e4afc9f295f26"],"state_sha256":"94d9effb3de0d7764ea48efab7b08ae2a2cade920458235a697c0f822b133877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GMdIHH6tA5RftB6R0Jyh4TCl00lMsR/WRK13epBfkm2XCYds1pQbvXfMadVJsY1Z1W4UKYkmAfOXout/GAbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:21:39.609582Z","bundle_sha256":"ffe664e9321dfb6bb8ae8e9cbc7110ae2007d2b7bef401258b5a70dfb8a884fb"}}