{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BXQ2B3SSBWQISDJ5HTA2PVZCUV","short_pith_number":"pith:BXQ2B3SS","schema_version":"1.0","canonical_sha256":"0de1a0ee520da0890d3d3cc1a7d722a542d1e5ae1fc08519e6fde24f62d5b453","source":{"kind":"arxiv","id":"2605.00255","version":1},"attestation_state":"computed","paper":{"title":"Sequential Automorphism Ensemble Decoding with Early Stopping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A sequential activation scheme with early stopping thresholds cuts the complexity of automorphism ensemble decoding by 6 to 22 times while keeping block error rates almost unchanged.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bassant Selim, Charles Pillet, Fran\\c{c}ois Leduc-Primeau, Pascal Giard","submitted_at":"2026-04-30T21:37:54Z","abstract_excerpt":"In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$, simula"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.00255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-04-30T21:37:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"05d78922c15b68d66ff19138d9c3c2145693508d6c6706462aab3162931fcbd8","abstract_canon_sha256":"81205dc1807c61591ed273edb420d159c00ba981b640ff6b09beec329e2c16af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T17:03:39.766885Z","signature_b64":"ZB43C1K3DD8YS4K9E/9fAM3ULetWCVcRz9hxdp9foeJSJHHrT6L4vL/Q9ZWzuRxXTyzjc+YTPRuOPgau+9fKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de1a0ee520da0890d3d3cc1a7d722a542d1e5ae1fc08519e6fde24f62d5b453","last_reissued_at":"2026-05-21T17:03:39.764556Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T17:03:39.764556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Automorphism Ensemble Decoding with Early Stopping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A sequential activation scheme with early stopping thresholds cuts the complexity of automorphism ensemble decoding by 6 to 22 times while keeping block error rates almost unchanged.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bassant Selim, Charles Pillet, Fran\\c{c}ois Leduc-Primeau, Pascal Giard","submitted_at":"2026-04-30T21:37:54Z","abstract_excerpt":"In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$, simula"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For various code parameters and a BLER below 10^{-3}, simulation results show that average decoding complexity is reduced by a factor of at least 6×, and up to 22×, compared to the original AED complexity, with a negligible degradation in BLER.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the observed correlation between the SC path metric and the final decoding outcome is strong enough and stable enough across code parameters that pre-optimized thresholds chosen on one set of simulations will continue to satisfy the BLER constraint on unseen data without requiring per-instance re-tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Sequential activation with early termination thresholds for automorphism ensemble SC decoders reduces average complexity by 6x to 22x at BLER below 10^{-3} with negligible error-rate loss.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A sequential activation scheme with early stopping thresholds cuts the complexity of automorphism ensemble decoding by 6 to 22 times while keeping block error rates almost unchanged.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1922da497a3479828830ad4db0897d87523ccd51d8e4d3d996153c9d0edd5ad6"},"source":{"id":"2605.00255","kind":"arxiv","version":1},"verdict":{"id":"21acee6d-c948-4746-87e5-15ef45be052e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T19:25:43.563344Z","strongest_claim":"For various code parameters and a BLER below 10^{-3}, simulation results show that average decoding complexity is reduced by a factor of at least 6×, and up to 22×, compared to the original AED complexity, with a negligible degradation in BLER.","one_line_summary":"Sequential activation with early termination thresholds for automorphism ensemble SC decoders reduces average complexity by 6x to 22x at BLER below 10^{-3} with negligible error-rate loss.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the observed correlation between the SC path metric and the final decoding outcome is strong enough and stable enough across code parameters that pre-optimized thresholds chosen on one set of simulations will continue to satisfy the BLER constraint on unseen data without requiring per-instance re-tuning.","pith_extraction_headline":"A sequential activation scheme with early stopping thresholds cuts the complexity of automorphism ensemble decoding by 6 to 22 times while keeping block error rates almost unchanged."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00255/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T20:35:40.875643Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:22:43.934244Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9510f6aad214c87405d67c331388be8474addf15ddcbb33d785a3cae2d3b7b96"},"references":{"count":21,"sample":[{"doi":"","year":1954,"title":"A class of multiple-error-correcting codes and the decoding scheme,","work_id":"","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1954,"title":"Application of boolean algebra to switching circuit design and to error detection,","work_id":"","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Channel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","work_id":"","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"On the efficiency of polar-like decoding for symmetric codes,","work_id":"","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Automorphism ensemble decoding of Reed-Muller codes,","work_id":"","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":2,"snapshot_sha256":"c31790c96f3c0184d3c023fd71428b149f5b29d04aaea762b8b7e2dacb7b0efc","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":"2605.00255","created_at":"2026-05-21T17:03:39.764670+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.00255v1","created_at":"2026-05-21T17:03:39.764670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00255","created_at":"2026-05-21T17:03:39.764670+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXQ2B3SSBWQI","created_at":"2026-05-21T17:03:39.764670+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXQ2B3SSBWQISDJ5","created_at":"2026-05-21T17:03:39.764670+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXQ2B3SS","created_at":"2026-05-21T17:03:39.764670+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/BXQ2B3SSBWQISDJ5HTA2PVZCUV","json":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV.json","graph_json":"https://pith.science/api/pith-number/BXQ2B3SSBWQISDJ5HTA2PVZCUV/graph.json","events_json":"https://pith.science/api/pith-number/BXQ2B3SSBWQISDJ5HTA2PVZCUV/events.json","paper":"https://pith.science/paper/BXQ2B3SS"},"agent_actions":{"view_html":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV","download_json":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV.json","view_paper":"https://pith.science/paper/BXQ2B3SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.00255&json=true","fetch_graph":"https://pith.science/api/pith-number/BXQ2B3SSBWQISDJ5HTA2PVZCUV/graph.json","fetch_events":"https://pith.science/api/pith-number/BXQ2B3SSBWQISDJ5HTA2PVZCUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV/action/storage_attestation","attest_author":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV/action/author_attestation","sign_citation":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV/action/citation_signature","submit_replication":"https://pith.science/pith/BXQ2B3SSBWQISDJ5HTA2PVZCUV/action/replication_record"}},"created_at":"2026-05-21T17:03:39.764670+00:00","updated_at":"2026-05-21T17:03:39.764670+00:00"}