{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YTIEN7VO55O37HFMQPIAPWIRU6","short_pith_number":"pith:YTIEN7VO","canonical_record":{"source":{"id":"1605.04063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-13T06:41:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49b2ed241c80bdcb3edc5a123176ba0f831b0be2888b599eccb9c1f7420371cf","abstract_canon_sha256":"a46ba0f2ea68d951dcc0a5f9fafaa16c694283885b354f49237eb1138dc02276"},"schema_version":"1.0"},"canonical_sha256":"c4d046feaeef5dbf9cac83d007d911a79c16ceae6a08eb9cc70dc9df259b3a1a","source":{"kind":"arxiv","id":"1605.04063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04063","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04063v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04063","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"YTIEN7VO55O3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YTIEN7VO55O37HFM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YTIEN7VO","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YTIEN7VO55O37HFMQPIAPWIRU6","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-13T06:41:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49b2ed241c80bdcb3edc5a123176ba0f831b0be2888b599eccb9c1f7420371cf","abstract_canon_sha256":"a46ba0f2ea68d951dcc0a5f9fafaa16c694283885b354f49237eb1138dc02276"},"schema_version":"1.0"},"canonical_sha256":"c4d046feaeef5dbf9cac83d007d911a79c16ceae6a08eb9cc70dc9df259b3a1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:47.765893Z","signature_b64":"G8l2Qsu2zEQq+SRnhZ1dv0OtXGna0lJEcaN1rrBxOR+/qDMovFzNyPuCpYIf2ATPl1uQjrLCsi/uN+9Ho5iuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4d046feaeef5dbf9cac83d007d911a79c16ceae6a08eb9cc70dc9df259b3a1a","last_reissued_at":"2026-05-18T00:39:47.765068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:47.765068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04063","source_version":2,"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-18T00:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3fb/ygKXNMvABHXvXmJRyGJykuKZg0YC46KDxt5EomuHTv1ZcwWu0FRun1sucRF4PDalJ1cRVhB6U1rXpRJzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:54:55.943082Z"},"content_sha256":"8eb34cb0c1a77ca5967b1b0be57bd819cd289fcd7eb1db0cb6f07db2e5757687","schema_version":"1.0","event_id":"sha256:8eb34cb0c1a77ca5967b1b0be57bd819cd289fcd7eb1db0cb6f07db2e5757687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YTIEN7VO55O37HFMQPIAPWIRU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A construction of $q$-ary linear codes with two 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":"2016-05-13T06:41:42Z","abstract_excerpt":"Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight distributions of the linear codes are determined in some cases based on Gauss sums. It is interesting that our construction can produce optimal or almost optimal codes. Furthermore, we show that our codes can be used to construct secret sharing schemes with interesting access structures and strongly regular graphs with new parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04063","kind":"arxiv","version":2},"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-18T00:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QZmXRP/+9N3kKc11l47UUa9uyHIwKQz9aOifdctmiwJcSnEIb7fQhtykPx8IghZ1Iyy1U7Nu8jopaqXFQyADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:54:55.943437Z"},"content_sha256":"f179b5d4785fea703bb80daf096bd7152c2b5f71897921e77fc12651b7c69327","schema_version":"1.0","event_id":"sha256:f179b5d4785fea703bb80daf096bd7152c2b5f71897921e77fc12651b7c69327"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTIEN7VO55O37HFMQPIAPWIRU6/bundle.json","state_url":"https://pith.science/pith/YTIEN7VO55O37HFMQPIAPWIRU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTIEN7VO55O37HFMQPIAPWIRU6/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-24T17:54:55Z","links":{"resolver":"https://pith.science/pith/YTIEN7VO55O37HFMQPIAPWIRU6","bundle":"https://pith.science/pith/YTIEN7VO55O37HFMQPIAPWIRU6/bundle.json","state":"https://pith.science/pith/YTIEN7VO55O37HFMQPIAPWIRU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTIEN7VO55O37HFMQPIAPWIRU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YTIEN7VO55O37HFMQPIAPWIRU6","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":"a46ba0f2ea68d951dcc0a5f9fafaa16c694283885b354f49237eb1138dc02276","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-13T06:41:42Z","title_canon_sha256":"49b2ed241c80bdcb3edc5a123176ba0f831b0be2888b599eccb9c1f7420371cf"},"schema_version":"1.0","source":{"id":"1605.04063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04063","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04063v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04063","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"YTIEN7VO55O3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YTIEN7VO55O37HFM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YTIEN7VO","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:f179b5d4785fea703bb80daf096bd7152c2b5f71897921e77fc12651b7c69327","target":"graph","created_at":"2026-05-18T00:39:47Z","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 are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight distributions of the linear codes are determined in some cases based on Gauss sums. It is interesting that our construction can produce optimal or almost optimal codes. Furthermore, we show that our codes can be used to construct secret sharing schemes with interesting access structures and strongly regular graphs with new parameters.","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":"2016-05-13T06:41:42Z","title":"A construction of $q$-ary linear codes with two weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04063","kind":"arxiv","version":2},"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:8eb34cb0c1a77ca5967b1b0be57bd819cd289fcd7eb1db0cb6f07db2e5757687","target":"record","created_at":"2026-05-18T00:39:47Z","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":"a46ba0f2ea68d951dcc0a5f9fafaa16c694283885b354f49237eb1138dc02276","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-13T06:41:42Z","title_canon_sha256":"49b2ed241c80bdcb3edc5a123176ba0f831b0be2888b599eccb9c1f7420371cf"},"schema_version":"1.0","source":{"id":"1605.04063","kind":"arxiv","version":2}},"canonical_sha256":"c4d046feaeef5dbf9cac83d007d911a79c16ceae6a08eb9cc70dc9df259b3a1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4d046feaeef5dbf9cac83d007d911a79c16ceae6a08eb9cc70dc9df259b3a1a","first_computed_at":"2026-05-18T00:39:47.765068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:47.765068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8l2Qsu2zEQq+SRnhZ1dv0OtXGna0lJEcaN1rrBxOR+/qDMovFzNyPuCpYIf2ATPl1uQjrLCsi/uN+9Ho5iuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:47.765893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb34cb0c1a77ca5967b1b0be57bd819cd289fcd7eb1db0cb6f07db2e5757687","sha256:f179b5d4785fea703bb80daf096bd7152c2b5f71897921e77fc12651b7c69327"],"state_sha256":"4b9c1825c09ef2ad5ef9b7636c7813bbc17a70798a9fcd9d90c804f69a2b398c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"984S02rNtCtZlzARTtXt3bmdIzSdX76BSsh81cX1ZQ9bViPhue8xbXmS5Qpf3+665UymoG32B/F9eXJU0DPpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:54:55.945282Z","bundle_sha256":"431835abd3d626d0ecb34afd1cb1b68cce3ef289524d95dc0888519914f67f1d"}}