{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U5LIM5AFGSWYLQNLY3O35JZLB2","short_pith_number":"pith:U5LIM5AF","schema_version":"1.0","canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","source":{"kind":"arxiv","id":"1102.1475","version":1},"attestation_state":"computed","paper":{"title":"Security Embedding Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung D. Ly, Tie Liu, Yufei Blankenship","submitted_at":"2011-02-07T23:53:52Z","abstract_excerpt":"This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation of the problem is presented. A coding scheme that combines rate splitting, superposition coding, nested binning and channel prefixing is considered and is shown to achieve the secrecy capacity region of the channel in several scenarios. Specifying these results to both scalar and independent parallel Gaussian channels (under an average individual per-subcha"},"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":"1102.1475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:53:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12d547e55bedc2025fc9b7a4169c3cf11330d2b7c5b7f46af7b828f16d96edb0","abstract_canon_sha256":"7198aca15f168e5f25cb0c951291d67e15d52f4d8151d81499f5eda85ef67038"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:53.144505Z","signature_b64":"p4WYlIKF54O5o8+tbmSvZKtexgADkyTBfyw9HL6oUx5LgMFWwF0J0zajQSG2XF9dMKHdT8wSJz/0VMiUfe5gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","last_reissued_at":"2026-05-18T04:29:53.143927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:53.143927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security Embedding Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung D. Ly, Tie Liu, Yufei Blankenship","submitted_at":"2011-02-07T23:53:52Z","abstract_excerpt":"This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation of the problem is presented. A coding scheme that combines rate splitting, superposition coding, nested binning and channel prefixing is considered and is shown to achieve the secrecy capacity region of the channel in several scenarios. Specifying these results to both scalar and independent parallel Gaussian channels (under an average individual per-subcha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1475","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.1475","created_at":"2026-05-18T04:29:53.144001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1475v1","created_at":"2026-05-18T04:29:53.144001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1475","created_at":"2026-05-18T04:29:53.144001+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5LIM5AFGSWY","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5LIM5AFGSWYLQNL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5LIM5AF","created_at":"2026-05-18T12:26:42.757692+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/U5LIM5AFGSWYLQNLY3O35JZLB2","json":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2.json","graph_json":"https://pith.science/api/pith-number/U5LIM5AFGSWYLQNLY3O35JZLB2/graph.json","events_json":"https://pith.science/api/pith-number/U5LIM5AFGSWYLQNLY3O35JZLB2/events.json","paper":"https://pith.science/paper/U5LIM5AF"},"agent_actions":{"view_html":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2","download_json":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2.json","view_paper":"https://pith.science/paper/U5LIM5AF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1475&json=true","fetch_graph":"https://pith.science/api/pith-number/U5LIM5AFGSWYLQNLY3O35JZLB2/graph.json","fetch_events":"https://pith.science/api/pith-number/U5LIM5AFGSWYLQNLY3O35JZLB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/action/storage_attestation","attest_author":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/action/author_attestation","sign_citation":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/action/citation_signature","submit_replication":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/action/replication_record"}},"created_at":"2026-05-18T04:29:53.144001+00:00","updated_at":"2026-05-18T04:29:53.144001+00:00"}