{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:32M7EJNI6BH22QN3NMOEXVMBIC","short_pith_number":"pith:32M7EJNI","schema_version":"1.0","canonical_sha256":"de99f225a8f04fad41bb6b1c4bd58140bbfbcc00d24e83405fdaefa2283dce73","source":{"kind":"arxiv","id":"2606.07933","version":1},"attestation_state":"computed","paper":{"title":"Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Mahmood, Harish Viswanathan, Jinfeng Du","submitted_at":"2026-06-06T01:50:58Z","abstract_excerpt":"We analyze the finite-blocklength performance of lossy joint source-channel codes (JSCC) in an unknown-channel framework, where the true channel is unknown but the source distribution is known. We establish achievability results for mismatched-design JSCC, where the code design is based on a channel $Q_{Y|X}$ but deployed over a different channel $P_{Y|X}$. Our mismatched-design achievability result allows nonstationary channel laws and arbitrary standard Borel alphabets for the source, reproduction, channel input and channel output. The achievability bound is given in terms of the rate-distor"},"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":"2606.07933","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-06T01:50:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2d048e059d1ed61ce45c0ac0ae25c5a076db6966a1144f0712987a34c638d69","abstract_canon_sha256":"430c315f17d0bd65791b4bbf5b9f09bc01c0b2d16131916b3eb2d1427c6cf59e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:55.810447Z","signature_b64":"FWuKV2XXk3/W36On9PqWBj0XQAvoV07bt6AAEAcrA7rnpFqdYXM0Vn1wMgNuA3ky+044jfoY0VzgG1Qf/txzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de99f225a8f04fad41bb6b1c4bd58140bbfbcc00d24e83405fdaefa2283dce73","last_reissued_at":"2026-06-09T01:04:55.810042Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:55.810042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Mahmood, Harish Viswanathan, Jinfeng Du","submitted_at":"2026-06-06T01:50:58Z","abstract_excerpt":"We analyze the finite-blocklength performance of lossy joint source-channel codes (JSCC) in an unknown-channel framework, where the true channel is unknown but the source distribution is known. We establish achievability results for mismatched-design JSCC, where the code design is based on a channel $Q_{Y|X}$ but deployed over a different channel $P_{Y|X}$. Our mismatched-design achievability result allows nonstationary channel laws and arbitrary standard Borel alphabets for the source, reproduction, channel input and channel output. The achievability bound is given in terms of the rate-distor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07933","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.07933/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.07933","created_at":"2026-06-09T01:04:55.810099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07933v1","created_at":"2026-06-09T01:04:55.810099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07933","created_at":"2026-06-09T01:04:55.810099+00:00"},{"alias_kind":"pith_short_12","alias_value":"32M7EJNI6BH2","created_at":"2026-06-09T01:04:55.810099+00:00"},{"alias_kind":"pith_short_16","alias_value":"32M7EJNI6BH22QN3","created_at":"2026-06-09T01:04:55.810099+00:00"},{"alias_kind":"pith_short_8","alias_value":"32M7EJNI","created_at":"2026-06-09T01:04:55.810099+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/32M7EJNI6BH22QN3NMOEXVMBIC","json":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC.json","graph_json":"https://pith.science/api/pith-number/32M7EJNI6BH22QN3NMOEXVMBIC/graph.json","events_json":"https://pith.science/api/pith-number/32M7EJNI6BH22QN3NMOEXVMBIC/events.json","paper":"https://pith.science/paper/32M7EJNI"},"agent_actions":{"view_html":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC","download_json":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC.json","view_paper":"https://pith.science/paper/32M7EJNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07933&json=true","fetch_graph":"https://pith.science/api/pith-number/32M7EJNI6BH22QN3NMOEXVMBIC/graph.json","fetch_events":"https://pith.science/api/pith-number/32M7EJNI6BH22QN3NMOEXVMBIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC/action/storage_attestation","attest_author":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC/action/author_attestation","sign_citation":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC/action/citation_signature","submit_replication":"https://pith.science/pith/32M7EJNI6BH22QN3NMOEXVMBIC/action/replication_record"}},"created_at":"2026-06-09T01:04:55.810099+00:00","updated_at":"2026-06-09T01:04:55.810099+00:00"}