{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3KR4OLT2WI62IBLV7WMZGKSTB","short_pith_number":"pith:E3KR4OLT","canonical_record":{"source":{"id":"1610.07297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T06:59:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc62eb9dfe1c50daca209d0b9cac7221ee1d6de25a963bac3bf3ed3e882bf027","abstract_canon_sha256":"7a476fbe2124c7ae71c0793f9f6211824c75647b74a7231856c74fd16469775c"},"schema_version":"1.0"},"canonical_sha256":"26d51e3973d591ed202bafeccc995298778aa167546d5ef2381aaa93e4e958f8","source":{"kind":"arxiv","id":"1610.07297","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07297","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07297v2","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07297","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"E3KR4OLT2WI6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3KR4OLT2WI62IBL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3KR4OLT","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3KR4OLT2WI62IBLV7WMZGKSTB","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T06:59:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc62eb9dfe1c50daca209d0b9cac7221ee1d6de25a963bac3bf3ed3e882bf027","abstract_canon_sha256":"7a476fbe2124c7ae71c0793f9f6211824c75647b74a7231856c74fd16469775c"},"schema_version":"1.0"},"canonical_sha256":"26d51e3973d591ed202bafeccc995298778aa167546d5ef2381aaa93e4e958f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:45.693359Z","signature_b64":"4+EQv7zT6ip+64SCL5rrSPEH31UwQoLUeRqW3RbC72krkxDzt4UdFUWcuPU8uXhkxIzrsVJ2lQJGKY1aN2VdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d51e3973d591ed202bafeccc995298778aa167546d5ef2381aaa93e4e958f8","last_reissued_at":"2026-05-18T00:16:45.692666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:45.692666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07297","source_version":2,"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-18T00:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMjMFxs7pJyawrtY4ObW9QNNx3SyR8wzklT1fysMsW/8NxG9IHn0vxTiMaiRpkWyavn/XdRjCzb4g0z0pfNTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:33.837358Z"},"content_sha256":"f96ea875c4d9e4f01d478f52365a998022f24a686a4ca27c09ccfcde93d8d7dc","schema_version":"1.0","event_id":"sha256:f96ea875c4d9e4f01d478f52365a998022f24a686a4ca27c09ccfcde93d8d7dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3KR4OLT2WI62IBLV7WMZGKSTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Channel capacity of polar coding with a given polar mismatched successive cancellation decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mine Alsan","submitted_at":"2016-10-24T06:59:45Z","abstract_excerpt":"Ar{\\i}kan's polar coding, is by now a well studied technique that allows achieving the symmetric capacity of binary input memoryless channels with low complexity encoding and decoding, provided that the polar decoding architecture is used and the decoding metric is matched to the true channel. In this paper, we analyze communication rates that are achievable when the polar coding/decoding architecture is used with the decoder using an incorrect model of the channel. We define the `polar mismatched capacity' as an analogue of the classical mismatched capacity, give an expression for it, and der"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07297","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"},"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-18T00:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGKL9rmX1LhTD9Ltgsfia1iqkMT9Nqbyt6Gu14OGRS8QKU0E0G6SNXwUni4s+nBTHNeGEY97xnVPgQeNo3L6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:33.838061Z"},"content_sha256":"8282925c6966fcc6bb470b16c9d24efeaca9bcfd9e47badac8e9c84975de2c6e","schema_version":"1.0","event_id":"sha256:8282925c6966fcc6bb470b16c9d24efeaca9bcfd9e47badac8e9c84975de2c6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/bundle.json","state_url":"https://pith.science/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/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-06-08T15:38:33Z","links":{"resolver":"https://pith.science/pith/E3KR4OLT2WI62IBLV7WMZGKSTB","bundle":"https://pith.science/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/bundle.json","state":"https://pith.science/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3KR4OLT2WI62IBLV7WMZGKSTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3KR4OLT2WI62IBLV7WMZGKSTB","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":"7a476fbe2124c7ae71c0793f9f6211824c75647b74a7231856c74fd16469775c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T06:59:45Z","title_canon_sha256":"bc62eb9dfe1c50daca209d0b9cac7221ee1d6de25a963bac3bf3ed3e882bf027"},"schema_version":"1.0","source":{"id":"1610.07297","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07297","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07297v2","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07297","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"E3KR4OLT2WI6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3KR4OLT2WI62IBL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3KR4OLT","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:8282925c6966fcc6bb470b16c9d24efeaca9bcfd9e47badac8e9c84975de2c6e","target":"graph","created_at":"2026-05-18T00:16:45Z","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":"Ar{\\i}kan's polar coding, is by now a well studied technique that allows achieving the symmetric capacity of binary input memoryless channels with low complexity encoding and decoding, provided that the polar decoding architecture is used and the decoding metric is matched to the true channel. In this paper, we analyze communication rates that are achievable when the polar coding/decoding architecture is used with the decoder using an incorrect model of the channel. We define the `polar mismatched capacity' as an analogue of the classical mismatched capacity, give an expression for it, and der","authors_text":"Mine Alsan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T06:59:45Z","title":"Channel capacity of polar coding with a given polar mismatched successive cancellation decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07297","kind":"arxiv","version":2},"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:f96ea875c4d9e4f01d478f52365a998022f24a686a4ca27c09ccfcde93d8d7dc","target":"record","created_at":"2026-05-18T00:16:45Z","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":"7a476fbe2124c7ae71c0793f9f6211824c75647b74a7231856c74fd16469775c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-24T06:59:45Z","title_canon_sha256":"bc62eb9dfe1c50daca209d0b9cac7221ee1d6de25a963bac3bf3ed3e882bf027"},"schema_version":"1.0","source":{"id":"1610.07297","kind":"arxiv","version":2}},"canonical_sha256":"26d51e3973d591ed202bafeccc995298778aa167546d5ef2381aaa93e4e958f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d51e3973d591ed202bafeccc995298778aa167546d5ef2381aaa93e4e958f8","first_computed_at":"2026-05-18T00:16:45.692666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:45.692666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4+EQv7zT6ip+64SCL5rrSPEH31UwQoLUeRqW3RbC72krkxDzt4UdFUWcuPU8uXhkxIzrsVJ2lQJGKY1aN2VdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:45.693359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07297","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f96ea875c4d9e4f01d478f52365a998022f24a686a4ca27c09ccfcde93d8d7dc","sha256:8282925c6966fcc6bb470b16c9d24efeaca9bcfd9e47badac8e9c84975de2c6e"],"state_sha256":"4cfe072a0ac8839647a317d697b220c3fa4e43e611cb92c727b8668c3d0dbaee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dre8mRF3t+3Gq13D4qTVvyqLzRKhrL+6p+Qu4hzblQ6M8vmCA37msT9t2cYSb27J09RoU3eM0O2Z9ZubYPvBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:38:33.841769Z","bundle_sha256":"36ad9cc70963bfa9abdab2cd2ef4ecb68eb7474062519901293ae7aacf57b69b"}}