{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BQIZBXRQ473YQABFGYJ2YXG66P","short_pith_number":"pith:BQIZBXRQ","canonical_record":{"source":{"id":"2605.24314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-23T00:43:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37f28587db361516b7e783918e75070d03141acc6500ebad4db52ccd3abd9410","abstract_canon_sha256":"1077c8c1d982775e8bc1e51353ae6864602d440ff96e7bd97552b2421ab1f499"},"schema_version":"1.0"},"canonical_sha256":"0c1190de30e7f78800253613ac5cdef3f48b83f4faa8d166c7c13a18cb854383","source":{"kind":"arxiv","id":"2605.24314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24314","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24314v1","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24314","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"BQIZBXRQ473Y","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"BQIZBXRQ473YQABF","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"BQIZBXRQ","created_at":"2026-05-26T01:02:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BQIZBXRQ473YQABFGYJ2YXG66P","target":"record","payload":{"canonical_record":{"source":{"id":"2605.24314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-23T00:43:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37f28587db361516b7e783918e75070d03141acc6500ebad4db52ccd3abd9410","abstract_canon_sha256":"1077c8c1d982775e8bc1e51353ae6864602d440ff96e7bd97552b2421ab1f499"},"schema_version":"1.0"},"canonical_sha256":"0c1190de30e7f78800253613ac5cdef3f48b83f4faa8d166c7c13a18cb854383","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:59.314206Z","signature_b64":"pbiy46Lo79GRqg7FmE9eNsKNTGCzaYrBn1lAl3tDgiZsshgHXketUzuvqEb+p2loZZ+ipuySMsxey/XFsSMpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c1190de30e7f78800253613ac5cdef3f48b83f4faa8d166c7c13a18cb854383","last_reissued_at":"2026-05-26T01:02:59.313294Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:59.313294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.24314","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-05-26T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TxbxVBvmDMu9jdfod/UBLohAThRYlVfis7q0HK0HHW52hXtFSPZbZsacVx14X3W7JOwGlH3DO7SIRj6syJjmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:25:39.535745Z"},"content_sha256":"49e728b5b43453b53dcb142951f76a8d097d23736c47cb9c3a68c95b52d9217d","schema_version":"1.0","event_id":"sha256:49e728b5b43453b53dcb142951f76a8d097d23736c47cb9c3a68c95b52d9217d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BQIZBXRQ473YQABFGYJ2YXG66P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Permutation Groups of Cyclic Codes over Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Jicheng Ma, Junjie Huang","submitted_at":"2026-05-23T00:43:24Z","abstract_excerpt":"The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic codes with very long lengths and special generator polynomials to those with prime lengths. Consequently, we mainly determine the permutation groups of certain cyclic codes over $\\mathbb{F}_{r^\\alpha}$ with lengths $hp$, $r^mp^n$ and $pq$ and special generator polynomials where $h$ is a positive integer and $p$, $q$ and $r$ are distinct prime numbers. For lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24314","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/2605.24314/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-05-26T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyaDeT1SPCopI7BoIDfh7Oc5D6F2o+epapBgaMgmB7Z7OJZ98otHxjL2zRdMRUuEu1YTiSfDH/1DhTVPTO7BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:25:39.536477Z"},"content_sha256":"301e38359128305880ac3d8c7da8e1e66866face81595248f781c249404b9fbe","schema_version":"1.0","event_id":"sha256:301e38359128305880ac3d8c7da8e1e66866face81595248f781c249404b9fbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQIZBXRQ473YQABFGYJ2YXG66P/bundle.json","state_url":"https://pith.science/pith/BQIZBXRQ473YQABFGYJ2YXG66P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQIZBXRQ473YQABFGYJ2YXG66P/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-06-06T14:25:39Z","links":{"resolver":"https://pith.science/pith/BQIZBXRQ473YQABFGYJ2YXG66P","bundle":"https://pith.science/pith/BQIZBXRQ473YQABFGYJ2YXG66P/bundle.json","state":"https://pith.science/pith/BQIZBXRQ473YQABFGYJ2YXG66P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQIZBXRQ473YQABFGYJ2YXG66P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BQIZBXRQ473YQABFGYJ2YXG66P","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":"1077c8c1d982775e8bc1e51353ae6864602d440ff96e7bd97552b2421ab1f499","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-23T00:43:24Z","title_canon_sha256":"37f28587db361516b7e783918e75070d03141acc6500ebad4db52ccd3abd9410"},"schema_version":"1.0","source":{"id":"2605.24314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24314","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24314v1","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24314","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"BQIZBXRQ473Y","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"BQIZBXRQ473YQABF","created_at":"2026-05-26T01:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"BQIZBXRQ","created_at":"2026-05-26T01:02:59Z"}],"graph_snapshots":[{"event_id":"sha256:301e38359128305880ac3d8c7da8e1e66866face81595248f781c249404b9fbe","target":"graph","created_at":"2026-05-26T01:02: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/2605.24314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic codes with very long lengths and special generator polynomials to those with prime lengths. Consequently, we mainly determine the permutation groups of certain cyclic codes over $\\mathbb{F}_{r^\\alpha}$ with lengths $hp$, $r^mp^n$ and $pq$ and special generator polynomials where $h$ is a positive integer and $p$, $q$ and $r$ are distinct prime numbers. For lengt","authors_text":"Chang-An Zhao, Jicheng Ma, Junjie Huang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-23T00:43:24Z","title":"On Permutation Groups of Cyclic Codes over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24314","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:49e728b5b43453b53dcb142951f76a8d097d23736c47cb9c3a68c95b52d9217d","target":"record","created_at":"2026-05-26T01:02: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":"1077c8c1d982775e8bc1e51353ae6864602d440ff96e7bd97552b2421ab1f499","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-23T00:43:24Z","title_canon_sha256":"37f28587db361516b7e783918e75070d03141acc6500ebad4db52ccd3abd9410"},"schema_version":"1.0","source":{"id":"2605.24314","kind":"arxiv","version":1}},"canonical_sha256":"0c1190de30e7f78800253613ac5cdef3f48b83f4faa8d166c7c13a18cb854383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c1190de30e7f78800253613ac5cdef3f48b83f4faa8d166c7c13a18cb854383","first_computed_at":"2026-05-26T01:02:59.313294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:02:59.313294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pbiy46Lo79GRqg7FmE9eNsKNTGCzaYrBn1lAl3tDgiZsshgHXketUzuvqEb+p2loZZ+ipuySMsxey/XFsSMpCg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:02:59.314206Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49e728b5b43453b53dcb142951f76a8d097d23736c47cb9c3a68c95b52d9217d","sha256:301e38359128305880ac3d8c7da8e1e66866face81595248f781c249404b9fbe"],"state_sha256":"3e21159886407c5b564a3863fcbdf3560cffba987d4d5c721d40c3531c2e8427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPaaS5VHETFlXKpiG8zVJxYT3dniv1zsXe4LpO/w/fOdH2JOQ31oSkC5hf+iJGd2D0YrEwYofpxO2E+O2Lz2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:25:39.540006Z","bundle_sha256":"6d22d14521e6de1052984a9d147c925562843c3c4bc05a36175d2c8ff3ccd9fd"}}