{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4RRBT7Y6FL2VE4D3A5ROD2GUVC","short_pith_number":"pith:4RRBT7Y6","schema_version":"1.0","canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","source":{"kind":"arxiv","id":"1004.2757","version":2},"attestation_state":"computed","paper":{"title":"Multi-User Cooperative Diversity through Network Coding Based on Classical Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Branka Vucetic, Jo\\~ao Luiz Rebelatto, Yonghui Li","submitted_at":"2010-04-16T04:36:25Z","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"},"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":"1004.2757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-16T04:36:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"366693a434a1ea181a1e2d7e0773df06eaa0017e6539b5869b2b63263624a112","abstract_canon_sha256":"e520fb9934ae60514ad7d4296fb52412962a87e6121f509e62a438b55793452d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:45.689465Z","signature_b64":"BXlmOZKkr8bgc147hi6Kq3V97gs7muBVpttEPXGGvlzyoMMkFnZbtT3CTbYeldLIPhH57j+Nvot+dV6XAT4dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","last_reissued_at":"2026-05-18T04:28:45.688824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:45.688824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-User Cooperative Diversity through Network Coding Based on Classical Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Branka Vucetic, Jo\\~ao Luiz Rebelatto, Yonghui Li","submitted_at":"2010-04-16T04:36:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2757","kind":"arxiv","version":2},"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":"1004.2757","created_at":"2026-05-18T04:28:45.688899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2757v2","created_at":"2026-05-18T04:28:45.688899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2757","created_at":"2026-05-18T04:28:45.688899+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RRBT7Y6FL2V","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RRBT7Y6FL2VE4D3","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RRBT7Y6","created_at":"2026-05-18T12:26:04.259169+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/4RRBT7Y6FL2VE4D3A5ROD2GUVC","json":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC.json","graph_json":"https://pith.science/api/pith-number/4RRBT7Y6FL2VE4D3A5ROD2GUVC/graph.json","events_json":"https://pith.science/api/pith-number/4RRBT7Y6FL2VE4D3A5ROD2GUVC/events.json","paper":"https://pith.science/paper/4RRBT7Y6"},"agent_actions":{"view_html":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC","download_json":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC.json","view_paper":"https://pith.science/paper/4RRBT7Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2757&json=true","fetch_graph":"https://pith.science/api/pith-number/4RRBT7Y6FL2VE4D3A5ROD2GUVC/graph.json","fetch_events":"https://pith.science/api/pith-number/4RRBT7Y6FL2VE4D3A5ROD2GUVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/action/storage_attestation","attest_author":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/action/author_attestation","sign_citation":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/action/citation_signature","submit_replication":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/action/replication_record"}},"created_at":"2026-05-18T04:28:45.688899+00:00","updated_at":"2026-05-18T04:28:45.688899+00:00"}