{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UBAQCXTJ7RGE4CJ643ZCYJ4UE7","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":"5c791838adf1fd36eb0246c03abde5e164c7a67a3516a553c0402b6f8560fd11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-24T07:59:46Z","title_canon_sha256":"113f1eeef8e9ce6faf158dc637569b9a15f488d27809d6ddf554e620eb8b84f6"},"schema_version":"1.0","source":{"id":"2606.25522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25522","created_at":"2026-06-25T01:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25522v1","created_at":"2026-06-25T01:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25522","created_at":"2026-06-25T01:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"UBAQCXTJ7RGE","created_at":"2026-06-25T01:18:07Z"},{"alias_kind":"pith_short_16","alias_value":"UBAQCXTJ7RGE4CJ6","created_at":"2026-06-25T01:18:07Z"},{"alias_kind":"pith_short_8","alias_value":"UBAQCXTJ","created_at":"2026-06-25T01:18:07Z"}],"graph_snapshots":[{"event_id":"sha256:a846e4810111785ab3de605763754a94e8a90d11f5c4de91d2e6fc1446d71d9a","target":"graph","created_at":"2026-06-25T01:18:07Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.25522/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A theoretical analysis of CRC-aided successive cancellation list (CA-SCL) decoding for polar codes remains an open problem, despite its widespread practical adoption. While low-density parity-check (LDPC) codes benefit from mature analytical tools, such as density evolution (DE), for predicting the performance of belief-propagation (BP) decoding, similar techniques are not directly applicable to CA-SCL decoding. This limitation stems from the complex path-pruning mechanism inherent in CA-SCL decoding. In this paper, we propose an analytical framework based on a novel path-survival model that c","authors_text":"and Wen Tong, Huazi Zhang, Jiajie Tong, Jun Wang, Xianbin Wang, Yuan Li, Zhichao Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-24T07:59:46Z","title":"A Path-Survival Analytical Framework for SCL Decoding of Polar Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25522","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab18b937f6b69eb4be43b457a79ffce8f98d99a9229b106a89a38023af7d62dd","target":"record","created_at":"2026-06-25T01:18:07Z","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":"5c791838adf1fd36eb0246c03abde5e164c7a67a3516a553c0402b6f8560fd11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-24T07:59:46Z","title_canon_sha256":"113f1eeef8e9ce6faf158dc637569b9a15f488d27809d6ddf554e620eb8b84f6"},"schema_version":"1.0","source":{"id":"2606.25522","kind":"arxiv","version":1}},"canonical_sha256":"a041015e69fc4c4e093ee6f22c279427f26d82f2706b36de5ef6d5b970621ae9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a041015e69fc4c4e093ee6f22c279427f26d82f2706b36de5ef6d5b970621ae9","first_computed_at":"2026-06-25T01:18:07.763542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:07.763542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9Drx1kbb6DIigqeJ45KfMJWMIImLnN3h9pCPYLn/FwqAYxqFcxEihqvVFRHAf68xbBUMeVNJjKF5Q1fKP7WCg==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:07.763965Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab18b937f6b69eb4be43b457a79ffce8f98d99a9229b106a89a38023af7d62dd","sha256:a846e4810111785ab3de605763754a94e8a90d11f5c4de91d2e6fc1446d71d9a"],"state_sha256":"bacb0568184911ce784c71192d8a375d2b7fac58ec8112afb423b99c303f5791"}