{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZWCTTDXYUT5RS4JU2NPOY6OUMJ","short_pith_number":"pith:ZWCTTDXY","schema_version":"1.0","canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","source":{"kind":"arxiv","id":"1305.0547","version":1},"attestation_state":"computed","paper":{"title":"On Achievable Rates for Channels with Mismatched Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anelia Somekh-Baruch","submitted_at":"2013-05-02T19:33:10Z","abstract_excerpt":"The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods: superposition coding and random binning. The inner bounds are derived by analyzing the average error probability of the code ensemble for both methods and by a tight characterization of the resulting error exponents. Random coding converse theorems are also derived. A comparison of the achievable regions shows that in the matched case, random binning performs a"},"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":"1305.0547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T19:33:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c1e70c286525b3ec484474b535f813006e95ea4dad0f4934ce691f1a3881a4a","abstract_canon_sha256":"607edc154fd34a06c021ed857b09ede8269516679d0f623eff452cb932310ead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:39.885668Z","signature_b64":"pQLrV54lnmKvRHQGhOibgvomVOR0l52cGTuBfWRZZd6KTmOBUgZXqb7ncR367k49/fd/TxEp1jl11Ajo8KTLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","last_reissued_at":"2026-05-18T03:26:39.885144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:39.885144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Achievable Rates for Channels with Mismatched Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anelia Somekh-Baruch","submitted_at":"2013-05-02T19:33:10Z","abstract_excerpt":"The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods: superposition coding and random binning. The inner bounds are derived by analyzing the average error probability of the code ensemble for both methods and by a tight characterization of the resulting error exponents. Random coding converse theorems are also derived. A comparison of the achievable regions shows that in the matched case, random binning performs a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0547","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":"1305.0547","created_at":"2026-05-18T03:26:39.885230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0547v1","created_at":"2026-05-18T03:26:39.885230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0547","created_at":"2026-05-18T03:26:39.885230+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWCTTDXYUT5R","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWCTTDXYUT5RS4JU","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWCTTDXY","created_at":"2026-05-18T12:28:09.283467+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/ZWCTTDXYUT5RS4JU2NPOY6OUMJ","json":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ.json","graph_json":"https://pith.science/api/pith-number/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/graph.json","events_json":"https://pith.science/api/pith-number/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/events.json","paper":"https://pith.science/paper/ZWCTTDXY"},"agent_actions":{"view_html":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ","download_json":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ.json","view_paper":"https://pith.science/paper/ZWCTTDXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0547&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/action/replication_record"}},"created_at":"2026-05-18T03:26:39.885230+00:00","updated_at":"2026-05-18T03:26:39.885230+00:00"}