{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UW42Y77LLRNIKP6BTKINXRFYHI","short_pith_number":"pith:UW42Y77L","schema_version":"1.0","canonical_sha256":"a5b9ac7feb5c5a853fc19a90dbc4b83a2adcb58712a06a95df5866db0b47a645","source":{"kind":"arxiv","id":"2404.18438","version":1},"attestation_state":"computed","paper":{"title":"Two classes of constacyclic codes with a square-root-like lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Cunsheng Ding, Hao Chen, Tingfang Chen, Zhonghua Sun","submitted_at":"2024-04-29T05:26:51Z","abstract_excerpt":"Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic structure. In this paper, an infinite class of $q$-ary negacyclic codes of length $(q^m-1)/2$ and an infinite class of $q$-ary constacyclic codes of length $(q^m-1)/(q-1)$ are constructed and analyzed. As a by-product, two infinite classes of ternary negacyclic self-dual codes with a square-root-like lower bound on their minimum distances are presented."},"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":"2404.18438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-29T05:26:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"55f1240add680a6312f1b47412f9c00aabfa4217539118e90484f90c43e9a0b9","abstract_canon_sha256":"02d47d8958480392e1b7781be2c09a20a665d8b0100602de3d4f8fe79c7ecea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:16.303000Z","signature_b64":"6Un0UftXm5iY0K1MB1n0Z7iEgNgFuG+AAcg/no1I16ajwCtvvc79Zurz5tn7Gc6LoPCL9due9ZhSb1rAn7SvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5b9ac7feb5c5a853fc19a90dbc4b83a2adcb58712a06a95df5866db0b47a645","last_reissued_at":"2026-07-05T08:13:16.302594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:16.302594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two classes of constacyclic codes with a square-root-like lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Cunsheng Ding, Hao Chen, Tingfang Chen, Zhonghua Sun","submitted_at":"2024-04-29T05:26:51Z","abstract_excerpt":"Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic structure. In this paper, an infinite class of $q$-ary negacyclic codes of length $(q^m-1)/2$ and an infinite class of $q$-ary constacyclic codes of length $(q^m-1)/(q-1)$ are constructed and analyzed. As a by-product, two infinite classes of ternary negacyclic self-dual codes with a square-root-like lower bound on their minimum distances are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18438","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/2404.18438/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.18438","created_at":"2026-07-05T08:13:16.302652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18438v1","created_at":"2026-07-05T08:13:16.302652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18438","created_at":"2026-07-05T08:13:16.302652+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW42Y77LLRNI","created_at":"2026-07-05T08:13:16.302652+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW42Y77LLRNIKP6B","created_at":"2026-07-05T08:13:16.302652+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW42Y77L","created_at":"2026-07-05T08:13:16.302652+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/UW42Y77LLRNIKP6BTKINXRFYHI","json":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI.json","graph_json":"https://pith.science/api/pith-number/UW42Y77LLRNIKP6BTKINXRFYHI/graph.json","events_json":"https://pith.science/api/pith-number/UW42Y77LLRNIKP6BTKINXRFYHI/events.json","paper":"https://pith.science/paper/UW42Y77L"},"agent_actions":{"view_html":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI","download_json":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI.json","view_paper":"https://pith.science/paper/UW42Y77L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18438&json=true","fetch_graph":"https://pith.science/api/pith-number/UW42Y77LLRNIKP6BTKINXRFYHI/graph.json","fetch_events":"https://pith.science/api/pith-number/UW42Y77LLRNIKP6BTKINXRFYHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI/action/storage_attestation","attest_author":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI/action/author_attestation","sign_citation":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI/action/citation_signature","submit_replication":"https://pith.science/pith/UW42Y77LLRNIKP6BTKINXRFYHI/action/replication_record"}},"created_at":"2026-07-05T08:13:16.302652+00:00","updated_at":"2026-07-05T08:13:16.302652+00:00"}