{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:QMBLEMPAH5SGYI3G3QHFCVXC6Z","short_pith_number":"pith:QMBLEMPA","canonical_record":{"source":{"id":"0804.4866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-30T16:51:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f03a9e8cb46bc4ef35a906f0dee75d38ca9a6b70f7f6c5059ec018df21cbb4a1","abstract_canon_sha256":"805cd12e7610069fc1bb6cfadb380f8cd1e4a6843007db3316de0c2077f02731"},"schema_version":"1.0"},"canonical_sha256":"8302b231e03f646c2366dc0e5156e2f66567bbaa755d2192ed3d07f0a912c635","source":{"kind":"arxiv","id":"0804.4866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4866","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4866v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4866","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"QMBLEMPAH5SG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMBLEMPAH5SGYI3G","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMBLEMPA","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:QMBLEMPAH5SGYI3G3QHFCVXC6Z","target":"record","payload":{"canonical_record":{"source":{"id":"0804.4866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-30T16:51:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f03a9e8cb46bc4ef35a906f0dee75d38ca9a6b70f7f6c5059ec018df21cbb4a1","abstract_canon_sha256":"805cd12e7610069fc1bb6cfadb380f8cd1e4a6843007db3316de0c2077f02731"},"schema_version":"1.0"},"canonical_sha256":"8302b231e03f646c2366dc0e5156e2f66567bbaa755d2192ed3d07f0a912c635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.813691Z","signature_b64":"VBgVfTtqcrZAK6Q59I1AjcSpO5iz3uU8od/dfB0vNGyzOachb5k+Nb+HRF2+jOAUlhI51qsGw1NHv/78nS0zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8302b231e03f646c2366dc0e5156e2f66567bbaa755d2192ed3d07f0a912c635","last_reissued_at":"2026-05-18T00:59:11.813127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.813127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.4866","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-05-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mH9Amd0p1z3n8FVFSz68EhR9aZkm89Iny82MfqSz3QrIWB/8Eyj/P0OVRzHBPzC7WE8vg/KSDZ6hN0BYnbhlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:13:37.135970Z"},"content_sha256":"b3007453081fe38175b4b8eb7e6f2989814a5926f53645c9dec37eefbae605cf","schema_version":"1.0","event_id":"sha256:b3007453081fe38175b4b8eb7e6f2989814a5926f53645c9dec37eefbae605cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:QMBLEMPAH5SGYI3G3QHFCVXC6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, H. Vincent Poor, Lalitha Sankar","submitted_at":"2008-04-30T16:51:55Z","abstract_excerpt":"The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4866","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":""},"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oi4ymGIEoLsQaFIdxkM8T9jBTs7EDnG2Z8TH/VqPDbq79LZlKIo7SLw2dAjQeEdN2ssDQXdDaCi1ADWsEb6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:13:37.136310Z"},"content_sha256":"014d0397fbf1679bb92bc9cadd9bb2346f0293ccfea4114aff67506f74c1d75a","schema_version":"1.0","event_id":"sha256:014d0397fbf1679bb92bc9cadd9bb2346f0293ccfea4114aff67506f74c1d75a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/bundle.json","state_url":"https://pith.science/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/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-10T22:13:37Z","links":{"resolver":"https://pith.science/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z","bundle":"https://pith.science/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/bundle.json","state":"https://pith.science/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMBLEMPAH5SGYI3G3QHFCVXC6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:QMBLEMPAH5SGYI3G3QHFCVXC6Z","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":"805cd12e7610069fc1bb6cfadb380f8cd1e4a6843007db3316de0c2077f02731","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-30T16:51:55Z","title_canon_sha256":"f03a9e8cb46bc4ef35a906f0dee75d38ca9a6b70f7f6c5059ec018df21cbb4a1"},"schema_version":"1.0","source":{"id":"0804.4866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4866","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4866v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4866","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"QMBLEMPAH5SG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMBLEMPAH5SGYI3G","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMBLEMPA","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:014d0397fbf1679bb92bc9cadd9bb2346f0293ccfea4114aff67506f74c1d75a","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions de","authors_text":"Elza Erkip, H. Vincent Poor, Lalitha Sankar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-30T16:51:55Z","title":"Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4866","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:b3007453081fe38175b4b8eb7e6f2989814a5926f53645c9dec37eefbae605cf","target":"record","created_at":"2026-05-18T00:59:11Z","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":"805cd12e7610069fc1bb6cfadb380f8cd1e4a6843007db3316de0c2077f02731","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-30T16:51:55Z","title_canon_sha256":"f03a9e8cb46bc4ef35a906f0dee75d38ca9a6b70f7f6c5059ec018df21cbb4a1"},"schema_version":"1.0","source":{"id":"0804.4866","kind":"arxiv","version":1}},"canonical_sha256":"8302b231e03f646c2366dc0e5156e2f66567bbaa755d2192ed3d07f0a912c635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8302b231e03f646c2366dc0e5156e2f66567bbaa755d2192ed3d07f0a912c635","first_computed_at":"2026-05-18T00:59:11.813127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.813127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VBgVfTtqcrZAK6Q59I1AjcSpO5iz3uU8od/dfB0vNGyzOachb5k+Nb+HRF2+jOAUlhI51qsGw1NHv/78nS0zBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.813691Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.4866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3007453081fe38175b4b8eb7e6f2989814a5926f53645c9dec37eefbae605cf","sha256:014d0397fbf1679bb92bc9cadd9bb2346f0293ccfea4114aff67506f74c1d75a"],"state_sha256":"9566f9538751324371ae7468a42e102efb99855f2b4ce342a6adb91dec7b3a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqb6/YP0CyF8CzkyMIIlY/TVLUjQ5qJ1ogfe8UahNb6pQnjKeyPA06LbqKIp6xx7I/nQPWzjIZcBWYEQokM4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:13:37.138367Z","bundle_sha256":"dab04e83fd153e3917c6bf195ed3bcac76f3de7f401dca12e5b5281a81491912"}}