{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4IUCCEVSPLBGINTER33WN5BIU6","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":"b477a069318c35135e9143c33693c85d3b3474c31d522a4139b879afa6099676","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T22:34:59Z","title_canon_sha256":"6e202fd5d7d025fef83dd8e52bc76cc81a82dde5fd1d00e39e0b27479aedfa74"},"schema_version":"1.0","source":{"id":"1303.4447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4447","created_at":"2026-05-18T03:30:27Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4447v1","created_at":"2026-05-18T03:30:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4447","created_at":"2026-05-18T03:30:27Z"},{"alias_kind":"pith_short_12","alias_value":"4IUCCEVSPLBG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4IUCCEVSPLBGINTE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4IUCCEVS","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:f4a5f2cb5db37ad57ff188627aa2985a9151f79f824a3baf2d4b59966895937b","target":"graph","created_at":"2026-05-18T03:30:27Z","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 study multi-user multi-way relay networks where $N$ user nodes exchange their information through a single relay node. We use network coding in the relay to increase the throughput. Due to the limitation of complexity, we only consider the binary multi-user network coding (BMNC) in the relay. We study BMNC matrix (in GF(2)) and propose several design criteria on the BMNC matrix to improve the symbol error probability (SEP) performance. Closed-form expressions of the SEP of the system are provided. Moreover, an upper bound of the SEP is also proposed to provide further insights on system per","authors_text":"Ang Yang, Chengwen Xing, Jingming Kuang, Jinhong Yuan, Ming Xiao, Zesong Fei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T22:34:59Z","title":"Design of Binary Network Codes for Multi-user Multi-way Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4447","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:9630b4668e476b7e731345b145a2f04b457dfa1d322a9607d8a9fdc1c663bb4d","target":"record","created_at":"2026-05-18T03:30:27Z","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":"b477a069318c35135e9143c33693c85d3b3474c31d522a4139b879afa6099676","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T22:34:59Z","title_canon_sha256":"6e202fd5d7d025fef83dd8e52bc76cc81a82dde5fd1d00e39e0b27479aedfa74"},"schema_version":"1.0","source":{"id":"1303.4447","kind":"arxiv","version":1}},"canonical_sha256":"e2282112b27ac26436648ef766f428a7866561303a69a1f9aec24d984f8a6623","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2282112b27ac26436648ef766f428a7866561303a69a1f9aec24d984f8a6623","first_computed_at":"2026-05-18T03:30:27.200056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:27.200056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyrDoiOtW9bpxED/efxzqhT1bqp4WbVG5Lo1J3ffLn0jOLbdsE9I1N/BUpw1vUcKaQWwOzs7qogtA4txFSNrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:27.200744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9630b4668e476b7e731345b145a2f04b457dfa1d322a9607d8a9fdc1c663bb4d","sha256:f4a5f2cb5db37ad57ff188627aa2985a9151f79f824a3baf2d4b59966895937b"],"state_sha256":"b0cd3de3926a498c85f5ea2843ab86ef7327fe4e808eb6d6f2825a658f23d288"}