{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RXTL56PQBLHRX3AESYKSXULJQC","short_pith_number":"pith:RXTL56PQ","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"},"canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","source":{"kind":"arxiv","id":"2401.07986","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RXTL56PQBLHRX3AESYKSXULJQC","target":"record","payload":{"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"},"canonical_sha256":"8de6bef9f00acf1bec0496152bd169808bdb807e60357277cf79c99427dbef92","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"},"source_kind":"arxiv","source_id":"2401.07986","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-06-09T02:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pL9h8FHLqz+8AtwMg2DJA6Mi96E4VHYiVXEeWpczqY0o01wIV60e29Lz1T4k4HXF7WZ8mqQCSVL8mLB2mwyzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:39:33.981124Z"},"content_sha256":"9678ff1df4ca4d3a10b4a7480652adbc1722e4ad4a85255d1688c32fe6510fc0","schema_version":"1.0","event_id":"sha256:9678ff1df4ca4d3a10b4a7480652adbc1722e4ad4a85255d1688c32fe6510fc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RXTL56PQBLHRX3AESYKSXULJQC","target":"graph","payload":{"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"},"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-06-09T02:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRDFIaS3LzSMf5FpZ/i49zazACB/3xCxWSUqVn/0YbHOwqtkM9X4KmhH/AzLlUp7fc2S19F7sF1SYR84aGVfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:39:33.981536Z"},"content_sha256":"fdd466e0a129fc31567d328cd62dd37e99018edca28eb302bd3b6671dfdbe26d","schema_version":"1.0","event_id":"sha256:fdd466e0a129fc31567d328cd62dd37e99018edca28eb302bd3b6671dfdbe26d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/bundle.json","state_url":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXTL56PQBLHRX3AESYKSXULJQC/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-06-21T16:39:33Z","links":{"resolver":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC","bundle":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/bundle.json","state":"https://pith.science/pith/RXTL56PQBLHRX3AESYKSXULJQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXTL56PQBLHRX3AESYKSXULJQC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0C0Z+9l/Da8IjCw68dZlRq1dLDGLfaWADNq7s2wTdj6JnFi1b56irBptZlEt79Dv6B7FPksVAQbuTDMlmktBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T16:39:33.984271Z","bundle_sha256":"43f74d49fb8c5b72c8156ad762899be3957f926d49048535b54662df17e97f04"}}