{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QJNB2W5MACXE3OUIXJ45IOERO4","short_pith_number":"pith:QJNB2W5M","schema_version":"1.0","canonical_sha256":"825a1d5bac00ae4dba88ba79d43891773a046b3fce7692fc16abb799a9ac921d","source":{"kind":"arxiv","id":"1407.1905","version":1},"attestation_state":"computed","paper":{"title":"Polyadic Constacyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Hai Q. Dinh, San Ling, Yun Fan","submitted_at":"2014-07-07T23:13:29Z","abstract_excerpt":"For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier of a Type I polyadic constacyclic code is given. As an application, some optimal codes from Type I polyadic constacyclic codes, including generalized Reed-Solomon codes and alternant MDS codes, are constructed."},"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":"1407.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-07T23:13:29Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"59caffdcf3f31e26a1be285461f7510a15c94917500149ab8a4b31c43b2da98c","abstract_canon_sha256":"92bf569a3680be1d4a3d9758a65fb22070183e3c80d6d7a8713261ed44a6e168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.930745Z","signature_b64":"80Yrb9wl6krp1ugRksD+R3T5VqYuQ43r08JpuZMTWD4mgW46vCCgTLiKpVEQ5sdgaSdW6bIOFwt+7KEE8d7bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"825a1d5bac00ae4dba88ba79d43891773a046b3fce7692fc16abb799a9ac921d","last_reissued_at":"2026-05-18T02:48:08.930175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.930175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polyadic Constacyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Hai Q. Dinh, San Ling, Yun Fan","submitted_at":"2014-07-07T23:13:29Z","abstract_excerpt":"For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier of a Type I polyadic constacyclic code is given. As an application, some optimal codes from Type I polyadic constacyclic codes, including generalized Reed-Solomon codes and alternant MDS codes, are constructed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1905","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":"1407.1905","created_at":"2026-05-18T02:48:08.930234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1905v1","created_at":"2026-05-18T02:48:08.930234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1905","created_at":"2026-05-18T02:48:08.930234+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJNB2W5MACXE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJNB2W5MACXE3OUI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJNB2W5M","created_at":"2026-05-18T12:28:46.137349+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/QJNB2W5MACXE3OUIXJ45IOERO4","json":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4.json","graph_json":"https://pith.science/api/pith-number/QJNB2W5MACXE3OUIXJ45IOERO4/graph.json","events_json":"https://pith.science/api/pith-number/QJNB2W5MACXE3OUIXJ45IOERO4/events.json","paper":"https://pith.science/paper/QJNB2W5M"},"agent_actions":{"view_html":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4","download_json":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4.json","view_paper":"https://pith.science/paper/QJNB2W5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1905&json=true","fetch_graph":"https://pith.science/api/pith-number/QJNB2W5MACXE3OUIXJ45IOERO4/graph.json","fetch_events":"https://pith.science/api/pith-number/QJNB2W5MACXE3OUIXJ45IOERO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4/action/storage_attestation","attest_author":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4/action/author_attestation","sign_citation":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4/action/citation_signature","submit_replication":"https://pith.science/pith/QJNB2W5MACXE3OUIXJ45IOERO4/action/replication_record"}},"created_at":"2026-05-18T02:48:08.930234+00:00","updated_at":"2026-05-18T02:48:08.930234+00:00"}