{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6YGH2II7PZ7RNHHLXOVVI5JKRA","short_pith_number":"pith:6YGH2II7","schema_version":"1.0","canonical_sha256":"f60c7d211f7e7f169cebbbab54752a88307c94d76759412ad0c5e5aedfac458a","source":{"kind":"arxiv","id":"1011.1225","version":2},"attestation_state":"computed","paper":{"title":"On the Capacity of Multiple-Access-Z-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, H. Vincent Poor, Xiaohu Shang","submitted_at":"2010-11-04T17:55:44Z","abstract_excerpt":"The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.1225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-04T17:55:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aff0f927fc10f9219dbadc4af7779ff18d31b9c2a4f4d3c0c4df1158c6f3450d","abstract_canon_sha256":"817fa0e27b96037b2f6695da5c57b53550845f7462202b4e9eddb6acf6892aaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.047173Z","signature_b64":"wA0atHpHMBSBHLUaSIvd8iT78NrVsxX6sVzihR5k6+xEAtlSOqHloOGzF0kiYa+9Xj5QgXaKZANicodJWDpxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60c7d211f7e7f169cebbbab54752a88307c94d76759412ad0c5e5aedfac458a","last_reissued_at":"2026-05-18T03:46:17.046526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.046526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Multiple-Access-Z-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, H. Vincent Poor, Xiaohu Shang","submitted_at":"2010-11-04T17:55:44Z","abstract_excerpt":"The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1225","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.1225","created_at":"2026-05-18T03:46:17.046654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1225v2","created_at":"2026-05-18T03:46:17.046654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1225","created_at":"2026-05-18T03:46:17.046654+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YGH2II7PZ7R","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YGH2II7PZ7RNHHL","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YGH2II7","created_at":"2026-05-18T12:26:04.259169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA","json":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA.json","graph_json":"https://pith.science/api/pith-number/6YGH2II7PZ7RNHHLXOVVI5JKRA/graph.json","events_json":"https://pith.science/api/pith-number/6YGH2II7PZ7RNHHLXOVVI5JKRA/events.json","paper":"https://pith.science/paper/6YGH2II7"},"agent_actions":{"view_html":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA","download_json":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA.json","view_paper":"https://pith.science/paper/6YGH2II7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1225&json=true","fetch_graph":"https://pith.science/api/pith-number/6YGH2II7PZ7RNHHLXOVVI5JKRA/graph.json","fetch_events":"https://pith.science/api/pith-number/6YGH2II7PZ7RNHHLXOVVI5JKRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA/action/storage_attestation","attest_author":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA/action/author_attestation","sign_citation":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA/action/citation_signature","submit_replication":"https://pith.science/pith/6YGH2II7PZ7RNHHLXOVVI5JKRA/action/replication_record"}},"created_at":"2026-05-18T03:46:17.046654+00:00","updated_at":"2026-05-18T03:46:17.046654+00:00"}