{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IYZGD66ISNIWF74GMV4DEM72PN","short_pith_number":"pith:IYZGD66I","schema_version":"1.0","canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","source":{"kind":"arxiv","id":"1405.6008","version":3},"attestation_state":"computed","paper":{"title":"Sub-quadratic 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":"Johan S. R. Nielsen, Peter Beelen","submitted_at":"2014-05-23T10:03:36Z","abstract_excerpt":"We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the same methods from computer algebra, yielding similar asymptotic complexities."},"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":"1405.6008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T10:03:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d04e7dc40d08d4223388627543fc5d27048e35a2fec6073c5c90cb43841d6bdf","abstract_canon_sha256":"ae97ce989aaa720cb742cd85c400e2ab1a1230dfcd64f7cb610c7b558c3c955e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:45.369773Z","signature_b64":"AsetPa/SCkUY2cP8TSAveWMQT1kCKqNFzsMo+36BY7B7rU2wF8sLD8vEvrz2koCUJWgavJlM+T3BR8oml6SyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","last_reissued_at":"2026-05-18T02:03:45.368996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:45.368996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sub-quadratic 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":"Johan S. R. Nielsen, Peter Beelen","submitted_at":"2014-05-23T10:03:36Z","abstract_excerpt":"We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the same methods from computer algebra, yielding similar asymptotic complexities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6008","kind":"arxiv","version":3},"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":"1405.6008","created_at":"2026-05-18T02:03:45.369116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6008v3","created_at":"2026-05-18T02:03:45.369116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6008","created_at":"2026-05-18T02:03:45.369116+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYZGD66ISNIW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYZGD66ISNIWF74G","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYZGD66I","created_at":"2026-05-18T12:28:33.132498+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/IYZGD66ISNIWF74GMV4DEM72PN","json":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN.json","graph_json":"https://pith.science/api/pith-number/IYZGD66ISNIWF74GMV4DEM72PN/graph.json","events_json":"https://pith.science/api/pith-number/IYZGD66ISNIWF74GMV4DEM72PN/events.json","paper":"https://pith.science/paper/IYZGD66I"},"agent_actions":{"view_html":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN","download_json":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN.json","view_paper":"https://pith.science/paper/IYZGD66I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6008&json=true","fetch_graph":"https://pith.science/api/pith-number/IYZGD66ISNIWF74GMV4DEM72PN/graph.json","fetch_events":"https://pith.science/api/pith-number/IYZGD66ISNIWF74GMV4DEM72PN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/action/storage_attestation","attest_author":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/action/author_attestation","sign_citation":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/action/citation_signature","submit_replication":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/action/replication_record"}},"created_at":"2026-05-18T02:03:45.369116+00:00","updated_at":"2026-05-18T02:03:45.369116+00:00"}