{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IDUGJJIMN67TWSFVJQOPA5OQ5C","short_pith_number":"pith:IDUGJJIM","schema_version":"1.0","canonical_sha256":"40e864a50c6fbf3b48b54c1cf075d0e8971f0bdfb8349f42f0e878373c79114a","source":{"kind":"arxiv","id":"2509.03186","version":1},"attestation_state":"computed","paper":{"title":"Long QMDS additive code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandro Giannoni, Daniele Bartoli, Giuseppe Marino, Yue Zhou","submitted_at":"2025-09-03T10:14:41Z","abstract_excerpt":"We investigate additive codes, defined as $\\mathbb{F}_q$-linear subspaces $C \\subseteq \\mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the minimum Hamming distance and the normalized dimension $r/h$ may be fractional. A central object of interest is the class of quasi-MDS (QMDS) codes, those additive codes achieving the generalized Singleton bound:\n  $$ d = n - \\left\\lceil \\frac{r}{h} \\right\\rceil + 1. $$\n  In this work, we construct explicit families of additive QMDS codes whose lengths exceed"},"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":"2509.03186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-03T10:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca685a4a7f254361def3fab7d3d8e4928a2879bdf20fbceef3f1b6af70de2771","abstract_canon_sha256":"3d9fc505f861f6f519702dd3cd546c17675fc34cd84b81208e4b5d31a03852a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:05.865527Z","signature_b64":"65iFLAQ5jbkuGPWA1m9xoO0bshIAE9EQOcuxE5l2id7k3qy0vT9x/pUxPZzPSgnXoXnjd8UqkLjnW/y88oZgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e864a50c6fbf3b48b54c1cf075d0e8971f0bdfb8349f42f0e878373c79114a","last_reissued_at":"2026-07-05T12:04:05.864765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:05.864765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long QMDS additive code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandro Giannoni, Daniele Bartoli, Giuseppe Marino, Yue Zhou","submitted_at":"2025-09-03T10:14:41Z","abstract_excerpt":"We investigate additive codes, defined as $\\mathbb{F}_q$-linear subspaces $C \\subseteq \\mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the minimum Hamming distance and the normalized dimension $r/h$ may be fractional. A central object of interest is the class of quasi-MDS (QMDS) codes, those additive codes achieving the generalized Singleton bound:\n  $$ d = n - \\left\\lceil \\frac{r}{h} \\right\\rceil + 1. $$\n  In this work, we construct explicit families of additive QMDS codes whose lengths exceed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03186","kind":"arxiv","version":1},"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/2509.03186/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":"2509.03186","created_at":"2026-07-05T12:04:05.864859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.03186v1","created_at":"2026-07-05T12:04:05.864859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03186","created_at":"2026-07-05T12:04:05.864859+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDUGJJIMN67T","created_at":"2026-07-05T12:04:05.864859+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDUGJJIMN67TWSFV","created_at":"2026-07-05T12:04:05.864859+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDUGJJIM","created_at":"2026-07-05T12:04:05.864859+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/IDUGJJIMN67TWSFVJQOPA5OQ5C","json":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C.json","graph_json":"https://pith.science/api/pith-number/IDUGJJIMN67TWSFVJQOPA5OQ5C/graph.json","events_json":"https://pith.science/api/pith-number/IDUGJJIMN67TWSFVJQOPA5OQ5C/events.json","paper":"https://pith.science/paper/IDUGJJIM"},"agent_actions":{"view_html":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C","download_json":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C.json","view_paper":"https://pith.science/paper/IDUGJJIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.03186&json=true","fetch_graph":"https://pith.science/api/pith-number/IDUGJJIMN67TWSFVJQOPA5OQ5C/graph.json","fetch_events":"https://pith.science/api/pith-number/IDUGJJIMN67TWSFVJQOPA5OQ5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C/action/storage_attestation","attest_author":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C/action/author_attestation","sign_citation":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C/action/citation_signature","submit_replication":"https://pith.science/pith/IDUGJJIMN67TWSFVJQOPA5OQ5C/action/replication_record"}},"created_at":"2026-07-05T12:04:05.864859+00:00","updated_at":"2026-07-05T12:04:05.864859+00:00"}