{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WXWU4SJ7EDBIGF44HOQRNRPH5W","short_pith_number":"pith:WXWU4SJ7","canonical_record":{"source":{"id":"1812.09357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-12-21T20:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"a8aa383759015a32a23cfb5bfa984dc9b844dda4e70c6844dbacc49b0fe09604","abstract_canon_sha256":"241a2cb738b95d585d3bbe04c58ac33349dfa0104567a1fb2e258d9e049ecf79"},"schema_version":"1.0"},"canonical_sha256":"b5ed4e493f20c283179c3ba116c5e7ed83b2204960ecc8e70776ce4ae802fa84","source":{"kind":"arxiv","id":"1812.09357","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09357","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09357v2","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09357","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"WXWU4SJ7EDBI","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_16","alias_value":"WXWU4SJ7EDBIGF44","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_8","alias_value":"WXWU4SJ7","created_at":"2026-07-04T23:58:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WXWU4SJ7EDBIGF44HOQRNRPH5W","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-12-21T20:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"a8aa383759015a32a23cfb5bfa984dc9b844dda4e70c6844dbacc49b0fe09604","abstract_canon_sha256":"241a2cb738b95d585d3bbe04c58ac33349dfa0104567a1fb2e258d9e049ecf79"},"schema_version":"1.0"},"canonical_sha256":"b5ed4e493f20c283179c3ba116c5e7ed83b2204960ecc8e70776ce4ae802fa84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:05.724899Z","signature_b64":"GTqvskPxipT9P/bHF/2uURDRsaQlBdyyho2GPVWgX5Pl6KCuCkhfzzaENoAlOLa9uqcFsJdWIfj2F5u3bu4WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ed4e493f20c283179c3ba116c5e7ed83b2204960ecc8e70776ce4ae802fa84","last_reissued_at":"2026-07-04T23:58:05.724434Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:05.724434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09357","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-04T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkFb0uKKoGXxM8phayOJB2qBQblRYQp9H/CKP33dV/fVTXgEFPLbCGw0QRpJkZiaD2wrkKP2/eHkSFnSpRpoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:54:39.937145Z"},"content_sha256":"5b9e91b5d3cbca4b19f366ac43a5f4007bcffa45e739c6e178cf9d1a630a5d74","schema_version":"1.0","event_id":"sha256:5b9e91b5d3cbca4b19f366ac43a5f4007bcffa45e739c6e178cf9d1a630a5d74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WXWU4SJ7EDBIGF44HOQRNRPH5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complexity Reduction Method for Successive Cancellation List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Onur Dizdar","submitted_at":"2018-12-21T20:05:42Z","abstract_excerpt":"This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning. We prove that such sorting scheme reduces the input number of multiplexers in any hardware implementation of SCL decoding from L to (L/2+1) without any changes in the decoding latency. We also propose sorter architectures for the proposed sorting method. Field programmable gate array (FPGA) implementations show that the proposed m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09357","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/1812.09357/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-04T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuqgQce1OEuipJMcGw2rgcX7kBLWesiiyvEcoBTtjaf2VzVGoxOQmu3n0El1TWnpZtB2DsMkI+x1EYXt0a16Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:54:39.937623Z"},"content_sha256":"6d2630e0007c63343ee34b4b2bd9437f3711ae7b3fc207b8dd51fa6cef8397df","schema_version":"1.0","event_id":"sha256:6d2630e0007c63343ee34b4b2bd9437f3711ae7b3fc207b8dd51fa6cef8397df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/bundle.json","state_url":"https://pith.science/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/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-06T09:54:39Z","links":{"resolver":"https://pith.science/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W","bundle":"https://pith.science/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/bundle.json","state":"https://pith.science/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXWU4SJ7EDBIGF44HOQRNRPH5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WXWU4SJ7EDBIGF44HOQRNRPH5W","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":"241a2cb738b95d585d3bbe04c58ac33349dfa0104567a1fb2e258d9e049ecf79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-12-21T20:05:42Z","title_canon_sha256":"a8aa383759015a32a23cfb5bfa984dc9b844dda4e70c6844dbacc49b0fe09604"},"schema_version":"1.0","source":{"id":"1812.09357","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09357","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09357v2","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09357","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"WXWU4SJ7EDBI","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_16","alias_value":"WXWU4SJ7EDBIGF44","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_8","alias_value":"WXWU4SJ7","created_at":"2026-07-04T23:58:05Z"}],"graph_snapshots":[{"event_id":"sha256:6d2630e0007c63343ee34b4b2bd9437f3711ae7b3fc207b8dd51fa6cef8397df","target":"graph","created_at":"2026-07-04T23:58:05Z","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/1812.09357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning. We prove that such sorting scheme reduces the input number of multiplexers in any hardware implementation of SCL decoding from L to (L/2+1) without any changes in the decoding latency. We also propose sorter architectures for the proposed sorting method. Field programmable gate array (FPGA) implementations show that the proposed m","authors_text":"Onur Dizdar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-12-21T20:05:42Z","title":"A Complexity Reduction Method for Successive Cancellation List Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09357","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:5b9e91b5d3cbca4b19f366ac43a5f4007bcffa45e739c6e178cf9d1a630a5d74","target":"record","created_at":"2026-07-04T23:58:05Z","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":"241a2cb738b95d585d3bbe04c58ac33349dfa0104567a1fb2e258d9e049ecf79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-12-21T20:05:42Z","title_canon_sha256":"a8aa383759015a32a23cfb5bfa984dc9b844dda4e70c6844dbacc49b0fe09604"},"schema_version":"1.0","source":{"id":"1812.09357","kind":"arxiv","version":2}},"canonical_sha256":"b5ed4e493f20c283179c3ba116c5e7ed83b2204960ecc8e70776ce4ae802fa84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5ed4e493f20c283179c3ba116c5e7ed83b2204960ecc8e70776ce4ae802fa84","first_computed_at":"2026-07-04T23:58:05.724434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:05.724434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GTqvskPxipT9P/bHF/2uURDRsaQlBdyyho2GPVWgX5Pl6KCuCkhfzzaENoAlOLa9uqcFsJdWIfj2F5u3bu4WCg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:05.724899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09357","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b9e91b5d3cbca4b19f366ac43a5f4007bcffa45e739c6e178cf9d1a630a5d74","sha256:6d2630e0007c63343ee34b4b2bd9437f3711ae7b3fc207b8dd51fa6cef8397df"],"state_sha256":"43669c721eabfa4221dc0aa50a1a38684541263f72df4ef120e876c9b1aefc29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbWGiTJD9359lkbgu989sL1mc651fjKIho+siN0qQeol6jd2HZuS2LBJ1hPtRuK67NlBSo/klQu1FdowPwAhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:54:39.940813Z","bundle_sha256":"364886d1751976f82932058607457c6f3deb01ffa90a6b5f2fc5767e17d21653"}}