{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F4EI7XFQQWYFIMNM2HRBZN2E52","short_pith_number":"pith:F4EI7XFQ","canonical_record":{"source":{"id":"1303.2087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T19:32:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b45e705754db2b756d4a95f7dc8c20cea29841a6e15a6279b2caca1d5135cb9","abstract_canon_sha256":"0d1d0dcdab1d10e84bdb6b80f51fc7a2d09db2ed3ec0be2b74d1eb55ef4e01bb"},"schema_version":"1.0"},"canonical_sha256":"2f088fdcb085b05431acd1e21cb744ee9846edf21b990601a8decefd9c67df55","source":{"kind":"arxiv","id":"1303.2087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2087","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2087v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2087","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"F4EI7XFQQWYF","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4EI7XFQQWYFIMNM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4EI7XFQ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F4EI7XFQQWYFIMNM2HRBZN2E52","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T19:32:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b45e705754db2b756d4a95f7dc8c20cea29841a6e15a6279b2caca1d5135cb9","abstract_canon_sha256":"0d1d0dcdab1d10e84bdb6b80f51fc7a2d09db2ed3ec0be2b74d1eb55ef4e01bb"},"schema_version":"1.0"},"canonical_sha256":"2f088fdcb085b05431acd1e21cb744ee9846edf21b990601a8decefd9c67df55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:31.417651Z","signature_b64":"k6nqna97giv02ZXE9/+BHFldlZkkLdAQ5DczIdDyD57enzo6UsRzjmIWz9XA68IXa0uvG8MoCMmaJAOd4kD9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f088fdcb085b05431acd1e21cb744ee9846edf21b990601a8decefd9c67df55","last_reissued_at":"2026-05-18T03:31:31.416929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:31.416929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2087","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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsjqDrPO/kVtAgxoYKz4W5z2FA2S9/Ft/PeQleUGq/zrZbuduXHzybpzJWLPiuKwYYLd5RwW6Et7mWRCZvbPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:02.073787Z"},"content_sha256":"d8f3eb0884f7fa117291f2ca763d1547a316a5203a98f9fd8e86c14487a2e8d7","schema_version":"1.0","event_id":"sha256:d8f3eb0884f7fa117291f2ca763d1547a316a5203a98f9fd8e86c14487a2e8d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F4EI7XFQQWYFIMNM2HRBZN2E52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Bounds and Sum Rate Capacities of a CLass of Discrete Memoryless Interference Channels","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":"2013-03-08T19:32:37Z","abstract_excerpt":"This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference communicate at a rate such that its message can be decoded at the unintended receiver using single user detection. It is also established that this class of discrete memoryless interference channels is equivalent in c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2087","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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcarDwjNldRJzZbhN7tEN8HIfgh/EmRJ5TzkBggFvHT0eUYGReRnZtHaDze4A9VOYeBtIkros2MynRn02Y52Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:02.074481Z"},"content_sha256":"340823c6a163a6c7337ac3ef99fb89c2094e5f9fb40317b281608fe644d8ac9e","schema_version":"1.0","event_id":"sha256:340823c6a163a6c7337ac3ef99fb89c2094e5f9fb40317b281608fe644d8ac9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/bundle.json","state_url":"https://pith.science/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/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-06T05:28:02Z","links":{"resolver":"https://pith.science/pith/F4EI7XFQQWYFIMNM2HRBZN2E52","bundle":"https://pith.science/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/bundle.json","state":"https://pith.science/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4EI7XFQQWYFIMNM2HRBZN2E52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F4EI7XFQQWYFIMNM2HRBZN2E52","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":"0d1d0dcdab1d10e84bdb6b80f51fc7a2d09db2ed3ec0be2b74d1eb55ef4e01bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T19:32:37Z","title_canon_sha256":"5b45e705754db2b756d4a95f7dc8c20cea29841a6e15a6279b2caca1d5135cb9"},"schema_version":"1.0","source":{"id":"1303.2087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2087","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2087v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2087","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"F4EI7XFQQWYF","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4EI7XFQQWYFIMNM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4EI7XFQ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:340823c6a163a6c7337ac3ef99fb89c2094e5f9fb40317b281608fe644d8ac9e","target":"graph","created_at":"2026-05-18T03:31:31Z","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":"This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference communicate at a rate such that its message can be decoded at the unintended receiver using single user detection. It is also established that this class of discrete memoryless interference channels is equivalent in c","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":"2013-03-08T19:32:37Z","title":"Capacity Bounds and Sum Rate Capacities of a CLass of Discrete Memoryless Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2087","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:d8f3eb0884f7fa117291f2ca763d1547a316a5203a98f9fd8e86c14487a2e8d7","target":"record","created_at":"2026-05-18T03:31:31Z","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":"0d1d0dcdab1d10e84bdb6b80f51fc7a2d09db2ed3ec0be2b74d1eb55ef4e01bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T19:32:37Z","title_canon_sha256":"5b45e705754db2b756d4a95f7dc8c20cea29841a6e15a6279b2caca1d5135cb9"},"schema_version":"1.0","source":{"id":"1303.2087","kind":"arxiv","version":1}},"canonical_sha256":"2f088fdcb085b05431acd1e21cb744ee9846edf21b990601a8decefd9c67df55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f088fdcb085b05431acd1e21cb744ee9846edf21b990601a8decefd9c67df55","first_computed_at":"2026-05-18T03:31:31.416929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:31.416929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6nqna97giv02ZXE9/+BHFldlZkkLdAQ5DczIdDyD57enzo6UsRzjmIWz9XA68IXa0uvG8MoCMmaJAOd4kD9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:31.417651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8f3eb0884f7fa117291f2ca763d1547a316a5203a98f9fd8e86c14487a2e8d7","sha256:340823c6a163a6c7337ac3ef99fb89c2094e5f9fb40317b281608fe644d8ac9e"],"state_sha256":"24b7f197c37f6af485046eb6b7bb00eb4232cb09f353cbccc071406de6396308"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1GnXT5konyq3s6O0LRXS06cQpW/XH6LXZwihLPIHWQwdcRc3jgXuJVICaQpPkdRlVgQHJxKP9LzZb8HYyORBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:28:02.078125Z","bundle_sha256":"fa5c436a728fb777c54dacf035760f48c4fb4c085fb94f269888ac101a4d961c"}}