{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FDKHSQNAFRMDASLPQQWAS4EWBZ","short_pith_number":"pith:FDKHSQNA","canonical_record":{"source":{"id":"1702.05846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:28:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84c99439c145e9b4427d2b8ef30d28cba13c763f25f1aa77224bf7db1911985a","abstract_canon_sha256":"4865c291dd13635773270fa4f314ffbd4995d5d23d6190e2784c07d8b490eb68"},"schema_version":"1.0"},"canonical_sha256":"28d47941a02c5830496f842c0970960e5d94b14639b75b62bf2dbf365b37126d","source":{"kind":"arxiv","id":"1702.05846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05846","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05846v1","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05846","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FDKHSQNAFRMD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDKHSQNAFRMDASLP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDKHSQNA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FDKHSQNAFRMDASLPQQWAS4EWBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:28:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84c99439c145e9b4427d2b8ef30d28cba13c763f25f1aa77224bf7db1911985a","abstract_canon_sha256":"4865c291dd13635773270fa4f314ffbd4995d5d23d6190e2784c07d8b490eb68"},"schema_version":"1.0"},"canonical_sha256":"28d47941a02c5830496f842c0970960e5d94b14639b75b62bf2dbf365b37126d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.401522Z","signature_b64":"fTVm8SugF+sRnkHzgV/yE6Zwd911t2I/qjwjHuzyt4zkX3F7EXoNRNbDH/H4Ui40LZN9zQmJem6C+NivwckfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d47941a02c5830496f842c0970960e5d94b14639b75b62bf2dbf365b37126d","last_reissued_at":"2026-05-18T00:50:07.400759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.400759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05846","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-18T00:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/G3OPw2EIMZS2902rABwzl3e9qmgWcra2XUQOwiEfppXe+gIaaJj7LuuBXna2P0mFbZFN+GFL2w9BW7q5dmzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:27:01.539504Z"},"content_sha256":"8738fe8abf158f30abe1803e03680824e483c7c4b945a4b2657f0dff9573988c","schema_version":"1.0","event_id":"sha256:8738fe8abf158f30abe1803e03680824e483c7c4b945a4b2657f0dff9573988c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FDKHSQNAFRMDASLPQQWAS4EWBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Techniques to Derive Capacity Results for Multi-User Interference Channels","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":"2017-02-20T03:28:33Z","abstract_excerpt":"The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential application of Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05846","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-18T00:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN9ixn1k4o8KjMUtwlSqEG2PeZiABIGQDtg5BPNu/D6M3ZM6TkRo2dbEwkgHcmdlw7LV9CQeU1+quVDVjEkKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:27:01.540184Z"},"content_sha256":"31f24d94cadf607b962fb2ceafb8274117b5cf16b8b1acfe9fed203d9a1eee5c","schema_version":"1.0","event_id":"sha256:31f24d94cadf607b962fb2ceafb8274117b5cf16b8b1acfe9fed203d9a1eee5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/bundle.json","state_url":"https://pith.science/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/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-27T17:27:01Z","links":{"resolver":"https://pith.science/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ","bundle":"https://pith.science/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/bundle.json","state":"https://pith.science/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDKHSQNAFRMDASLPQQWAS4EWBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FDKHSQNAFRMDASLPQQWAS4EWBZ","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":"4865c291dd13635773270fa4f314ffbd4995d5d23d6190e2784c07d8b490eb68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:28:33Z","title_canon_sha256":"84c99439c145e9b4427d2b8ef30d28cba13c763f25f1aa77224bf7db1911985a"},"schema_version":"1.0","source":{"id":"1702.05846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05846","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05846v1","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05846","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FDKHSQNAFRMD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDKHSQNAFRMDASLP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDKHSQNA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:31f24d94cadf607b962fb2ceafb8274117b5cf16b8b1acfe9fed203d9a1eee5c","target":"graph","created_at":"2026-05-18T00:50: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":"The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential application of Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference ne","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":"2017-02-20T03:28:33Z","title":"Novel Techniques to Derive Capacity Results for Multi-User Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05846","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:8738fe8abf158f30abe1803e03680824e483c7c4b945a4b2657f0dff9573988c","target":"record","created_at":"2026-05-18T00:50: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":"4865c291dd13635773270fa4f314ffbd4995d5d23d6190e2784c07d8b490eb68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:28:33Z","title_canon_sha256":"84c99439c145e9b4427d2b8ef30d28cba13c763f25f1aa77224bf7db1911985a"},"schema_version":"1.0","source":{"id":"1702.05846","kind":"arxiv","version":1}},"canonical_sha256":"28d47941a02c5830496f842c0970960e5d94b14639b75b62bf2dbf365b37126d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28d47941a02c5830496f842c0970960e5d94b14639b75b62bf2dbf365b37126d","first_computed_at":"2026-05-18T00:50:07.400759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:07.400759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTVm8SugF+sRnkHzgV/yE6Zwd911t2I/qjwjHuzyt4zkX3F7EXoNRNbDH/H4Ui40LZN9zQmJem6C+NivwckfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:07.401522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8738fe8abf158f30abe1803e03680824e483c7c4b945a4b2657f0dff9573988c","sha256:31f24d94cadf607b962fb2ceafb8274117b5cf16b8b1acfe9fed203d9a1eee5c"],"state_sha256":"ee1ccb33f06a2912fb627559fd34f439526a4ff322730defb2a89528e387a42f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScGm6mXSe2NOjyMWZo4mD2PbtPGyK8Y5BerbdWcen8wGdy8QscDi1cIz5S6L5QJOTw3+1p9iRp7egdIF/l7vDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:27:01.543799Z","bundle_sha256":"acce05d50e8d438d4a635fdd6e2537baf0089b7173a13ef703e38f0f5e1d2b4b"}}