{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JTNTWVRZ4CZEQFN7VTMN7KXJQK","short_pith_number":"pith:JTNTWVRZ","schema_version":"1.0","canonical_sha256":"4cdb3b5639e0b24815bfacd8dfaae9828e06ff9603c85a7abbe2512ea6b0c6c3","source":{"kind":"arxiv","id":"1801.07006","version":1},"attestation_state":"computed","paper":{"title":"Improved Power Decoding of Interleaved One-Point Hermitian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Irene Bouw, Johan Rosenkilde, Sven Puchinger","submitted_at":"2018-01-22T09:26:59Z","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"},"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":"1801.07006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T09:26:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b6c123e09d803f63bf24b096bcf78bbefa60ed6571618c80a85887cf7eb8027","abstract_canon_sha256":"f856fbeeda28fb6b0eb091ba72b8267330e157eb139b0c3b595e7ddfc3e47316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.523022Z","signature_b64":"SjiKgVIr225YbEcLZX2BOrJlok1Xs+x5u5tNhRBgKeieC/i4l4LZFIzSbvdiIz/lxViJWBTmkshtHO+lW6HrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cdb3b5639e0b24815bfacd8dfaae9828e06ff9603c85a7abbe2512ea6b0c6c3","last_reissued_at":"2026-05-18T00:25:22.522408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.522408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Power Decoding of Interleaved One-Point Hermitian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Irene Bouw, Johan Rosenkilde, Sven Puchinger","submitted_at":"2018-01-22T09:26:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07006","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.07006","created_at":"2026-05-18T00:25:22.522499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07006v1","created_at":"2026-05-18T00:25:22.522499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07006","created_at":"2026-05-18T00:25:22.522499+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTNTWVRZ4CZE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTNTWVRZ4CZEQFN7","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTNTWVRZ","created_at":"2026-05-18T12:32:31.084164+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/JTNTWVRZ4CZEQFN7VTMN7KXJQK","json":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK.json","graph_json":"https://pith.science/api/pith-number/JTNTWVRZ4CZEQFN7VTMN7KXJQK/graph.json","events_json":"https://pith.science/api/pith-number/JTNTWVRZ4CZEQFN7VTMN7KXJQK/events.json","paper":"https://pith.science/paper/JTNTWVRZ"},"agent_actions":{"view_html":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK","download_json":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK.json","view_paper":"https://pith.science/paper/JTNTWVRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07006&json=true","fetch_graph":"https://pith.science/api/pith-number/JTNTWVRZ4CZEQFN7VTMN7KXJQK/graph.json","fetch_events":"https://pith.science/api/pith-number/JTNTWVRZ4CZEQFN7VTMN7KXJQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK/action/storage_attestation","attest_author":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK/action/author_attestation","sign_citation":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK/action/citation_signature","submit_replication":"https://pith.science/pith/JTNTWVRZ4CZEQFN7VTMN7KXJQK/action/replication_record"}},"created_at":"2026-05-18T00:25:22.522499+00:00","updated_at":"2026-05-18T00:25:22.522499+00:00"}