{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UJ7G6NEA7OUUNCOVBXMLOI2WXB","short_pith_number":"pith:UJ7G6NEA","schema_version":"1.0","canonical_sha256":"a27e6f3480fba94689d50dd8b72356b85400fc48e5255b9e3da6ac3e4760e147","source":{"kind":"arxiv","id":"1711.11096","version":3},"attestation_state":"computed","paper":{"title":"Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Furkan Ercan, Warren J. Gross","submitted_at":"2017-11-29T20:36:43Z","abstract_excerpt":"Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for $5^{\\rm th}$ generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to overcome this issue. On the other hand, SC-Flip has a higher implementation complexity compared to SC due to the required log-likelihood ratio (LLR) selection and sorting process. Moreover, it "},"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":"1711.11096","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:36:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"220b0696ea519ca30fa28298adfc55a94ee0e4ac1aaba54d1dddcb0b52b05612","abstract_canon_sha256":"9a7aba15446903a954da8520f132e19384efaa9348c04172d000c9e9c9952db1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.780557Z","signature_b64":"Jvqg8AB0jI8O7BmK/TQH+AxB1bf05Xa78eRvm/AOjQHxwsuR1O0cJowORp5F3tKXd2h8RDojySjFp/7Z4N5uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27e6f3480fba94689d50dd8b72356b85400fc48e5255b9e3da6ac3e4760e147","last_reissued_at":"2026-05-18T00:04:39.780119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.780119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Furkan Ercan, Warren J. Gross","submitted_at":"2017-11-29T20:36:43Z","abstract_excerpt":"Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for $5^{\\rm th}$ generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to overcome this issue. On the other hand, SC-Flip has a higher implementation complexity compared to SC due to the required log-likelihood ratio (LLR) selection and sorting process. Moreover, it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11096","kind":"arxiv","version":3},"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":"1711.11096","created_at":"2026-05-18T00:04:39.780184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11096v3","created_at":"2026-05-18T00:04:39.780184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11096","created_at":"2026-05-18T00:04:39.780184+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ7G6NEA7OUU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ7G6NEA7OUUNCOV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ7G6NEA","created_at":"2026-05-18T12:31:46.661854+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/UJ7G6NEA7OUUNCOVBXMLOI2WXB","json":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB.json","graph_json":"https://pith.science/api/pith-number/UJ7G6NEA7OUUNCOVBXMLOI2WXB/graph.json","events_json":"https://pith.science/api/pith-number/UJ7G6NEA7OUUNCOVBXMLOI2WXB/events.json","paper":"https://pith.science/paper/UJ7G6NEA"},"agent_actions":{"view_html":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB","download_json":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB.json","view_paper":"https://pith.science/paper/UJ7G6NEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11096&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ7G6NEA7OUUNCOVBXMLOI2WXB/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ7G6NEA7OUUNCOVBXMLOI2WXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB/action/storage_attestation","attest_author":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB/action/author_attestation","sign_citation":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB/action/citation_signature","submit_replication":"https://pith.science/pith/UJ7G6NEA7OUUNCOVBXMLOI2WXB/action/replication_record"}},"created_at":"2026-05-18T00:04:39.780184+00:00","updated_at":"2026-05-18T00:04:39.780184+00:00"}