{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:4VLAXEWZH3JLMFRPDIZZTWGOOF","short_pith_number":"pith:4VLAXEWZ","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"},"canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","source":{"kind":"arxiv","id":"cs/0605041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605041","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605041v2","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605041","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"4VLAXEWZH3JL","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"4VLAXEWZH3JLMFRP","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"4VLAXEWZ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:4VLAXEWZH3JLMFRPDIZZTWGOOF","target":"record","payload":{"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"},"canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","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"},"source_kind":"arxiv","source_id":"cs/0605041","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-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vaWNf1nJTWPOsc9hE4JkVOjsrR4XKK8egfB5r8LHmZm3uvTcePbqAwzOYwePT4SS39ye8knRosqaiwUVQeOkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:06:50.336161Z"},"content_sha256":"3fcf36c0bacaf58a6ea4d3c6107d978459315a096d4887f0608a69b4077746ce","schema_version":"1.0","event_id":"sha256:3fcf36c0bacaf58a6ea4d3c6107d978459315a096d4887f0608a69b4077746ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:4VLAXEWZH3JLMFRPDIZZTWGOOF","target":"graph","payload":{"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"},"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-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lioTedlGC4O5IbDBT/yFQPVNu9VrNsCSf+VIqHaQBC2Sz62araibl4gvOxOIEMUhNB+W8RWbzcZkSNljshFRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:06:50.336942Z"},"content_sha256":"1fb9676cd35739a825a2a91477b95171975cdf5298281eba1c086b78ac1db9e5","schema_version":"1.0","event_id":"sha256:1fb9676cd35739a825a2a91477b95171975cdf5298281eba1c086b78ac1db9e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/bundle.json","state_url":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/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-06-08T19:06:50Z","links":{"resolver":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF","bundle":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/bundle.json","state":"https://pith.science/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VLAXEWZH3JLMFRPDIZZTWGOOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:4VLAXEWZH3JLMFRPDIZZTWGOOF","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":"5423cefeb198f918f03ea12d2e5ebc315e65d890805eae9b395c5a9b75df11cf","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-09T14:32:51Z","title_canon_sha256":"b864e5598bb1a80483cdf40157813a669ddf8aacd426bd6c30af5e926438a16e"},"schema_version":"1.0","source":{"id":"cs/0605041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605041","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605041v2","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605041","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"4VLAXEWZH3JL","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"4VLAXEWZH3JLMFRP","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"4VLAXEWZ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:1fb9676cd35739a825a2a91477b95171975cdf5298281eba1c086b78ac1db9e5","target":"graph","created_at":"2026-05-18T00:57: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":"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","authors_text":"Edmund M. Yeh, Jian Cao","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-05-09T14:32:51Z","title":"Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605041","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:3fcf36c0bacaf58a6ea4d3c6107d978459315a096d4887f0608a69b4077746ce","target":"record","created_at":"2026-05-18T00:57: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":"5423cefeb198f918f03ea12d2e5ebc315e65d890805eae9b395c5a9b75df11cf","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-09T14:32:51Z","title_canon_sha256":"b864e5598bb1a80483cdf40157813a669ddf8aacd426bd6c30af5e926438a16e"},"schema_version":"1.0","source":{"id":"cs/0605041","kind":"arxiv","version":2}},"canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5560b92d93ed2b6162f1a3399d8ce7168bb95377ef0b9293e61ebfcb10ff7fe","first_computed_at":"2026-05-18T00:57:45.029902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:45.029902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnNprzKLdi0xveItOyJ9HjxvM43na/0NPieltLl/o9zhyBEV0MRgVyq4iQ2PkU78HJRJTkF/gOZ1nQIpwXnKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:45.030483Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fcf36c0bacaf58a6ea4d3c6107d978459315a096d4887f0608a69b4077746ce","sha256:1fb9676cd35739a825a2a91477b95171975cdf5298281eba1c086b78ac1db9e5"],"state_sha256":"415f398f5f455441cf5c0dd4d8498b9aa753406111f3b1fd870bd06d0d2d6181"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3iYtRPiHL2e6sXFloNKi3SiTY8b9Zdw4C5MwkLuagp4OC0ObwYRemPMN+42Z96H5pAkcLtiBvaGwkcbpUzDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:06:50.340599Z","bundle_sha256":"7e9efbd16c265f919d36dbe376b259ec9ae2a2cb2c55cc49cbf7c7b586b5e458"}}