{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2ADTQIUJQ5A6MP6NVS4WMR3YJ5","short_pith_number":"pith:2ADTQIUJ","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"},"canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","source":{"kind":"arxiv","id":"1109.4074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4074","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4074v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4074","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"2ADTQIUJQ5A6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ADTQIUJQ5A6MP6N","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ADTQIUJ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2ADTQIUJQ5A6MP6NVS4WMR3YJ5","target":"record","payload":{"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"},"canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","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"},"source_kind":"arxiv","source_id":"1109.4074","source_version":2,"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"su2CNtoQzVmPR1WNIlZvLcBxtVY37DC3YKmNkImgvNax6f/5lQoyzv8vagOAIYtdUv4vrisRBknYssmViBePCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:02:46.548726Z"},"content_sha256":"b08d1164b83daa41d54ba647f6e332376002160f99ef30c1c9265aabe59d6d6f","schema_version":"1.0","event_id":"sha256:b08d1164b83daa41d54ba647f6e332376002160f99ef30c1c9265aabe59d6d6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2ADTQIUJQ5A6MP6NVS4WMR3YJ5","target":"graph","payload":{"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"},"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GztQ5IGSD1x/SofeFaSVAc2m5KZpaNQcgxspmDDI56JA8ierGlDkh/XSrZN+4gzenfdpZVk593zZRQiNpd7YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:02:46.549359Z"},"content_sha256":"39500ccd14b97deed658ae41584ea0b2ae6a8e8b9e694a415ab45b03853558d3","schema_version":"1.0","event_id":"sha256:39500ccd14b97deed658ae41584ea0b2ae6a8e8b9e694a415ab45b03853558d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/bundle.json","state_url":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/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-06T03:02:46Z","links":{"resolver":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5","bundle":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/bundle.json","state":"https://pith.science/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ADTQIUJQ5A6MP6NVS4WMR3YJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2ADTQIUJQ5A6MP6NVS4WMR3YJ5","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":"e8ff881bd70588e9f3b1b32f2b54bd3f2ff4991bcc03910d4fcdb2c0402b8e93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-19T16:17:11Z","title_canon_sha256":"0759970f31c5851e50c3311f8bddaba0c58a879c42c725904dc7ae9cbd1d94f1"},"schema_version":"1.0","source":{"id":"1109.4074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4074","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4074v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4074","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"2ADTQIUJQ5A6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ADTQIUJQ5A6MP6N","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ADTQIUJ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:39500ccd14b97deed658ae41584ea0b2ae6a8e8b9e694a415ab45b03853558d3","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"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","authors_text":"Ryutaroh Matsumoto, Xiaolin Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-19T16:17:11Z","title":"Secure Multiplex Coding Over Interference Channel with Confidential Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4074","kind":"arxiv","version":2},"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:b08d1164b83daa41d54ba647f6e332376002160f99ef30c1c9265aabe59d6d6f","target":"record","created_at":"2026-05-18T02:21:36Z","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":"e8ff881bd70588e9f3b1b32f2b54bd3f2ff4991bcc03910d4fcdb2c0402b8e93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-19T16:17:11Z","title_canon_sha256":"0759970f31c5851e50c3311f8bddaba0c58a879c42c725904dc7ae9cbd1d94f1"},"schema_version":"1.0","source":{"id":"1109.4074","kind":"arxiv","version":2}},"canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0073822898741e63fcdacb96647784f65678cb52de68bf5be1c45c2a42885bc","first_computed_at":"2026-05-18T02:21:36.439969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.439969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FmDImxZlf4WYpjmhYa8YbWSaMdRV0v7inRZbCNxS5HG/iPR6KqIkC/0LIHJC5NcXhIxZJiOUVOO1v7mE0Ur1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.440468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b08d1164b83daa41d54ba647f6e332376002160f99ef30c1c9265aabe59d6d6f","sha256:39500ccd14b97deed658ae41584ea0b2ae6a8e8b9e694a415ab45b03853558d3"],"state_sha256":"6a767a54e0cb77a1b1dbb439fff55813cd5b039509f3edeb42721ad3855c67bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7CVqIXP6uyElZYQoaUSKdDP5Gs4WWJxr9Sei3appVjEklbUqSCiv0h1JVahjM1IrM4pR4fPi4Js10Zz/UenAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:02:46.553568Z","bundle_sha256":"8b0bcf15d084fe899b4c8b2d3f1a4c9b72b82533dc762763da8eee0622f40b41"}}