{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FJVBCB4OS5G3AP7VODHSN57MZN","short_pith_number":"pith:FJVBCB4O","schema_version":"1.0","canonical_sha256":"2a6a11078e974db03ff570cf26f7eccb5b82d2e9ccafb88906780dc2e449061b","source":{"kind":"arxiv","id":"1207.3132","version":1},"attestation_state":"computed","paper":{"title":"On the Automorphism Groups and Equivalence of Cyclic Combinatorial Objects","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-07-13T02:21:40Z","abstract_excerpt":"We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial objects on $p^m$ elements are equivalent."},"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":"1207.3132","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T02:21:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efc470534b20b97d824492e79cec593e0e25c0975dc1ccd5fbd2d23903097c30","abstract_canon_sha256":"824ae5d52376a90c83f9bfb4efc0ddc27382690818b1bfd97203bc2f11f67fe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:12.384248Z","signature_b64":"vPMNj5vM3i4g0JVVY2jG7OUcn427oqiKMBf9klGIkspLvNx95vI1bC6VaMoFqo2Y9hFaQuO0YUl+noZL+oAqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6a11078e974db03ff570cf26f7eccb5b82d2e9ccafb88906780dc2e449061b","last_reissued_at":"2026-05-18T03:51:12.383761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:12.383761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Automorphism Groups and Equivalence of Cyclic Combinatorial Objects","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-07-13T02:21:40Z","abstract_excerpt":"We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial objects on $p^m$ elements are equivalent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3132","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":""},"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":"1207.3132","created_at":"2026-05-18T03:51:12.383838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3132v1","created_at":"2026-05-18T03:51:12.383838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3132","created_at":"2026-05-18T03:51:12.383838+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJVBCB4OS5G3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJVBCB4OS5G3AP7V","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJVBCB4O","created_at":"2026-05-18T12:27:06.952714+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/FJVBCB4OS5G3AP7VODHSN57MZN","json":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN.json","graph_json":"https://pith.science/api/pith-number/FJVBCB4OS5G3AP7VODHSN57MZN/graph.json","events_json":"https://pith.science/api/pith-number/FJVBCB4OS5G3AP7VODHSN57MZN/events.json","paper":"https://pith.science/paper/FJVBCB4O"},"agent_actions":{"view_html":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN","download_json":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN.json","view_paper":"https://pith.science/paper/FJVBCB4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3132&json=true","fetch_graph":"https://pith.science/api/pith-number/FJVBCB4OS5G3AP7VODHSN57MZN/graph.json","fetch_events":"https://pith.science/api/pith-number/FJVBCB4OS5G3AP7VODHSN57MZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN/action/storage_attestation","attest_author":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN/action/author_attestation","sign_citation":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN/action/citation_signature","submit_replication":"https://pith.science/pith/FJVBCB4OS5G3AP7VODHSN57MZN/action/replication_record"}},"created_at":"2026-05-18T03:51:12.383838+00:00","updated_at":"2026-05-18T03:51:12.383838+00:00"}