{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7LKEKGNU3BTUK2CAOPKJXTMNZ2","short_pith_number":"pith:7LKEKGNU","canonical_record":{"source":{"id":"1903.03164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T20:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"6cfeec980f51e3f3876ec010771625e0d852b6f082fe7bf93726a8ff4ff2d109","abstract_canon_sha256":"4551a17eddd51884b018b0d8ece2e5c21d2eba1d3944db71ff88195fa3a9a6b2"},"schema_version":"1.0"},"canonical_sha256":"fad44519b4d86745684073d49bcd8dce8f822b22b4bd6a67df04d5e0fbf3fde8","source":{"kind":"arxiv","id":"1903.03164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03164","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03164v1","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03164","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"7LKEKGNU3BTU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7LKEKGNU3BTUK2CA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7LKEKGNU","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7LKEKGNU3BTUK2CAOPKJXTMNZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T20:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"6cfeec980f51e3f3876ec010771625e0d852b6f082fe7bf93726a8ff4ff2d109","abstract_canon_sha256":"4551a17eddd51884b018b0d8ece2e5c21d2eba1d3944db71ff88195fa3a9a6b2"},"schema_version":"1.0"},"canonical_sha256":"fad44519b4d86745684073d49bcd8dce8f822b22b4bd6a67df04d5e0fbf3fde8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:46.261073Z","signature_b64":"/OubIjfz7Kc6sy/SlXZKGsJUloKJ0RSeuffdOv81vsGXWOUWo3GNOxpvVLnDueNDsL2UzPUiVmejHyrbH1abBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad44519b4d86745684073d49bcd8dce8f822b22b4bd6a67df04d5e0fbf3fde8","last_reissued_at":"2026-05-17T23:51:46.260515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:46.260515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03164","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-05-17T23:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgWClK59G7lr7Soaj6A6w7DKwJ2kL5E26ybHE6kQtGJnGTXK/8kWOx0uvS8P6DyOwKl2MtcDVN01p2Yl75eMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:08:52.496213Z"},"content_sha256":"d0142a1c4a7b773556e963185725fa7cb1ff95a0dfe485bb645afdbde97f5f5d","schema_version":"1.0","event_id":"sha256:d0142a1c4a7b773556e963185725fa7cb1ff95a0dfe485bb645afdbde97f5f5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7LKEKGNU3BTUK2CAOPKJXTMNZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shallow Overlay Trees Suffice for High-Throughput Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hao Tan, Wojciech Golab","submitted_at":"2019-03-07T20:15:45Z","abstract_excerpt":"All-to-all data transmission is a typical data transmission pattern in blockchain systems. Developing an optimization scheme that provides high throughput and low latency data transmission can significantly benefit the performance of those systems. In this work, we consider the problem of optimizing all-to-all data transmission in a wide area network(WAN) using overlay multicast. We prove that in a congestion-free core network model, using shallow broadcast trees with heights up to two is sufficient for all-to-all data transmission to achieve the optimal throughput allowed by the available net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03164","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":""},"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-17T23:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSg6EBJ0c0cXB5yZYTopjybS9D9zKSFNlVvQdC6WKKegSx1Svqw70QsGSzme0wZ/ZhJz5iufqXWIAjSF8NpRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:08:52.496586Z"},"content_sha256":"7d1a67475d5102f8f1d051794cda47c5d843f74a52699b8b9c041932d44d6688","schema_version":"1.0","event_id":"sha256:7d1a67475d5102f8f1d051794cda47c5d843f74a52699b8b9c041932d44d6688"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/bundle.json","state_url":"https://pith.science/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/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-06-03T14:08:52Z","links":{"resolver":"https://pith.science/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2","bundle":"https://pith.science/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/bundle.json","state":"https://pith.science/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LKEKGNU3BTUK2CAOPKJXTMNZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7LKEKGNU3BTUK2CAOPKJXTMNZ2","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":"4551a17eddd51884b018b0d8ece2e5c21d2eba1d3944db71ff88195fa3a9a6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T20:15:45Z","title_canon_sha256":"6cfeec980f51e3f3876ec010771625e0d852b6f082fe7bf93726a8ff4ff2d109"},"schema_version":"1.0","source":{"id":"1903.03164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03164","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03164v1","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03164","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"7LKEKGNU3BTU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7LKEKGNU3BTUK2CA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7LKEKGNU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:7d1a67475d5102f8f1d051794cda47c5d843f74a52699b8b9c041932d44d6688","target":"graph","created_at":"2026-05-17T23:51:46Z","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":"All-to-all data transmission is a typical data transmission pattern in blockchain systems. Developing an optimization scheme that provides high throughput and low latency data transmission can significantly benefit the performance of those systems. In this work, we consider the problem of optimizing all-to-all data transmission in a wide area network(WAN) using overlay multicast. We prove that in a congestion-free core network model, using shallow broadcast trees with heights up to two is sufficient for all-to-all data transmission to achieve the optimal throughput allowed by the available net","authors_text":"Hao Tan, Wojciech Golab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T20:15:45Z","title":"Shallow Overlay Trees Suffice for High-Throughput Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03164","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:d0142a1c4a7b773556e963185725fa7cb1ff95a0dfe485bb645afdbde97f5f5d","target":"record","created_at":"2026-05-17T23:51:46Z","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":"4551a17eddd51884b018b0d8ece2e5c21d2eba1d3944db71ff88195fa3a9a6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T20:15:45Z","title_canon_sha256":"6cfeec980f51e3f3876ec010771625e0d852b6f082fe7bf93726a8ff4ff2d109"},"schema_version":"1.0","source":{"id":"1903.03164","kind":"arxiv","version":1}},"canonical_sha256":"fad44519b4d86745684073d49bcd8dce8f822b22b4bd6a67df04d5e0fbf3fde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fad44519b4d86745684073d49bcd8dce8f822b22b4bd6a67df04d5e0fbf3fde8","first_computed_at":"2026-05-17T23:51:46.260515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:46.260515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OubIjfz7Kc6sy/SlXZKGsJUloKJ0RSeuffdOv81vsGXWOUWo3GNOxpvVLnDueNDsL2UzPUiVmejHyrbH1abBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:46.261073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0142a1c4a7b773556e963185725fa7cb1ff95a0dfe485bb645afdbde97f5f5d","sha256:7d1a67475d5102f8f1d051794cda47c5d843f74a52699b8b9c041932d44d6688"],"state_sha256":"b49f63cabaaaf214ba7f0c2b8f7c18873b100537339c5c18ad141c87fdc2f294"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqLhB7CR2n4llljGT/QzkY0TiNKleJleqy9vnQ0Qs5P633bRXWmeTkP/1xdojExBYRM+KCzICkFDDmQdKMJuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:08:52.498611Z","bundle_sha256":"372663069cc7fd4ec8166bb3d75b05771962d6c6bdfc7cd9d5a2a12ab30eb430"}}