{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MAR2HJ57MY3XZFOLBMIZMLIPLF","short_pith_number":"pith:MAR2HJ57","canonical_record":{"source":{"id":"2012.09425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-17T07:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e09e11851264b45202910af4ea7c09863e6072b632cb5fa07073e88322ad987e","abstract_canon_sha256":"f82341cad7c1eb475a18ddcad77d4301840fad72b84bed3be55cad3d92dd2c79"},"schema_version":"1.0"},"canonical_sha256":"6023a3a7bf66377c95cb0b11962d0f5964bcc1b8bca2d8cf479020f41914d20e","source":{"kind":"arxiv","id":"2012.09425","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09425","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09425v2","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09425","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"MAR2HJ57MY3X","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_16","alias_value":"MAR2HJ57MY3XZFOL","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_8","alias_value":"MAR2HJ57","created_at":"2026-07-05T02:02:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MAR2HJ57MY3XZFOLBMIZMLIPLF","target":"record","payload":{"canonical_record":{"source":{"id":"2012.09425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-17T07:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e09e11851264b45202910af4ea7c09863e6072b632cb5fa07073e88322ad987e","abstract_canon_sha256":"f82341cad7c1eb475a18ddcad77d4301840fad72b84bed3be55cad3d92dd2c79"},"schema_version":"1.0"},"canonical_sha256":"6023a3a7bf66377c95cb0b11962d0f5964bcc1b8bca2d8cf479020f41914d20e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:08.668855Z","signature_b64":"hGJfo1TcJyqDV3U2bTgV5mDaDLLiWsXA6BhT7z/53237Gz+B7EhNVDCvR+7+4RyteHiFIyPMHmLlDddl9DXIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6023a3a7bf66377c95cb0b11962d0f5964bcc1b8bca2d8cf479020f41914d20e","last_reissued_at":"2026-07-05T02:02:08.668511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:08.668511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.09425","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQ6NmX1PWotArvExBx1SGBL2jeH+nqROBSz18SVaKxe7cf4AUZ0lS/4MwWuRJk3cPt7+q51yDn+S+LwezOEwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:36:06.433287Z"},"content_sha256":"0a177d733249a7e9ae67377533c96e69df8621bf8dde4714bd33e6a2d98e1231","schema_version":"1.0","event_id":"sha256:0a177d733249a7e9ae67377533c96e69df8621bf8dde4714bd33e6a2d98e1231"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MAR2HJ57MY3XZFOLBMIZMLIPLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dou Li, Hongfei Zhu, Yanjun Yang, Yuping Zhao, Zhiwei Cao","submitted_at":"2020-12-17T07:31:38Z","abstract_excerpt":"A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable latency. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. We define four types of constituent nodes and provide fast list decoding algorithms for each of them. Simulation results present that fast list decoding with three types of constituent nodes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09425","kind":"arxiv","version":2},"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/2012.09425/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAd7SPIwDey8FEnP5JXxNRab+6Be20VcGStAqwo7N/XzTJMPVEeX8BEP0JL+Je/J0OGOyVdGoaOoaQNEG2SMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:36:06.433907Z"},"content_sha256":"1ee5a171d66e51746772800e96fdd597f191e56b79febac68488212ed7d80dc4","schema_version":"1.0","event_id":"sha256:1ee5a171d66e51746772800e96fdd597f191e56b79febac68488212ed7d80dc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/bundle.json","state_url":"https://pith.science/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T18:36:06Z","links":{"resolver":"https://pith.science/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF","bundle":"https://pith.science/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/bundle.json","state":"https://pith.science/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAR2HJ57MY3XZFOLBMIZMLIPLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MAR2HJ57MY3XZFOLBMIZMLIPLF","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":"f82341cad7c1eb475a18ddcad77d4301840fad72b84bed3be55cad3d92dd2c79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-17T07:31:38Z","title_canon_sha256":"e09e11851264b45202910af4ea7c09863e6072b632cb5fa07073e88322ad987e"},"schema_version":"1.0","source":{"id":"2012.09425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09425","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09425v2","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09425","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"MAR2HJ57MY3X","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_16","alias_value":"MAR2HJ57MY3XZFOL","created_at":"2026-07-05T02:02:08Z"},{"alias_kind":"pith_short_8","alias_value":"MAR2HJ57","created_at":"2026-07-05T02:02:08Z"}],"graph_snapshots":[{"event_id":"sha256:1ee5a171d66e51746772800e96fdd597f191e56b79febac68488212ed7d80dc4","target":"graph","created_at":"2026-07-05T02:02:08Z","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/2012.09425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable latency. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. We define four types of constituent nodes and provide fast list decoding algorithms for each of them. Simulation results present that fast list decoding with three types of constituent nodes","authors_text":"Dou Li, Hongfei Zhu, Yanjun Yang, Yuping Zhao, Zhiwei Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-17T07:31:38Z","title":"Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09425","kind":"arxiv","version":2},"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:0a177d733249a7e9ae67377533c96e69df8621bf8dde4714bd33e6a2d98e1231","target":"record","created_at":"2026-07-05T02:02:08Z","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":"f82341cad7c1eb475a18ddcad77d4301840fad72b84bed3be55cad3d92dd2c79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-17T07:31:38Z","title_canon_sha256":"e09e11851264b45202910af4ea7c09863e6072b632cb5fa07073e88322ad987e"},"schema_version":"1.0","source":{"id":"2012.09425","kind":"arxiv","version":2}},"canonical_sha256":"6023a3a7bf66377c95cb0b11962d0f5964bcc1b8bca2d8cf479020f41914d20e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6023a3a7bf66377c95cb0b11962d0f5964bcc1b8bca2d8cf479020f41914d20e","first_computed_at":"2026-07-05T02:02:08.668511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:02:08.668511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGJfo1TcJyqDV3U2bTgV5mDaDLLiWsXA6BhT7z/53237Gz+B7EhNVDCvR+7+4RyteHiFIyPMHmLlDddl9DXIBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:02:08.668855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a177d733249a7e9ae67377533c96e69df8621bf8dde4714bd33e6a2d98e1231","sha256:1ee5a171d66e51746772800e96fdd597f191e56b79febac68488212ed7d80dc4"],"state_sha256":"78df80f04d5d889d8b397d12945b837f488484356b2e35f4bc43041c7ce52032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHLY0ccoMIFb0uj61QLfRJSwMtMnQ3zovYdKPaY+hJSvdwV8ga49/HzaiWMStzHNvvkkl7BHhckhHTS/j/DrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:36:06.440390Z","bundle_sha256":"021a4f88596dfde58e0a977ababfe15e0385380bae63614153db6e1e31445370"}}