{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AKTX5PYP2H4H2FNHLG22FESWES","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":"6bf47aaa021a9b0190c45a7cdfa6ab727d4941b1df33553ea9f3fe439649fbdd","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-12T14:00:11Z","title_canon_sha256":"aa75bc96fdf6048b9dc985d89d6c90c3661a631ac52781ead73058a8ee72dc01"},"schema_version":"1.0","source":{"id":"2507.09290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09290","created_at":"2026-07-05T11:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09290v1","created_at":"2026-07-05T11:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09290","created_at":"2026-07-05T11:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"AKTX5PYP2H4H","created_at":"2026-07-05T11:36:06Z"},{"alias_kind":"pith_short_16","alias_value":"AKTX5PYP2H4H2FNH","created_at":"2026-07-05T11:36:06Z"},{"alias_kind":"pith_short_8","alias_value":"AKTX5PYP","created_at":"2026-07-05T11:36:06Z"}],"graph_snapshots":[{"event_id":"sha256:36422d8afdd8e7ea7803939b88f4b2e29a88bb79e3f7b85caac7d091f25b188b","target":"graph","created_at":"2026-07-05T11:36:06Z","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/2507.09290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chiara Castello, Paolo Santonastaso","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-12T14:00:11Z","title":"Asymptotically optimal cyclic subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09290","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:5c48e3e619d11f9b46d4e409de4b5b3a78128a5337f999ee4ba8425b0968d9b0","target":"record","created_at":"2026-07-05T11:36:06Z","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":"6bf47aaa021a9b0190c45a7cdfa6ab727d4941b1df33553ea9f3fe439649fbdd","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-12T14:00:11Z","title_canon_sha256":"aa75bc96fdf6048b9dc985d89d6c90c3661a631ac52781ead73058a8ee72dc01"},"schema_version":"1.0","source":{"id":"2507.09290","kind":"arxiv","version":1}},"canonical_sha256":"02a77ebf0fd1f87d15a759b5a29256249dac3312aa0b5e1c2f2939574f9d1c24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02a77ebf0fd1f87d15a759b5a29256249dac3312aa0b5e1c2f2939574f9d1c24","first_computed_at":"2026-07-05T11:36:06.832134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:06.832134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYbYruIn7M1nZrtfoMsHWJ/aomGmho/m/r87wka9CAjQ1YJWOrHoIL8di3w/incnlNuy+Ue3czHnwdi/FC+zBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:06.832487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c48e3e619d11f9b46d4e409de4b5b3a78128a5337f999ee4ba8425b0968d9b0","sha256:36422d8afdd8e7ea7803939b88f4b2e29a88bb79e3f7b85caac7d091f25b188b"],"state_sha256":"ae22431eb8492644ddda915e6b23fb2f7cce78f5ab9838fc0ef15718d77c3aa5"}