{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4ZMT353DUDFPRQNYRVHOYKODDC","short_pith_number":"pith:4ZMT353D","schema_version":"1.0","canonical_sha256":"e6593df763a0caf8c1b88d4eec29c3188602233852c67ec4db2f54b99d86796c","source":{"kind":"arxiv","id":"cs/0610112","version":1},"attestation_state":"computed","paper":{"title":"On the Performance of Lossless Joint Source-Channel Coding Based on Linear Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peiliang Qiu, Shengtian Yang","submitted_at":"2006-10-18T23:45:00Z","abstract_excerpt":"A general lossless joint source-channel coding scheme based on linear codes is proposed and then analyzed in this paper. It is shown that a linear code with good joint spectrum can be used to establish limit-approaching joint source-channel coding schemes for arbitrary sources and channels, where the joint spectrum of the code is a generalization of the input-output weight distribution."},"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":"cs/0610112","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T23:45:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9eb61695976d742427f826a53863e9907fe0a53da7669fe9427c6d17cb83ce39","abstract_canon_sha256":"02d728158e93154fe83afc17c8baf39835ee75c4fc5a7d5c42344d6a0f51680b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:05.107799Z","signature_b64":"7dcWFlZWlJhlIow5MAqsTXQRNzccwHzX6Z6a9WwzaYNLbUeB+XexLeN3jjJSxUtqt+NG/NmQqK384SSM9jloDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6593df763a0caf8c1b88d4eec29c3188602233852c67ec4db2f54b99d86796c","last_reissued_at":"2026-05-18T00:58:05.107451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:05.107451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Performance of Lossless Joint Source-Channel Coding Based on Linear Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peiliang Qiu, Shengtian Yang","submitted_at":"2006-10-18T23:45:00Z","abstract_excerpt":"A general lossless joint source-channel coding scheme based on linear codes is proposed and then analyzed in this paper. It is shown that a linear code with good joint spectrum can be used to establish limit-approaching joint source-channel coding schemes for arbitrary sources and channels, where the joint spectrum of the code is a generalization of the input-output weight distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610112","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610112","created_at":"2026-05-18T00:58:05.107507+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610112v1","created_at":"2026-05-18T00:58:05.107507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610112","created_at":"2026-05-18T00:58:05.107507+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZMT353DUDFP","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZMT353DUDFPRQNY","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZMT353D","created_at":"2026-05-18T12:25:53.939244+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/4ZMT353DUDFPRQNYRVHOYKODDC","json":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC.json","graph_json":"https://pith.science/api/pith-number/4ZMT353DUDFPRQNYRVHOYKODDC/graph.json","events_json":"https://pith.science/api/pith-number/4ZMT353DUDFPRQNYRVHOYKODDC/events.json","paper":"https://pith.science/paper/4ZMT353D"},"agent_actions":{"view_html":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC","download_json":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC.json","view_paper":"https://pith.science/paper/4ZMT353D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610112&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZMT353DUDFPRQNYRVHOYKODDC/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZMT353DUDFPRQNYRVHOYKODDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC/action/storage_attestation","attest_author":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC/action/author_attestation","sign_citation":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC/action/citation_signature","submit_replication":"https://pith.science/pith/4ZMT353DUDFPRQNYRVHOYKODDC/action/replication_record"}},"created_at":"2026-05-18T00:58:05.107507+00:00","updated_at":"2026-05-18T00:58:05.107507+00:00"}