{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:PP3LRKJVPKTMHFFVVSM2LXR2CK","short_pith_number":"pith:PP3LRKJV","schema_version":"1.0","canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","source":{"kind":"arxiv","id":"0907.2702","version":2},"attestation_state":"computed","paper":{"title":"Interference Channels with Destination Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pramod Viswanath, Vinod M. Prabhakaran","submitted_at":"2009-07-15T20:52:46Z","abstract_excerpt":"Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum-capacity of this channel is characterized up to a constant number of bits. The coding scheme employed builds up on the superposition scheme of Han and Kobayashi (1981) for two-user interference channels without cooperation. New upperbounds to the sum-capacity are also derived."},"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":"0907.2702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-15T20:52:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46df29fb63723f58bb42d2fa6373fb015b60bb96c910c35281e1ed5b392183bb","abstract_canon_sha256":"3aeba09c71c0c1ca8c35c273a2cb6dcc7734d52d6f1839d4e416ff2bbe3e2098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:37.008583Z","signature_b64":"ZL5JXF4DcI6ySbTimHYA3UcgIDHtZ5mN9vNiIyWKrFe3IA2G/5lsAqJfzr/s9Ks6xYGL6haNvsVI6ltpLp6+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","last_reissued_at":"2026-05-18T04:30:37.007799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:37.007799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Channels with Destination Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pramod Viswanath, Vinod M. Prabhakaran","submitted_at":"2009-07-15T20:52:46Z","abstract_excerpt":"Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum-capacity of this channel is characterized up to a constant number of bits. The coding scheme employed builds up on the superposition scheme of Han and Kobayashi (1981) for two-user interference channels without cooperation. New upperbounds to the sum-capacity are also derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2702","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0907.2702","created_at":"2026-05-18T04:30:37.007923+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.2702v2","created_at":"2026-05-18T04:30:37.007923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2702","created_at":"2026-05-18T04:30:37.007923+00:00"},{"alias_kind":"pith_short_12","alias_value":"PP3LRKJVPKTM","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PP3LRKJVPKTMHFFV","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PP3LRKJV","created_at":"2026-05-18T12:26:01.383474+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/PP3LRKJVPKTMHFFVVSM2LXR2CK","json":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK.json","graph_json":"https://pith.science/api/pith-number/PP3LRKJVPKTMHFFVVSM2LXR2CK/graph.json","events_json":"https://pith.science/api/pith-number/PP3LRKJVPKTMHFFVVSM2LXR2CK/events.json","paper":"https://pith.science/paper/PP3LRKJV"},"agent_actions":{"view_html":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK","download_json":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK.json","view_paper":"https://pith.science/paper/PP3LRKJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.2702&json=true","fetch_graph":"https://pith.science/api/pith-number/PP3LRKJVPKTMHFFVVSM2LXR2CK/graph.json","fetch_events":"https://pith.science/api/pith-number/PP3LRKJVPKTMHFFVVSM2LXR2CK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/action/storage_attestation","attest_author":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/action/author_attestation","sign_citation":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/action/citation_signature","submit_replication":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/action/replication_record"}},"created_at":"2026-05-18T04:30:37.007923+00:00","updated_at":"2026-05-18T04:30:37.007923+00:00"}