{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HJVZTHUCXA3MSW5BHP3LHWOU2H","short_pith_number":"pith:HJVZTHUC","schema_version":"1.0","canonical_sha256":"3a6b999e82b836c95ba13bf6b3d9d4d1c518cb2f2081e8b849ab9c3c677bded2","source":{"kind":"arxiv","id":"1508.05077","version":1},"attestation_state":"computed","paper":{"title":"A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerardo Vega","submitted_at":"2015-08-20T19:29:26Z","abstract_excerpt":"It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present "},"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":"1508.05077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T19:29:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f9807944c13e3adb8d694ed8697747c5602bc8a1acbdd9f32411efc04c9346a","abstract_canon_sha256":"b71a17144e2b83e86e21314b213735dd3bb68c804468c4491a319cf85f09a498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.708162Z","signature_b64":"68BOb3+vj73nG+572FmCoNM1RwvT4lxjGvUwtsfxfDWWWnBXq2ztPqG0vvD8AjSoBBVEpDsJvAg5g5EB2y2SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6b999e82b836c95ba13bf6b3d9d4d1c518cb2f2081e8b849ab9c3c677bded2","last_reissued_at":"2026-05-18T01:34:59.707445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.707445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerardo Vega","submitted_at":"2015-08-20T19:29:26Z","abstract_excerpt":"It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05077","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":"1508.05077","created_at":"2026-05-18T01:34:59.707555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05077v1","created_at":"2026-05-18T01:34:59.707555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05077","created_at":"2026-05-18T01:34:59.707555+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJVZTHUCXA3M","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJVZTHUCXA3MSW5B","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJVZTHUC","created_at":"2026-05-18T12:29:25.134429+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/HJVZTHUCXA3MSW5BHP3LHWOU2H","json":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H.json","graph_json":"https://pith.science/api/pith-number/HJVZTHUCXA3MSW5BHP3LHWOU2H/graph.json","events_json":"https://pith.science/api/pith-number/HJVZTHUCXA3MSW5BHP3LHWOU2H/events.json","paper":"https://pith.science/paper/HJVZTHUC"},"agent_actions":{"view_html":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H","download_json":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H.json","view_paper":"https://pith.science/paper/HJVZTHUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05077&json=true","fetch_graph":"https://pith.science/api/pith-number/HJVZTHUCXA3MSW5BHP3LHWOU2H/graph.json","fetch_events":"https://pith.science/api/pith-number/HJVZTHUCXA3MSW5BHP3LHWOU2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H/action/storage_attestation","attest_author":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H/action/author_attestation","sign_citation":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H/action/citation_signature","submit_replication":"https://pith.science/pith/HJVZTHUCXA3MSW5BHP3LHWOU2H/action/replication_record"}},"created_at":"2026-05-18T01:34:59.707555+00:00","updated_at":"2026-05-18T01:34:59.707555+00:00"}