{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:PP3LRKJVPKTMHFFVVSM2LXR2CK","short_pith_number":"pith:PP3LRKJV","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"},"canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","source":{"kind":"arxiv","id":"0907.2702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.2702","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"arxiv_version","alias_value":"0907.2702v2","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2702","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"pith_short_12","alias_value":"PP3LRKJVPKTM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"PP3LRKJVPKTMHFFV","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"PP3LRKJV","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:PP3LRKJVPKTMHFFVVSM2LXR2CK","target":"record","payload":{"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"},"canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","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"},"source_kind":"arxiv","source_id":"0907.2702","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:30:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcfkO2T1WzJ8gee7voDOHC8KVzYaoPVOS40OYs4vxoR2W4aUvM89qXOM3E0LpSy9NTiPJ0OJDoAGRUG9AWSGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:15:45.395439Z"},"content_sha256":"4f0ca27f611c8da60f6ca87885fcc196d303ffe25da3bf9ad544669228896376","schema_version":"1.0","event_id":"sha256:4f0ca27f611c8da60f6ca87885fcc196d303ffe25da3bf9ad544669228896376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:PP3LRKJVPKTMHFFVVSM2LXR2CK","target":"graph","payload":{"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"},"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:30:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5pTlb71BW+g0ftd88IFSwPAOHpVaGw/ilXg1W6BEkAld5XJjMI00IwbtskmCcvvguWbq/xa2++EYRZkSk5YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:15:45.396156Z"},"content_sha256":"ee139ef31374c2294eb35716d31bdc95c8645a165440cdc1ab56620e14f6e439","schema_version":"1.0","event_id":"sha256:ee139ef31374c2294eb35716d31bdc95c8645a165440cdc1ab56620e14f6e439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/bundle.json","state_url":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/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-10T00:15:45Z","links":{"resolver":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK","bundle":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/bundle.json","state":"https://pith.science/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP3LRKJVPKTMHFFVVSM2LXR2CK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:PP3LRKJVPKTMHFFVVSM2LXR2CK","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":"3aeba09c71c0c1ca8c35c273a2cb6dcc7734d52d6f1839d4e416ff2bbe3e2098","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-15T20:52:46Z","title_canon_sha256":"46df29fb63723f58bb42d2fa6373fb015b60bb96c910c35281e1ed5b392183bb"},"schema_version":"1.0","source":{"id":"0907.2702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.2702","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"arxiv_version","alias_value":"0907.2702v2","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2702","created_at":"2026-05-18T04:30:37Z"},{"alias_kind":"pith_short_12","alias_value":"PP3LRKJVPKTM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"PP3LRKJVPKTMHFFV","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"PP3LRKJV","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:ee139ef31374c2294eb35716d31bdc95c8645a165440cdc1ab56620e14f6e439","target":"graph","created_at":"2026-05-18T04:30: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":"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.","authors_text":"Pramod Viswanath, Vinod M. Prabhakaran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-15T20:52:46Z","title":"Interference Channels with Destination Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2702","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:4f0ca27f611c8da60f6ca87885fcc196d303ffe25da3bf9ad544669228896376","target":"record","created_at":"2026-05-18T04:30: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":"3aeba09c71c0c1ca8c35c273a2cb6dcc7734d52d6f1839d4e416ff2bbe3e2098","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-15T20:52:46Z","title_canon_sha256":"46df29fb63723f58bb42d2fa6373fb015b60bb96c910c35281e1ed5b392183bb"},"schema_version":"1.0","source":{"id":"0907.2702","kind":"arxiv","version":2}},"canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bf6b8a9357aa6c394b5ac99a5de3a1294925b148584406c9df782e26ddc576f","first_computed_at":"2026-05-18T04:30:37.007799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:37.007799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZL5JXF4DcI6ySbTimHYA3UcgIDHtZ5mN9vNiIyWKrFe3IA2G/5lsAqJfzr/s9Ks6xYGL6haNvsVI6ltpLp6+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:37.008583Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.2702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f0ca27f611c8da60f6ca87885fcc196d303ffe25da3bf9ad544669228896376","sha256:ee139ef31374c2294eb35716d31bdc95c8645a165440cdc1ab56620e14f6e439"],"state_sha256":"3ef85d4c2fb58edf13b4e2b7ae6503d9c73c73e663279d695998a7513272942d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8uXdvFeBPCwCCQv/58APmJJYBKyO4pIwgORrs9NDLxGqDlIAO/SdmMVPZrew/Dj2NkVsCF+U+KfkiIAERH6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:15:45.400335Z","bundle_sha256":"fd7bd19e54c2008d80285fd706e214bd2deb52f1e42c56a98f86487fe5827faf"}}