{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:HFPIEIDYMCZJJ5ER6VTVOEUG47","short_pith_number":"pith:HFPIEIDY","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"},"canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","source":{"kind":"arxiv","id":"cs/0511096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511096","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511096v1","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511096","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFPIEIDYMCZJ","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"HFPIEIDYMCZJJ5ER","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"HFPIEIDY","created_at":"2026-07-04T15:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:HFPIEIDYMCZJJ5ER6VTVOEUG47","target":"record","payload":{"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"},"canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","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"},"source_kind":"arxiv","source_id":"cs/0511096","source_version":1,"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6CnxLDUSvOye8ME8ZOHQEUkDbp5rdo62x8ZgSkDHqQsd6baq6bJhjinHU7LuZiehvX1adt02M0MBx1PVL7rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:43:08.817321Z"},"content_sha256":"a0c40610d1364b40822024e7de491f83420d31ddf77be0a63373cc35a60de4f1","schema_version":"1.0","event_id":"sha256:a0c40610d1364b40822024e7de491f83420d31ddf77be0a63373cc35a60de4f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:HFPIEIDYMCZJJ5ER6VTVOEUG47","target":"graph","payload":{"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"},"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CV7VEW6uDp4dCdR18FYJ7qpl4Pm3hhVW6+E5CiPencAmDejTNgimpt2DhaE7msHql9S3jCSCfonCS2B7/UmXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:43:08.817676Z"},"content_sha256":"536e469f4aed5e261292e871f85a81da21382222a34ec44ac3a6966ce2f75913","schema_version":"1.0","event_id":"sha256:536e469f4aed5e261292e871f85a81da21382222a34ec44ac3a6966ce2f75913"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/bundle.json","state_url":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/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-08-05T16:43:08Z","links":{"resolver":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47","bundle":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/bundle.json","state":"https://pith.science/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFPIEIDYMCZJJ5ER6VTVOEUG47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:HFPIEIDYMCZJJ5ER6VTVOEUG47","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":"af1d0d9402066be5f51d0aefffbef5362c19bc241d951a71268f1d416e1998cc","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-28T18:37:55Z","title_canon_sha256":"513c654a9656256d64b7579634bf87f2083d4036167dc39ef6c4daa828e775fc"},"schema_version":"1.0","source":{"id":"cs/0511096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511096","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511096v1","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511096","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFPIEIDYMCZJ","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"HFPIEIDYMCZJJ5ER","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"HFPIEIDY","created_at":"2026-07-04T15:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:536e469f4aed5e261292e871f85a81da21382222a34ec44ac3a6966ce2f75913","target":"graph","created_at":"2026-07-04T15:03:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0511096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"S. Ulukus, W. Kang","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-11-28T18:37:55Z","title":"A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511096","kind":"arxiv","version":1},"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:a0c40610d1364b40822024e7de491f83420d31ddf77be0a63373cc35a60de4f1","target":"record","created_at":"2026-07-04T15:03:00Z","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":"af1d0d9402066be5f51d0aefffbef5362c19bc241d951a71268f1d416e1998cc","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-28T18:37:55Z","title_canon_sha256":"513c654a9656256d64b7579634bf87f2083d4036167dc39ef6c4daa828e775fc"},"schema_version":"1.0","source":{"id":"cs/0511096","kind":"arxiv","version":1}},"canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"395e82207860b294f491f567571286e7f05ab2acfe852970e2a5bdb93594ffb6","first_computed_at":"2026-07-04T15:03:00.927806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:00.927806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RyICTyQz/vcIOdY47E3YSJEw+KDSgzSol+mpbFy305Z1enFbF0ePNxcYO2aRByPOl+9R/GiW3zScNm7TFF8kBw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:00.928198Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0511096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0c40610d1364b40822024e7de491f83420d31ddf77be0a63373cc35a60de4f1","sha256:536e469f4aed5e261292e871f85a81da21382222a34ec44ac3a6966ce2f75913"],"state_sha256":"c1adab31e7c238d07668317368a2ca97a8dbcc96cdf720d956fd1bfeaf1f7ac9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clqDpgSEy/2w96gs/49ZqxA1zORlkF9ftqbcnhDvONooB/YhJrw0k9a5MOayWjrx3NUrl868UXCy0hWo+B6jBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T16:43:08.868183Z","bundle_sha256":"a092b78292ccc9e3631e6f5b15f6594b465e82474c5ad032c157aee4f3308514"}}