{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JTNTWVRZ4CZEQFN7VTMN7KXJQK","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":"f856fbeeda28fb6b0eb091ba72b8267330e157eb139b0c3b595e7ddfc3e47316","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T09:26:59Z","title_canon_sha256":"7b6c123e09d803f63bf24b096bcf78bbefa60ed6571618c80a85887cf7eb8027"},"schema_version":"1.0","source":{"id":"1801.07006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07006","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07006v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07006","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"JTNTWVRZ4CZE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JTNTWVRZ4CZEQFN7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JTNTWVRZ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:79bb3d846902a1b50ee85f0cccea4a3da5420d6be8920645f671106675e5fb96","target":"graph","created_at":"2026-05-18T00:25:22Z","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":"We propose a new partial decoding algorithm for $h$-interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to $1-(\\tfrac{k+g}{n})^{\\frac{h}{h+1}}$, where $k$ is the dimension, $n$ the length, and $g$ the genus of the code. Simulation results for various parameters indicate that the new decoder achieves this maximal decoding radius with high probability. The algorithm is based on a recent generalization of Rosenkilde's improved power decoder to interleaved Reed-Solomon codes, does not require an expensive root-finding step, and improves up","authors_text":"Irene Bouw, Johan Rosenkilde, Sven Puchinger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T09:26:59Z","title":"Improved Power Decoding of Interleaved One-Point Hermitian Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07006","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:f7d9065511c3a238d2d1c38a3e4ddbac8088d47bc21be9bc2d4ed8f6e36462b4","target":"record","created_at":"2026-05-18T00:25:22Z","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":"f856fbeeda28fb6b0eb091ba72b8267330e157eb139b0c3b595e7ddfc3e47316","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T09:26:59Z","title_canon_sha256":"7b6c123e09d803f63bf24b096bcf78bbefa60ed6571618c80a85887cf7eb8027"},"schema_version":"1.0","source":{"id":"1801.07006","kind":"arxiv","version":1}},"canonical_sha256":"4cdb3b5639e0b24815bfacd8dfaae9828e06ff9603c85a7abbe2512ea6b0c6c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cdb3b5639e0b24815bfacd8dfaae9828e06ff9603c85a7abbe2512ea6b0c6c3","first_computed_at":"2026-05-18T00:25:22.522408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:22.522408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjiKgVIr225YbEcLZX2BOrJlok1Xs+x5u5tNhRBgKeieC/i4l4LZFIzSbvdiIz/lxViJWBTmkshtHO+lW6HrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:22.523022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7d9065511c3a238d2d1c38a3e4ddbac8088d47bc21be9bc2d4ed8f6e36462b4","sha256:79bb3d846902a1b50ee85f0cccea4a3da5420d6be8920645f671106675e5fb96"],"state_sha256":"4b858fc56a31345f13d3e7f31e7c0e53d1c237bb109154699caa00361e5cffcc"}