{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CNEAJQDHYANQ67EOA76J3YOVA2","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":"01914d6c7269e278bdd168d09556275975c7ce6c2180aadbedf7085273958959","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-27T04:38:18Z","title_canon_sha256":"7d8db48cd28cdeb1e62cf28b2603a1edf78c711f2d75351ff350bc11e7ba55fb"},"schema_version":"1.0","source":{"id":"1302.6660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6660","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6660v1","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6660","created_at":"2026-05-18T03:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"CNEAJQDHYANQ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CNEAJQDHYANQ67EO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CNEAJQDH","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:cafb732212a2892e425850aa99c90823bbe0e62b7109bc2b6e371a609cc266b8","target":"graph","created_at":"2026-05-18T03:32:19Z","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 use class field theory, specifically Drinfeld modules of rank 1, to construct a family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. Over a field of size $\\ell^2$, these codes are within $2/(\\sqrt{\\ell}-1)$ of the Singleton bound. The functions fields underlying these codes are subfields with a cyclic Galois group of the narrow ray class field of certain function fields. The resulting codes are \"folded\" using a generator of the Galois group. This generalizes earlier work by the first author on folded AG codes based on cyclotomic function fields. Using the Chebo","authors_text":"Chaoping Xing, Venkatesan Guruswami","cross_cats":["cs.CC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-27T04:38:18Z","title":"Optimal rate algebraic list decoding using narrow ray class fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6660","kind":"arxiv","version":1},"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:693897bace7107b92d90652f80870996d87ffaffae51765d5c580ddc6f533a90","target":"record","created_at":"2026-05-18T03:32:19Z","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":"01914d6c7269e278bdd168d09556275975c7ce6c2180aadbedf7085273958959","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-27T04:38:18Z","title_canon_sha256":"7d8db48cd28cdeb1e62cf28b2603a1edf78c711f2d75351ff350bc11e7ba55fb"},"schema_version":"1.0","source":{"id":"1302.6660","kind":"arxiv","version":1}},"canonical_sha256":"134804c067c01b0f7c8e07fc9de1d50699622cc255f8ebf63e7a3dc43e6ec15b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"134804c067c01b0f7c8e07fc9de1d50699622cc255f8ebf63e7a3dc43e6ec15b","first_computed_at":"2026-05-18T03:32:19.200434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:19.200434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QaIx+xCjQsH+IqvgYx0DIkJkZsdwJHTevQgnUjkF/MfQwQJhS1zhIdLge3+8gILzBxqEI4Dg7dRxvQxCL39NAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:19.201158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:693897bace7107b92d90652f80870996d87ffaffae51765d5c580ddc6f533a90","sha256:cafb732212a2892e425850aa99c90823bbe0e62b7109bc2b6e371a609cc266b8"],"state_sha256":"ab4a24362f3de3e2e94cbbec71f5db4195df3bcf4b85ee14b0b26c528a59ec3c"}