{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7XITYZBXWY4LWLITSFM2J7SUOD","short_pith_number":"pith:7XITYZBX","canonical_record":{"source":{"id":"1010.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T15:48:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd706821c280c631d1c6a5b89563fb051ea13792a5fd6013119ec1252652f438","abstract_canon_sha256":"7adee83b8d27ba204ffc84bb0dcd3ed05b6c90141f7d6f3ed0773ee9f7499afc"},"schema_version":"1.0"},"canonical_sha256":"fdd13c6437b638bb2d139159a4fe5470de25cacb292553041b863011c405f80e","source":{"kind":"arxiv","id":"1010.6255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6255","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6255v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6255","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"7XITYZBXWY4L","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7XITYZBXWY4LWLIT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7XITYZBX","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7XITYZBXWY4LWLITSFM2J7SUOD","target":"record","payload":{"canonical_record":{"source":{"id":"1010.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T15:48:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd706821c280c631d1c6a5b89563fb051ea13792a5fd6013119ec1252652f438","abstract_canon_sha256":"7adee83b8d27ba204ffc84bb0dcd3ed05b6c90141f7d6f3ed0773ee9f7499afc"},"schema_version":"1.0"},"canonical_sha256":"fdd13c6437b638bb2d139159a4fe5470de25cacb292553041b863011c405f80e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:07.228016Z","signature_b64":"d59nqUbs4eGh5uFXirNKvLS5YvVlol8F1XJWGlRRv7JV2a16Orsz7i5m/x8B7CT16bO7T0HDyF+GhT59ZSRVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd13c6437b638bb2d139159a4fe5470de25cacb292553041b863011c405f80e","last_reissued_at":"2026-05-18T04:38:07.227566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:07.227566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.6255","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-18T04:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpWKRL7aFBEWfcXNogsLXkl9LUrveyx/21ap3Ui8dJloTbwLvtztJB179gSxs9mnLiiJPVGx4rTP2/+rilHlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:29:30.686301Z"},"content_sha256":"78a24e1f1608ebdf81f3b63e05931e030fe8b12340ca7b9f9397c7812c1e2a5b","schema_version":"1.0","event_id":"sha256:78a24e1f1608ebdf81f3b63e05931e030fe8b12340ca7b9f9397c7812c1e2a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7XITYZBXWY4LWLITSFM2J7SUOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of the 2-user Gaussian MAC Interfering with a P2P Link","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anas Chaaban, Aydin Sezgin","submitted_at":"2010-10-29T15:48:32Z","abstract_excerpt":"A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases. These cases are mainly when interference is strong or very strong. A sum capacity upper bound is also obtained, which is nearly tight if the interference power at the receivers is low. In this case, using Gaussian codes and treating interference as noise achieves a sum rate close to the upper bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6255","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-18T04:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw0G2hPb8POeVbXhKXDmTH1j7vpNit8ZPbQWf8EDZkjs+51qDmUTcm6zDC+tzNt71KSn9H0bkF/kYdlAC+AUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:29:30.686744Z"},"content_sha256":"d654d07a0088979620e7ef20086602c708c610f073ff730faf7c69b54276182a","schema_version":"1.0","event_id":"sha256:d654d07a0088979620e7ef20086602c708c610f073ff730faf7c69b54276182a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XITYZBXWY4LWLITSFM2J7SUOD/bundle.json","state_url":"https://pith.science/pith/7XITYZBXWY4LWLITSFM2J7SUOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XITYZBXWY4LWLITSFM2J7SUOD/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-05-25T20:29:30Z","links":{"resolver":"https://pith.science/pith/7XITYZBXWY4LWLITSFM2J7SUOD","bundle":"https://pith.science/pith/7XITYZBXWY4LWLITSFM2J7SUOD/bundle.json","state":"https://pith.science/pith/7XITYZBXWY4LWLITSFM2J7SUOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XITYZBXWY4LWLITSFM2J7SUOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7XITYZBXWY4LWLITSFM2J7SUOD","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":"7adee83b8d27ba204ffc84bb0dcd3ed05b6c90141f7d6f3ed0773ee9f7499afc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T15:48:32Z","title_canon_sha256":"fd706821c280c631d1c6a5b89563fb051ea13792a5fd6013119ec1252652f438"},"schema_version":"1.0","source":{"id":"1010.6255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6255","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6255v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6255","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"7XITYZBXWY4L","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7XITYZBXWY4LWLIT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7XITYZBX","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:d654d07a0088979620e7ef20086602c708c610f073ff730faf7c69b54276182a","target":"graph","created_at":"2026-05-18T04:38:07Z","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":"A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases. These cases are mainly when interference is strong or very strong. A sum capacity upper bound is also obtained, which is nearly tight if the interference power at the receivers is low. In this case, using Gaussian codes and treating interference as noise achieves a sum rate close to the upper bound.","authors_text":"Anas Chaaban, Aydin Sezgin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T15:48:32Z","title":"On the Capacity of the 2-user Gaussian MAC Interfering with a P2P Link"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6255","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:78a24e1f1608ebdf81f3b63e05931e030fe8b12340ca7b9f9397c7812c1e2a5b","target":"record","created_at":"2026-05-18T04:38:07Z","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":"7adee83b8d27ba204ffc84bb0dcd3ed05b6c90141f7d6f3ed0773ee9f7499afc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T15:48:32Z","title_canon_sha256":"fd706821c280c631d1c6a5b89563fb051ea13792a5fd6013119ec1252652f438"},"schema_version":"1.0","source":{"id":"1010.6255","kind":"arxiv","version":1}},"canonical_sha256":"fdd13c6437b638bb2d139159a4fe5470de25cacb292553041b863011c405f80e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdd13c6437b638bb2d139159a4fe5470de25cacb292553041b863011c405f80e","first_computed_at":"2026-05-18T04:38:07.227566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:07.227566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d59nqUbs4eGh5uFXirNKvLS5YvVlol8F1XJWGlRRv7JV2a16Orsz7i5m/x8B7CT16bO7T0HDyF+GhT59ZSRVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:07.228016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78a24e1f1608ebdf81f3b63e05931e030fe8b12340ca7b9f9397c7812c1e2a5b","sha256:d654d07a0088979620e7ef20086602c708c610f073ff730faf7c69b54276182a"],"state_sha256":"3f04b6db5f74cb5d33a2a8d03896a70e379a1db0786c3c9728c6d60a4667edee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5EtAL57Ne5Ca2h2cpTErjrhXdzHA6WDEXFnea3CIYqFJAhEEAx6OSYsYkKqGquQhh5VWhFMp/MQwpLebYOFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:29:30.690000Z","bundle_sha256":"91998048563d1ebd59b87846524396e0694210b5d4c7d11efa4d166b407fd0ff"}}