{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CI4XC4SKLUTLVCMG3MZVPRSPUW","short_pith_number":"pith:CI4XC4SK","schema_version":"1.0","canonical_sha256":"123971724a5d26ba8986db3357c64fa59e5cdeb241c5b270b5cc5c50c463357f","source":{"kind":"arxiv","id":"1410.8714","version":3},"attestation_state":"computed","paper":{"title":"Multi-Class Source-Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adri\\`a Tauste Campo, Albert Guill\\'en i F\\`abregas, Alfonso Martinez, Boris D. Kudryashov, Gonzalo Vazquez-Vilar, Irina E. Bocharova","submitted_at":"2014-10-31T12:04:04Z","abstract_excerpt":"This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the numbe"},"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":"1410.8714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T12:04:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b132ff8829dd060e1728591612fd1e516f9c341d7c86239ca0f96fc7e16d6b77","abstract_canon_sha256":"984ecfb65ba24cc4091ea675ebee779ee307f0f3d0504f0c261fe65d35125d22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.513804Z","signature_b64":"C7S+n3VK8Ia96dd2wHFC3ocXF/e5kTdJHW4cKvDMSFIgun9M+nr4kqFcPy+GAYEHmI2zQdyvzv4HXl2mmJrpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"123971724a5d26ba8986db3357c64fa59e5cdeb241c5b270b5cc5c50c463357f","last_reissued_at":"2026-05-18T00:58:36.513044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.513044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Class Source-Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adri\\`a Tauste Campo, Albert Guill\\'en i F\\`abregas, Alfonso Martinez, Boris D. Kudryashov, Gonzalo Vazquez-Vilar, Irina E. Bocharova","submitted_at":"2014-10-31T12:04:04Z","abstract_excerpt":"This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8714","kind":"arxiv","version":3},"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":"1410.8714","created_at":"2026-05-18T00:58:36.513147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8714v3","created_at":"2026-05-18T00:58:36.513147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8714","created_at":"2026-05-18T00:58:36.513147+00:00"},{"alias_kind":"pith_short_12","alias_value":"CI4XC4SKLUTL","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CI4XC4SKLUTLVCMG","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CI4XC4SK","created_at":"2026-05-18T12:28:22.404517+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/CI4XC4SKLUTLVCMG3MZVPRSPUW","json":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW.json","graph_json":"https://pith.science/api/pith-number/CI4XC4SKLUTLVCMG3MZVPRSPUW/graph.json","events_json":"https://pith.science/api/pith-number/CI4XC4SKLUTLVCMG3MZVPRSPUW/events.json","paper":"https://pith.science/paper/CI4XC4SK"},"agent_actions":{"view_html":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW","download_json":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW.json","view_paper":"https://pith.science/paper/CI4XC4SK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8714&json=true","fetch_graph":"https://pith.science/api/pith-number/CI4XC4SKLUTLVCMG3MZVPRSPUW/graph.json","fetch_events":"https://pith.science/api/pith-number/CI4XC4SKLUTLVCMG3MZVPRSPUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW/action/storage_attestation","attest_author":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW/action/author_attestation","sign_citation":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW/action/citation_signature","submit_replication":"https://pith.science/pith/CI4XC4SKLUTLVCMG3MZVPRSPUW/action/replication_record"}},"created_at":"2026-05-18T00:58:36.513147+00:00","updated_at":"2026-05-18T00:58:36.513147+00:00"}