{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DRH5Z3B5V3ORNF2UTIK2VL4EPV","short_pith_number":"pith:DRH5Z3B5","schema_version":"1.0","canonical_sha256":"1c4fdcec3daedd1697549a15aaaf847d60e4c5bc3871dd7cbd8367344f6fe554","source":{"kind":"arxiv","id":"1306.1632","version":3},"attestation_state":"computed","paper":{"title":"A Generalized Channel Coding Theory for Distributed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo","submitted_at":"2013-06-07T06:49:22Z","abstract_excerpt":"This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each transmitter is chosen arbitrarily in each time slot. The coding choice of a transmitter is denoted by a code index parameter, which is known neither to other transmitters nor to the receiver. Fundamental performance limitation of the system is characterized using an achievable region defined in the space of the code index vectors. As the codeword length is taken to"},"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":"1306.1632","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-07T06:49:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ee7459a18c27ab014002667d58b60c1bbfca515da1ac23a5985b61aa36b2c71","abstract_canon_sha256":"35f2d75cb9094da2ec497d2dc0a97cb6c3aa4158254ef828d31ef33128122b02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.047999Z","signature_b64":"JSjiwKQLsejt3gRfukLZ0bJZVG5+fDPOj3ueVZBeozIete7EnFXxvPypmacSuBAPEQNe0Rk16Pilf1v1jBWLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c4fdcec3daedd1697549a15aaaf847d60e4c5bc3871dd7cbd8367344f6fe554","last_reissued_at":"2026-05-18T00:59:04.047302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.047302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Channel Coding Theory for Distributed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo","submitted_at":"2013-06-07T06:49:22Z","abstract_excerpt":"This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each transmitter is chosen arbitrarily in each time slot. The coding choice of a transmitter is denoted by a code index parameter, which is known neither to other transmitters nor to the receiver. Fundamental performance limitation of the system is characterized using an achievable region defined in the space of the code index vectors. As the codeword length is taken to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1632","kind":"arxiv","version":3},"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":"1306.1632","created_at":"2026-05-18T00:59:04.047424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1632v3","created_at":"2026-05-18T00:59:04.047424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1632","created_at":"2026-05-18T00:59:04.047424+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRH5Z3B5V3OR","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRH5Z3B5V3ORNF2U","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRH5Z3B5","created_at":"2026-05-18T12:27:43.054852+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/DRH5Z3B5V3ORNF2UTIK2VL4EPV","json":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV.json","graph_json":"https://pith.science/api/pith-number/DRH5Z3B5V3ORNF2UTIK2VL4EPV/graph.json","events_json":"https://pith.science/api/pith-number/DRH5Z3B5V3ORNF2UTIK2VL4EPV/events.json","paper":"https://pith.science/paper/DRH5Z3B5"},"agent_actions":{"view_html":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV","download_json":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV.json","view_paper":"https://pith.science/paper/DRH5Z3B5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1632&json=true","fetch_graph":"https://pith.science/api/pith-number/DRH5Z3B5V3ORNF2UTIK2VL4EPV/graph.json","fetch_events":"https://pith.science/api/pith-number/DRH5Z3B5V3ORNF2UTIK2VL4EPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV/action/storage_attestation","attest_author":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV/action/author_attestation","sign_citation":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV/action/citation_signature","submit_replication":"https://pith.science/pith/DRH5Z3B5V3ORNF2UTIK2VL4EPV/action/replication_record"}},"created_at":"2026-05-18T00:59:04.047424+00:00","updated_at":"2026-05-18T00:59:04.047424+00:00"}