{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3KGGQVEZNU5OTOKWWHIONXLUXY","short_pith_number":"pith:3KGGQVEZ","schema_version":"1.0","canonical_sha256":"da8c6854996d3ae9b956b1d0e6dd74be2dca7b395c3e9480a7e348f29e13e006","source":{"kind":"arxiv","id":"2601.02330","version":2},"attestation_state":"computed","paper":{"title":"Error-Building Decoding of Linear Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guoda Qiu, Ling Liu, Liping Li, Yuejun Wei","submitted_at":"2026-01-05T18:22:17Z","abstract_excerpt":"This paper proposes a novel maximum-likelihood (ML) soft-decision decoding framework for linear block codes, termed error-building decoding (EBD). The complete decoding process can be performed using only the parity-check matrix, without requiring any other pre-constructed information (such as trellis diagrams or error-pattern lists), and it has the potential to be further customized if specific properties of the code can be exploited. We formally define error-building blocks, and derive a recursive theorem that allows efficient construction of larger locally optimal blocks from smaller ones, "},"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":"2601.02330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-05T18:22:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b75b1038eedec6cfff18a813eee8ec5855fe1d1952d52c6061751e83a8297650","abstract_canon_sha256":"ecdfa1e84ac17bf12e4857c78fc45e88318544d722930d860ea51664d8e3a82f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:04.883086Z","signature_b64":"a3lHB1ZcCYqPwNMOtCJHg2Xx9hZ7suYO4EPGMPW36SbEGLJWmyTbrOEIVvN42qpqbD4Qy/j8bdFtLSotPBJTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da8c6854996d3ae9b956b1d0e6dd74be2dca7b395c3e9480a7e348f29e13e006","last_reissued_at":"2026-06-19T16:12:04.882560Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:04.882560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-Building Decoding of Linear Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guoda Qiu, Ling Liu, Liping Li, Yuejun Wei","submitted_at":"2026-01-05T18:22:17Z","abstract_excerpt":"This paper proposes a novel maximum-likelihood (ML) soft-decision decoding framework for linear block codes, termed error-building decoding (EBD). The complete decoding process can be performed using only the parity-check matrix, without requiring any other pre-constructed information (such as trellis diagrams or error-pattern lists), and it has the potential to be further customized if specific properties of the code can be exploited. We formally define error-building blocks, and derive a recursive theorem that allows efficient construction of larger locally optimal blocks from smaller ones, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.02330","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/2601.02330/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":"2601.02330","created_at":"2026-06-19T16:12:04.882634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.02330v2","created_at":"2026-06-19T16:12:04.882634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.02330","created_at":"2026-06-19T16:12:04.882634+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KGGQVEZNU5O","created_at":"2026-06-19T16:12:04.882634+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KGGQVEZNU5OTOKW","created_at":"2026-06-19T16:12:04.882634+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KGGQVEZ","created_at":"2026-06-19T16:12:04.882634+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY","json":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY.json","graph_json":"https://pith.science/api/pith-number/3KGGQVEZNU5OTOKWWHIONXLUXY/graph.json","events_json":"https://pith.science/api/pith-number/3KGGQVEZNU5OTOKWWHIONXLUXY/events.json","paper":"https://pith.science/paper/3KGGQVEZ"},"agent_actions":{"view_html":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY","download_json":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY.json","view_paper":"https://pith.science/paper/3KGGQVEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.02330&json=true","fetch_graph":"https://pith.science/api/pith-number/3KGGQVEZNU5OTOKWWHIONXLUXY/graph.json","fetch_events":"https://pith.science/api/pith-number/3KGGQVEZNU5OTOKWWHIONXLUXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY/action/storage_attestation","attest_author":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY/action/author_attestation","sign_citation":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY/action/citation_signature","submit_replication":"https://pith.science/pith/3KGGQVEZNU5OTOKWWHIONXLUXY/action/replication_record"}},"created_at":"2026-06-19T16:12:04.882634+00:00","updated_at":"2026-06-19T16:12:04.882634+00:00"}