{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZWCTTDXYUT5RS4JU2NPOY6OUMJ","short_pith_number":"pith:ZWCTTDXY","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"},"canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","source":{"kind":"arxiv","id":"1305.0547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0547","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0547v1","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0547","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCTTDXYUT5R","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCTTDXYUT5RS4JU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCTTDXY","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZWCTTDXYUT5RS4JU2NPOY6OUMJ","target":"record","payload":{"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"},"canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","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"},"source_kind":"arxiv","source_id":"1305.0547","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fi3+VCEHpvizxSlDmPqv6NdmHk5RQD3GdtuSNAOnfFYCbznSwLs002gHGR2NpGCD6d2jnkbaKqM4X/APQk98Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:11:35.331226Z"},"content_sha256":"e6dcd3be6decd2af209e2667ac99d0783358fda5e7a809be8864e53750a17f0f","schema_version":"1.0","event_id":"sha256:e6dcd3be6decd2af209e2667ac99d0783358fda5e7a809be8864e53750a17f0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZWCTTDXYUT5RS4JU2NPOY6OUMJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3J/QoSgeL7rtTkE+F2xFHnWiR7pyX806drNZmlsvheWnd1QtiAFDIOKql07vi6GOnE1XicXnycJwmoHJgq3kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:11:35.331588Z"},"content_sha256":"38012d37462ef5f64e9e3946adb5c17cf2c98737e1a51171dd65d4d652dcf0fe","schema_version":"1.0","event_id":"sha256:38012d37462ef5f64e9e3946adb5c17cf2c98737e1a51171dd65d4d652dcf0fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/bundle.json","state_url":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T02:11:35Z","links":{"resolver":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ","bundle":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/bundle.json","state":"https://pith.science/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWCTTDXYUT5RS4JU2NPOY6OUMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZWCTTDXYUT5RS4JU2NPOY6OUMJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"607edc154fd34a06c021ed857b09ede8269516679d0f623eff452cb932310ead","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T19:33:10Z","title_canon_sha256":"7c1e70c286525b3ec484474b535f813006e95ea4dad0f4934ce691f1a3881a4a"},"schema_version":"1.0","source":{"id":"1305.0547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0547","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0547v1","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0547","created_at":"2026-05-18T03:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCTTDXYUT5R","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCTTDXYUT5RS4JU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCTTDXY","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:38012d37462ef5f64e9e3946adb5c17cf2c98737e1a51171dd65d4d652dcf0fe","target":"graph","created_at":"2026-05-18T03:26:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anelia Somekh-Baruch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T19:33:10Z","title":"On Achievable Rates for Channels with Mismatched Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0547","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6dcd3be6decd2af209e2667ac99d0783358fda5e7a809be8864e53750a17f0f","target":"record","created_at":"2026-05-18T03:26:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"607edc154fd34a06c021ed857b09ede8269516679d0f623eff452cb932310ead","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T19:33:10Z","title_canon_sha256":"7c1e70c286525b3ec484474b535f813006e95ea4dad0f4934ce691f1a3881a4a"},"schema_version":"1.0","source":{"id":"1305.0547","kind":"arxiv","version":1}},"canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd85398ef8a4fb197134d35eec79d4626f346ddadd5937077c52b16c58972939","first_computed_at":"2026-05-18T03:26:39.885144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:39.885144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pQLrV54lnmKvRHQGhOibgvomVOR0l52cGTuBfWRZZd6KTmOBUgZXqb7ncR367k49/fd/TxEp1jl11Ajo8KTLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:39.885668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6dcd3be6decd2af209e2667ac99d0783358fda5e7a809be8864e53750a17f0f","sha256:38012d37462ef5f64e9e3946adb5c17cf2c98737e1a51171dd65d4d652dcf0fe"],"state_sha256":"b002bcaa01ab6d6e597f08e2a4b38950d1efd07363526b250cb810accad9d747"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YdDFTW7iU+6vyaj+NZ7nsQCFzOQ9+e3EbN9nj85LkeQMNW4Bc6T/wRB+o7lDPSL8bqRPHJlS25jaSwxSqQ/sDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:11:35.333669Z","bundle_sha256":"1d63f80b328a5f0f75ec7981b20308ff68600870fa2ed3deca347d9b5b97bdbc"}}