{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZZ2YVBXNN6QTJBMWHTVCUZTPI2","short_pith_number":"pith:ZZ2YVBXN","canonical_record":{"source":{"id":"2605.14334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-14T03:58:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"acb8d5662a010bb129c4676d4121018b53d3c2d80ff54ed1760dff5842ab57a0","abstract_canon_sha256":"bece49e31d5922f0d27ccecc2a1a1f296afdc2f1e14415d12a618c253a8acb63"},"schema_version":"1.0"},"canonical_sha256":"ce758a86ed6fa13485963cea2a666f469936d9ca78e0ffd85548714ff2d61eda","source":{"kind":"arxiv","id":"2605.14334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14334","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14334v1","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14334","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ2YVBXNN6QT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ2YVBXNN6QTJBMW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ2YVBXN","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZZ2YVBXNN6QTJBMWHTVCUZTPI2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-14T03:58:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"acb8d5662a010bb129c4676d4121018b53d3c2d80ff54ed1760dff5842ab57a0","abstract_canon_sha256":"bece49e31d5922f0d27ccecc2a1a1f296afdc2f1e14415d12a618c253a8acb63"},"schema_version":"1.0"},"canonical_sha256":"ce758a86ed6fa13485963cea2a666f469936d9ca78e0ffd85548714ff2d61eda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:08.257800Z","signature_b64":"PD+F8Veq7Reg8trBbovDOsMVg9N4auvRIpBeu/A+h922fp3Y2kzvC7Zlee88Mt141MoXZ86Qyd8u4EAaXPyzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce758a86ed6fa13485963cea2a666f469936d9ca78e0ffd85548714ff2d61eda","last_reissued_at":"2026-05-17T23:39:08.257097Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:08.257097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14334","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-17T23:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVIwmQuG7VWGxGGIO3SJnmAJsvbz8arSypjGZD3kdYIZHTiutGEY6T2vSeirAh0qJx3r88OT71T9j5EY3fiFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:02.860491Z"},"content_sha256":"1c507b5565a451890926719b01da4c7c89c493556586a0f53d088f9cc025475a","schema_version":"1.0","event_id":"sha256:1c507b5565a451890926719b01da4c7c89c493556586a0f53d088f9cc025475a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZZ2YVBXNN6QTJBMWHTVCUZTPI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Joint Source-Channel Coding of Multimodal Semantic Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Denis Kozlov, Mahtab Mirmohseni, Rahim Tafazolli","submitted_at":"2026-05-14T03:58:16Z","abstract_excerpt":"We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random variables. The encoder observes independent and identically distributed samples of an arbitrary non-empty subset of modalities. The samples are encoded and transmitted over a discrete memoryless wiretap channel. The legitimate receiver reconstructs all modalities. We extend the rate-distortion-perception problem formulation to multimodal sources. We establi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression, the secret key rate, and the statistics of the wiretap channel.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The source consists of i.i.d. samples of an arbitrary non-empty subset of modalities and the channel is discrete memoryless; if the modalities are statistically dependent in ways not captured by the model or the channel has memory, the bounds may not apply.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper establishes converse and achievability bounds for secure joint source-channel coding of multimodal sources over wiretap channels, with secrecy limits composed of compression level, secret key rate, and channel statistics.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"cecc5e39d6286b32407798de4022342b5edc4b06f4be15ff5156164914988e44"},"source":{"id":"2605.14334","kind":"arxiv","version":1},"verdict":{"id":"afa0288d-3ce2-4e62-8da9-f24fde35469a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:02:03.066345Z","strongest_claim":"We show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression, the secret key rate, and the statistics of the wiretap channel.","one_line_summary":"The paper establishes converse and achievability bounds for secure joint source-channel coding of multimodal sources over wiretap channels, with secrecy limits composed of compression level, secret key rate, and channel statistics.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The source consists of i.i.d. samples of an arbitrary non-empty subset of modalities and the channel is discrete memoryless; if the modalities are statistically dependent in ways not captured by the model or the channel has memory, the bounds may not apply.","pith_extraction_headline":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics."},"references":{"count":17,"sample":[{"doi":"","year":2021,"title":"A rate-distortion framework for char- acterizing semantic information,","work_id":"e2f9d116-03c8-4c5c-a5b9-5f6ce017a3bf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"An indirect rate-distortion characterization for semantic sources: General model and the case of Gaussian observation,","work_id":"839ca4b3-1cc2-4d56-9bea-21cb8472b0da","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Semantic compression with side information: A rate-distortion perspective,","work_id":"50521c5d-7936-4cdd-9f18-2263d48305ea","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Rate-distortion-perception theory for semantic communication","work_id":"ebcad483-1b49-4f5a-8daa-6fe3d92c7e2e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"The role of fidelity in goal-oriented semantic communication: A rate distortion approach,","work_id":"5d780a9e-0122-4e78-8842-256fb941cf15","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"ca73f7f39ef034de53e0c3e6ddffe2f438ec20d9b8b31cf715adf557c9ad4881","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b7744c418baa392864969bc4d90c526fc8cae520dd96f5fd7087f00bf3786d51"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"afa0288d-3ce2-4e62-8da9-f24fde35469a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFMZYAE40aygDWVeyMUauUfRGOKiK3mWDHqhOPgcR1/yZ1Uc0QT+BgWyMIdiaeldZrCloxPcYN+fjYWYzY6zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:02.861014Z"},"content_sha256":"76d47bd9f14d02f20821783cd31ac048a6a71d1af2e0b958d763284f2bb7d60b","schema_version":"1.0","event_id":"sha256:76d47bd9f14d02f20821783cd31ac048a6a71d1af2e0b958d763284f2bb7d60b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/bundle.json","state_url":"https://pith.science/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/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-30T08:37:02Z","links":{"resolver":"https://pith.science/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2","bundle":"https://pith.science/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/bundle.json","state":"https://pith.science/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ2YVBXNN6QTJBMWHTVCUZTPI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZZ2YVBXNN6QTJBMWHTVCUZTPI2","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":"bece49e31d5922f0d27ccecc2a1a1f296afdc2f1e14415d12a618c253a8acb63","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-14T03:58:16Z","title_canon_sha256":"acb8d5662a010bb129c4676d4121018b53d3c2d80ff54ed1760dff5842ab57a0"},"schema_version":"1.0","source":{"id":"2605.14334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14334","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14334v1","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14334","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ2YVBXNN6QT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ2YVBXNN6QTJBMW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ2YVBXN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:76d47bd9f14d02f20821783cd31ac048a6a71d1af2e0b958d763284f2bb7d60b","target":"graph","created_at":"2026-05-17T23:39:08Z","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 show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression, the secret key rate, and the statistics of the wiretap channel."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The source consists of i.i.d. samples of an arbitrary non-empty subset of modalities and the channel is discrete memoryless; if the modalities are statistically dependent in ways not captured by the model or the channel has memory, the bounds may not apply."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper establishes converse and achievability bounds for secure joint source-channel coding of multimodal sources over wiretap channels, with secrecy limits composed of compression level, secret key rate, and channel statistics."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics."}],"snapshot_sha256":"cecc5e39d6286b32407798de4022342b5edc4b06f4be15ff5156164914988e44"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b7744c418baa392864969bc4d90c526fc8cae520dd96f5fd7087f00bf3786d51"},"paper":{"abstract_excerpt":"We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random variables. The encoder observes independent and identically distributed samples of an arbitrary non-empty subset of modalities. The samples are encoded and transmitted over a discrete memoryless wiretap channel. The legitimate receiver reconstructs all modalities. We extend the rate-distortion-perception problem formulation to multimodal sources. We establi","authors_text":"Denis Kozlov, Mahtab Mirmohseni, Rahim Tafazolli","cross_cats":["math.IT"],"headline":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-14T03:58:16Z","title":"Secure Joint Source-Channel Coding of Multimodal Semantic Sources"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A rate-distortion framework for char- acterizing semantic information,","work_id":"e2f9d116-03c8-4c5c-a5b9-5f6ce017a3bf","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"An indirect rate-distortion characterization for semantic sources: General model and the case of Gaussian observation,","work_id":"839ca4b3-1cc2-4d56-9bea-21cb8472b0da","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Semantic compression with side information: A rate-distortion perspective,","work_id":"50521c5d-7936-4cdd-9f18-2263d48305ea","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Rate-distortion-perception theory for semantic communication","work_id":"ebcad483-1b49-4f5a-8daa-6fe3d92c7e2e","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The role of fidelity in goal-oriented semantic communication: A rate distortion approach,","work_id":"5d780a9e-0122-4e78-8842-256fb941cf15","year":2023}],"snapshot_sha256":"ca73f7f39ef034de53e0c3e6ddffe2f438ec20d9b8b31cf715adf557c9ad4881"},"source":{"id":"2605.14334","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:02:03.066345Z","id":"afa0288d-3ce2-4e62-8da9-f24fde35469a","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper establishes converse and achievability bounds for secure joint source-channel coding of multimodal sources over wiretap channels, with secrecy limits composed of compression level, secret key rate, and channel statistics.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The fundamental secrecy limit for multimodal sources over wiretap channels decomposes into compression level, secret key rate, and wiretap channel statistics.","strongest_claim":"We show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression, the secret key rate, and the statistics of the wiretap channel.","weakest_assumption":"The source consists of i.i.d. samples of an arbitrary non-empty subset of modalities and the channel is discrete memoryless; if the modalities are statistically dependent in ways not captured by the model or the channel has memory, the bounds may not apply."}},"verdict_id":"afa0288d-3ce2-4e62-8da9-f24fde35469a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1c507b5565a451890926719b01da4c7c89c493556586a0f53d088f9cc025475a","target":"record","created_at":"2026-05-17T23:39:08Z","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":"bece49e31d5922f0d27ccecc2a1a1f296afdc2f1e14415d12a618c253a8acb63","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-14T03:58:16Z","title_canon_sha256":"acb8d5662a010bb129c4676d4121018b53d3c2d80ff54ed1760dff5842ab57a0"},"schema_version":"1.0","source":{"id":"2605.14334","kind":"arxiv","version":1}},"canonical_sha256":"ce758a86ed6fa13485963cea2a666f469936d9ca78e0ffd85548714ff2d61eda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce758a86ed6fa13485963cea2a666f469936d9ca78e0ffd85548714ff2d61eda","first_computed_at":"2026-05-17T23:39:08.257097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:08.257097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PD+F8Veq7Reg8trBbovDOsMVg9N4auvRIpBeu/A+h922fp3Y2kzvC7Zlee88Mt141MoXZ86Qyd8u4EAaXPyzDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:08.257800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c507b5565a451890926719b01da4c7c89c493556586a0f53d088f9cc025475a","sha256:76d47bd9f14d02f20821783cd31ac048a6a71d1af2e0b958d763284f2bb7d60b"],"state_sha256":"0d6b77c2ba72ee28506d540d666bc859321fe068388c0fc2af50189385975e62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqothEa8/4gSq+JsqEAbpbWg7oOjxNWdE0mryOeluek64X6BAhI+aF53aA02+ihpQdpoazmotdsqckeDPEvTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:37:02.863423Z","bundle_sha256":"8ae8e39ce606be270e236e54045a5178399101e911ded741d59e22388a8133cd"}}