{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J26QEUZ7LXCPZ6P7P574IYH5MY","short_pith_number":"pith:J26QEUZ7","canonical_record":{"source":{"id":"1303.2379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-10T21:44:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30ff6adcb810dcca199dcf18f6674e47dceeee12123ea4093882f9dbf60b5e90","abstract_canon_sha256":"c7ff72cfd6393422ad43db08773e29a60cf0eb37001a827fce13db7a18850061"},"schema_version":"1.0"},"canonical_sha256":"4ebd02533f5dc4fcf9ff7f7fc460fd661efe215c49a01d679b2586c64320025c","source":{"kind":"arxiv","id":"1303.2379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2379","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2379v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2379","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"J26QEUZ7LXCP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J26QEUZ7LXCPZ6P7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J26QEUZ7","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J26QEUZ7LXCPZ6P7P574IYH5MY","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-10T21:44:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30ff6adcb810dcca199dcf18f6674e47dceeee12123ea4093882f9dbf60b5e90","abstract_canon_sha256":"c7ff72cfd6393422ad43db08773e29a60cf0eb37001a827fce13db7a18850061"},"schema_version":"1.0"},"canonical_sha256":"4ebd02533f5dc4fcf9ff7f7fc460fd661efe215c49a01d679b2586c64320025c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:45.737127Z","signature_b64":"6QObT1uYVBLEJYvoZYzppRRChC3QGCoQiTQHg2pbssEvRBkKr1cv0pW/I4X/ER3d5PojX1dJF3pEyTsGFti4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebd02533f5dc4fcf9ff7f7fc460fd661efe215c49a01d679b2586c64320025c","last_reissued_at":"2026-05-18T03:25:45.736344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:45.736344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2379","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-18T03:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHKGE5Ng7M+df5c5F6XPtYnMvLxIfWbTGIuljxXKMha4IBkBSv2VK1nRE9nS7ihp8gFPp/OlGxudjzfbxaQWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:02:59.219988Z"},"content_sha256":"b0d9a3d3673698b1e76185af50cb720e80a25c107440f56af92db84deed9d56f","schema_version":"1.0","event_id":"sha256:b0d9a3d3673698b1e76185af50cb720e80a25c107440f56af92db84deed9d56f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J26QEUZ7LXCPZ6P7P574IYH5MY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditions for Robustness of Polar Codes in the Presence of Channel Mismatch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mine Alsan","submitted_at":"2013-03-10T21:44:08Z","abstract_excerpt":"A challenging problem related to the design of polar codes is \"robustness against channel parameter variations\" as stated in Ar{\\i}kan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as a mismatch decoding problem. We propose conditions which ensure a polar encoder/decoder designed for a mismatched B-DMC can be used to communicate reliably. In particular, the analysis shows that the original polar code construction method is robust over the class of binary symmetric channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2379","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-18T03:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcuI3NHBtiuG8Gg4OPou9wGg8sHsFWyXCyY16exklegzibTroAuuWwar5njuxfMYG3bYcDE3CfSlUBLQGbhFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:02:59.220714Z"},"content_sha256":"e8f5233f4bc26ac273434f61612cc70ec4d248910a515c70dce7ca21d815c113","schema_version":"1.0","event_id":"sha256:e8f5233f4bc26ac273434f61612cc70ec4d248910a515c70dce7ca21d815c113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/bundle.json","state_url":"https://pith.science/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/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-08T18:02:59Z","links":{"resolver":"https://pith.science/pith/J26QEUZ7LXCPZ6P7P574IYH5MY","bundle":"https://pith.science/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/bundle.json","state":"https://pith.science/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J26QEUZ7LXCPZ6P7P574IYH5MY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J26QEUZ7LXCPZ6P7P574IYH5MY","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":"c7ff72cfd6393422ad43db08773e29a60cf0eb37001a827fce13db7a18850061","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-10T21:44:08Z","title_canon_sha256":"30ff6adcb810dcca199dcf18f6674e47dceeee12123ea4093882f9dbf60b5e90"},"schema_version":"1.0","source":{"id":"1303.2379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2379","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2379v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2379","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"J26QEUZ7LXCP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J26QEUZ7LXCPZ6P7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J26QEUZ7","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:e8f5233f4bc26ac273434f61612cc70ec4d248910a515c70dce7ca21d815c113","target":"graph","created_at":"2026-05-18T03:25: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":"A challenging problem related to the design of polar codes is \"robustness against channel parameter variations\" as stated in Ar{\\i}kan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as a mismatch decoding problem. We propose conditions which ensure a polar encoder/decoder designed for a mismatched B-DMC can be used to communicate reliably. In particular, the analysis shows that the original polar code construction method is robust over the class of binary symmetric channels.","authors_text":"Mine Alsan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-10T21:44:08Z","title":"Conditions for Robustness of Polar Codes in the Presence of Channel Mismatch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2379","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:b0d9a3d3673698b1e76185af50cb720e80a25c107440f56af92db84deed9d56f","target":"record","created_at":"2026-05-18T03:25: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":"c7ff72cfd6393422ad43db08773e29a60cf0eb37001a827fce13db7a18850061","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-10T21:44:08Z","title_canon_sha256":"30ff6adcb810dcca199dcf18f6674e47dceeee12123ea4093882f9dbf60b5e90"},"schema_version":"1.0","source":{"id":"1303.2379","kind":"arxiv","version":2}},"canonical_sha256":"4ebd02533f5dc4fcf9ff7f7fc460fd661efe215c49a01d679b2586c64320025c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ebd02533f5dc4fcf9ff7f7fc460fd661efe215c49a01d679b2586c64320025c","first_computed_at":"2026-05-18T03:25:45.736344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:45.736344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6QObT1uYVBLEJYvoZYzppRRChC3QGCoQiTQHg2pbssEvRBkKr1cv0pW/I4X/ER3d5PojX1dJF3pEyTsGFti4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:45.737127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d9a3d3673698b1e76185af50cb720e80a25c107440f56af92db84deed9d56f","sha256:e8f5233f4bc26ac273434f61612cc70ec4d248910a515c70dce7ca21d815c113"],"state_sha256":"ceda639d519af661d772078e0946bdba96a6f4d39815e05ba4e40ada69735a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzpUFrLDfnGZfmnHS68iwY6fGzEK5wJ2aZa8YAzbYh+qc2w/UIo5qAQBLmDm4FF8rDReMJGLQQ1l8njEBDqvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:02:59.224560Z","bundle_sha256":"f9d7caa8469bf10007a56226a562a2d63c08619e9a67b64ce386ee987ca2cfd8"}}