{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AKTX5PYP2H4H2FNHLG22FESWES","short_pith_number":"pith:AKTX5PYP","schema_version":"1.0","canonical_sha256":"02a77ebf0fd1f87d15a759b5a29256249dac3312aa0b5e1c2f2939574f9d1c24","source":{"kind":"arxiv","id":"2507.09290","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically optimal cyclic subspace codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chiara Castello, Paolo Santonastaso","submitted_at":"2025-07-12T14:00:11Z","abstract_excerpt":"Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing cyclic subspace codes with large cardinality and prescribed minimum distance. Using this new method, we provide new constructions of cyclic subspace codes in the Grassmannian $\\mathcal{G}_q(n,k)$ of all $k$-dimensional $\\mathbb{F}_q$-subspaces of an $n$-dimensional vector space over $\\mathbb{F}_q$, when $k\\mid n$ and $n/k$ is a composite number, with minimu"},"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":"2507.09290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-12T14:00:11Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"aa75bc96fdf6048b9dc985d89d6c90c3661a631ac52781ead73058a8ee72dc01","abstract_canon_sha256":"6bf47aaa021a9b0190c45a7cdfa6ab727d4941b1df33553ea9f3fe439649fbdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:06.832487Z","signature_b64":"jYbYruIn7M1nZrtfoMsHWJ/aomGmho/m/r87wka9CAjQ1YJWOrHoIL8di3w/incnlNuy+Ue3czHnwdi/FC+zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a77ebf0fd1f87d15a759b5a29256249dac3312aa0b5e1c2f2939574f9d1c24","last_reissued_at":"2026-07-05T11:36:06.832134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:06.832134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically optimal cyclic subspace codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chiara Castello, Paolo Santonastaso","submitted_at":"2025-07-12T14:00:11Z","abstract_excerpt":"Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing cyclic subspace codes with large cardinality and prescribed minimum distance. Using this new method, we provide new constructions of cyclic subspace codes in the Grassmannian $\\mathcal{G}_q(n,k)$ of all $k$-dimensional $\\mathbb{F}_q$-subspaces of an $n$-dimensional vector space over $\\mathbb{F}_q$, when $k\\mid n$ and $n/k$ is a composite number, with minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09290","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/2507.09290/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":"2507.09290","created_at":"2026-07-05T11:36:06.832188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.09290v1","created_at":"2026-07-05T11:36:06.832188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09290","created_at":"2026-07-05T11:36:06.832188+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKTX5PYP2H4H","created_at":"2026-07-05T11:36:06.832188+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKTX5PYP2H4H2FNH","created_at":"2026-07-05T11:36:06.832188+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKTX5PYP","created_at":"2026-07-05T11:36:06.832188+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/AKTX5PYP2H4H2FNHLG22FESWES","json":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES.json","graph_json":"https://pith.science/api/pith-number/AKTX5PYP2H4H2FNHLG22FESWES/graph.json","events_json":"https://pith.science/api/pith-number/AKTX5PYP2H4H2FNHLG22FESWES/events.json","paper":"https://pith.science/paper/AKTX5PYP"},"agent_actions":{"view_html":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES","download_json":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES.json","view_paper":"https://pith.science/paper/AKTX5PYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.09290&json=true","fetch_graph":"https://pith.science/api/pith-number/AKTX5PYP2H4H2FNHLG22FESWES/graph.json","fetch_events":"https://pith.science/api/pith-number/AKTX5PYP2H4H2FNHLG22FESWES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES/action/storage_attestation","attest_author":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES/action/author_attestation","sign_citation":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES/action/citation_signature","submit_replication":"https://pith.science/pith/AKTX5PYP2H4H2FNHLG22FESWES/action/replication_record"}},"created_at":"2026-07-05T11:36:06.832188+00:00","updated_at":"2026-07-05T11:36:06.832188+00:00"}