{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HEMH3NXYBN5YEBYOFBM2OGC4FL","short_pith_number":"pith:HEMH3NXY","canonical_record":{"source":{"id":"1301.3996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"b97de5d35a0c63eb1c2d9bd0df521182065e9654666530c08fe46fb14d28da95","abstract_canon_sha256":"bd18358f4a1ff88620216ddf74c1e5e0049b627c2bf8202e5ead9b2ceefbd2e8"},"schema_version":"1.0"},"canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","source":{"kind":"arxiv","id":"1301.3996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3996","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3996v2","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3996","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"HEMH3NXYBN5Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HEMH3NXYBN5YEBYO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HEMH3NXY","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HEMH3NXYBN5YEBYOFBM2OGC4FL","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"b97de5d35a0c63eb1c2d9bd0df521182065e9654666530c08fe46fb14d28da95","abstract_canon_sha256":"bd18358f4a1ff88620216ddf74c1e5e0049b627c2bf8202e5ead9b2ceefbd2e8"},"schema_version":"1.0"},"canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.714363Z","signature_b64":"X/CBv1ARicmjtBFoDESNaLkdHDbQyepXN0km3DRvgHsnh+2Ue1IRsirafO+98s17XSrU6pHbJdkLlJQ892UQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","last_reissued_at":"2026-05-18T03:05:18.713926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.713926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3996","source_version":2,"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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YLz5UrEhz7VH42phMF1ZZEEhVWR+WDYGkL9eb9WArK+ipOcf4VwhMwADupe9Om4wcQzSc3WZh2erOarYlckBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:08:22.330987Z"},"content_sha256":"3f7e0a7245c3cbc1db649ce7a9dad00e4362f82a064ac034fe4ee046c56a1944","schema_version":"1.0","event_id":"sha256:3f7e0a7245c3cbc1db649ce7a9dad00e4362f82a064ac034fe4ee046c56a1944"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HEMH3NXYBN5YEBYOFBM2OGC4FL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterizable Byzantine Broadcast in Loosely Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-01-17T07:09:15Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3996","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":""},"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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/GyaJOiavv7Oe0dHXnXI4NVxtbkuwJZej6e+4997h+xyyufWCAqfzE0V7dEAXkoOw3SYWSQYKt3a0j63Rj9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:08:22.331719Z"},"content_sha256":"0fa06cfb6b034bbd093e3287ec166b515d6eaf6d92e0327ad23904eff3e6a66c","schema_version":"1.0","event_id":"sha256:0fa06cfb6b034bbd093e3287ec166b515d6eaf6d92e0327ad23904eff3e6a66c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/bundle.json","state_url":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/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-05-23T14:08:22Z","links":{"resolver":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL","bundle":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/bundle.json","state":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HEMH3NXYBN5YEBYOFBM2OGC4FL","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":"bd18358f4a1ff88620216ddf74c1e5e0049b627c2bf8202e5ead9b2ceefbd2e8","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","title_canon_sha256":"b97de5d35a0c63eb1c2d9bd0df521182065e9654666530c08fe46fb14d28da95"},"schema_version":"1.0","source":{"id":"1301.3996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3996","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3996v2","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3996","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"HEMH3NXYBN5Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HEMH3NXYBN5YEBYO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HEMH3NXY","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:0fa06cfb6b034bbd093e3287ec166b515d6eaf6d92e0327ad23904eff3e6a66c","target":"graph","created_at":"2026-05-18T03:05:18Z","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":"We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A firs","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","title":"Parameterizable Byzantine Broadcast in Loosely Connected Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3996","kind":"arxiv","version":2},"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:3f7e0a7245c3cbc1db649ce7a9dad00e4362f82a064ac034fe4ee046c56a1944","target":"record","created_at":"2026-05-18T03:05:18Z","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":"bd18358f4a1ff88620216ddf74c1e5e0049b627c2bf8202e5ead9b2ceefbd2e8","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","title_canon_sha256":"b97de5d35a0c63eb1c2d9bd0df521182065e9654666530c08fe46fb14d28da95"},"schema_version":"1.0","source":{"id":"1301.3996","kind":"arxiv","version":2}},"canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","first_computed_at":"2026-05-18T03:05:18.713926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:18.713926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/CBv1ARicmjtBFoDESNaLkdHDbQyepXN0km3DRvgHsnh+2Ue1IRsirafO+98s17XSrU6pHbJdkLlJQ892UQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:18.714363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f7e0a7245c3cbc1db649ce7a9dad00e4362f82a064ac034fe4ee046c56a1944","sha256:0fa06cfb6b034bbd093e3287ec166b515d6eaf6d92e0327ad23904eff3e6a66c"],"state_sha256":"f61051edb9f8fc15920e12a816cf22b2ef8296a67c60c775ac51b5fcdfd9ad1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pf+95Ik0hSn5GCTizOdk0ubfgwIOGiZnaRjNqSKtnSSJkC/2QvrYvZVTvS7Ip6hIjid0/Pe8dsv4Qzy6kUqzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T14:08:22.335485Z","bundle_sha256":"d9046a79bef1e4b27698f2080253a1186b20e9e6d30f4e6fb5ea0e27e74d7021"}}