{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TWZYUJKNTSV7DSOW6VYFBXA7XI","short_pith_number":"pith:TWZYUJKN","schema_version":"1.0","canonical_sha256":"9db38a254d9cabf1c9d6f57050dc1fba0bef0babeea5c1a9d348bb8baf1c778a","source":{"kind":"arxiv","id":"1201.6248","version":4},"attestation_state":"computed","paper":{"title":"List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Ruano, Olav Geil, Ryutaroh Matsumoto","submitted_at":"2012-01-30T15:15:37Z","abstract_excerpt":"We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\\\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya $C_{ab}$ curves proposed by Lee, Bras-Amor\\'os and O'Sullivan to general one-point AG codes, without any assumption. Finally we extend the latter unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construct"},"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":"1201.6248","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-30T15:15:37Z","cross_cats_sorted":["cs.SC","math.AC","math.AG","math.IT"],"title_canon_sha256":"9f0a04c8be57f2c00475f7904248e272418cb153015377ee7d8a3bf65d52bb73","abstract_canon_sha256":"221ac710f700b8f41681d542cf15a1e9edade2127d24394a17b5f05bd31f4708"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:52.610000Z","signature_b64":"eyPL44MYj1o77mvSpVep0wjijVjNPyucNmBXa+Qeog/nZTNVDBrY03SfFzvN3letAO1Xq3xuMOf8LjpVVeAQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db38a254d9cabf1c9d6f57050dc1fba0bef0babeea5c1a9d348bb8baf1c778a","last_reissued_at":"2026-05-18T03:43:52.609296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:52.609296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Ruano, Olav Geil, Ryutaroh Matsumoto","submitted_at":"2012-01-30T15:15:37Z","abstract_excerpt":"We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\\\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya $C_{ab}$ curves proposed by Lee, Bras-Amor\\'os and O'Sullivan to general one-point AG codes, without any assumption. Finally we extend the latter unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6248","kind":"arxiv","version":4},"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":"1201.6248","created_at":"2026-05-18T03:43:52.609440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6248v4","created_at":"2026-05-18T03:43:52.609440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6248","created_at":"2026-05-18T03:43:52.609440+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWZYUJKNTSV7","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWZYUJKNTSV7DSOW","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWZYUJKN","created_at":"2026-05-18T12:27:23.164592+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/TWZYUJKNTSV7DSOW6VYFBXA7XI","json":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI.json","graph_json":"https://pith.science/api/pith-number/TWZYUJKNTSV7DSOW6VYFBXA7XI/graph.json","events_json":"https://pith.science/api/pith-number/TWZYUJKNTSV7DSOW6VYFBXA7XI/events.json","paper":"https://pith.science/paper/TWZYUJKN"},"agent_actions":{"view_html":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI","download_json":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI.json","view_paper":"https://pith.science/paper/TWZYUJKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6248&json=true","fetch_graph":"https://pith.science/api/pith-number/TWZYUJKNTSV7DSOW6VYFBXA7XI/graph.json","fetch_events":"https://pith.science/api/pith-number/TWZYUJKNTSV7DSOW6VYFBXA7XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI/action/storage_attestation","attest_author":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI/action/author_attestation","sign_citation":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI/action/citation_signature","submit_replication":"https://pith.science/pith/TWZYUJKNTSV7DSOW6VYFBXA7XI/action/replication_record"}},"created_at":"2026-05-18T03:43:52.609440+00:00","updated_at":"2026-05-18T03:43:52.609440+00:00"}