{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BHKMQBI7RWXFFHGVV2GF256OQ5","short_pith_number":"pith:BHKMQBI7","canonical_record":{"source":{"id":"1103.0038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-28T22:04:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc2489953c69d790430c252b4c0d7e7a2f5af9c4003df06674764f83ace95bf3","abstract_canon_sha256":"070c8730e88f3b9840b57b0cb25dce64e2663067ac566a3730f7aad0a39772d2"},"schema_version":"1.0"},"canonical_sha256":"09d4c8051f8dae529cd5ae8c5d77ce87693ceed0dafc258ed20fc129eef7eaae","source":{"kind":"arxiv","id":"1103.0038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0038","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0038v2","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0038","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"BHKMQBI7RWXF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BHKMQBI7RWXFFHGV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BHKMQBI7","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BHKMQBI7RWXFFHGVV2GF256OQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-28T22:04:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc2489953c69d790430c252b4c0d7e7a2f5af9c4003df06674764f83ace95bf3","abstract_canon_sha256":"070c8730e88f3b9840b57b0cb25dce64e2663067ac566a3730f7aad0a39772d2"},"schema_version":"1.0"},"canonical_sha256":"09d4c8051f8dae529cd5ae8c5d77ce87693ceed0dafc258ed20fc129eef7eaae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.589139Z","signature_b64":"xJy4fTViWgzFjlIqNLgGRVZWxIgaN7W5cm/3YywFAHyekjWk77bXRbSOtKHlH7XKtce/fgEwAGyz/r5U0vZQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d4c8051f8dae529cd5ae8c5d77ce87693ceed0dafc258ed20fc129eef7eaae","last_reissued_at":"2026-05-18T04:25:37.588544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.588544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0038","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-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9OPoExUnyITSoZa/OfPu2hOXFQdRwqMm+bOJb4W5rfVUwJcWYyrDUKvrZfc4ArE15ejMIIg6Pu/jYSEGKJnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:59.128788Z"},"content_sha256":"15823da9d8648a113f0e4711d23cb5a7b9607ee36915b49fc7956f93349cb9b9","schema_version":"1.0","event_id":"sha256:15823da9d8648a113f0e4711d23cb5a7b9607ee36915b49fc7956f93349cb9b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BHKMQBI7RWXFFHGVV2GF256OQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sum-Capacity with Successive Decoding in Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Chee Wei Tan, Gregory J. Pottie, Suhas N. Diggavi, Yue Zhao","submitted_at":"2011-02-28T22:04:06Z","abstract_excerpt":"In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we find the constrained sum-capacity and its achievable schemes with the minimum number of messages, first in symmetric channels, and then in general asymmetric channels. We show that the constrained sum-capacity oscillates a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0038","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-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMJry5r0L5G34cNcjRS6HhjH1B0e20lS3NPSfdNYRGUyuV+uH570w4JJvLBarEmzKlF06baYNBVbbE3cTbuXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:59.129771Z"},"content_sha256":"ff3af748b74b2bfe2f86d699a7260f653ecb4b1431aaf78a7b39ad539ed8e945","schema_version":"1.0","event_id":"sha256:ff3af748b74b2bfe2f86d699a7260f653ecb4b1431aaf78a7b39ad539ed8e945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/bundle.json","state_url":"https://pith.science/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/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-30T13:27:59Z","links":{"resolver":"https://pith.science/pith/BHKMQBI7RWXFFHGVV2GF256OQ5","bundle":"https://pith.science/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/bundle.json","state":"https://pith.science/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHKMQBI7RWXFFHGVV2GF256OQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BHKMQBI7RWXFFHGVV2GF256OQ5","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":"070c8730e88f3b9840b57b0cb25dce64e2663067ac566a3730f7aad0a39772d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-28T22:04:06Z","title_canon_sha256":"cc2489953c69d790430c252b4c0d7e7a2f5af9c4003df06674764f83ace95bf3"},"schema_version":"1.0","source":{"id":"1103.0038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0038","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0038v2","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0038","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"BHKMQBI7RWXF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BHKMQBI7RWXFFHGV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BHKMQBI7","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:ff3af748b74b2bfe2f86d699a7260f653ecb4b1431aaf78a7b39ad539ed8e945","target":"graph","created_at":"2026-05-18T04:25:37Z","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":"In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce the complementarity conditions that capture the use of Gaussian coding and successive decoding. In the deterministic channel problem, we find the constrained sum-capacity and its achievable schemes with the minimum number of messages, first in symmetric channels, and then in general asymmetric channels. We show that the constrained sum-capacity oscillates a","authors_text":"A. Salman Avestimehr, Chee Wei Tan, Gregory J. Pottie, Suhas N. Diggavi, Yue Zhao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-28T22:04:06Z","title":"On the Sum-Capacity with Successive Decoding in Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0038","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:15823da9d8648a113f0e4711d23cb5a7b9607ee36915b49fc7956f93349cb9b9","target":"record","created_at":"2026-05-18T04:25:37Z","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":"070c8730e88f3b9840b57b0cb25dce64e2663067ac566a3730f7aad0a39772d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-28T22:04:06Z","title_canon_sha256":"cc2489953c69d790430c252b4c0d7e7a2f5af9c4003df06674764f83ace95bf3"},"schema_version":"1.0","source":{"id":"1103.0038","kind":"arxiv","version":2}},"canonical_sha256":"09d4c8051f8dae529cd5ae8c5d77ce87693ceed0dafc258ed20fc129eef7eaae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09d4c8051f8dae529cd5ae8c5d77ce87693ceed0dafc258ed20fc129eef7eaae","first_computed_at":"2026-05-18T04:25:37.588544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:37.588544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJy4fTViWgzFjlIqNLgGRVZWxIgaN7W5cm/3YywFAHyekjWk77bXRbSOtKHlH7XKtce/fgEwAGyz/r5U0vZQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:37.589139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15823da9d8648a113f0e4711d23cb5a7b9607ee36915b49fc7956f93349cb9b9","sha256:ff3af748b74b2bfe2f86d699a7260f653ecb4b1431aaf78a7b39ad539ed8e945"],"state_sha256":"1f3aba72f9ece609bb17fe822ef2aa5327fa18c99c2c0cf686bbd82f77c2a11e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKcNhDhJ2EnET5VKoaAFJdK3DqXFR5t7pJKwv6tPsKvF2R6IK/V/ToGKROeNoQ467B+e8lY7HNbldV+lTzDWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:27:59.134065Z","bundle_sha256":"69bbd30728a651f3189c8d7b8f055d731cd59137a46ab46c9202fa7bb175070c"}}