{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:24TRZG524CRGTGSVVPAHCLOBY7","short_pith_number":"pith:24TRZG52","canonical_record":{"source":{"id":"1208.3091","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a9542496c0002dd36f7202130c3e2905df9765560afc88029a2ee4efc1e2da1","abstract_canon_sha256":"10f449d3cddc05b3022fe5465f9cfc0bdc5279a1d531eec4ab2ead55fd360858"},"schema_version":"1.0"},"canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","source":{"kind":"arxiv","id":"1208.3091","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3091","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3091v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3091","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"24TRZG524CRG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"24TRZG524CRGTGSV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"24TRZG52","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:24TRZG524CRGTGSVVPAHCLOBY7","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3091","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a9542496c0002dd36f7202130c3e2905df9765560afc88029a2ee4efc1e2da1","abstract_canon_sha256":"10f449d3cddc05b3022fe5465f9cfc0bdc5279a1d531eec4ab2ead55fd360858"},"schema_version":"1.0"},"canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.579782Z","signature_b64":"gmsM3qL2u1Ai/i7UkHnA/9ROQ1JDoaUCNcKXgccDNsN0d7NrcaLvyIErc4UGR/qZxacIWOhb7fW1DDTfooGyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","last_reissued_at":"2026-05-18T03:48:45.578947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.578947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3091","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rWR+T8wI0uzoujwz88By8MH7QlM+IGEdydzoCz1J+pLNEiEkngoqcSLLeItbOAuncaeYZqfEq2XGHwk1oXsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:10:28.741098Z"},"content_sha256":"dbc1b6a8a010a04109aaabeeec7ce539ac730df47745f74b60655c42cbc08165","schema_version":"1.0","event_id":"sha256:dbc1b6a8a010a04109aaabeeec7ce539ac730df47745f74b60655c42cbc08165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:24TRZG524CRGTGSVVPAHCLOBY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen","submitted_at":"2012-08-15T11:05:53Z","abstract_excerpt":"In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3091","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03nBQL53fkEpXjgFrmERogrSZ4WO8Q0X6iWQnqU5QTAjc4xvyV5LMGqXAKwa3W8tFEIymgUCkgbwfzj77O+RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:10:28.741498Z"},"content_sha256":"1a42b802163bd9bd43272ea9d323d25df4aba7bae47d4d482987b44a119cc044","schema_version":"1.0","event_id":"sha256:1a42b802163bd9bd43272ea9d323d25df4aba7bae47d4d482987b44a119cc044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/bundle.json","state_url":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24TRZG524CRGTGSVVPAHCLOBY7/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-28T11:10:28Z","links":{"resolver":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7","bundle":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/bundle.json","state":"https://pith.science/pith/24TRZG524CRGTGSVVPAHCLOBY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24TRZG524CRGTGSVVPAHCLOBY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:24TRZG524CRGTGSVVPAHCLOBY7","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":"10f449d3cddc05b3022fe5465f9cfc0bdc5279a1d531eec4ab2ead55fd360858","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","title_canon_sha256":"3a9542496c0002dd36f7202130c3e2905df9765560afc88029a2ee4efc1e2da1"},"schema_version":"1.0","source":{"id":"1208.3091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3091","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3091v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3091","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"24TRZG524CRG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"24TRZG524CRGTGSV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"24TRZG52","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:1a42b802163bd9bd43272ea9d323d25df4aba7bae47d4d482987b44a119cc044","target":"graph","created_at":"2026-05-18T03:48: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":"In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which can pass CRC. Simulation shows that the adaptive SC-List decoder provides significant complexity reduction. We also demonstrate that polar code (2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder with very large list size can achieve a frame error rate FER=0.001 at Eb/No=1.1dB, which is about 0.2dB from the information theoretic lim","authors_text":"Bin Li, David Tse, Hui Shen","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","title":"An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3091","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:dbc1b6a8a010a04109aaabeeec7ce539ac730df47745f74b60655c42cbc08165","target":"record","created_at":"2026-05-18T03:48: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":"10f449d3cddc05b3022fe5465f9cfc0bdc5279a1d531eec4ab2ead55fd360858","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T11:05:53Z","title_canon_sha256":"3a9542496c0002dd36f7202130c3e2905df9765560afc88029a2ee4efc1e2da1"},"schema_version":"1.0","source":{"id":"1208.3091","kind":"arxiv","version":1}},"canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7271c9bbae0a2699a55abc0712dc1c7dba921998392491549332aebbaf909ed","first_computed_at":"2026-05-18T03:48:45.578947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:45.578947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmsM3qL2u1Ai/i7UkHnA/9ROQ1JDoaUCNcKXgccDNsN0d7NrcaLvyIErc4UGR/qZxacIWOhb7fW1DDTfooGyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:45.579782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbc1b6a8a010a04109aaabeeec7ce539ac730df47745f74b60655c42cbc08165","sha256:1a42b802163bd9bd43272ea9d323d25df4aba7bae47d4d482987b44a119cc044"],"state_sha256":"157421f01691f799549fc9c527b96bbf8db3cb7d34cfbba86982588d354daac4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDjsBwWrdWoeNZJRZgcE3+YslMffgxULbTIK5x4YNqcarRzFWHbZAd8fyAqyinGLe5nsnWp7v6NDJvfDom+dDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:10:28.743551Z","bundle_sha256":"bf89bc5cc0512f8840e96388dc37e1d61e33da930a388042bacdbfe1dbe92662"}}