{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BECGWCMKPFRBJM26QC2HNPQE6U","short_pith_number":"pith:BECGWCMK","canonical_record":{"source":{"id":"1207.3322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T18:19:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7a324974474ea5309f5815f016ee5b0729442fcf3136023151ee23895552e8d","abstract_canon_sha256":"58855de333d7dade9ecb9d294e4adc79f7af90ebc33bd73ccd1af4b927d753a4"},"schema_version":"1.0"},"canonical_sha256":"09046b098a796214b35e80b476be04f529dea7b6e5dc43ff062d430fba718313","source":{"kind":"arxiv","id":"1207.3322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3322","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3322v1","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3322","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"BECGWCMKPFRB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BECGWCMKPFRBJM26","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BECGWCMK","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BECGWCMKPFRBJM26QC2HNPQE6U","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T18:19:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7a324974474ea5309f5815f016ee5b0729442fcf3136023151ee23895552e8d","abstract_canon_sha256":"58855de333d7dade9ecb9d294e4adc79f7af90ebc33bd73ccd1af4b927d753a4"},"schema_version":"1.0"},"canonical_sha256":"09046b098a796214b35e80b476be04f529dea7b6e5dc43ff062d430fba718313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:02.682829Z","signature_b64":"60yQiLdTnBYqLG/1RSVBANiwLR7+/w1G4+wjQ4vHOg1zIvi4XKbNcdKwSz6b9JmM0/fTZQO5ovuOK5/fL2FJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09046b098a796214b35e80b476be04f529dea7b6e5dc43ff062d430fba718313","last_reissued_at":"2026-05-18T03:51:02.682202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:02.682202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3322","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:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijFhwn+TgZrvZHhyXCORusfpolj6/IA3gaCCL3fEYnwcZLuabPd3ef4xqXOwfIWPiPdpO9PJBIE27GShaaSLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:57:15.407456Z"},"content_sha256":"e4549a4b8dafe4b3f733403ee27e99efc3d0136bcc6c130fcddd5a3fb5364aab","schema_version":"1.0","event_id":"sha256:e4549a4b8dafe4b3f733403ee27e99efc3d0136bcc6c130fcddd5a3fb5364aab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BECGWCMKPFRBJM26QC2HNPQE6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sum Capacity of the Discrete Memoryless Interference Channel with One-Sided Weak Interference and Mixed Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Biao Chen, Fangfang Zhu","submitted_at":"2012-07-13T18:19:33Z","abstract_excerpt":"The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by letting the transceiver pair subject to the interference communicates at a rate such that its message can be decoded at the unintended receiver using single user detection. Moreover, this class of discrete memoryless interference channels is equivalent in capacity region to certain discrete degraded interference channels. This allows the construction of a ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3322","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:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ooytqrv5wvF1qf4XLja7c5soylo4ZFL43uEZD3W3m4Mz4QMHFdvAllK+pYG4PgApfYMs1gxfmM51W16dSGqdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:57:15.408171Z"},"content_sha256":"d3242356ebd7afdd8b47110890ce09565b1989a1fddb86749dc66bc3671fc41a","schema_version":"1.0","event_id":"sha256:d3242356ebd7afdd8b47110890ce09565b1989a1fddb86749dc66bc3671fc41a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BECGWCMKPFRBJM26QC2HNPQE6U/bundle.json","state_url":"https://pith.science/pith/BECGWCMKPFRBJM26QC2HNPQE6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BECGWCMKPFRBJM26QC2HNPQE6U/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-06T11:57:15Z","links":{"resolver":"https://pith.science/pith/BECGWCMKPFRBJM26QC2HNPQE6U","bundle":"https://pith.science/pith/BECGWCMKPFRBJM26QC2HNPQE6U/bundle.json","state":"https://pith.science/pith/BECGWCMKPFRBJM26QC2HNPQE6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BECGWCMKPFRBJM26QC2HNPQE6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BECGWCMKPFRBJM26QC2HNPQE6U","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":"58855de333d7dade9ecb9d294e4adc79f7af90ebc33bd73ccd1af4b927d753a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T18:19:33Z","title_canon_sha256":"e7a324974474ea5309f5815f016ee5b0729442fcf3136023151ee23895552e8d"},"schema_version":"1.0","source":{"id":"1207.3322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3322","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3322v1","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3322","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"BECGWCMKPFRB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BECGWCMKPFRBJM26","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BECGWCMK","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:d3242356ebd7afdd8b47110890ce09565b1989a1fddb86749dc66bc3671fc41a","target":"graph","created_at":"2026-05-18T03:51:02Z","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 sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by letting the transceiver pair subject to the interference communicates at a rate such that its message can be decoded at the unintended receiver using single user detection. Moreover, this class of discrete memoryless interference channels is equivalent in capacity region to certain discrete degraded interference channels. This allows the construction of a ca","authors_text":"Biao Chen, Fangfang Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T18:19:33Z","title":"On the Sum Capacity of the Discrete Memoryless Interference Channel with One-Sided Weak Interference and Mixed Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3322","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:e4549a4b8dafe4b3f733403ee27e99efc3d0136bcc6c130fcddd5a3fb5364aab","target":"record","created_at":"2026-05-18T03:51:02Z","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":"58855de333d7dade9ecb9d294e4adc79f7af90ebc33bd73ccd1af4b927d753a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T18:19:33Z","title_canon_sha256":"e7a324974474ea5309f5815f016ee5b0729442fcf3136023151ee23895552e8d"},"schema_version":"1.0","source":{"id":"1207.3322","kind":"arxiv","version":1}},"canonical_sha256":"09046b098a796214b35e80b476be04f529dea7b6e5dc43ff062d430fba718313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09046b098a796214b35e80b476be04f529dea7b6e5dc43ff062d430fba718313","first_computed_at":"2026-05-18T03:51:02.682202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:02.682202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60yQiLdTnBYqLG/1RSVBANiwLR7+/w1G4+wjQ4vHOg1zIvi4XKbNcdKwSz6b9JmM0/fTZQO5ovuOK5/fL2FJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:02.682829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4549a4b8dafe4b3f733403ee27e99efc3d0136bcc6c130fcddd5a3fb5364aab","sha256:d3242356ebd7afdd8b47110890ce09565b1989a1fddb86749dc66bc3671fc41a"],"state_sha256":"7cc1cd8c40e7eaf84652b22e06ca1969fbcb41493448bc4e81a4e457c7c0da1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UmmJMVy3e9xsEfv9X5BRos6byU4n8tfVItOOMIxPt1YH2rSjJxz/XDsOsS0foIm8hXu2KxXocU6FTP9ry2bAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:57:15.412063Z","bundle_sha256":"2116eaf4d9719e98706bd4890d09e594a87d5b5d8b276f5334b0151e476502c4"}}