{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BV6EHVRF6AXKZKUEIYKT6Y6QH5","short_pith_number":"pith:BV6EHVRF","schema_version":"1.0","canonical_sha256":"0d7c43d625f02eacaa8446153f63d03f4ba17cdf96adbb7ba4c24e1f5d18829c","source":{"kind":"arxiv","id":"2304.11554","version":1},"attestation_state":"computed","paper":{"title":"Construction of PAC Codes with List-Search and Path-Splitting Critical Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunfang Xia, Jiahao Wang, Shirong Jiang, Xiang Li","submitted_at":"2023-04-23T06:50:54Z","abstract_excerpt":"Polarization-adjusted convolutional (PAC) codes can approach the theoretical bound for block error rate (BLER) performance at short-to-medium codeword length. PAC codes have excellent BLER performance using Monte Carlo (MC) rate-profiles and Weighted Sum (WS) rate-profiles, but the BLER performances of the constructed codes still fall away from the dispersion bound at high signal-to-noise ratios (SNR). This paper proposes a List-Search (LS) construction method for PAC codes, which considers the influence of weight spectrum on BLER performance and the condition that sequence decoding for PAC co"},"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":"2304.11554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-04-23T06:50:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10778c1889470fa3457d27fcb424eedd6326bdbd33cf714b6c211c1431ddc106","abstract_canon_sha256":"f49fbe84485fb1af108bd0dffc09375f0fe008fdb21473bd800d0767ea10752d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:34.311653Z","signature_b64":"eJjhJ2zrnPCVoCsBEOZW+Ol6OlgYQ6tmwBRVVoXbShCLeYmIOYMAzMMMEFPoWciFpymY8X5gZMXWhTNKr7N0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7c43d625f02eacaa8446153f63d03f4ba17cdf96adbb7ba4c24e1f5d18829c","last_reissued_at":"2026-07-05T06:03:34.311158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:34.311158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of PAC Codes with List-Search and Path-Splitting Critical Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunfang Xia, Jiahao Wang, Shirong Jiang, Xiang Li","submitted_at":"2023-04-23T06:50:54Z","abstract_excerpt":"Polarization-adjusted convolutional (PAC) codes can approach the theoretical bound for block error rate (BLER) performance at short-to-medium codeword length. PAC codes have excellent BLER performance using Monte Carlo (MC) rate-profiles and Weighted Sum (WS) rate-profiles, but the BLER performances of the constructed codes still fall away from the dispersion bound at high signal-to-noise ratios (SNR). This paper proposes a List-Search (LS) construction method for PAC codes, which considers the influence of weight spectrum on BLER performance and the condition that sequence decoding for PAC co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11554","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/2304.11554/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":"2304.11554","created_at":"2026-07-05T06:03:34.311219+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11554v1","created_at":"2026-07-05T06:03:34.311219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11554","created_at":"2026-07-05T06:03:34.311219+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV6EHVRF6AXK","created_at":"2026-07-05T06:03:34.311219+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV6EHVRF6AXKZKUE","created_at":"2026-07-05T06:03:34.311219+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV6EHVRF","created_at":"2026-07-05T06:03:34.311219+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06072","citing_title":"PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5","json":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5.json","graph_json":"https://pith.science/api/pith-number/BV6EHVRF6AXKZKUEIYKT6Y6QH5/graph.json","events_json":"https://pith.science/api/pith-number/BV6EHVRF6AXKZKUEIYKT6Y6QH5/events.json","paper":"https://pith.science/paper/BV6EHVRF"},"agent_actions":{"view_html":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5","download_json":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5.json","view_paper":"https://pith.science/paper/BV6EHVRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11554&json=true","fetch_graph":"https://pith.science/api/pith-number/BV6EHVRF6AXKZKUEIYKT6Y6QH5/graph.json","fetch_events":"https://pith.science/api/pith-number/BV6EHVRF6AXKZKUEIYKT6Y6QH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5/action/storage_attestation","attest_author":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5/action/author_attestation","sign_citation":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5/action/citation_signature","submit_replication":"https://pith.science/pith/BV6EHVRF6AXKZKUEIYKT6Y6QH5/action/replication_record"}},"created_at":"2026-07-05T06:03:34.311219+00:00","updated_at":"2026-07-05T06:03:34.311219+00:00"}