{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OVF6RGFSJMAZZNOY6PENNAAH5U","short_pith_number":"pith:OVF6RGFS","schema_version":"1.0","canonical_sha256":"754be898b24b019cb5d8f3c8d68007ed2422fea6b766141556d6db3d70bc326c","source":{"kind":"arxiv","id":"1808.03616","version":2},"attestation_state":"computed","paper":{"title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","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":"2018-08-10T16:47:47Z","abstract_excerpt":"The interest in polar codes has been increasing significantly since their adoption for use in the 5$^{\\rm th}$ generation wireless systems standard. Successive cancellation (SC) decoding algorithm has low implementation complexity, but yields mediocre error-correction performance at the code lengths of interest. SC-Flip algorithm improves the error-correction performance of SC by identifying possibly erroneous decisions made by SC and re-iterates after flipping one bit. It was recently shown that only a portion of bit-channels are most likely to be in error. In this work, we investigate the av"},"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":"1808.03616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:47:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6dfa071ba0da4d560fc06facf473a151de9705f24f9b7c11e33dc78dd3568a79","abstract_canon_sha256":"6ae937bd442c9df9e9133fcf2b9896c5e4bf65c7b0d7114046097591b065c4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.137046Z","signature_b64":"TC3MTkoanHDu7ydyS8cJ/w1J+urAYWlpTjn71p50w2l7/VuONGNo5sUVI4dArc0VN3SAP9FqGT5JdO2JiczQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"754be898b24b019cb5d8f3c8d68007ed2422fea6b766141556d6db3d70bc326c","last_reissued_at":"2026-05-18T00:04:39.136504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.136504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","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":"2018-08-10T16:47:47Z","abstract_excerpt":"The interest in polar codes has been increasing significantly since their adoption for use in the 5$^{\\rm th}$ generation wireless systems standard. Successive cancellation (SC) decoding algorithm has low implementation complexity, but yields mediocre error-correction performance at the code lengths of interest. SC-Flip algorithm improves the error-correction performance of SC by identifying possibly erroneous decisions made by SC and re-iterates after flipping one bit. It was recently shown that only a portion of bit-channels are most likely to be in error. In this work, we investigate the av"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03616","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03616","created_at":"2026-05-18T00:04:39.136581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03616v2","created_at":"2026-05-18T00:04:39.136581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03616","created_at":"2026-05-18T00:04:39.136581+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVF6RGFSJMAZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVF6RGFSJMAZZNOY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVF6RGFS","created_at":"2026-05-18T12:32:43.782077+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/OVF6RGFSJMAZZNOY6PENNAAH5U","json":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U.json","graph_json":"https://pith.science/api/pith-number/OVF6RGFSJMAZZNOY6PENNAAH5U/graph.json","events_json":"https://pith.science/api/pith-number/OVF6RGFSJMAZZNOY6PENNAAH5U/events.json","paper":"https://pith.science/paper/OVF6RGFS"},"agent_actions":{"view_html":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U","download_json":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U.json","view_paper":"https://pith.science/paper/OVF6RGFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03616&json=true","fetch_graph":"https://pith.science/api/pith-number/OVF6RGFSJMAZZNOY6PENNAAH5U/graph.json","fetch_events":"https://pith.science/api/pith-number/OVF6RGFSJMAZZNOY6PENNAAH5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U/action/storage_attestation","attest_author":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U/action/author_attestation","sign_citation":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U/action/citation_signature","submit_replication":"https://pith.science/pith/OVF6RGFSJMAZZNOY6PENNAAH5U/action/replication_record"}},"created_at":"2026-05-18T00:04:39.136581+00:00","updated_at":"2026-05-18T00:04:39.136581+00:00"}