{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4RRBT7Y6FL2VE4D3A5ROD2GUVC","short_pith_number":"pith:4RRBT7Y6","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"},"canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","source":{"kind":"arxiv","id":"1004.2757","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4RRBT7Y6FL2VE4D3A5ROD2GUVC","target":"record","payload":{"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"},"canonical_sha256":"e46219ff1e2af552707b0762e1e8d4a8b785a172d3e3ce6fc86ed6ea2892fc7b","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"},"source_kind":"arxiv","source_id":"1004.2757","source_version":2,"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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuiEMvd2dKNb2fT8AK8FgApPFpNa15lfUdgNDAwUAd6ATIWjV3hWP9WbB0/XaEs9QaDkYWoISA85g6NbjYjaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:29.500810Z"},"content_sha256":"e2cd735cf07d3e604f3567ef4022a689a9f8d7cac2de5cf0bd2382bde566cab0","schema_version":"1.0","event_id":"sha256:e2cd735cf07d3e604f3567ef4022a689a9f8d7cac2de5cf0bd2382bde566cab0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4RRBT7Y6FL2VE4D3A5ROD2GUVC","target":"graph","payload":{"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"},"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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ms7mES6mlsGav4bDKTssLZChIdVMlUhihguQxM3+Ubics0FkYIquMMKlXytjNNElG08SdNPzqnn/wfvP0w1fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:29.501485Z"},"content_sha256":"336ef8a93d691b0e051427c6e8e2a08aa7e7d7ea7969ae8e29234c0afb3baec3","schema_version":"1.0","event_id":"sha256:336ef8a93d691b0e051427c6e8e2a08aa7e7d7ea7969ae8e29234c0afb3baec3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/bundle.json","state_url":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/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-05-25T18:17:29Z","links":{"resolver":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC","bundle":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/bundle.json","state":"https://pith.science/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RRBT7Y6FL2VE4D3A5ROD2GUVC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPVw/PpV0+NOXKR8BO/8n+opG9TbKBFIzdLenXgRlAUx2bmMRPRzoIIhEdrirCtu3ArHiyiqSYvzHxKAmK3EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:17:29.505365Z","bundle_sha256":"036132a890d459612e1d62a2790d6345c1490d17320d1b87ddbc58903103fd5b"}}