{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5BWEAMIJEYIZWO4HSXX6Y2TXKN","short_pith_number":"pith:5BWEAMIJ","canonical_record":{"source":{"id":"1710.10202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-27T15:36:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c0588bf213dd2b4d21a62355c244a61262091e41be480620f2a144bb7840962","abstract_canon_sha256":"b86960ce9706edbc459d97bbd511e5c78adb411ba496d0f2cad8811223f8cdc5"},"schema_version":"1.0"},"canonical_sha256":"e86c40310926119b3b8795efec6a77536debda2a50d7382ac7992b50bcc3e46b","source":{"kind":"arxiv","id":"1710.10202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10202","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10202v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10202","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"5BWEAMIJEYIZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5BWEAMIJEYIZWO4H","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5BWEAMIJ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5BWEAMIJEYIZWO4HSXX6Y2TXKN","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-27T15:36:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c0588bf213dd2b4d21a62355c244a61262091e41be480620f2a144bb7840962","abstract_canon_sha256":"b86960ce9706edbc459d97bbd511e5c78adb411ba496d0f2cad8811223f8cdc5"},"schema_version":"1.0"},"canonical_sha256":"e86c40310926119b3b8795efec6a77536debda2a50d7382ac7992b50bcc3e46b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.526367Z","signature_b64":"6ffYz3TgJ9xa+Qxt7CAUGLsnUgKnFwwtRlvqnn5JKe8sp3KpO71wBTQkTlxPgazUwWpbG3F0knV0mIVYYYGRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86c40310926119b3b8795efec6a77536debda2a50d7382ac7992b50bcc3e46b","last_reissued_at":"2026-05-18T00:31:54.525944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.525944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10202","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-18T00:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9k2lXOpzvUzoSsccaouYkmhp2CrJXsS2zkyJARWSam5INFo7i4Bc3ry/ioycdjUmTBqKyVjplAEH93/n0GgpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:53:10.824339Z"},"content_sha256":"c06c0efca0d5ad50eb76729cdbea266b10042f125d5ff6bdf357ecc7a658b3e3","schema_version":"1.0","event_id":"sha256:c06c0efca0d5ad50eb76729cdbea266b10042f125d5ff6bdf357ecc7a658b3e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5BWEAMIJEYIZWO4HSXX6Y2TXKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Coding for the Cognitive 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":"Cong Ling, Mengfan Zheng, Wen Chen","submitted_at":"2017-10-27T15:36:07Z","abstract_excerpt":"In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for interference channels rely on the use of polar codes for the multiple access channel, the code construction problem of which can be complicated. We show that the whole secrecy capacity region of the CICC can be achieved by simple point-to-point polar codes due to the cognitivity, and our proposed scheme requires the minimum rate of randomness at the encoder."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10202","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-18T00:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGNjB2pfUuUNvsBPxSeeAnxPefQFC/IRnKz5D0/YqEx9H8rLpYmvDwSr9aaJZiGeaScpSQ32mmsBg6f75lWPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:53:10.824709Z"},"content_sha256":"96bafdcc87365240efcd494f1041d93c2ecc05045aa3976b86f971167f06b734","schema_version":"1.0","event_id":"sha256:96bafdcc87365240efcd494f1041d93c2ecc05045aa3976b86f971167f06b734"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/bundle.json","state_url":"https://pith.science/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/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-01T07:53:10Z","links":{"resolver":"https://pith.science/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN","bundle":"https://pith.science/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/bundle.json","state":"https://pith.science/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BWEAMIJEYIZWO4HSXX6Y2TXKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5BWEAMIJEYIZWO4HSXX6Y2TXKN","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":"b86960ce9706edbc459d97bbd511e5c78adb411ba496d0f2cad8811223f8cdc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-27T15:36:07Z","title_canon_sha256":"6c0588bf213dd2b4d21a62355c244a61262091e41be480620f2a144bb7840962"},"schema_version":"1.0","source":{"id":"1710.10202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10202","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10202v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10202","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"5BWEAMIJEYIZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5BWEAMIJEYIZWO4H","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5BWEAMIJ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:96bafdcc87365240efcd494f1041d93c2ecc05045aa3976b86f971167f06b734","target":"graph","created_at":"2026-05-18T00:31:54Z","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, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for interference channels rely on the use of polar codes for the multiple access channel, the code construction problem of which can be complicated. We show that the whole secrecy capacity region of the CICC can be achieved by simple point-to-point polar codes due to the cognitivity, and our proposed scheme requires the minimum rate of randomness at the encoder.","authors_text":"Cong Ling, Mengfan Zheng, Wen Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-27T15:36:07Z","title":"Polar Coding for the Cognitive Interference Channel with Confidential Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10202","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:c06c0efca0d5ad50eb76729cdbea266b10042f125d5ff6bdf357ecc7a658b3e3","target":"record","created_at":"2026-05-18T00:31:54Z","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":"b86960ce9706edbc459d97bbd511e5c78adb411ba496d0f2cad8811223f8cdc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-27T15:36:07Z","title_canon_sha256":"6c0588bf213dd2b4d21a62355c244a61262091e41be480620f2a144bb7840962"},"schema_version":"1.0","source":{"id":"1710.10202","kind":"arxiv","version":1}},"canonical_sha256":"e86c40310926119b3b8795efec6a77536debda2a50d7382ac7992b50bcc3e46b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e86c40310926119b3b8795efec6a77536debda2a50d7382ac7992b50bcc3e46b","first_computed_at":"2026-05-18T00:31:54.525944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:54.525944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ffYz3TgJ9xa+Qxt7CAUGLsnUgKnFwwtRlvqnn5JKe8sp3KpO71wBTQkTlxPgazUwWpbG3F0knV0mIVYYYGRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:54.526367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c06c0efca0d5ad50eb76729cdbea266b10042f125d5ff6bdf357ecc7a658b3e3","sha256:96bafdcc87365240efcd494f1041d93c2ecc05045aa3976b86f971167f06b734"],"state_sha256":"7a0ea036a16b94cf7d20547eabc0e4710bf126603a444abe2b3e6ec35faf7f26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXADkFB/auQDO8i2pM0EjC3+PK9dxv/yGorooNciyuSj9OyzKsB2hV8BEoVstjWG0d6OMpiIiSIohxPV1OfdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:53:10.826704Z","bundle_sha256":"7c0eeaf9bb363eb6ee0e4d831fd87043d989e7eab292b5d179f749373f236568"}}