{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U5LIM5AFGSWYLQNLY3O35JZLB2","short_pith_number":"pith:U5LIM5AF","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"},"canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","source":{"kind":"arxiv","id":"1102.1475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1475","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1475v1","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1475","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"U5LIM5AFGSWY","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5LIM5AFGSWYLQNL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5LIM5AF","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U5LIM5AFGSWYLQNLY3O35JZLB2","target":"record","payload":{"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"},"canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","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"},"source_kind":"arxiv","source_id":"1102.1475","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-18T04:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVPGjuy4EgEo7MqOq/OOUcnne0VF+frOH5j50fNLYfglIZq6qLBERrGa9FuN1wiSxn9QmeWvbSh7xQY7rICgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:04.954202Z"},"content_sha256":"c89634e72e9824fcd19bd468ec4774649721044cb7519fd308370739f564f954","schema_version":"1.0","event_id":"sha256:c89634e72e9824fcd19bd468ec4774649721044cb7519fd308370739f564f954"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U5LIM5AFGSWYLQNLY3O35JZLB2","target":"graph","payload":{"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"},"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-18T04:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2t4BdWMHeEfit8zXcQURVbIX8FHwWoXxeEwWsPcGKQ3tH58sKH4hWraq8PPzzGstsyzB4XMWzz0cI4svP/TjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:04.954890Z"},"content_sha256":"b00ee22c718547bc8650b1e440d11dd77522d07458ea239d66579a2ee0f1d9d7","schema_version":"1.0","event_id":"sha256:b00ee22c718547bc8650b1e440d11dd77522d07458ea239d66579a2ee0f1d9d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/bundle.json","state_url":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/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-05-27T06:51:04Z","links":{"resolver":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2","bundle":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/bundle.json","state":"https://pith.science/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5LIM5AFGSWYLQNLY3O35JZLB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U5LIM5AFGSWYLQNLY3O35JZLB2","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":"7198aca15f168e5f25cb0c951291d67e15d52f4d8151d81499f5eda85ef67038","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:53:52Z","title_canon_sha256":"12d547e55bedc2025fc9b7a4169c3cf11330d2b7c5b7f46af7b828f16d96edb0"},"schema_version":"1.0","source":{"id":"1102.1475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1475","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1475v1","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1475","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"U5LIM5AFGSWY","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5LIM5AFGSWYLQNL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5LIM5AF","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:b00ee22c718547bc8650b1e440d11dd77522d07458ea239d66579a2ee0f1d9d7","target":"graph","created_at":"2026-05-18T04:29:53Z","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":"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","authors_text":"Hung D. Ly, Tie Liu, Yufei Blankenship","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:53:52Z","title":"Security Embedding Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1475","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:c89634e72e9824fcd19bd468ec4774649721044cb7519fd308370739f564f954","target":"record","created_at":"2026-05-18T04:29:53Z","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":"7198aca15f168e5f25cb0c951291d67e15d52f4d8151d81499f5eda85ef67038","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T23:53:52Z","title_canon_sha256":"12d547e55bedc2025fc9b7a4169c3cf11330d2b7c5b7f46af7b828f16d96edb0"},"schema_version":"1.0","source":{"id":"1102.1475","kind":"arxiv","version":1}},"canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a75686740534ad85c1abc6ddbea72b0e844c58d44726c0778e68c8e7506a748f","first_computed_at":"2026-05-18T04:29:53.143927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:53.143927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4WYlIKF54O5o8+tbmSvZKtexgADkyTBfyw9HL6oUx5LgMFWwF0J0zajQSG2XF9dMKHdT8wSJz/0VMiUfe5gCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:53.144505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c89634e72e9824fcd19bd468ec4774649721044cb7519fd308370739f564f954","sha256:b00ee22c718547bc8650b1e440d11dd77522d07458ea239d66579a2ee0f1d9d7"],"state_sha256":"6fce04013738b84c26e63847af88604ddcc623ada3be30035ebef9151876bad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YisE7DA2h/wLlSdFnW5pav7cjAw+koXErD0N9CpInatM3nyTVT7MdSqe8B4bSGfOJftOgbTkFZCekru2IU1iCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:51:04.958082Z","bundle_sha256":"658160fae323f1fbd736c096d4b45c7290307d3bc6910712557f36c639f0b39a"}}