{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BILSQ7TTXDCWMHUV62J7V6K6GT","short_pith_number":"pith:BILSQ7TT","schema_version":"1.0","canonical_sha256":"0a17287e73b8c5661e95f693faf95e34fa07cbb2f26cf8aab54463ff7a4e4e41","source":{"kind":"arxiv","id":"1901.06791","version":1},"attestation_state":"computed","paper":{"title":"SC-Fano Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Min-Oh Jeong, Song-Nam Hong","submitted_at":"2019-01-21T04:49:38Z","abstract_excerpt":"In this paper, we present a novel decoding algorithm of a polar code, named SC-Fano decoding, by appropriately incorporating the Fano sequential decoding into the standard successive-cancellation (SC) decoding. The proposed SC-Fano decoding follows the basic procedures of SC decoding with an additional operation to evaluate the reliability (or belief) of a current partial path. Specifically, at every decoding stage, it decides whether to move forward along a current path or move backward to find a more likelihood path. In this way, SC-Fano decoding can address the inherent drawback of SC decod"},"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":"1901.06791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-01-21T04:49:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cdac70e7986e750d903b2bd023c18f12ab7b638ce84e9cce6315ebb9c47dffda","abstract_canon_sha256":"f2d0e100e8590338495896c7bec33f7d3907bf4aca8122bc89e751fb07e5d5f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:42.197048Z","signature_b64":"aB9KQkHGnf2NVeWstXcGUbEXAvObeNJg8VMx7cGSu5k/DP8hOSGw2qzttj0SE6jtWvpcW6sfVkNMfooUPIGIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a17287e73b8c5661e95f693faf95e34fa07cbb2f26cf8aab54463ff7a4e4e41","last_reissued_at":"2026-05-17T23:55:42.196445Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:42.196445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SC-Fano Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Min-Oh Jeong, Song-Nam Hong","submitted_at":"2019-01-21T04:49:38Z","abstract_excerpt":"In this paper, we present a novel decoding algorithm of a polar code, named SC-Fano decoding, by appropriately incorporating the Fano sequential decoding into the standard successive-cancellation (SC) decoding. The proposed SC-Fano decoding follows the basic procedures of SC decoding with an additional operation to evaluate the reliability (or belief) of a current partial path. Specifically, at every decoding stage, it decides whether to move forward along a current path or move backward to find a more likelihood path. In this way, SC-Fano decoding can address the inherent drawback of SC decod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06791","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.06791","created_at":"2026-05-17T23:55:42.196542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06791v1","created_at":"2026-05-17T23:55:42.196542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06791","created_at":"2026-05-17T23:55:42.196542+00:00"},{"alias_kind":"pith_short_12","alias_value":"BILSQ7TTXDCW","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BILSQ7TTXDCWMHUV","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BILSQ7TT","created_at":"2026-05-18T12:33:12.712433+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/BILSQ7TTXDCWMHUV62J7V6K6GT","json":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT.json","graph_json":"https://pith.science/api/pith-number/BILSQ7TTXDCWMHUV62J7V6K6GT/graph.json","events_json":"https://pith.science/api/pith-number/BILSQ7TTXDCWMHUV62J7V6K6GT/events.json","paper":"https://pith.science/paper/BILSQ7TT"},"agent_actions":{"view_html":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT","download_json":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT.json","view_paper":"https://pith.science/paper/BILSQ7TT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06791&json=true","fetch_graph":"https://pith.science/api/pith-number/BILSQ7TTXDCWMHUV62J7V6K6GT/graph.json","fetch_events":"https://pith.science/api/pith-number/BILSQ7TTXDCWMHUV62J7V6K6GT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT/action/storage_attestation","attest_author":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT/action/author_attestation","sign_citation":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT/action/citation_signature","submit_replication":"https://pith.science/pith/BILSQ7TTXDCWMHUV62J7V6K6GT/action/replication_record"}},"created_at":"2026-05-17T23:55:42.196542+00:00","updated_at":"2026-05-17T23:55:42.196542+00:00"}