{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4VLAXEWZH3JLMFRPDIZZTWGOOF","short_pith_number":"pith:4VLAXEWZ","schema_version":"1.0","canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","source":{"kind":"arxiv","id":"cs/0605041","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund M. Yeh, Jian Cao","submitted_at":"2006-05-09T14:32:51Z","abstract_excerpt":"We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the optimal rates allowed by information theory in a distributed manner. In this scheme, each real user creates a number of virtual users via a power/rate splitting mechanism in the M-user Gaussian channel or via a random switching mechanism in the M-user discrete memoryless channel. At the receiver, all virtual users are successively decoded. Compared with other mu"},"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":"cs/0605041","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-09T14:32:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b864e5598bb1a80483cdf40157813a669ddf8aacd426bd6c30af5e926438a16e","abstract_canon_sha256":"5423cefeb198f918f03ea12d2e5ebc315e65d890805eae9b395c5a9b75df11cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.030483Z","signature_b64":"MnNprzKLdi0xveItOyJ9HjxvM43na/0NPieltLl/o9zhyBEV0MRgVyq4iQ2PkU78HJRJTkF/gOZ1nQIpwXnKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","last_reissued_at":"2026-05-18T00:57:45.029902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.029902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund M. Yeh, Jian Cao","submitted_at":"2006-05-09T14:32:51Z","abstract_excerpt":"We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the optimal rates allowed by information theory in a distributed manner. In this scheme, each real user creates a number of virtual users via a power/rate splitting mechanism in the M-user Gaussian channel or via a random switching mechanism in the M-user discrete memoryless channel. At the receiver, all virtual users are successively decoded. Compared with other mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605041","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":"cs/0605041","created_at":"2026-05-18T00:57:45.029975+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0605041v2","created_at":"2026-05-18T00:57:45.029975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605041","created_at":"2026-05-18T00:57:45.029975+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VLAXEWZH3JL","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VLAXEWZH3JLMFRP","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VLAXEWZ","created_at":"2026-05-18T12:25:53.939244+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/4VLAXEWZH3JLMFRPDIZZTWGOOF","json":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF.json","graph_json":"https://pith.science/api/pith-number/4VLAXEWZH3JLMFRPDIZZTWGOOF/graph.json","events_json":"https://pith.science/api/pith-number/4VLAXEWZH3JLMFRPDIZZTWGOOF/events.json","paper":"https://pith.science/paper/4VLAXEWZ"},"agent_actions":{"view_html":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF","download_json":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF.json","view_paper":"https://pith.science/paper/4VLAXEWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0605041&json=true","fetch_graph":"https://pith.science/api/pith-number/4VLAXEWZH3JLMFRPDIZZTWGOOF/graph.json","fetch_events":"https://pith.science/api/pith-number/4VLAXEWZH3JLMFRPDIZZTWGOOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/action/storage_attestation","attest_author":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/action/author_attestation","sign_citation":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/action/citation_signature","submit_replication":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/action/replication_record"}},"created_at":"2026-05-18T00:57:45.029975+00:00","updated_at":"2026-05-18T00:57:45.029975+00:00"}