{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KINVQ26TV5M3JVRV56YYD52EWE","short_pith_number":"pith:KINVQ26T","schema_version":"1.0","canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","source":{"kind":"arxiv","id":"1711.11093","version":4},"attestation_state":"computed","paper":{"title":"Partitioned Successive-Cancellation Flip 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, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-11-29T20:29:38Z","abstract_excerpt":"Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre error-correction performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List decoding which keeps a list of candidates by running a number of SC decoders in parallel, thus increasing the implementation complexity, and (ii) SC-Flip decoding that relies on a single SC module, and kee"},"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.11093","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5396aacbe35da32b92632e600e8c832139dbcae5271bb4fa4a2fa7da11d4f48","abstract_canon_sha256":"73159fbd546cff1fbabfeaee3621e609f9e0496edb650a718253543691cfb60e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.685805Z","signature_b64":"HN4L9XIlHErUe+tfc7YMYbUR4oAkAMH7ZN3UW/3mRAZviFfAjVJzaaFkhsWofKKvCahp5yWtFT6UoGuWuCFRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","last_reissued_at":"2026-05-18T00:03:56.685087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.685087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioned Successive-Cancellation Flip 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, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-11-29T20:29:38Z","abstract_excerpt":"Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre error-correction performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List decoding which keeps a list of candidates by running a number of SC decoders in parallel, thus increasing the implementation complexity, and (ii) SC-Flip decoding that relies on a single SC module, and kee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11093","kind":"arxiv","version":4},"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.11093","created_at":"2026-05-18T00:03:56.685204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11093v4","created_at":"2026-05-18T00:03:56.685204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11093","created_at":"2026-05-18T00:03:56.685204+00:00"},{"alias_kind":"pith_short_12","alias_value":"KINVQ26TV5M3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KINVQ26TV5M3JVRV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KINVQ26T","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11563","citing_title":"Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE","json":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE.json","graph_json":"https://pith.science/api/pith-number/KINVQ26TV5M3JVRV56YYD52EWE/graph.json","events_json":"https://pith.science/api/pith-number/KINVQ26TV5M3JVRV56YYD52EWE/events.json","paper":"https://pith.science/paper/KINVQ26T"},"agent_actions":{"view_html":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE","download_json":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE.json","view_paper":"https://pith.science/paper/KINVQ26T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11093&json=true","fetch_graph":"https://pith.science/api/pith-number/KINVQ26TV5M3JVRV56YYD52EWE/graph.json","fetch_events":"https://pith.science/api/pith-number/KINVQ26TV5M3JVRV56YYD52EWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/action/storage_attestation","attest_author":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/action/author_attestation","sign_citation":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/action/citation_signature","submit_replication":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/action/replication_record"}},"created_at":"2026-05-18T00:03:56.685204+00:00","updated_at":"2026-05-18T00:03:56.685204+00:00"}