{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LEYSXY2MXRWVYEKBENLWQDTDJH","short_pith_number":"pith:LEYSXY2M","schema_version":"1.0","canonical_sha256":"59312be34cbc6d5c11412357680e6349e0d477afd48d17bd17de3578af21bfc3","source":{"kind":"arxiv","id":"1507.01255","version":2},"attestation_state":"computed","paper":{"title":"Universal Decoding for Source-Channel Coding with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2015-07-05T18:55:08Z","abstract_excerpt":"We consider a setting of Slepian--Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, assuming first that they are both memoryless. Exact analysis of the random-binning/random-coding error exponent of this universal decoder shows that it is the same as the one achieved by the optimal maximu"},"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":"1507.01255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-05T18:55:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee607dbcbff18aea346fcf7c14397fb5fc40174ed32ea158f15508dcffbfcaeb","abstract_canon_sha256":"b03f7e8093f66e66793c87420b4b4997e47a685a8634fac9d415105829f7c199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:06.259935Z","signature_b64":"pM7ZpEeaTfyhOhmA2ILnBKWT7WwWkU2eYoAlscCNXBzk0rgsJqBzsETV3KvtlCYIpCO0P0ObU4TfVJFAWMiaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59312be34cbc6d5c11412357680e6349e0d477afd48d17bd17de3578af21bfc3","last_reissued_at":"2026-05-18T01:22:06.259469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:06.259469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Decoding for Source-Channel Coding with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2015-07-05T18:55:08Z","abstract_excerpt":"We consider a setting of Slepian--Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, assuming first that they are both memoryless. Exact analysis of the random-binning/random-coding error exponent of this universal decoder shows that it is the same as the one achieved by the optimal maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01255","kind":"arxiv","version":2},"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":"1507.01255","created_at":"2026-05-18T01:22:06.259544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01255v2","created_at":"2026-05-18T01:22:06.259544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01255","created_at":"2026-05-18T01:22:06.259544+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEYSXY2MXRWV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEYSXY2MXRWVYEKB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEYSXY2M","created_at":"2026-05-18T12:29:29.992203+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/LEYSXY2MXRWVYEKBENLWQDTDJH","json":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH.json","graph_json":"https://pith.science/api/pith-number/LEYSXY2MXRWVYEKBENLWQDTDJH/graph.json","events_json":"https://pith.science/api/pith-number/LEYSXY2MXRWVYEKBENLWQDTDJH/events.json","paper":"https://pith.science/paper/LEYSXY2M"},"agent_actions":{"view_html":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH","download_json":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH.json","view_paper":"https://pith.science/paper/LEYSXY2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01255&json=true","fetch_graph":"https://pith.science/api/pith-number/LEYSXY2MXRWVYEKBENLWQDTDJH/graph.json","fetch_events":"https://pith.science/api/pith-number/LEYSXY2MXRWVYEKBENLWQDTDJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH/action/storage_attestation","attest_author":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH/action/author_attestation","sign_citation":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH/action/citation_signature","submit_replication":"https://pith.science/pith/LEYSXY2MXRWVYEKBENLWQDTDJH/action/replication_record"}},"created_at":"2026-05-18T01:22:06.259544+00:00","updated_at":"2026-05-18T01:22:06.259544+00:00"}