{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RXTL56PQBLHRX3AESYKSXULJQC","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":"eaa2d44aa1c0c29c699feec58f7e693d961240ed4a9255269258e8e1f02f0c36","cross_cats_sorted":["math.IT","math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T22:14:44Z","title_canon_sha256":"abe6a3a8d45f5e7c1f2f61d72ee10e5be1cf2cc7e97c3f49ce3547a23997ae5d"},"schema_version":"1.0","source":{"id":"2401.07986","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07986","created_at":"2026-06-09T02:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07986v3","created_at":"2026-06-09T02:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07986","created_at":"2026-06-09T02:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"RXTL56PQBLHR","created_at":"2026-06-09T02:08:26Z"},{"alias_kind":"pith_short_16","alias_value":"RXTL56PQBLHRX3AE","created_at":"2026-06-09T02:08:26Z"},{"alias_kind":"pith_short_8","alias_value":"RXTL56PQ","created_at":"2026-06-09T02:08:26Z"}],"graph_snapshots":[{"event_id":"sha256:fdd466e0a129fc31567d328cd62dd37e99018edca28eb302bd3b6671dfdbe26d","target":"graph","created_at":"2026-06-09T02:08:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.07986/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $n$ be a prime power, $r$ be a prime with $r\\mid n-1$, and $\\varepsilon\\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\\mathbb F_r$ having length $n$, relative distance $(r-1)/r+O(n^{-\\varepsilon})$ and rate $n^{-1/2-\\varepsilon}$. When $r=2$, our binary codes have exponential size when compared to all previously known families of linear and non-linear codes with relative distance asymptotic to $1/2$, such as Delsarte--Goethals codes. Moreover, concatenating with a Reed-Solomon code we get a family of codes of length $n","authors_text":"Akash Bhople, Giacomo Cherubini, Giacomo Micheli, Tefjol Pllaha","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T22:14:44Z","title":"A New Class of Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07986","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:9678ff1df4ca4d3a10b4a7480652adbc1722e4ad4a85255d1688c32fe6510fc0","target":"record","created_at":"2026-06-09T02:08:26Z","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":"eaa2d44aa1c0c29c699feec58f7e693d961240ed4a9255269258e8e1f02f0c36","cross_cats_sorted":["math.IT","math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T22:14:44Z","title_canon_sha256":"abe6a3a8d45f5e7c1f2f61d72ee10e5be1cf2cc7e97c3f49ce3547a23997ae5d"},"schema_version":"1.0","source":{"id":"2401.07986","kind":"arxiv","version":3}},"canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","first_computed_at":"2026-06-09T02:08:26.048375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:26.048375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOyqwpOAazNjzV1tETYKW3oFFtix/rGEOfB3ZANthMAk/jZZ3TWObfAEQFW6KqXzF8pO5gPpdtNjrbLOfqw1DA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:26.049204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.07986","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9678ff1df4ca4d3a10b4a7480652adbc1722e4ad4a85255d1688c32fe6510fc0","sha256:fdd466e0a129fc31567d328cd62dd37e99018edca28eb302bd3b6671dfdbe26d"],"state_sha256":"2fb307f4ac3bc99242af9f8513b19b47da01db8b8ce530e2df71ca2d3b0d90b7"}