{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D73QU7KHVAWWIUDNE3QRFDJ6OM","short_pith_number":"pith:D73QU7KH","schema_version":"1.0","canonical_sha256":"1ff70a7d47a82d64506d26e1128d3e7321f14dac7d8e85b649c7b23d3a82f69a","source":{"kind":"arxiv","id":"1310.5187","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.5187","created_at":"2026-05-18T03:09:47.029224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5187v1","created_at":"2026-05-18T03:09:47.029224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5187","created_at":"2026-05-18T03:09:47.029224+00:00"},{"alias_kind":"pith_short_12","alias_value":"D73QU7KHVAWW","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D73QU7KHVAWWIUDN","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D73QU7KH","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM","json":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM.json","graph_json":"https://pith.science/api/pith-number/D73QU7KHVAWWIUDNE3QRFDJ6OM/graph.json","events_json":"https://pith.science/api/pith-number/D73QU7KHVAWWIUDNE3QRFDJ6OM/events.json","paper":"https://pith.science/paper/D73QU7KH"},"agent_actions":{"view_html":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM","download_json":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM.json","view_paper":"https://pith.science/paper/D73QU7KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5187&json=true","fetch_graph":"https://pith.science/api/pith-number/D73QU7KHVAWWIUDNE3QRFDJ6OM/graph.json","fetch_events":"https://pith.science/api/pith-number/D73QU7KHVAWWIUDNE3QRFDJ6OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/action/storage_attestation","attest_author":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/action/author_attestation","sign_citation":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/action/citation_signature","submit_replication":"https://pith.science/pith/D73QU7KHVAWWIUDNE3QRFDJ6OM/action/replication_record"}},"created_at":"2026-05-18T03:09:47.029224+00:00","updated_at":"2026-05-18T03:09:47.029224+00:00"}