{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6BQXDPBYFOSWPCZWFXAYN2DMQS","short_pith_number":"pith:6BQXDPBY","canonical_record":{"source":{"id":"1511.02093","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T14:31:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"085f861e68fc7f2af8eee33479a6723b34e28a38cbb57e264ae1373290ee0273","abstract_canon_sha256":"ec40cba9465b61c7b8fc0cc1a4afbb2c96ce9aec58e78331ace5cfecb10c5194"},"schema_version":"1.0"},"canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","source":{"kind":"arxiv","id":"1511.02093","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02093","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02093v3","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02093","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"6BQXDPBYFOSW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6BQXDPBYFOSWPCZW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6BQXDPBY","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6BQXDPBYFOSWPCZWFXAYN2DMQS","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02093","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T14:31:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"085f861e68fc7f2af8eee33479a6723b34e28a38cbb57e264ae1373290ee0273","abstract_canon_sha256":"ec40cba9465b61c7b8fc0cc1a4afbb2c96ce9aec58e78331ace5cfecb10c5194"},"schema_version":"1.0"},"canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:06.539356Z","signature_b64":"Hve+4vqMnGhBDtQ4kaxjyMXqWqQYhhf+AajhIqM+ATVOlvIAzvSbjWWrOmHCylL5FNqVS9gr7GDex6xSaSWHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","last_reissued_at":"2026-05-18T01:15:06.538634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:06.538634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02093","source_version":3,"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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8B3r+RlSyr/6o84J10N1Msjyar/8m5je/dK9ByELxUnaUsuK/39KlVQPqlq7wqhMU5D4zGWZ6VNcH4qTIKafBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:05:50.171503Z"},"content_sha256":"6ac019561908fa9dab24a0ee39d27b8d020a441c665caa52595cdced2f68de60","schema_version":"1.0","event_id":"sha256:6ac019561908fa9dab24a0ee39d27b8d020a441c665caa52595cdced2f68de60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6BQXDPBYFOSWPCZWFXAYN2DMQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluation of the Hamming weights of a class of linear codes based on Gauss sums","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-11-06T14:31:50Z","abstract_excerpt":"Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02093","kind":"arxiv","version":3},"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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFrMV8/b47ToFBQuhu8n6hP8MzInYif9qA1NZcu9LvTcn8vbDHY5UjVG6qj4VyiJj2oykTpSD09/NisUSeRhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:05:50.171851Z"},"content_sha256":"a6c3f433cda6ba54b8eeed531c14cadd54fa3d30c9f849b5fdb23213132c99bf","schema_version":"1.0","event_id":"sha256:a6c3f433cda6ba54b8eeed531c14cadd54fa3d30c9f849b5fdb23213132c99bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/bundle.json","state_url":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/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:05:50Z","links":{"resolver":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS","bundle":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/bundle.json","state":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6BQXDPBYFOSWPCZWFXAYN2DMQS","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":"ec40cba9465b61c7b8fc0cc1a4afbb2c96ce9aec58e78331ace5cfecb10c5194","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T14:31:50Z","title_canon_sha256":"085f861e68fc7f2af8eee33479a6723b34e28a38cbb57e264ae1373290ee0273"},"schema_version":"1.0","source":{"id":"1511.02093","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02093","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02093v3","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02093","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"6BQXDPBYFOSW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6BQXDPBYFOSWPCZW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6BQXDPBY","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a6c3f433cda6ba54b8eeed531c14cadd54fa3d30c9f849b5fdb23213132c99bf","target":"graph","created_at":"2026-05-18T01:15:06Z","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":"Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper c","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-11-06T14:31:50Z","title":"Evaluation of the Hamming weights of a class of linear codes based on Gauss sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02093","kind":"arxiv","version":3},"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:6ac019561908fa9dab24a0ee39d27b8d020a441c665caa52595cdced2f68de60","target":"record","created_at":"2026-05-18T01:15:06Z","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":"ec40cba9465b61c7b8fc0cc1a4afbb2c96ce9aec58e78331ace5cfecb10c5194","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T14:31:50Z","title_canon_sha256":"085f861e68fc7f2af8eee33479a6723b34e28a38cbb57e264ae1373290ee0273"},"schema_version":"1.0","source":{"id":"1511.02093","kind":"arxiv","version":3}},"canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","first_computed_at":"2026-05-18T01:15:06.538634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:06.538634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hve+4vqMnGhBDtQ4kaxjyMXqWqQYhhf+AajhIqM+ATVOlvIAzvSbjWWrOmHCylL5FNqVS9gr7GDex6xSaSWHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:06.539356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02093","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac019561908fa9dab24a0ee39d27b8d020a441c665caa52595cdced2f68de60","sha256:a6c3f433cda6ba54b8eeed531c14cadd54fa3d30c9f849b5fdb23213132c99bf"],"state_sha256":"2af42c00fd9f5bd15f3069592032a2bfb29503fbe1aaaad35f3d664b338b0643"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZSeA5p9DxxBFdIXPvMXjpmo+bFPRui0tAT1zHsnzrGxkViv965HluMXiKIOQmI081qXiAnPVc2uEDbwh1F0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:05:50.173882Z","bundle_sha256":"91459943f0cf0d07441cb452d389a15eb64d7b0e95eb8cc7206ddbd996ef3f88"}}