{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHYQXOKQCS2IDN4PNNH6GQYAOF","short_pith_number":"pith:KHYQXOKQ","canonical_record":{"source":{"id":"1706.06269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-06-20T04:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"1739fba048559184a2694c80ec3c5c858b38b565efc6d46183b5796fefc8c1c0","abstract_canon_sha256":"17b41ce9c7940a88c8bbbf25ffd8ee5c7c33e9a82f33946d61f6c4c5716eeaf6"},"schema_version":"1.0"},"canonical_sha256":"51f10bb95014b481b78f6b4fe343007152097f6b9f3236432767d42c51354f3a","source":{"kind":"arxiv","id":"1706.06269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06269","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06269v2","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06269","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"KHYQXOKQCS2I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHYQXOKQCS2IDN4P","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHYQXOKQ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHYQXOKQCS2IDN4PNNH6GQYAOF","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-06-20T04:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"1739fba048559184a2694c80ec3c5c858b38b565efc6d46183b5796fefc8c1c0","abstract_canon_sha256":"17b41ce9c7940a88c8bbbf25ffd8ee5c7c33e9a82f33946d61f6c4c5716eeaf6"},"schema_version":"1.0"},"canonical_sha256":"51f10bb95014b481b78f6b4fe343007152097f6b9f3236432767d42c51354f3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:34.872712Z","signature_b64":"4kKXzcX3ztbY3GohvzOT0eQl27p1UC48Nf5uIZYhK9hDVsQb2H+/djWW3rtZqyoAwwN0JctEUnG5G6qldCZBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f10bb95014b481b78f6b4fe343007152097f6b9f3236432767d42c51354f3a","last_reissued_at":"2026-05-18T00:34:34.872309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:34.872309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06269","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-18T00:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aD5svsYnR7MfPrI1L94PgTySZBdgKUHqlh5SSN+rOTsarHRdYmsLw381tAVCSchUulXt2XUaH1NeHJ6CmBgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:03:30.661207Z"},"content_sha256":"3c33648a5b384772eafe278349dab4abb89cf06852bda9b9bd3eab442ae17e5a","schema_version":"1.0","event_id":"sha256:3c33648a5b384772eafe278349dab4abb89cf06852bda9b9bd3eab442ae17e5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHYQXOKQCS2IDN4PNNH6GQYAOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repeated-root constacyclic codes over finite commutative chain rings and their distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Anuradha Sharma, Tania Sidana","submitted_at":"2017-06-20T04:59:09Z","abstract_excerpt":"Let $\\mathcal{R}_e$ be a finite commutative chain ring with nilpotency index $e \\geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\\mathcal{R}_{2},$ their sizes and their dual codes are determined. As an application, some isodual constacyclic codes over $\\mathcal{R}_{2}$ are also listed. Moreover, Hamming distances, Rosenbloom-Tsfasman distances and Rosenbloom-Tsfasman weight distributions of all repeated-root constacyclic codes over $\\mathcal{R}_{2}$ and some repeated-root constacyclic codes over $\\mathcal{R}_{e}$ are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06269","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-18T00:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zGZmjDecHzGwn0adWhxt0fo4oGsPjO2kYYGt39Zz+jA79lH36Un+tCDOxmZuUmSrGOd0wgwdipr/VaNByeEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:03:30.661580Z"},"content_sha256":"66ca35a34e990b659e16239cd32fcaa7d5df6323f5ee3fc6f1a6cbf46b9a2cfe","schema_version":"1.0","event_id":"sha256:66ca35a34e990b659e16239cd32fcaa7d5df6323f5ee3fc6f1a6cbf46b9a2cfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/bundle.json","state_url":"https://pith.science/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/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-23T17:03:30Z","links":{"resolver":"https://pith.science/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF","bundle":"https://pith.science/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/bundle.json","state":"https://pith.science/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHYQXOKQCS2IDN4PNNH6GQYAOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHYQXOKQCS2IDN4PNNH6GQYAOF","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":"17b41ce9c7940a88c8bbbf25ffd8ee5c7c33e9a82f33946d61f6c4c5716eeaf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-06-20T04:59:09Z","title_canon_sha256":"1739fba048559184a2694c80ec3c5c858b38b565efc6d46183b5796fefc8c1c0"},"schema_version":"1.0","source":{"id":"1706.06269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06269","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06269v2","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06269","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"KHYQXOKQCS2I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHYQXOKQCS2IDN4P","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHYQXOKQ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:66ca35a34e990b659e16239cd32fcaa7d5df6323f5ee3fc6f1a6cbf46b9a2cfe","target":"graph","created_at":"2026-05-18T00:34:34Z","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":"Let $\\mathcal{R}_e$ be a finite commutative chain ring with nilpotency index $e \\geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\\mathcal{R}_{2},$ their sizes and their dual codes are determined. As an application, some isodual constacyclic codes over $\\mathcal{R}_{2}$ are also listed. Moreover, Hamming distances, Rosenbloom-Tsfasman distances and Rosenbloom-Tsfasman weight distributions of all repeated-root constacyclic codes over $\\mathcal{R}_{2}$ and some repeated-root constacyclic codes over $\\mathcal{R}_{e}$ are determined.","authors_text":"Anuradha Sharma, Tania Sidana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-06-20T04:59:09Z","title":"Repeated-root constacyclic codes over finite commutative chain rings and their distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06269","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:3c33648a5b384772eafe278349dab4abb89cf06852bda9b9bd3eab442ae17e5a","target":"record","created_at":"2026-05-18T00:34:34Z","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":"17b41ce9c7940a88c8bbbf25ffd8ee5c7c33e9a82f33946d61f6c4c5716eeaf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-06-20T04:59:09Z","title_canon_sha256":"1739fba048559184a2694c80ec3c5c858b38b565efc6d46183b5796fefc8c1c0"},"schema_version":"1.0","source":{"id":"1706.06269","kind":"arxiv","version":2}},"canonical_sha256":"51f10bb95014b481b78f6b4fe343007152097f6b9f3236432767d42c51354f3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51f10bb95014b481b78f6b4fe343007152097f6b9f3236432767d42c51354f3a","first_computed_at":"2026-05-18T00:34:34.872309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:34.872309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4kKXzcX3ztbY3GohvzOT0eQl27p1UC48Nf5uIZYhK9hDVsQb2H+/djWW3rtZqyoAwwN0JctEUnG5G6qldCZBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:34.872712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c33648a5b384772eafe278349dab4abb89cf06852bda9b9bd3eab442ae17e5a","sha256:66ca35a34e990b659e16239cd32fcaa7d5df6323f5ee3fc6f1a6cbf46b9a2cfe"],"state_sha256":"b20d7aa2a489fae71c38f27b0b230daff3edb099748e344bcf0c1dc798da6fe5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIE/7enSnC3DJUfA6mnERXjIKRzzFf1wxuS01hHGWWolnEOpPmFPE/698tH/P4FbWcTznEJcStuFy0Etfb+ACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:03:30.663518Z","bundle_sha256":"9dbed73d49e934843a9457edaf88479f42f200c2fbba6bf670394b2c4341616d"}}