{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IYZGD66ISNIWF74GMV4DEM72PN","short_pith_number":"pith:IYZGD66I","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"},"canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","source":{"kind":"arxiv","id":"1405.6008","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6008","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6008v3","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6008","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"IYZGD66ISNIW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYZGD66ISNIWF74G","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYZGD66I","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IYZGD66ISNIWF74GMV4DEM72PN","target":"record","payload":{"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"},"canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","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"},"source_kind":"arxiv","source_id":"1405.6008","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHyqABmfynpIhsTyRnfFoUaEJwWK5ztGNDtlugwkxEDXXQPnI/+QcO5b0+EPHaiu8g2gCkCacmYARZ1RPWPAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:31:22.498888Z"},"content_sha256":"c6bcb553f381a47b4ba5a46ba7e08b844e030bd54396a7de30f35b1c34517a0d","schema_version":"1.0","event_id":"sha256:c6bcb553f381a47b4ba5a46ba7e08b844e030bd54396a7de30f35b1c34517a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IYZGD66ISNIWF74GMV4DEM72PN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKhd1E7QmMQRm/Xw//NHRRo1viqxd4PCaRgW+qgKS1+UefsnmhJRlsBY1Xntr5l24CPXCwMJLrEZMFFurifNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:31:22.499247Z"},"content_sha256":"d4e2920102e94098a272ff105881c9bbf226b53a5d11c61134fade500486d05d","schema_version":"1.0","event_id":"sha256:d4e2920102e94098a272ff105881c9bbf226b53a5d11c61134fade500486d05d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/bundle.json","state_url":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYZGD66ISNIWF74GMV4DEM72PN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:31:22Z","links":{"resolver":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN","bundle":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/bundle.json","state":"https://pith.science/pith/IYZGD66ISNIWF74GMV4DEM72PN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYZGD66ISNIWF74GMV4DEM72PN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IYZGD66ISNIWF74GMV4DEM72PN","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":"ae97ce989aaa720cb742cd85c400e2ab1a1230dfcd64f7cb610c7b558c3c955e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T10:03:36Z","title_canon_sha256":"d04e7dc40d08d4223388627543fc5d27048e35a2fec6073c5c90cb43841d6bdf"},"schema_version":"1.0","source":{"id":"1405.6008","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6008","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6008v3","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6008","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"IYZGD66ISNIW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYZGD66ISNIWF74G","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYZGD66I","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:d4e2920102e94098a272ff105881c9bbf226b53a5d11c61134fade500486d05d","target":"graph","created_at":"2026-05-18T02:03:45Z","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 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.","authors_text":"Johan S. R. Nielsen, Peter Beelen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T10:03:36Z","title":"Sub-quadratic Decoding of One-point Hermitian Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6008","kind":"arxiv","version":3},"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:c6bcb553f381a47b4ba5a46ba7e08b844e030bd54396a7de30f35b1c34517a0d","target":"record","created_at":"2026-05-18T02:03:45Z","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":"ae97ce989aaa720cb742cd85c400e2ab1a1230dfcd64f7cb610c7b558c3c955e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T10:03:36Z","title_canon_sha256":"d04e7dc40d08d4223388627543fc5d27048e35a2fec6073c5c90cb43841d6bdf"},"schema_version":"1.0","source":{"id":"1405.6008","kind":"arxiv","version":3}},"canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"463261fbc8935162ff8665783233fa7b7886a84d44bbd7c7319f8714e213c85d","first_computed_at":"2026-05-18T02:03:45.368996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:45.368996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AsetPa/SCkUY2cP8TSAveWMQT1kCKqNFzsMo+36BY7B7rU2wF8sLD8vEvrz2koCUJWgavJlM+T3BR8oml6SyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:45.369773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6008","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6bcb553f381a47b4ba5a46ba7e08b844e030bd54396a7de30f35b1c34517a0d","sha256:d4e2920102e94098a272ff105881c9bbf226b53a5d11c61134fade500486d05d"],"state_sha256":"9865093f37695d717964798916c9c7a004ba1242cfb3c27f38c1c4f27b2499f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEpSX+M0Pb+dHfJRk1P9QBXBVd36H6FZ7tG96JYwPxdFECJ5ecGzct8hJVrl5ysieyqK63VEYxRTF/K4zK4+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:31:22.501477Z","bundle_sha256":"2b00d264e73ef04d84b7d58b4088d83720e9c517ada807e09f1814d6ab13106b"}}