{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q24P5U6STNFQBQ3IVO2MANMTNI","short_pith_number":"pith:Q24P5U6S","canonical_record":{"source":{"id":"1311.2505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-11T17:14:54Z","cross_cats_sorted":["math-ph","math.IT","math.MP"],"title_canon_sha256":"c6771ef89d5be9daed66a1dd3475233546c31cb77dca4482bd60eaaf2614d07c","abstract_canon_sha256":"91d75b6f60a9d539b5b3856e776fbc2031ea4e3a04f42386ac7805997987bddf"},"schema_version":"1.0"},"canonical_sha256":"86b8fed3d29b4b00c368abb4c035936a0a0fe733954bdac93f931dc7e419b489","source":{"kind":"arxiv","id":"1311.2505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2505","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2505v2","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2505","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q24P5U6STNFQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q24P5U6STNFQBQ3I","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q24P5U6S","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q24P5U6STNFQBQ3IVO2MANMTNI","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-11T17:14:54Z","cross_cats_sorted":["math-ph","math.IT","math.MP"],"title_canon_sha256":"c6771ef89d5be9daed66a1dd3475233546c31cb77dca4482bd60eaaf2614d07c","abstract_canon_sha256":"91d75b6f60a9d539b5b3856e776fbc2031ea4e3a04f42386ac7805997987bddf"},"schema_version":"1.0"},"canonical_sha256":"86b8fed3d29b4b00c368abb4c035936a0a0fe733954bdac93f931dc7e419b489","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:59.538165Z","signature_b64":"6mp0fm8XY/lWY5XxgiPIZOCVN0bLHoS7a5kXGMfwFE+uwWeTxljy5+Ee7mFsU+V5KnB4+I/+m6w+aZMyctVQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86b8fed3d29b4b00c368abb4c035936a0a0fe733954bdac93f931dc7e419b489","last_reissued_at":"2026-05-18T01:20:59.537708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:59.537708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2505","source_version":2,"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-18T01:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zCn6Y1sZmSiPd7XzGsPMwhYFrU9kYO4orE5mYoTTK/eqlfN2jcRf1KtQMNETygLahXIgh7CXg4biHPjTViG6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:08:52.014383Z"},"content_sha256":"53d28f8c15163a5b1bd0aa300c3edada40d78dfe9bb8e5a121147f948e57c838","schema_version":"1.0","event_id":"sha256:53d28f8c15163a5b1bd0aa300c3edada40d78dfe9bb8e5a121147f948e57c838"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q24P5U6STNFQBQ3IVO2MANMTNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimal constacyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.IT","math.MP"],"primary_cat":"cs.IT","authors_text":"Giuliano G. La Guardia","submitted_at":"2013-11-11T17:14:54Z","abstract_excerpt":"In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters. In this light, we propose constructions of families of classical block and convolutional maximum-distance-separable (MDS) constacyclic codes, as well as families of asymmetric quantum MDS codes derived from (classical-block) constacyclic codes. These results are mainly derived from the investigation of suitable properties on cyclotomic cosets of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2505","kind":"arxiv","version":2},"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"},"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-18T01:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0r5yA0fQ5YmG6YTG6g/sPqvAAHx7o/O/sbLA/zkwZsj/wDW66Ek39MwmdR8FIvv9vXGTWBH3kEgT4FKUWx8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:08:52.014732Z"},"content_sha256":"b526227c179f9afb6175e5bd9270e4677674c4807e85de6cfa6e67c9704d1b76","schema_version":"1.0","event_id":"sha256:b526227c179f9afb6175e5bd9270e4677674c4807e85de6cfa6e67c9704d1b76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/bundle.json","state_url":"https://pith.science/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/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-24T05:08:52Z","links":{"resolver":"https://pith.science/pith/Q24P5U6STNFQBQ3IVO2MANMTNI","bundle":"https://pith.science/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/bundle.json","state":"https://pith.science/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q24P5U6STNFQBQ3IVO2MANMTNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q24P5U6STNFQBQ3IVO2MANMTNI","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":"91d75b6f60a9d539b5b3856e776fbc2031ea4e3a04f42386ac7805997987bddf","cross_cats_sorted":["math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-11T17:14:54Z","title_canon_sha256":"c6771ef89d5be9daed66a1dd3475233546c31cb77dca4482bd60eaaf2614d07c"},"schema_version":"1.0","source":{"id":"1311.2505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2505","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2505v2","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2505","created_at":"2026-05-18T01:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q24P5U6STNFQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q24P5U6STNFQBQ3I","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q24P5U6S","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:b526227c179f9afb6175e5bd9270e4677674c4807e85de6cfa6e67c9704d1b76","target":"graph","created_at":"2026-05-18T01:20: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"},"paper":{"abstract_excerpt":"In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters. In this light, we propose constructions of families of classical block and convolutional maximum-distance-separable (MDS) constacyclic codes, as well as families of asymmetric quantum MDS codes derived from (classical-block) constacyclic codes. These results are mainly derived from the investigation of suitable properties on cyclotomic cosets of th","authors_text":"Giuliano G. La Guardia","cross_cats":["math-ph","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-11T17:14:54Z","title":"On optimal constacyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2505","kind":"arxiv","version":2},"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:53d28f8c15163a5b1bd0aa300c3edada40d78dfe9bb8e5a121147f948e57c838","target":"record","created_at":"2026-05-18T01:20: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":"91d75b6f60a9d539b5b3856e776fbc2031ea4e3a04f42386ac7805997987bddf","cross_cats_sorted":["math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-11T17:14:54Z","title_canon_sha256":"c6771ef89d5be9daed66a1dd3475233546c31cb77dca4482bd60eaaf2614d07c"},"schema_version":"1.0","source":{"id":"1311.2505","kind":"arxiv","version":2}},"canonical_sha256":"86b8fed3d29b4b00c368abb4c035936a0a0fe733954bdac93f931dc7e419b489","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86b8fed3d29b4b00c368abb4c035936a0a0fe733954bdac93f931dc7e419b489","first_computed_at":"2026-05-18T01:20:59.537708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:59.537708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6mp0fm8XY/lWY5XxgiPIZOCVN0bLHoS7a5kXGMfwFE+uwWeTxljy5+Ee7mFsU+V5KnB4+I/+m6w+aZMyctVQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:59.538165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d28f8c15163a5b1bd0aa300c3edada40d78dfe9bb8e5a121147f948e57c838","sha256:b526227c179f9afb6175e5bd9270e4677674c4807e85de6cfa6e67c9704d1b76"],"state_sha256":"9baf03c90bb35b077baf13d282e3f3866f3b4eab1aefd5d4cda63c3b8a60a9a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkBcu/5RZNoxY09pLHh9bPUMf0qxl/0tjv3WELyxRnVv0JxbMVlXVeQ2nOXwscEE5+j+keOUJOrQ2PaiUEILBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:08:52.016664Z","bundle_sha256":"f9108e1a4c7961a5ab274495c8c3206720fff010e0202b8cd7c9218b03024d73"}}