{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:HFPIEIDYMCZJJ5ER6VTVOEUG47","short_pith_number":"pith:HFPIEIDY","schema_version":"1.0","canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","source":{"kind":"arxiv","id":"cs/0511096","version":1},"attestation_state":"computed","paper":{"title":"A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"S. Ulukus, W. Kang","submitted_at":"2005-11-28T18:37:55Z","abstract_excerpt":"The capacity region of the multiple access channel with arbitrarily correlated sources remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the form of single-letter entropy and mutual information expressions, without a single-letter converse. Cover, El Gamal and Salehi also gave a converse in terms of some n-letter mutual informations, which are incomputable. In this paper, we derive an upper bound for the sum rate of this channel in a single-letter expression by using spectrum analysis. The incomputability of the sum rate of Cover, El Gamal and Salehi scheme comes"},"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/0511096","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-28T18:37:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"513c654a9656256d64b7579634bf87f2083d4036167dc39ef6c4daa828e775fc","abstract_canon_sha256":"af1d0d9402066be5f51d0aefffbef5362c19bc241d951a71268f1d416e1998cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:00.928198Z","signature_b64":"RyICTyQz/vcIOdY47E3YSJEw+KDSgzSol+mpbFy305Z1enFbF0ePNxcYO2aRByPOl+9R/GiW3zScNm7TFF8kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","last_reissued_at":"2026-07-04T15:03:00.927806Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:00.927806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"S. Ulukus, W. Kang","submitted_at":"2005-11-28T18:37:55Z","abstract_excerpt":"The capacity region of the multiple access channel with arbitrarily correlated sources remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the form of single-letter entropy and mutual information expressions, without a single-letter converse. Cover, El Gamal and Salehi also gave a converse in terms of some n-letter mutual informations, which are incomputable. In this paper, we derive an upper bound for the sum rate of this channel in a single-letter expression by using spectrum analysis. The incomputability of the sum rate of Cover, El Gamal and Salehi scheme comes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511096","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0511096/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/0511096","created_at":"2026-07-04T15:03:00.927868+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0511096v1","created_at":"2026-07-04T15:03:00.927868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511096","created_at":"2026-07-04T15:03:00.927868+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFPIEIDYMCZJ","created_at":"2026-07-04T15:03:00.927868+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFPIEIDYMCZJJ5ER","created_at":"2026-07-04T15:03:00.927868+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFPIEIDY","created_at":"2026-07-04T15:03:00.927868+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/HFPIEIDYMCZJJ5ER6VTVOEUG47","json":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47.json","graph_json":"https://pith.science/api/pith-number/HFPIEIDYMCZJJ5ER6VTVOEUG47/graph.json","events_json":"https://pith.science/api/pith-number/HFPIEIDYMCZJJ5ER6VTVOEUG47/events.json","paper":"https://pith.science/paper/HFPIEIDY"},"agent_actions":{"view_html":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47","download_json":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47.json","view_paper":"https://pith.science/paper/HFPIEIDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0511096&json=true","fetch_graph":"https://pith.science/api/pith-number/HFPIEIDYMCZJJ5ER6VTVOEUG47/graph.json","fetch_events":"https://pith.science/api/pith-number/HFPIEIDYMCZJJ5ER6VTVOEUG47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/action/storage_attestation","attest_author":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/action/author_attestation","sign_citation":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/action/citation_signature","submit_replication":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/action/replication_record"}},"created_at":"2026-07-04T15:03:00.927868+00:00","updated_at":"2026-07-04T15:03:00.927868+00:00"}