{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D73QU7KHVAWWIUDNE3QRFDJ6OM","short_pith_number":"pith:D73QU7KH","canonical_record":{"source":{"id":"1310.5187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T00:12:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab507726f292cb00fd3f492f32683a3d5d9aa0c59e2ce16a31e334f6e9274f6b","abstract_canon_sha256":"848863331b559607829030e785f189dcb11c2ac846df3cc6ac9b4ac61b6dbcd8"},"schema_version":"1.0"},"canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","source":{"kind":"arxiv","id":"1310.5187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5187","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5187v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5187","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"D73QU7KHVAWW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D73QU7KHVAWWIUDN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D73QU7KH","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D73QU7KHVAWWIUDNE3QRFDJ6OM","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T00:12:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab507726f292cb00fd3f492f32683a3d5d9aa0c59e2ce16a31e334f6e9274f6b","abstract_canon_sha256":"848863331b559607829030e785f189dcb11c2ac846df3cc6ac9b4ac61b6dbcd8"},"schema_version":"1.0"},"canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:47.029661Z","signature_b64":"ccU8Gl24vKiixvTGquwE0ocL/CPBjsGY1OFOZ8NywAKSOE0ucfqUyjTmKkuBBOo5JHsUf8BEWkWhs2yh/EsKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","last_reissued_at":"2026-05-18T03:09:47.029160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:47.029160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5187","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87mYvMsCMHjpHocfGfjwJW5md90trYelPPeC5v8+X3EFnXLZlsVjnOIiKLQWbM5p9Bk6uliQy/ubo+g7+GUaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:46:42.145158Z"},"content_sha256":"78ebbe226e5b0e0713f9a0f72486fbb586edc22572f9cc843642386d6d55f351","schema_version":"1.0","event_id":"sha256:78ebbe226e5b0e0713f9a0f72486fbb586edc22572f9cc843642386d6d55f351"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D73QU7KHVAWWIUDNE3QRFDJ6OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Reed-Solomon Codes for Simple Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongyi Yao, Iwan Duursma, Tracey Ho, Wael Halbawi","submitted_at":"2013-10-19T00:12:19Z","abstract_excerpt":"We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5187","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOSfBIbNy5pc0WWPuTRi14r8JsMfmORKWR/4ClUCbW4ZG0HREAl+cwcX2Urus4IyVfwsix7AbXQje6NCl+7BDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:46:42.145522Z"},"content_sha256":"cf8c5006d126f710975b09e0fc86e43fa8bd48d806b5559625fb5b5375c2c49d","schema_version":"1.0","event_id":"sha256:cf8c5006d126f710975b09e0fc86e43fa8bd48d806b5559625fb5b5375c2c49d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/bundle.json","state_url":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/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-21T13:46:42Z","links":{"resolver":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM","bundle":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/bundle.json","state":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D73QU7KHVAWWIUDNE3QRFDJ6OM","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":"848863331b559607829030e785f189dcb11c2ac846df3cc6ac9b4ac61b6dbcd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T00:12:19Z","title_canon_sha256":"ab507726f292cb00fd3f492f32683a3d5d9aa0c59e2ce16a31e334f6e9274f6b"},"schema_version":"1.0","source":{"id":"1310.5187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5187","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5187v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5187","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"D73QU7KHVAWW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D73QU7KHVAWWIUDN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D73QU7KH","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:cf8c5006d126f710975b09e0fc86e43fa8bd48d806b5559625fb5b5375c2c49d","target":"graph","created_at":"2026-05-18T03:09:47Z","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 a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from ","authors_text":"Hongyi Yao, Iwan Duursma, Tracey Ho, Wael Halbawi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T00:12:19Z","title":"Distributed Reed-Solomon Codes for Simple Multiple Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5187","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:78ebbe226e5b0e0713f9a0f72486fbb586edc22572f9cc843642386d6d55f351","target":"record","created_at":"2026-05-18T03:09:47Z","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":"848863331b559607829030e785f189dcb11c2ac846df3cc6ac9b4ac61b6dbcd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T00:12:19Z","title_canon_sha256":"ab507726f292cb00fd3f492f32683a3d5d9aa0c59e2ce16a31e334f6e9274f6b"},"schema_version":"1.0","source":{"id":"1310.5187","kind":"arxiv","version":1}},"canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","first_computed_at":"2026-05-18T03:09:47.029160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:47.029160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccU8Gl24vKiixvTGquwE0ocL/CPBjsGY1OFOZ8NywAKSOE0ucfqUyjTmKkuBBOo5JHsUf8BEWkWhs2yh/EsKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:47.029661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78ebbe226e5b0e0713f9a0f72486fbb586edc22572f9cc843642386d6d55f351","sha256:cf8c5006d126f710975b09e0fc86e43fa8bd48d806b5559625fb5b5375c2c49d"],"state_sha256":"d3fec75eb2fec077f32a3948330660f949d07176492407ea76e3bcbb5bc2d7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9F+lJ7slQVRnUHhapS8OTxM1yOnLRzYMDZLhH4hLVWGrOy7O8G+bamID/t9bMA6RK2roVqMVlsqRvFqUlqYIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T13:46:42.147473Z","bundle_sha256":"ca19b81b01895627200c789078906b9c131d21b1cb3df54d88535cffbcde9e98"}}