{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5YF5KYNZP2QP3ORFOMU4HXYO6W","short_pith_number":"pith:5YF5KYNZ","canonical_record":{"source":{"id":"1003.3501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-18T02:45:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2cedcd48223d9062f396aa64e930301612bed1bd6aa90b5a73af62960948cc62","abstract_canon_sha256":"a320cf71da9ac643ef133e6f6110eea90cb60589e17ba8ea24508929cf9b6ece"},"schema_version":"1.0"},"canonical_sha256":"ee0bd561b97ea0fdba257329c3df0ef58a8fc0d7aaf0dd94358bcae974ee50c9","source":{"kind":"arxiv","id":"1003.3501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3501","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3501v2","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3501","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"5YF5KYNZP2QP","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5YF5KYNZP2QP3ORF","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5YF5KYNZ","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5YF5KYNZP2QP3ORFOMU4HXYO6W","target":"record","payload":{"canonical_record":{"source":{"id":"1003.3501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-18T02:45:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2cedcd48223d9062f396aa64e930301612bed1bd6aa90b5a73af62960948cc62","abstract_canon_sha256":"a320cf71da9ac643ef133e6f6110eea90cb60589e17ba8ea24508929cf9b6ece"},"schema_version":"1.0"},"canonical_sha256":"ee0bd561b97ea0fdba257329c3df0ef58a8fc0d7aaf0dd94358bcae974ee50c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:36.772963Z","signature_b64":"VDD/YWiHhZZbE8O7BulJTEri3x9+Z0nKzqImXVM9szYyjcVBKSrFoGdafEU59bAGonBvV4zxSQul1M4LR8tTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee0bd561b97ea0fdba257329c3df0ef58a8fc0d7aaf0dd94358bcae974ee50c9","last_reissued_at":"2026-05-18T02:24:36.772111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:36.772111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.3501","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-18T02:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62O/hbndRSCgqEVOLNzokKvtvTJqfKFmz+YU4QaP716iILBKdaiXmEjGj0UYRj1W29z4CECrgv7AAXpNlHGCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:39:55.306688Z"},"content_sha256":"54c1a20c7091e66d737a94e2462c49edc9ec94966e5a215a31a37d6235743029","schema_version":"1.0","event_id":"sha256:54c1a20c7091e66d737a94e2462c49edc9ec94966e5a215a31a37d6235743029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5YF5KYNZP2QP3ORFOMU4HXYO6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Distributed Network Coding Based on Nonbinary Linear Block Codes for Multi-User Cooperative Communications","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-03-18T02:45:12Z","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 code rate. 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 maximizes the diversity order is recognized as equivalent to the design of linear "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3501","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-18T02:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X597dhlHVyXiTPepeD75fdFS8YwX83Uc4++SjWHPeK18cxJKZwR8iamwvrQ8fD+3KG8OC80Qp4hq/qvj/SLqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:39:55.307356Z"},"content_sha256":"46c80a10f767eb766747e9b0b7f10b158351adc01b7f23bd5fc0df2c14631bac","schema_version":"1.0","event_id":"sha256:46c80a10f767eb766747e9b0b7f10b158351adc01b7f23bd5fc0df2c14631bac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/bundle.json","state_url":"https://pith.science/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/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-26T00:39:55Z","links":{"resolver":"https://pith.science/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W","bundle":"https://pith.science/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/bundle.json","state":"https://pith.science/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YF5KYNZP2QP3ORFOMU4HXYO6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5YF5KYNZP2QP3ORFOMU4HXYO6W","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":"a320cf71da9ac643ef133e6f6110eea90cb60589e17ba8ea24508929cf9b6ece","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-18T02:45:12Z","title_canon_sha256":"2cedcd48223d9062f396aa64e930301612bed1bd6aa90b5a73af62960948cc62"},"schema_version":"1.0","source":{"id":"1003.3501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3501","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3501v2","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3501","created_at":"2026-05-18T02:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"5YF5KYNZP2QP","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5YF5KYNZP2QP3ORF","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5YF5KYNZ","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:46c80a10f767eb766747e9b0b7f10b158351adc01b7f23bd5fc0df2c14631bac","target":"graph","created_at":"2026-05-18T02:24:36Z","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 code rate. 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 maximizes the diversity order is recognized as equivalent to the design of linear ","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-03-18T02:45:12Z","title":"Generalized Distributed Network Coding Based on Nonbinary Linear Block Codes for Multi-User Cooperative Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3501","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:54c1a20c7091e66d737a94e2462c49edc9ec94966e5a215a31a37d6235743029","target":"record","created_at":"2026-05-18T02:24:36Z","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":"a320cf71da9ac643ef133e6f6110eea90cb60589e17ba8ea24508929cf9b6ece","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-18T02:45:12Z","title_canon_sha256":"2cedcd48223d9062f396aa64e930301612bed1bd6aa90b5a73af62960948cc62"},"schema_version":"1.0","source":{"id":"1003.3501","kind":"arxiv","version":2}},"canonical_sha256":"ee0bd561b97ea0fdba257329c3df0ef58a8fc0d7aaf0dd94358bcae974ee50c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee0bd561b97ea0fdba257329c3df0ef58a8fc0d7aaf0dd94358bcae974ee50c9","first_computed_at":"2026-05-18T02:24:36.772111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:36.772111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VDD/YWiHhZZbE8O7BulJTEri3x9+Z0nKzqImXVM9szYyjcVBKSrFoGdafEU59bAGonBvV4zxSQul1M4LR8tTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:36.772963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.3501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54c1a20c7091e66d737a94e2462c49edc9ec94966e5a215a31a37d6235743029","sha256:46c80a10f767eb766747e9b0b7f10b158351adc01b7f23bd5fc0df2c14631bac"],"state_sha256":"972385f1c5e44acab2d401ae28493680035cec6f722a9aaf38f4f254d62a7921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TFwwSKTq+zn+ms8EKwE6pwou1d3WShdDciMeuDy8eGPj3lVYmhZ5zqt4m/EgQsldkGc9kQ7DugtSH9nejy6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:39:55.310686Z","bundle_sha256":"d65716684bdeef3c959ab01ce439df2a00a8cb7e91ddb8a6025191d3d73edd8e"}}