{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4RRBT7Y6FL2VE4D3A5ROD2GUVC","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":"e520fb9934ae60514ad7d4296fb52412962a87e6121f509e62a438b55793452d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-16T04:36:25Z","title_canon_sha256":"366693a434a1ea181a1e2d7e0773df06eaa0017e6539b5869b2b63263624a112"},"schema_version":"1.0","source":{"id":"1004.2757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2757","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2757v2","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2757","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"4RRBT7Y6FL2V","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4RRBT7Y6FL2VE4D3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4RRBT7Y6","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:336ef8a93d691b0e051427c6e8e2a08aa7e7d7ea7969ae8e29234c0afb3baec3","target":"graph","created_at":"2026-05-18T04:28:45Z","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":"In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of $M$ users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linea","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Branka Vucetic, Jo\\~ao Luiz Rebelatto, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-16T04:36:25Z","title":"Multi-User Cooperative Diversity through Network Coding Based on Classical Coding Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2757","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:e2cd735cf07d3e604f3567ef4022a689a9f8d7cac2de5cf0bd2382bde566cab0","target":"record","created_at":"2026-05-18T04:28:45Z","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":"e520fb9934ae60514ad7d4296fb52412962a87e6121f509e62a438b55793452d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-16T04:36:25Z","title_canon_sha256":"366693a434a1ea181a1e2d7e0773df06eaa0017e6539b5869b2b63263624a112"},"schema_version":"1.0","source":{"id":"1004.2757","kind":"arxiv","version":2}},"canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","first_computed_at":"2026-05-18T04:28:45.688824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:45.688824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXlmOZKkr8bgc147hi6Kq3V97gs7muBVpttEPXGGvlzyoMMkFnZbtT3CTbYeldLIPhH57j+Nvot+dV6XAT4dDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:45.689465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2cd735cf07d3e604f3567ef4022a689a9f8d7cac2de5cf0bd2382bde566cab0","sha256:336ef8a93d691b0e051427c6e8e2a08aa7e7d7ea7969ae8e29234c0afb3baec3"],"state_sha256":"555a7a08df317c5cdc4e2e995ceb95d37dfe9ecbbd64515381e7cf0d8035f43f"}