{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WT25Q6KQ274XMM3SPZVN72HSLB","short_pith_number":"pith:WT25Q6KQ","canonical_record":{"source":{"id":"1408.1310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e371d240b22de70095e33160ace11991a2e298782a5dd04518f167fc21219ce","abstract_canon_sha256":"1ac19e26be223afac9e4826882b39917c00c470132fcc2b21819ec69009274d2"},"schema_version":"1.0"},"canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","source":{"kind":"arxiv","id":"1408.1310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1310","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1310v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1310","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"WT25Q6KQ274X","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WT25Q6KQ274XMM3S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WT25Q6KQ","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WT25Q6KQ274XMM3SPZVN72HSLB","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e371d240b22de70095e33160ace11991a2e298782a5dd04518f167fc21219ce","abstract_canon_sha256":"1ac19e26be223afac9e4826882b39917c00c470132fcc2b21819ec69009274d2"},"schema_version":"1.0"},"canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:47.557910Z","signature_b64":"59ZoHo6madfuESlLE+SOJatvR+xHVtFwZNw79GjmYxYiXJN/q2vRa2TqbyQ8YPVqe6/hAd7L6ZkDCCpCYQT7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","last_reissued_at":"2026-05-18T02:45:47.557276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:47.557276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1310","source_version":1,"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-05-18T02:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0lLBSKm0+nik6YddVCocO4qXxlG4AXf/0gOGUJ4wKGL3ewCcryAi24GC7BmxKl7PP4lO4SrKvIgRGwOtkzaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:56:44.551827Z"},"content_sha256":"ca89d5ee3fdfc7bce5a886c7c4f9f9a63a2c34a11ede8b797010da5dcb3361c9","schema_version":"1.0","event_id":"sha256:ca89d5ee3fdfc7bce5a886c7c4f9f9a63a2c34a11ede8b797010da5dcb3361c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WT25Q6KQ274XMM3SPZVN72HSLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Ta Pai, Po-Ning Chen, Ting-Yi Wu, Yunghsiang S. Han","submitted_at":"2014-08-06T14:57:27Z","abstract_excerpt":"Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees finding the ML decision. Simulations on Reed-Muller codes show that the proposed two-phase sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1310","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":""},"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-05-18T02:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfjQyU++8itXLRovzD312gRFi7QaER1gHMQVk36lCMT/diVEJeSrb3oBsVnJOQfnORB1Z90YOdEXqogg9KArDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:56:44.552582Z"},"content_sha256":"3df4532be224731c7601e462cc70e020e47f4cc416f4b6224c31f7868b902876","schema_version":"1.0","event_id":"sha256:3df4532be224731c7601e462cc70e020e47f4cc416f4b6224c31f7868b902876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/bundle.json","state_url":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT25Q6KQ274XMM3SPZVN72HSLB/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-06-10T22:56:44Z","links":{"resolver":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB","bundle":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/bundle.json","state":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT25Q6KQ274XMM3SPZVN72HSLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WT25Q6KQ274XMM3SPZVN72HSLB","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":"1ac19e26be223afac9e4826882b39917c00c470132fcc2b21819ec69009274d2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","title_canon_sha256":"3e371d240b22de70095e33160ace11991a2e298782a5dd04518f167fc21219ce"},"schema_version":"1.0","source":{"id":"1408.1310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1310","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1310v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1310","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"WT25Q6KQ274X","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WT25Q6KQ274XMM3S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WT25Q6KQ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:3df4532be224731c7601e462cc70e020e47f4cc416f4b6224c31f7868b902876","target":"graph","created_at":"2026-05-18T02:45:47Z","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"},"paper":{"abstract_excerpt":"Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees finding the ML decision. Simulations on Reed-Muller codes show that the proposed two-phase sch","authors_text":"Hung-Ta Pai, Po-Ning Chen, Ting-Yi Wu, Yunghsiang S. Han","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","title":"Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1310","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:ca89d5ee3fdfc7bce5a886c7c4f9f9a63a2c34a11ede8b797010da5dcb3361c9","target":"record","created_at":"2026-05-18T02:45:47Z","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":"1ac19e26be223afac9e4826882b39917c00c470132fcc2b21819ec69009274d2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","title_canon_sha256":"3e371d240b22de70095e33160ace11991a2e298782a5dd04518f167fc21219ce"},"schema_version":"1.0","source":{"id":"1408.1310","kind":"arxiv","version":1}},"canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","first_computed_at":"2026-05-18T02:45:47.557276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:47.557276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59ZoHo6madfuESlLE+SOJatvR+xHVtFwZNw79GjmYxYiXJN/q2vRa2TqbyQ8YPVqe6/hAd7L6ZkDCCpCYQT7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:47.557910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca89d5ee3fdfc7bce5a886c7c4f9f9a63a2c34a11ede8b797010da5dcb3361c9","sha256:3df4532be224731c7601e462cc70e020e47f4cc416f4b6224c31f7868b902876"],"state_sha256":"9ed2afe7a66bfd9bf43a45c416521f4bfd1f82ca17fac71f491fd405a12d73df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfStrwUE0jxH5ttZ+XpuHgwVkBwVcZ8PX1Uhkt3ZM47P057l5CbLsZJpTphOSWqQmJtK44VfZVAWxFrsy6vmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:56:44.556528Z","bundle_sha256":"3f696da4c1f9b9638c9ffa75f916b48e4d39433997097d0843c3eedef402bd07"}}