{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:72J7M4ALKEN4WPBMPIQLDBL2LA","short_pith_number":"pith:72J7M4AL","schema_version":"1.0","canonical_sha256":"fe93f6700b511bcb3c2c7a20b1857a5807ae06103f7c52f28a602224742cb238","source":{"kind":"arxiv","id":"2004.05969","version":1},"attestation_state":"computed","paper":{"title":"Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Joachim Neu, Mustafa Cemil Co\\c{s}kun","submitted_at":"2020-04-13T14:42:26Z","abstract_excerpt":"A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased during SC decoding and continues with decoding. Inactivated bits are resolved using information gathered from decoding frozen bits. This decoder leverages the structure of the Hadamard matrix, but can be applied to any linear code by representing it as a polar code with dynamic frozen bits. SCL decoders are partially characterized using density evo"},"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":"2004.05969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-04-13T14:42:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26750ae1253f275c3258a47e15d02176e301ff4e6b63cd9bfa130649ecba1f2c","abstract_canon_sha256":"77c9621812898e5fa07a1cc069bf2247274c5de2d8f56a04a73a3adb9f2dde39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:52.749869Z","signature_b64":"nvnSdlL30imbDbIrBMCwZaOCUY7BAQ18rSKge8+T/p/f9ANy9nadXQrR6h+jCPIfmxfeqj6Rg0xD6u6aZS1vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe93f6700b511bcb3c2c7a20b1857a5807ae06103f7c52f28a602224742cb238","last_reissued_at":"2026-07-05T02:02:52.749383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:52.749383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Joachim Neu, Mustafa Cemil Co\\c{s}kun","submitted_at":"2020-04-13T14:42:26Z","abstract_excerpt":"A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased during SC decoding and continues with decoding. Inactivated bits are resolved using information gathered from decoding frozen bits. This decoder leverages the structure of the Hadamard matrix, but can be applied to any linear code by representing it as a polar code with dynamic frozen bits. SCL decoders are partially characterized using density evo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05969","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.05969/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.05969","created_at":"2026-07-05T02:02:52.749437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05969v1","created_at":"2026-07-05T02:02:52.749437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05969","created_at":"2026-07-05T02:02:52.749437+00:00"},{"alias_kind":"pith_short_12","alias_value":"72J7M4ALKEN4","created_at":"2026-07-05T02:02:52.749437+00:00"},{"alias_kind":"pith_short_16","alias_value":"72J7M4ALKEN4WPBM","created_at":"2026-07-05T02:02:52.749437+00:00"},{"alias_kind":"pith_short_8","alias_value":"72J7M4AL","created_at":"2026-07-05T02:02:52.749437+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/72J7M4ALKEN4WPBMPIQLDBL2LA","json":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA.json","graph_json":"https://pith.science/api/pith-number/72J7M4ALKEN4WPBMPIQLDBL2LA/graph.json","events_json":"https://pith.science/api/pith-number/72J7M4ALKEN4WPBMPIQLDBL2LA/events.json","paper":"https://pith.science/paper/72J7M4AL"},"agent_actions":{"view_html":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA","download_json":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA.json","view_paper":"https://pith.science/paper/72J7M4AL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05969&json=true","fetch_graph":"https://pith.science/api/pith-number/72J7M4ALKEN4WPBMPIQLDBL2LA/graph.json","fetch_events":"https://pith.science/api/pith-number/72J7M4ALKEN4WPBMPIQLDBL2LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA/action/storage_attestation","attest_author":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA/action/author_attestation","sign_citation":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA/action/citation_signature","submit_replication":"https://pith.science/pith/72J7M4ALKEN4WPBMPIQLDBL2LA/action/replication_record"}},"created_at":"2026-07-05T02:02:52.749437+00:00","updated_at":"2026-07-05T02:02:52.749437+00:00"}