{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BXQ2B3SSBWQISDJ5HTA2PVZCUV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"81205dc1807c61591ed273edb420d159c00ba981b640ff6b09beec329e2c16af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-04-30T21:37:54Z","title_canon_sha256":"05d78922c15b68d66ff19138d9c3c2145693508d6c6706462aab3162931fcbd8"},"schema_version":"1.0","source":{"id":"2605.00255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00255","created_at":"2026-05-21T17:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00255v1","created_at":"2026-05-21T17:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00255","created_at":"2026-05-21T17:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"BXQ2B3SSBWQI","created_at":"2026-05-21T17:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"BXQ2B3SSBWQISDJ5","created_at":"2026-05-21T17:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"BXQ2B3SS","created_at":"2026-05-21T17:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:7e20bdbd8062f13539611ee6acc3a06159f5e6a3ff23528cf2fc3b45edcfbefc","target":"graph","created_at":"2026-05-21T17:03:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"1922da497a3479828830ad4db0897d87523ccd51d8e4d3d996153c9d0edd5ad6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.00255/integrity.json","findings":[],"snapshot_sha256":"9510f6aad214c87405d67c331388be8474addf15ddcbb33d785a3cae2d3b7b96","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bassant Selim, Charles Pillet, Fran\\c{c}ois Leduc-Primeau, Pascal Giard","cross_cats":["math.IT"],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-04-30T21:37:54Z","title":"Sequential Automorphism Ensemble Decoding with Early Stopping"},"references":{"count":21,"internal_anchors":0,"resolved_work":2,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A class of multiple-error-correcting codes and the decoding scheme,","work_id":"","year":1954},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Application of boolean algebra to switching circuit design and to error detection,","work_id":"","year":1954},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Channel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","work_id":"","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"On the efficiency of polar-like decoding for symmetric codes,","work_id":"","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Automorphism ensemble decoding of Reed-Muller codes,","work_id":"","year":2021}],"snapshot_sha256":"c31790c96f3c0184d3c023fd71428b149f5b29d04aaea762b8b7e2dacb7b0efc"},"source":{"id":"2605.00255","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-09T19:25:43.563344Z","id":"21acee6d-c948-4746-87e5-15ef45be052e","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"21acee6d-c948-4746-87e5-15ef45be052e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1173f6a6fd62f85135853d6bd47076d1aa3071ebcade0701307b2f74beb31410","target":"record","created_at":"2026-05-21T17:03:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"81205dc1807c61591ed273edb420d159c00ba981b640ff6b09beec329e2c16af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-04-30T21:37:54Z","title_canon_sha256":"05d78922c15b68d66ff19138d9c3c2145693508d6c6706462aab3162931fcbd8"},"schema_version":"1.0","source":{"id":"2605.00255","kind":"arxiv","version":1}},"canonical_sha256":"0de1a0ee520da0890d3d3cc1a7d722a542d1e5ae1fc08519e6fde24f62d5b453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0de1a0ee520da0890d3d3cc1a7d722a542d1e5ae1fc08519e6fde24f62d5b453","first_computed_at":"2026-05-21T17:03:39.764556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T17:03:39.764556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZB43C1K3DD8YS4K9E/9fAM3ULetWCVcRz9hxdp9foeJSJHHrT6L4vL/Q9ZWzuRxXTyzjc+YTPRuOPgau+9fKDw==","signature_status":"signed_v1","signed_at":"2026-05-21T17:03:39.766885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1173f6a6fd62f85135853d6bd47076d1aa3071ebcade0701307b2f74beb31410","sha256:7e20bdbd8062f13539611ee6acc3a06159f5e6a3ff23528cf2fc3b45edcfbefc"],"state_sha256":"69b05b17593b05531acbd4d2f7c406a7e735a8bd7711533b3364155ec0113ac9"}