{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZTNSHRS22GMATCEIJ5OZM5DS7S","short_pith_number":"pith:ZTNSHRS2","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"},"canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","source":{"kind":"arxiv","id":"2501.03802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03802","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03802v1","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03802","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZTNSHRS22GMA","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTNSHRS22GMATCEI","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTNSHRS2","created_at":"2026-07-05T09:57:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZTNSHRS22GMATCEIJ5OZM5DS7S","target":"record","payload":{"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"},"canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","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"},"source_kind":"arxiv","source_id":"2501.03802","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-05T09:57:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMKXUJ7b4A6ZDfrgn3dcTUJlympVxOKTzlccuLZXXQ2r7Ejilk+D63X0zu8Yz/Rfn/4oaIejPez8mAKQaNCyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:09:36.233943Z"},"content_sha256":"f36edbb772efb6f06819568a5cef14586db3b72631e924ce6c59f792d9cdeb89","schema_version":"1.0","event_id":"sha256:f36edbb772efb6f06819568a5cef14586db3b72631e924ce6c59f792d9cdeb89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZTNSHRS22GMATCEIJ5OZM5DS7S","target":"graph","payload":{"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"},"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-05T09:57:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQP2cVZMLbPTawz43hYTSLqF3alFeDTz5SwDa9/l9vreEe8OW/S6kzwqi2MRIB0N50gBqY/UP0fvaXOspHqoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:09:36.234327Z"},"content_sha256":"98b081e298c5670089a90897a275ce5045a8a4cbcc385a58aa3f0ca57c8c30de","schema_version":"1.0","event_id":"sha256:98b081e298c5670089a90897a275ce5045a8a4cbcc385a58aa3f0ca57c8c30de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/bundle.json","state_url":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/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-12T03:09:36Z","links":{"resolver":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S","bundle":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/bundle.json","state":"https://pith.science/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTNSHRS22GMATCEIJ5OZM5DS7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZTNSHRS22GMATCEIJ5OZM5DS7S","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":"bdd3b8914dfeb35583c91206a939fbc50a1b698e1ce5dbb7d0113fcf3509dff5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-07T14:14:14Z","title_canon_sha256":"fe9916aea567c9251ea9cf39b63a8a30a86342a5d05ebc5c68da5e38d3bea0b3"},"schema_version":"1.0","source":{"id":"2501.03802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03802","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03802v1","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03802","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZTNSHRS22GMA","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTNSHRS22GMATCEI","created_at":"2026-07-05T09:57:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTNSHRS2","created_at":"2026-07-05T09:57:59Z"}],"graph_snapshots":[{"event_id":"sha256:98b081e298c5670089a90897a275ce5045a8a4cbcc385a58aa3f0ca57c8c30de","target":"graph","created_at":"2026-07-05T09:57:59Z","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/2501.03802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chiara Castello, Ferdinando Zullo, Heide Gluesing-Luerssen, Olga Polverino","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-07T14:14:14Z","title":"Quasi-optimal cyclic orbit codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03802","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:f36edbb772efb6f06819568a5cef14586db3b72631e924ce6c59f792d9cdeb89","target":"record","created_at":"2026-07-05T09:57:59Z","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":"bdd3b8914dfeb35583c91206a939fbc50a1b698e1ce5dbb7d0113fcf3509dff5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-07T14:14:14Z","title_canon_sha256":"fe9916aea567c9251ea9cf39b63a8a30a86342a5d05ebc5c68da5e38d3bea0b3"},"schema_version":"1.0","source":{"id":"2501.03802","kind":"arxiv","version":1}},"canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdb23c65ad1980988884f5d967472fc90794255d31c5e3fb67bdf0aebb3d5d2","first_computed_at":"2026-07-05T09:57:59.747956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:59.747956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVqOiHzZ3cyLIZZpjqktT8gSJI0NNud6Gz6RzXVZLAJaJr7k4TyU7Q28Br7lASKotsmkCUItrlt4vGn/3QVsDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:59.748500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.03802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36edbb772efb6f06819568a5cef14586db3b72631e924ce6c59f792d9cdeb89","sha256:98b081e298c5670089a90897a275ce5045a8a4cbcc385a58aa3f0ca57c8c30de"],"state_sha256":"b7ef5c477516a9d2ca1810835003cbc5b7a5ae6f85385a393c4de958823bf3a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7t3ume/mUs8b1Y9IvwR+bw5tU75Fh6M0NLBN39qlLx5uT5KGBOuza8WKgQH2ADEYsNNPt302MSQB1YD6EYhDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T03:09:36.236703Z","bundle_sha256":"dc4e2ac3718df610b3e9fad8faf8dc1396380a07a977d0cea470a097e4c8b959"}}