{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3KGGQVEZNU5OTOKWWHIONXLUXY","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":"ecdfa1e84ac17bf12e4857c78fc45e88318544d722930d860ea51664d8e3a82f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-05T18:22:17Z","title_canon_sha256":"b75b1038eedec6cfff18a813eee8ec5855fe1d1952d52c6061751e83a8297650"},"schema_version":"1.0","source":{"id":"2601.02330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.02330","created_at":"2026-06-19T16:12:04Z"},{"alias_kind":"arxiv_version","alias_value":"2601.02330v2","created_at":"2026-06-19T16:12:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.02330","created_at":"2026-06-19T16:12:04Z"},{"alias_kind":"pith_short_12","alias_value":"3KGGQVEZNU5O","created_at":"2026-06-19T16:12:04Z"},{"alias_kind":"pith_short_16","alias_value":"3KGGQVEZNU5OTOKW","created_at":"2026-06-19T16:12:04Z"},{"alias_kind":"pith_short_8","alias_value":"3KGGQVEZ","created_at":"2026-06-19T16:12:04Z"}],"graph_snapshots":[{"event_id":"sha256:ce7b03b164d7cbe39fb9809142b5f8ee58ffa2c9760b1d171f7ed837a9566be0","target":"graph","created_at":"2026-06-19T16:12:04Z","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/2601.02330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Guoda Qiu, Ling Liu, Liping Li, Yuejun Wei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-05T18:22:17Z","title":"Error-Building Decoding of Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.02330","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:ca160652254888dc371252aac37943942b6375819e7d735aaef976b20664dfc9","target":"record","created_at":"2026-06-19T16:12:04Z","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":"ecdfa1e84ac17bf12e4857c78fc45e88318544d722930d860ea51664d8e3a82f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-05T18:22:17Z","title_canon_sha256":"b75b1038eedec6cfff18a813eee8ec5855fe1d1952d52c6061751e83a8297650"},"schema_version":"1.0","source":{"id":"2601.02330","kind":"arxiv","version":2}},"canonical_sha256":"da8c6854996d3ae9b956b1d0e6dd74be2dca7b395c3e9480a7e348f29e13e006","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da8c6854996d3ae9b956b1d0e6dd74be2dca7b395c3e9480a7e348f29e13e006","first_computed_at":"2026-06-19T16:12:04.882560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:04.882560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a3lHB1ZcCYqPwNMOtCJHg2Xx9hZ7suYO4EPGMPW36SbEGLJWmyTbrOEIVvN42qpqbD4Qy/j8bdFtLSotPBJTCg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:04.883086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.02330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca160652254888dc371252aac37943942b6375819e7d735aaef976b20664dfc9","sha256:ce7b03b164d7cbe39fb9809142b5f8ee58ffa2c9760b1d171f7ed837a9566be0"],"state_sha256":"f1ec0ed1d2adcb145a922d742e62d370001cc98d83eb41c38a4f02ab944f1803"}