{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BNZ4MUMPNUUSBHXZFQIXIQA77H","short_pith_number":"pith:BNZ4MUMP","schema_version":"1.0","canonical_sha256":"0b73c6518f6d29209ef92c1174401ff9c41476ceb8cccc68acba37d1a37b4727","source":{"kind":"arxiv","id":"1703.07982","version":1},"attestation_state":"computed","paper":{"title":"Improved Power Decoding of 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 n\\'e Nielsen, Sven Puchinger","submitted_at":"2017-03-23T09:55:44Z","abstract_excerpt":"We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami--Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed--Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes."},"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":"1703.07982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-23T09:55:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"105237d2a0b1c002a006a16426864734df2851101dfb115871999bc3a897ebf4","abstract_canon_sha256":"5ab94e3c6ea3b71b5fbddcd1a8d88e56e196d977910ef6b7da8c98ad6e36e6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.216352Z","signature_b64":"Ka8JLnCFxEz2MTQZDf2lTq0edMd5XEoaVsk9tkTxjukvD8kukC6gyXB6vyOmxbvtgKlPcUVhQB2kT2YOKwdPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b73c6518f6d29209ef92c1174401ff9c41476ceb8cccc68acba37d1a37b4727","last_reissued_at":"2026-05-18T00:48:04.215604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.215604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Power Decoding of 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 n\\'e Nielsen, Sven Puchinger","submitted_at":"2017-03-23T09:55:44Z","abstract_excerpt":"We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami--Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed--Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07982","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":"1703.07982","created_at":"2026-05-18T00:48:04.215725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07982v1","created_at":"2026-05-18T00:48:04.215725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07982","created_at":"2026-05-18T00:48:04.215725+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNZ4MUMPNUUS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNZ4MUMPNUUSBHXZ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNZ4MUMP","created_at":"2026-05-18T12:31:08.081275+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/BNZ4MUMPNUUSBHXZFQIXIQA77H","json":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H.json","graph_json":"https://pith.science/api/pith-number/BNZ4MUMPNUUSBHXZFQIXIQA77H/graph.json","events_json":"https://pith.science/api/pith-number/BNZ4MUMPNUUSBHXZFQIXIQA77H/events.json","paper":"https://pith.science/paper/BNZ4MUMP"},"agent_actions":{"view_html":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H","download_json":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H.json","view_paper":"https://pith.science/paper/BNZ4MUMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07982&json=true","fetch_graph":"https://pith.science/api/pith-number/BNZ4MUMPNUUSBHXZFQIXIQA77H/graph.json","fetch_events":"https://pith.science/api/pith-number/BNZ4MUMPNUUSBHXZFQIXIQA77H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H/action/storage_attestation","attest_author":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H/action/author_attestation","sign_citation":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H/action/citation_signature","submit_replication":"https://pith.science/pith/BNZ4MUMPNUUSBHXZFQIXIQA77H/action/replication_record"}},"created_at":"2026-05-18T00:48:04.215725+00:00","updated_at":"2026-05-18T00:48:04.215725+00:00"}