{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7GF3EXZXADZHGDCD5QB62SG62E","short_pith_number":"pith:7GF3EXZX","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"},"canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","source":{"kind":"arxiv","id":"2607.26684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26684","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26684v1","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26684","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"7GF3EXZXADZH","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_16","alias_value":"7GF3EXZXADZHGDCD","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_8","alias_value":"7GF3EXZX","created_at":"2026-07-30T01:21:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7GF3EXZXADZHGDCD5QB62SG62E","target":"record","payload":{"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"},"canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","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"},"source_kind":"arxiv","source_id":"2607.26684","source_version":1,"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-07-30T01:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFeNB/Jp2xnuDSACasaGMHttOi7xNFN05JRPee77HlsfjQUc+JdWRDmL5YlpGcZOxuheuxDqT9mr9UPRAH0uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:38.431892Z"},"content_sha256":"1a77bcfc11a80a7430dad51fda603e8b28d0621e131a16059257d25e6641eab4","schema_version":"1.0","event_id":"sha256:1a77bcfc11a80a7430dad51fda603e8b28d0621e131a16059257d25e6641eab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7GF3EXZXADZHGDCD5QB62SG62E","target":"graph","payload":{"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"},"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-07-30T01:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1QAS4M/10If5aItsJRXPBLXqekAVLiGDEoKByK53O+XjTZLUleXn8AfgZ8nkcr8sf/5E743izs8jdDuF9oHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:38.432392Z"},"content_sha256":"b3e6ec09cbcd71bc47ecacfca20e9ecd10550f0b06f4b13048590b62682532d2","schema_version":"1.0","event_id":"sha256:b3e6ec09cbcd71bc47ecacfca20e9ecd10550f0b06f4b13048590b62682532d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/bundle.json","state_url":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GF3EXZXADZHGDCD5QB62SG62E/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-08-07T05:37:38Z","links":{"resolver":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E","bundle":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/bundle.json","state":"https://pith.science/pith/7GF3EXZXADZHGDCD5QB62SG62E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GF3EXZXADZHGDCD5QB62SG62E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7GF3EXZXADZHGDCD5QB62SG62E","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":"d05da29fc3783a8b530c8b1f599565c276c703a9182c6e8402f6a38e4f4ea1d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-29T09:34:20Z","title_canon_sha256":"d6e15b3546dfa9b9fa9f2814c858c679debdf8be2c4eaeded3bede4e30e8abbf"},"schema_version":"1.0","source":{"id":"2607.26684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26684","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26684v1","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26684","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"7GF3EXZXADZH","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_16","alias_value":"7GF3EXZXADZHGDCD","created_at":"2026-07-30T01:21:55Z"},{"alias_kind":"pith_short_8","alias_value":"7GF3EXZX","created_at":"2026-07-30T01:21:55Z"}],"graph_snapshots":[{"event_id":"sha256:b3e6ec09cbcd71bc47ecacfca20e9ecd10550f0b06f4b13048590b62682532d2","target":"graph","created_at":"2026-07-30T01:21:55Z","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/2607.26684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Rub\\'en Rodr\\'iguez-Ballesteros, Umberto Mart\\'inez-Pe\\~{n}as","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-29T09:34:20Z","title":"Upper bounds on the length of quasi-MDS codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26684","kind":"arxiv","version":1},"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:1a77bcfc11a80a7430dad51fda603e8b28d0621e131a16059257d25e6641eab4","target":"record","created_at":"2026-07-30T01:21:55Z","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":"d05da29fc3783a8b530c8b1f599565c276c703a9182c6e8402f6a38e4f4ea1d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-29T09:34:20Z","title_canon_sha256":"d6e15b3546dfa9b9fa9f2814c858c679debdf8be2c4eaeded3bede4e30e8abbf"},"schema_version":"1.0","source":{"id":"2607.26684","kind":"arxiv","version":1}},"canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f98bb25f3700f2730c43ec03ed48ded122a166b8f48ab4d2762d39bad6b157d3","first_computed_at":"2026-07-30T01:21:55.972312Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:21:55.972312Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a77bcfc11a80a7430dad51fda603e8b28d0621e131a16059257d25e6641eab4","sha256:b3e6ec09cbcd71bc47ecacfca20e9ecd10550f0b06f4b13048590b62682532d2"],"state_sha256":"cfa3ef941f45a468dd732d4b6c5b289667420ec448ec512ae605c5fd4fd23e9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10y70vYdnGN7L+RWzNxR2nTq8/CUon8TJf1GhIB+cewC7phglryTKXdUjVNEo0J4fcersPWObtCuFKGO9lAlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:37:38.435863Z","bundle_sha256":"96f5d05818d0630f30c433ac354b176b8e3b79d739c4c234e9c1c53c06d58d1e"}}