{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2ADTQIUJQ5A6MP6NVS4WMR3YJ5","short_pith_number":"pith:2ADTQIUJ","schema_version":"1.0","canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","source":{"kind":"arxiv","id":"1109.4074","version":2},"attestation_state":"computed","paper":{"title":"Secure Multiplex Coding Over Interference Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ryutaroh Matsumoto, Xiaolin Li","submitted_at":"2011-09-19T16:17:11Z","abstract_excerpt":"In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole Han-Kobayashi region. In addition, this construction not only removes the rate loss incurred by adding dummy messages to achieve security, but also change the original weak security condition in [2] to st"},"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":"1109.4074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-19T16:17:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0759970f31c5851e50c3311f8bddaba0c58a879c42c725904dc7ae9cbd1d94f1","abstract_canon_sha256":"e8ff881bd70588e9f3b1b32f2b54bd3f2ff4991bcc03910d4fcdb2c0402b8e93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.440468Z","signature_b64":"FmDImxZlf4WYpjmhYa8YbWSaMdRV0v7inRZbCNxS5HG/iPR6KqIkC/0LIHJC5NcXhIxZJiOUVOO1v7mE0Ur1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","last_reissued_at":"2026-05-18T02:21:36.439969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.439969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Multiplex Coding Over Interference Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ryutaroh Matsumoto, Xiaolin Li","submitted_at":"2011-09-19T16:17:11Z","abstract_excerpt":"In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole Han-Kobayashi region. In addition, this construction not only removes the rate loss incurred by adding dummy messages to achieve security, but also change the original weak security condition in [2] to st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4074","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":"1109.4074","created_at":"2026-05-18T02:21:36.440049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4074v2","created_at":"2026-05-18T02:21:36.440049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4074","created_at":"2026-05-18T02:21:36.440049+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ADTQIUJQ5A6","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ADTQIUJQ5A6MP6N","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ADTQIUJ","created_at":"2026-05-18T12:26:18.847500+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/2ADTQIUJQ5A6MP6NVS4WMR3YJ5","json":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5.json","graph_json":"https://pith.science/api/pith-number/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/graph.json","events_json":"https://pith.science/api/pith-number/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/events.json","paper":"https://pith.science/paper/2ADTQIUJ"},"agent_actions":{"view_html":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5","download_json":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5.json","view_paper":"https://pith.science/paper/2ADTQIUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4074&json=true","fetch_graph":"https://pith.science/api/pith-number/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/action/storage_attestation","attest_author":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/action/author_attestation","sign_citation":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/action/citation_signature","submit_replication":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/action/replication_record"}},"created_at":"2026-05-18T02:21:36.440049+00:00","updated_at":"2026-05-18T02:21:36.440049+00:00"}