{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TT5XS67WMAQ37GD6LCMMAG4S2D","short_pith_number":"pith:TT5XS67W","canonical_record":{"source":{"id":"1512.05201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-16T15:13:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bbe9268632f595e831f53f2b5ccf77c8281289ac56c31133211c2ecbdb5a987c","abstract_canon_sha256":"5c108d7b9985ab73d573ed016986b32f3accea470ccc30d48a02b3e3008d2531"},"schema_version":"1.0"},"canonical_sha256":"9cfb797bf66021bf987e5898c01b92d0c77466a6ed048e13aecd1ca11c743de3","source":{"kind":"arxiv","id":"1512.05201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05201","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05201v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05201","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"TT5XS67WMAQ3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TT5XS67WMAQ37GD6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TT5XS67W","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TT5XS67WMAQ37GD6LCMMAG4S2D","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-16T15:13:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bbe9268632f595e831f53f2b5ccf77c8281289ac56c31133211c2ecbdb5a987c","abstract_canon_sha256":"5c108d7b9985ab73d573ed016986b32f3accea470ccc30d48a02b3e3008d2531"},"schema_version":"1.0"},"canonical_sha256":"9cfb797bf66021bf987e5898c01b92d0c77466a6ed048e13aecd1ca11c743de3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:13.285715Z","signature_b64":"/redkyFrnCyLMc/+IY+vhpkw4vfntXFp/Vt+B2Lut9hRkDBY8uMfaWAJ4YtBPrHP1RwxQPELfpCpA2KYw+YcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cfb797bf66021bf987e5898c01b92d0c77466a6ed048e13aecd1ca11c743de3","last_reissued_at":"2026-05-18T01:24:13.285337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:13.285337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05201","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e18xSHuTIb2GCY4xxhHihuJDTfIdhWqpFG+TukguxZPqyyXjIo0dopq1J4ohgj0uvpCwpQ6b//V5aQCcKYmcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:03.706569Z"},"content_sha256":"7323173f6837eaba6b18f619bd8eed0e24f9b759bec2501a7410cbcba63a1d2b","schema_version":"1.0","event_id":"sha256:7323173f6837eaba6b18f619bd8eed0e24f9b759bec2501a7410cbcba63a1d2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TT5XS67WMAQ37GD6LCMMAG4S2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Outer Bounds and Capacity Results for the Interference Channel with Conferencing Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Reza K. Farsani","submitted_at":"2015-12-16T15:13:24Z","abstract_excerpt":"In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a very few special cases of the one-sided IC. One of the major challenges in analyzing such cooperative networks is how to establish efficient capacity outer bounds for them. In this paper, by applying new techniques, novel capacity outer bounds are presented for the ICs with conferencing users. Using the outer bounds, several new capacity results are proved for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05201","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5smoLybO0SQwf9abEm2tLTTyEwWvRUvQTgLrJpAXYY/aV04fhAQl4ESFWNpedFag5qMB7jMgEnwvD/Z/mNvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:03.707233Z"},"content_sha256":"2dbc7183feba2541c494bb7a5d9bd2a5b0c1089769c4dcf30fe03db584d0b9f3","schema_version":"1.0","event_id":"sha256:2dbc7183feba2541c494bb7a5d9bd2a5b0c1089769c4dcf30fe03db584d0b9f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/bundle.json","state_url":"https://pith.science/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/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-27T14:40:03Z","links":{"resolver":"https://pith.science/pith/TT5XS67WMAQ37GD6LCMMAG4S2D","bundle":"https://pith.science/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/bundle.json","state":"https://pith.science/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TT5XS67WMAQ37GD6LCMMAG4S2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TT5XS67WMAQ37GD6LCMMAG4S2D","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":"5c108d7b9985ab73d573ed016986b32f3accea470ccc30d48a02b3e3008d2531","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-16T15:13:24Z","title_canon_sha256":"bbe9268632f595e831f53f2b5ccf77c8281289ac56c31133211c2ecbdb5a987c"},"schema_version":"1.0","source":{"id":"1512.05201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05201","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05201v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05201","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"TT5XS67WMAQ3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TT5XS67WMAQ37GD6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TT5XS67W","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:2dbc7183feba2541c494bb7a5d9bd2a5b0c1089769c4dcf30fe03db584d0b9f3","target":"graph","created_at":"2026-05-18T01:24:13Z","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, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a very few special cases of the one-sided IC. One of the major challenges in analyzing such cooperative networks is how to establish efficient capacity outer bounds for them. In this paper, by applying new techniques, novel capacity outer bounds are presented for the ICs with conferencing users. Using the outer bounds, several new capacity results are proved for","authors_text":"Amir K. Khandani, Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-16T15:13:24Z","title":"Novel Outer Bounds and Capacity Results for the Interference Channel with Conferencing Receivers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05201","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:7323173f6837eaba6b18f619bd8eed0e24f9b759bec2501a7410cbcba63a1d2b","target":"record","created_at":"2026-05-18T01:24:13Z","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":"5c108d7b9985ab73d573ed016986b32f3accea470ccc30d48a02b3e3008d2531","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-16T15:13:24Z","title_canon_sha256":"bbe9268632f595e831f53f2b5ccf77c8281289ac56c31133211c2ecbdb5a987c"},"schema_version":"1.0","source":{"id":"1512.05201","kind":"arxiv","version":1}},"canonical_sha256":"9cfb797bf66021bf987e5898c01b92d0c77466a6ed048e13aecd1ca11c743de3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cfb797bf66021bf987e5898c01b92d0c77466a6ed048e13aecd1ca11c743de3","first_computed_at":"2026-05-18T01:24:13.285337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:13.285337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/redkyFrnCyLMc/+IY+vhpkw4vfntXFp/Vt+B2Lut9hRkDBY8uMfaWAJ4YtBPrHP1RwxQPELfpCpA2KYw+YcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:13.285715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7323173f6837eaba6b18f619bd8eed0e24f9b759bec2501a7410cbcba63a1d2b","sha256:2dbc7183feba2541c494bb7a5d9bd2a5b0c1089769c4dcf30fe03db584d0b9f3"],"state_sha256":"2fc00fcf0204ab895374252ced638b57d665ae946bfdef71ef3d5254e3e8cfb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IfOkYx5Zq6NZOT/oz1VhWcMtwpXKWjrvN9kIgnV15Tn0qs31w6DEswbnkGaDgPB/47HO6M21EBWtSOXciFqiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:40:03.710944Z","bundle_sha256":"2a8a4d1ae24e2f85f51e0411e56b6591404949f4d830b6e283d101cd2c3490ed"}}