{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZTNSHRS22GMATCEIJ5OZM5DS7S","short_pith_number":"pith:ZTNSHRS2","schema_version":"1.0","canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","source":{"kind":"arxiv","id":"2501.03802","version":1},"attestation_state":"computed","paper":{"title":"Quasi-optimal cyclic orbit codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chiara Castello, Ferdinando Zullo, Heide Gluesing-Luerssen, Olga Polverino","submitted_at":"2025-01-07T14:14:14Z","abstract_excerpt":"We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective line. This allows us to derive new bounds on the parameters of the code. In the second part, we study a particular family of (quasi-)optimal cyclic orbit codes and derive a general existence theorem for quasi-optimal codes in even-dimensional vector spaces over finite fields of any characteristic. Finally, for our particular code family we describe the autom"},"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":"2501.03802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-07T14:14:14Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"fe9916aea567c9251ea9cf39b63a8a30a86342a5d05ebc5c68da5e38d3bea0b3","abstract_canon_sha256":"bdd3b8914dfeb35583c91206a939fbc50a1b698e1ce5dbb7d0113fcf3509dff5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:59.748500Z","signature_b64":"WVqOiHzZ3cyLIZZpjqktT8gSJI0NNud6Gz6RzXVZLAJaJr7k4TyU7Q28Br7lASKotsmkCUItrlt4vGn/3QVsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","last_reissued_at":"2026-07-05T09:57:59.747956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:59.747956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-optimal cyclic orbit codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chiara Castello, Ferdinando Zullo, Heide Gluesing-Luerssen, Olga Polverino","submitted_at":"2025-01-07T14:14:14Z","abstract_excerpt":"We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective line. This allows us to derive new bounds on the parameters of the code. In the second part, we study a particular family of (quasi-)optimal cyclic orbit codes and derive a general existence theorem for quasi-optimal codes in even-dimensional vector spaces over finite fields of any characteristic. Finally, for our particular code family we describe the autom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03802","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/2501.03802/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":"2501.03802","created_at":"2026-07-05T09:57:59.748031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03802v1","created_at":"2026-07-05T09:57:59.748031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03802","created_at":"2026-07-05T09:57:59.748031+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTNSHRS22GMA","created_at":"2026-07-05T09:57:59.748031+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTNSHRS22GMATCEI","created_at":"2026-07-05T09:57:59.748031+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTNSHRS2","created_at":"2026-07-05T09:57:59.748031+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09290","citing_title":"Asymptotically optimal cyclic subspace codes","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S","json":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S.json","graph_json":"https://pith.science/api/pith-number/ZTNSHRS22GMATCEIJ5OZM5DS7S/graph.json","events_json":"https://pith.science/api/pith-number/ZTNSHRS22GMATCEIJ5OZM5DS7S/events.json","paper":"https://pith.science/paper/ZTNSHRS2"},"agent_actions":{"view_html":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S","download_json":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S.json","view_paper":"https://pith.science/paper/ZTNSHRS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03802&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTNSHRS22GMATCEIJ5OZM5DS7S/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTNSHRS22GMATCEIJ5OZM5DS7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/action/storage_attestation","attest_author":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/action/author_attestation","sign_citation":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/action/citation_signature","submit_replication":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/action/replication_record"}},"created_at":"2026-07-05T09:57:59.748031+00:00","updated_at":"2026-07-05T09:57:59.748031+00:00"}