{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZL4G6H6N22W6Z3BJ6DFRIZS753","short_pith_number":"pith:ZL4G6H6N","canonical_record":{"source":{"id":"1510.05355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T05:05:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7f829b7a3acc08be6d35cf12e204864807fa8f516f5cbe95420b7b45be1f365","abstract_canon_sha256":"2a9207acd978cc1875daedcf67e4fb5b283b48f33a69940d505f9c7499f2a240"},"schema_version":"1.0"},"canonical_sha256":"caf86f1fcdd6adecec29f0cb14665feeebfd786bbb906cfef92104615dfc80f4","source":{"kind":"arxiv","id":"1510.05355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05355","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05355v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05355","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZL4G6H6N22W6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZL4G6H6N22W6Z3BJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZL4G6H6N","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZL4G6H6N22W6Z3BJ6DFRIZS753","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T05:05:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7f829b7a3acc08be6d35cf12e204864807fa8f516f5cbe95420b7b45be1f365","abstract_canon_sha256":"2a9207acd978cc1875daedcf67e4fb5b283b48f33a69940d505f9c7499f2a240"},"schema_version":"1.0"},"canonical_sha256":"caf86f1fcdd6adecec29f0cb14665feeebfd786bbb906cfef92104615dfc80f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.464946Z","signature_b64":"Cj6+XGg5nqNB0iZ6CHi974dgBhGYqw9lX8c7divscdgzOBl0ZTxyPM3zPjPawmrc/yAh3Z5cPlRgSqPKk82iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caf86f1fcdd6adecec29f0cb14665feeebfd786bbb906cfef92104615dfc80f4","last_reissued_at":"2026-05-18T01:29:52.464498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.464498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05355","source_version":1,"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:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtR8MhJv1X4Tgmvq7gkuL480ucEWlLKMX5CUVcEJ7aEIrvRe2GnanPdjrYerO5iPYCyRMdxkZiB+uCtt6hsuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:21:03.255218Z"},"content_sha256":"015ba222e54aed98125173095445fbabaa7ba7546502d1aebbe5740cc73cc3ff","schema_version":"1.0","event_id":"sha256:015ba222e54aed98125173095445fbabaa7ba7546502d1aebbe5740cc73cc3ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZL4G6H6N22W6Z3BJ6DFRIZS753","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Several classes of cyclic codes with either optimal three weights or a few weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qin Yue, Ziling Heng","submitted_at":"2015-10-19T05:05:39Z","abstract_excerpt":"Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction of cyclic codes. As applications, we obtain a class of optimal three-weight codes achieving the Griesmer bound, which generalizes a Vega's result in \\cite{V1}, and several classes of cyclic codes with only a few weights, which solve the open problem in \\cite{V1}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05355","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"},"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:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVBMJiZ9ECfysmOxE/yFh/SY2WMZU4eILCdrQcdVv8yYeuk/0iuvYoMiAXU4QOxBLI++zXbTL0691wyN4e+ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:21:03.255588Z"},"content_sha256":"7e9b1f4e9d468e83d79a17287192e74f01c3204c93c0702db2444bb93485f983","schema_version":"1.0","event_id":"sha256:7e9b1f4e9d468e83d79a17287192e74f01c3204c93c0702db2444bb93485f983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/bundle.json","state_url":"https://pith.science/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/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-24T19:21:03Z","links":{"resolver":"https://pith.science/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753","bundle":"https://pith.science/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/bundle.json","state":"https://pith.science/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZL4G6H6N22W6Z3BJ6DFRIZS753/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZL4G6H6N22W6Z3BJ6DFRIZS753","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":"2a9207acd978cc1875daedcf67e4fb5b283b48f33a69940d505f9c7499f2a240","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T05:05:39Z","title_canon_sha256":"b7f829b7a3acc08be6d35cf12e204864807fa8f516f5cbe95420b7b45be1f365"},"schema_version":"1.0","source":{"id":"1510.05355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05355","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05355v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05355","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZL4G6H6N22W6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZL4G6H6N22W6Z3BJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZL4G6H6N","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:7e9b1f4e9d468e83d79a17287192e74f01c3204c93c0702db2444bb93485f983","target":"graph","created_at":"2026-05-18T01:29:52Z","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":"Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction of cyclic codes. As applications, we obtain a class of optimal three-weight codes achieving the Griesmer bound, which generalizes a Vega's result in \\cite{V1}, and several classes of cyclic codes with only a few weights, which solve the open problem in \\cite{V1}.","authors_text":"Qin Yue, Ziling Heng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T05:05:39Z","title":"Several classes of cyclic codes with either optimal three weights or a few weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05355","kind":"arxiv","version":1},"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:015ba222e54aed98125173095445fbabaa7ba7546502d1aebbe5740cc73cc3ff","target":"record","created_at":"2026-05-18T01:29:52Z","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":"2a9207acd978cc1875daedcf67e4fb5b283b48f33a69940d505f9c7499f2a240","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T05:05:39Z","title_canon_sha256":"b7f829b7a3acc08be6d35cf12e204864807fa8f516f5cbe95420b7b45be1f365"},"schema_version":"1.0","source":{"id":"1510.05355","kind":"arxiv","version":1}},"canonical_sha256":"caf86f1fcdd6adecec29f0cb14665feeebfd786bbb906cfef92104615dfc80f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caf86f1fcdd6adecec29f0cb14665feeebfd786bbb906cfef92104615dfc80f4","first_computed_at":"2026-05-18T01:29:52.464498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.464498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cj6+XGg5nqNB0iZ6CHi974dgBhGYqw9lX8c7divscdgzOBl0ZTxyPM3zPjPawmrc/yAh3Z5cPlRgSqPKk82iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.464946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:015ba222e54aed98125173095445fbabaa7ba7546502d1aebbe5740cc73cc3ff","sha256:7e9b1f4e9d468e83d79a17287192e74f01c3204c93c0702db2444bb93485f983"],"state_sha256":"c5b2d52cf7b603540efd0952e04317bb4245df6905fab5079f6e5b9bc2978114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWvcvvW72YSMiscpjv9oe/zJSVqG2e+72s1nZhW+ORrPy7U0aRU7PaMLQ2Gg/Js18Rv7odu0a1TPN8rDTrewBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:21:03.260053Z","bundle_sha256":"1c4388385a8fdc85b04588011bdee90c289de378f7b776fba49513306ffa6f9e"}}