{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SXK65EXFVMEAGLPRRL3T5T4D6O","short_pith_number":"pith:SXK65EXF","canonical_record":{"source":{"id":"1302.1837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb3c7e935c9f4e33f6f856c0da714d97fb6d62d2809b6bd486bcd0fb399c4ad4","abstract_canon_sha256":"538298e1ea6aae5135c2a1300db9b88a3865bcfa8f663902f12451fe46bde92f"},"schema_version":"1.0"},"canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","source":{"kind":"arxiv","id":"1302.1837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1837","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1837v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1837","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"SXK65EXFVMEA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SXK65EXFVMEAGLPR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SXK65EXF","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SXK65EXFVMEAGLPRRL3T5T4D6O","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb3c7e935c9f4e33f6f856c0da714d97fb6d62d2809b6bd486bcd0fb399c4ad4","abstract_canon_sha256":"538298e1ea6aae5135c2a1300db9b88a3865bcfa8f663902f12451fe46bde92f"},"schema_version":"1.0"},"canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:14.493454Z","signature_b64":"zfeF8H6GysAsm3uJr1bj85CZBTFaY0jZeIoKyWZUuHSAJF+826W9Ces2odEiqi1UAryyEq9HiyqQQpwt8VHECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","last_reissued_at":"2026-05-18T03:34:14.492627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:14.492627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1837","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-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePjMYUnZekBYmKxbXbyhiA7IKkIq/asUf0KWnV7I+SmzVnV5xsMdJVPneAwShT4xNsoTorFxSXqJviO5B4r5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:19:20.944901Z"},"content_sha256":"c86929f3e81d17fe568524ccaba488937271b2e59b4bfd81121f523641efb840","schema_version":"1.0","event_id":"sha256:c86929f3e81d17fe568524ccaba488937271b2e59b4bfd81121f523641efb840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SXK65EXFVMEAGLPRRL3T5T4D6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity Region of the Two-User Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Reza K. Farsani","submitted_at":"2013-02-07T19:41:07Z","abstract_excerpt":"One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime is given for the general IC where the sum-rate capacity is achieved by treating interference as noise at the receivers. To obtain this result, a single-letter outer bound in terms of some auxiliary random variables is first established for the sum-rate capacity of the general IC and then those conditions under which this outer bound is reduced to the achieva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1837","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-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8e+Oh0wSaJhAoZW5MSuzJj66BZFWH+f6dAZpXdN1bIo9ppx9mO7DPzX5rn8g9rN2sSWuRINErm0ll3DfX57Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:19:20.945246Z"},"content_sha256":"911af550a09e7c4d91aa1893b092f7329a333a405e3a0cc08a9b1da1160f3235","schema_version":"1.0","event_id":"sha256:911af550a09e7c4d91aa1893b092f7329a333a405e3a0cc08a9b1da1160f3235"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/bundle.json","state_url":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/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-25T07:19:20Z","links":{"resolver":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O","bundle":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/bundle.json","state":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SXK65EXFVMEAGLPRRL3T5T4D6O","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":"538298e1ea6aae5135c2a1300db9b88a3865bcfa8f663902f12451fe46bde92f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","title_canon_sha256":"eb3c7e935c9f4e33f6f856c0da714d97fb6d62d2809b6bd486bcd0fb399c4ad4"},"schema_version":"1.0","source":{"id":"1302.1837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1837","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1837v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1837","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"SXK65EXFVMEA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SXK65EXFVMEAGLPR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SXK65EXF","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:911af550a09e7c4d91aa1893b092f7329a333a405e3a0cc08a9b1da1160f3235","target":"graph","created_at":"2026-05-18T03:34:14Z","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":"One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime is given for the general IC where the sum-rate capacity is achieved by treating interference as noise at the receivers. To obtain this result, a single-letter outer bound in terms of some auxiliary random variables is first established for the sum-rate capacity of the general IC and then those conditions under which this outer bound is reduced to the achieva","authors_text":"Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","title":"On the Capacity Region of the Two-User Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1837","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:c86929f3e81d17fe568524ccaba488937271b2e59b4bfd81121f523641efb840","target":"record","created_at":"2026-05-18T03:34:14Z","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":"538298e1ea6aae5135c2a1300db9b88a3865bcfa8f663902f12451fe46bde92f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","title_canon_sha256":"eb3c7e935c9f4e33f6f856c0da714d97fb6d62d2809b6bd486bcd0fb399c4ad4"},"schema_version":"1.0","source":{"id":"1302.1837","kind":"arxiv","version":1}},"canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","first_computed_at":"2026-05-18T03:34:14.492627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:14.492627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfeF8H6GysAsm3uJr1bj85CZBTFaY0jZeIoKyWZUuHSAJF+826W9Ces2odEiqi1UAryyEq9HiyqQQpwt8VHECw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:14.493454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c86929f3e81d17fe568524ccaba488937271b2e59b4bfd81121f523641efb840","sha256:911af550a09e7c4d91aa1893b092f7329a333a405e3a0cc08a9b1da1160f3235"],"state_sha256":"84d19f1fd02a53dbcc2a22d1e272ab879e48799b174371ff9d1a8d7f902b369d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sa3Eg3bubtFwHWrJ4LM7ueE6DVLWMk7JDcvYSlA7m0pFQZ9dFBBvvzACUcx2cZ9GwpnUkrIzCjja6BAPrEniCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:19:20.947205Z","bundle_sha256":"12c9211c49b326d0e45ce8d597bff7d0c2eb55eb155a0a05ce0dca51bda409a2"}}