{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7GF3EXZXADZHGDCD5QB62SG62E","short_pith_number":"pith:7GF3EXZX","schema_version":"1.0","canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","source":{"kind":"arxiv","id":"2607.26684","version":1},"attestation_state":"computed","paper":{"title":"Upper bounds on the length of quasi-MDS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rub\\'en Rodr\\'iguez-Ballesteros, Umberto Mart\\'inez-Pe\\~{n}as","submitted_at":"2026-07-29T09:34:20Z","abstract_excerpt":"We study upper bounds on the length of $\\mathbb F_q$-linear QMDS codes in the folded Hamming distance relative to their other parameters, especially the field size $q$. Via a correspondence between such codes and families of subspaces, we relate the length problem to that of upper bounding $1$-subspace packings with respect to the other parameters, especially the field size. Our main result is a reduction from these families to partial spreads, which allows us to import sharp bounds from finite geometry, including results of Drake-Freeman, N\\u{a}stase-Sissokho, and Honold-Kiermaier-Kurz. As a "},"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":"2607.26684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-29T09:34:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6e15b3546dfa9b9fa9f2814c858c679debdf8be2c4eaeded3bede4e30e8abbf","abstract_canon_sha256":"d05da29fc3783a8b530c8b1f599565c276c703a9182c6e8402f6a38e4f4ea1d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","last_reissued_at":"2026-07-30T01:21:55.972312Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:21:55.972312Z"},"graph_snapshot":{"paper":{"title":"Upper bounds on the length of quasi-MDS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rub\\'en Rodr\\'iguez-Ballesteros, Umberto Mart\\'inez-Pe\\~{n}as","submitted_at":"2026-07-29T09:34:20Z","abstract_excerpt":"We study upper bounds on the length of $\\mathbb F_q$-linear QMDS codes in the folded Hamming distance relative to their other parameters, especially the field size $q$. Via a correspondence between such codes and families of subspaces, we relate the length problem to that of upper bounding $1$-subspace packings with respect to the other parameters, especially the field size. Our main result is a reduction from these families to partial spreads, which allows us to import sharp bounds from finite geometry, including results of Drake-Freeman, N\\u{a}stase-Sissokho, and Honold-Kiermaier-Kurz. As a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26684","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/2607.26684/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":"2607.26684","created_at":"2026-07-30T01:21:55.977448+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26684v1","created_at":"2026-07-30T01:21:55.977448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26684","created_at":"2026-07-30T01:21:55.977448+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GF3EXZXADZH","created_at":"2026-07-30T01:21:55.977448+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GF3EXZXADZHGDCD","created_at":"2026-07-30T01:21:55.977448+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GF3EXZX","created_at":"2026-07-30T01:21:55.977448+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/7GF3EXZXADZHGDCD5QB62SG62E","json":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E.json","graph_json":"https://pith.science/api/pith-number/7GF3EXZXADZHGDCD5QB62SG62E/graph.json","events_json":"https://pith.science/api/pith-number/7GF3EXZXADZHGDCD5QB62SG62E/events.json","paper":"https://pith.science/paper/7GF3EXZX"},"agent_actions":{"view_html":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E","download_json":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E.json","view_paper":"https://pith.science/paper/7GF3EXZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26684&json=true","fetch_graph":"https://pith.science/api/pith-number/7GF3EXZXADZHGDCD5QB62SG62E/graph.json","fetch_events":"https://pith.science/api/pith-number/7GF3EXZXADZHGDCD5QB62SG62E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/action/storage_attestation","attest_author":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/action/author_attestation","sign_citation":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/action/citation_signature","submit_replication":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/action/replication_record"}},"created_at":"2026-07-30T01:21:55.977448+00:00","updated_at":"2026-07-30T01:21:55.977448+00:00"}