{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP","short_pith_number":"pith:ACHOR3A3","canonical_record":{"source":{"id":"2605.06802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1","abstract_canon_sha256":"ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d"},"schema_version":"1.0"},"canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","source":{"kind":"arxiv","id":"2605.06802","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06802","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06802v3","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06802","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"ACHOR3A3UW7F","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"ACHOR3A3UW7FA4LR","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"ACHOR3A3","created_at":"2026-05-26T02:05:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.06802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1","abstract_canon_sha256":"ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d"},"schema_version":"1.0"},"canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:10.220736Z","signature_b64":"zGA4G3MuWtfXiBzUS5SqCZRmiwCnAEu6Wjbzqf2W/1AB5zHvN6MCWJZ3XyWg9L02YLOr4o68zc0zPzFozTTkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","last_reissued_at":"2026-05-26T02:05:10.219766Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:10.219766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.06802","source_version":3,"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-26T02:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocA90SNaaVFI7JpH2+IBK2BSsG4LwLJV4xpT9/x+ITcvIxifnxF+M7FAjCQlwwgGI3nH5k1TJipyt9bY5T21BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:17:13.913020Z"},"content_sha256":"329b2eb62c54d063baa87c797ff6e21f6972f65ebc3525d206347c1777a1346c","schema_version":"1.0","event_id":"sha256:329b2eb62c54d063baa87c797ff6e21f6972f65ebc3525d206347c1777a1346c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bagus Santoso, Yasutada Oohama","submitted_at":"2026-05-07T18:05:21Z","abstract_excerpt":"In this paper we consider the variable-length lossless source coding for discrete memoryless sources. We proposes a new encryption framework for securely transmitting codewords over a noiseless channel. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant $\\delta\\in ("},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"41446edf09b0745b21ffe9d0e7f5fe6dc09f787da910d4c05c1cc4c7a9903a31"},"source":{"id":"2605.06802","kind":"arxiv","version":3},"verdict":{"id":"d67afa60-6e7a-4383-83a6-f78fa9347e24","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T06:47:35.229611Z","strongest_claim":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.","one_line_summary":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source.","pith_extraction_headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.06802/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T12:02:03.821213Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T07:36:02.444091Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:18.883056Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T12:23:06.797498Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"49af7b665b54b73dcb88cc1df5c32903c7d3d4cbf443503f482dbfdb5c6e932e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"5512da4b0e1b57cb46baf3886030b1c0b721da7cd1d162f2df00cdf4aa1ba15c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d67afa60-6e7a-4383-83a6-f78fa9347e24"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T02:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggbmvgCcgdtNDKjCBHDd/hF+5Qsh+2R+oZQ7yZRc4MAzyUw4D8EqzOoPVPkQkVogmRmSR5Ago9BejtBVtiJEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:17:13.914262Z"},"content_sha256":"b0215c60ce6042f2cee39487168a5fa58369019a0ecb63f51fd24f223184153c","schema_version":"1.0","event_id":"sha256:b0215c60ce6042f2cee39487168a5fa58369019a0ecb63f51fd24f223184153c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/bundle.json","state_url":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/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-06T19:17:13Z","links":{"resolver":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP","bundle":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/bundle.json","state":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP","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":"ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","title_canon_sha256":"656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1"},"schema_version":"1.0","source":{"id":"2605.06802","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06802","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06802v3","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06802","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"ACHOR3A3UW7F","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"ACHOR3A3UW7FA4LR","created_at":"2026-05-26T02:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"ACHOR3A3","created_at":"2026-05-26T02:05:10Z"}],"graph_snapshots":[{"event_id":"sha256:b0215c60ce6042f2cee39487168a5fa58369019a0ecb63f51fd24f223184153c","target":"graph","created_at":"2026-05-26T02:05:10Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound"}],"snapshot_sha256":"41446edf09b0745b21ffe9d0e7f5fe6dc09f787da910d4c05c1cc4c7a9903a31"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"5512da4b0e1b57cb46baf3886030b1c0b721da7cd1d162f2df00cdf4aa1ba15c"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T12:02:03.821213Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T07:36:02.444091Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:18.883056Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:23:06.797498Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06802/integrity.json","findings":[],"snapshot_sha256":"49af7b665b54b73dcb88cc1df5c32903c7d3d4cbf443503f482dbfdb5c6e932e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider the variable-length lossless source coding for discrete memoryless sources. We proposes a new encryption framework for securely transmitting codewords over a noiseless channel. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant $\\delta\\in (","authors_text":"Bagus Santoso, Yasutada Oohama","cross_cats":["math.IT"],"headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","title":"A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.06802","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T06:47:35.229611Z","id":"d67afa60-6e7a-4383-83a6-f78fa9347e24","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","strongest_claim":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.","weakest_assumption":"The source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source."}},"verdict_id":"d67afa60-6e7a-4383-83a6-f78fa9347e24"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:329b2eb62c54d063baa87c797ff6e21f6972f65ebc3525d206347c1777a1346c","target":"record","created_at":"2026-05-26T02:05:10Z","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":"ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","title_canon_sha256":"656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1"},"schema_version":"1.0","source":{"id":"2605.06802","kind":"arxiv","version":3}},"canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","first_computed_at":"2026-05-26T02:05:10.219766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:10.219766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zGA4G3MuWtfXiBzUS5SqCZRmiwCnAEu6Wjbzqf2W/1AB5zHvN6MCWJZ3XyWg9L02YLOr4o68zc0zPzFozTTkBw==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:10.220736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06802","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:329b2eb62c54d063baa87c797ff6e21f6972f65ebc3525d206347c1777a1346c","sha256:b0215c60ce6042f2cee39487168a5fa58369019a0ecb63f51fd24f223184153c"],"state_sha256":"d4eb7bf3549bf94242947c3d412dbaa3aea7e0b0506c6ca4452e408520e556d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOnS/2EpUXTLX0sr26UMPXA5i6OpSG1Ercl23pO7sD3EcRL1Gcqv6JDM8kM+DlEgCjDJO7/QcrzOLOCH7J29AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:17:13.920208Z","bundle_sha256":"606e24f6046b93c22cb1ab60bdedf720aa1a477ee328287a6cd792dc63ad5a3c"}}