{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RXTL56PQBLHRX3AESYKSXULJQC","short_pith_number":"pith:RXTL56PQ","schema_version":"1.0","canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","source":{"kind":"arxiv","id":"2401.07986","version":3},"attestation_state":"computed","paper":{"title":"A New Class of Linear Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Akash Bhople, Giacomo Cherubini, Giacomo Micheli, Tefjol Pllaha","submitted_at":"2024-01-15T22:14:44Z","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"},"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":"2401.07986","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T22:14:44Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"abe6a3a8d45f5e7c1f2f61d72ee10e5be1cf2cc7e97c3f49ce3547a23997ae5d","abstract_canon_sha256":"eaa2d44aa1c0c29c699feec58f7e693d961240ed4a9255269258e8e1f02f0c36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:26.049204Z","signature_b64":"yOyqwpOAazNjzV1tETYKW3oFFtix/rGEOfB3ZANthMAk/jZZ3TWObfAEQFW6KqXzF8pO5gPpdtNjrbLOfqw1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","last_reissued_at":"2026-06-09T02:08:26.048375Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:26.048375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Class of Linear Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Akash Bhople, Giacomo Cherubini, Giacomo Micheli, Tefjol Pllaha","submitted_at":"2024-01-15T22:14:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07986","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.07986/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.07986","created_at":"2026-06-09T02:08:26.048507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07986v3","created_at":"2026-06-09T02:08:26.048507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07986","created_at":"2026-06-09T02:08:26.048507+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXTL56PQBLHR","created_at":"2026-06-09T02:08:26.048507+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXTL56PQBLHRX3AE","created_at":"2026-06-09T02:08:26.048507+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXTL56PQ","created_at":"2026-06-09T02:08:26.048507+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/RXTL56PQBLHRX3AESYKSXULJQC","json":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC.json","graph_json":"https://pith.science/api/pith-number/RXTL56PQBLHRX3AESYKSXULJQC/graph.json","events_json":"https://pith.science/api/pith-number/RXTL56PQBLHRX3AESYKSXULJQC/events.json","paper":"https://pith.science/paper/RXTL56PQ"},"agent_actions":{"view_html":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC","download_json":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC.json","view_paper":"https://pith.science/paper/RXTL56PQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07986&json=true","fetch_graph":"https://pith.science/api/pith-number/RXTL56PQBLHRX3AESYKSXULJQC/graph.json","fetch_events":"https://pith.science/api/pith-number/RXTL56PQBLHRX3AESYKSXULJQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/action/storage_attestation","attest_author":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/action/author_attestation","sign_citation":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/action/citation_signature","submit_replication":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/action/replication_record"}},"created_at":"2026-06-09T02:08:26.048507+00:00","updated_at":"2026-06-09T02:08:26.048507+00:00"}