{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NXTFRGRV6GYMDGM2OQ2WK4V2JE","short_pith_number":"pith:NXTFRGRV","canonical_record":{"source":{"id":"1612.00128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:31:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"deb00c96106b0b6018eb9600770df4e5dcfad28407e0fa1b1adc335066b738b7","abstract_canon_sha256":"0790ae0575d2d25ef4b471a7dd0b571964528912c20ad9de2d15c3722424a2b6"},"schema_version":"1.0"},"canonical_sha256":"6de6589a35f1b0c1999a74356572ba490796878aa614b35c0ca422107966b8c0","source":{"kind":"arxiv","id":"1612.00128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00128","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00128v1","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00128","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"pith_short_12","alias_value":"NXTFRGRV6GYM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NXTFRGRV6GYMDGM2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NXTFRGRV","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NXTFRGRV6GYMDGM2OQ2WK4V2JE","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:31:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"deb00c96106b0b6018eb9600770df4e5dcfad28407e0fa1b1adc335066b738b7","abstract_canon_sha256":"0790ae0575d2d25ef4b471a7dd0b571964528912c20ad9de2d15c3722424a2b6"},"schema_version":"1.0"},"canonical_sha256":"6de6589a35f1b0c1999a74356572ba490796878aa614b35c0ca422107966b8c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:23.989286Z","signature_b64":"XIukCAL0xAbbIbMUSK4FcFNWEdsHdxJT4LI9p+W7diuBdw3RRNXpOrljaPSpDwQFJoWn86uZxjz3BCWBaP9ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de6589a35f1b0c1999a74356572ba490796878aa614b35c0ca422107966b8c0","last_reissued_at":"2026-05-18T00:53:23.988832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:23.988832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00128","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-18T00:53:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYz3MI5kOMWFTCIp+CBUoynOWm7wMOU96h80gGn1nLMXNvEafkcqaix/4Ga3XYosZwy/ihFtJ/B5fxzgJ/u5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:16:10.845106Z"},"content_sha256":"f6c01bc08e0a08fea3ba194616fb3b63195b0353f55cef6eb1bf3ceed30ab242","schema_version":"1.0","event_id":"sha256:f6c01bc08e0a08fea3ba194616fb3b63195b0353f55cef6eb1bf3ceed30ab242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NXTFRGRV6GYMDGM2OQ2WK4V2JE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trace Codes with Few Weights over $\\mathbb{F}_p+u\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Patrick Sol\\'e, Yan Liu","submitted_at":"2016-12-01T03:31:01Z","abstract_excerpt":"We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring $\\mathbb{F}_p+u\\mathbb{F}_p.$ They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over $\\mathbb{F}_p$. In particular, we obtain an infinite family of two-weight codes which meets the Griesmer bound with equality. Finally, an application to secret sharing schemes is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00128","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-18T00:53:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQ1zWJavNoo5kbGr9plWfyaFPNCfgpO7KkOozD5p03aaD9UvKW0FrZ5/URs9jDFr1InOywUTITeTJGG9DJhoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:16:10.845480Z"},"content_sha256":"d724ba35b78ba57d7633eeac55fb5757af8e4d74761dd86f4b1e4e354845df5c","schema_version":"1.0","event_id":"sha256:d724ba35b78ba57d7633eeac55fb5757af8e4d74761dd86f4b1e4e354845df5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/bundle.json","state_url":"https://pith.science/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/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-05T03:16:10Z","links":{"resolver":"https://pith.science/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE","bundle":"https://pith.science/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/bundle.json","state":"https://pith.science/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXTFRGRV6GYMDGM2OQ2WK4V2JE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NXTFRGRV6GYMDGM2OQ2WK4V2JE","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":"0790ae0575d2d25ef4b471a7dd0b571964528912c20ad9de2d15c3722424a2b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:31:01Z","title_canon_sha256":"deb00c96106b0b6018eb9600770df4e5dcfad28407e0fa1b1adc335066b738b7"},"schema_version":"1.0","source":{"id":"1612.00128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00128","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00128v1","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00128","created_at":"2026-05-18T00:53:23Z"},{"alias_kind":"pith_short_12","alias_value":"NXTFRGRV6GYM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NXTFRGRV6GYMDGM2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NXTFRGRV","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:d724ba35b78ba57d7633eeac55fb5757af8e4d74761dd86f4b1e4e354845df5c","target":"graph","created_at":"2026-05-18T00:53:23Z","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":"We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring $\\mathbb{F}_p+u\\mathbb{F}_p.$ They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over $\\mathbb{F}_p$. In particular, we obtain an infinite family of two-weight codes which meets the Griesmer bound with equality. Finally, an application to secret sharing schemes is given.","authors_text":"Minjia Shi, Patrick Sol\\'e, Yan Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:31:01Z","title":"Trace Codes with Few Weights over $\\mathbb{F}_p+u\\mathbb{F}_p$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00128","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:f6c01bc08e0a08fea3ba194616fb3b63195b0353f55cef6eb1bf3ceed30ab242","target":"record","created_at":"2026-05-18T00:53:23Z","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":"0790ae0575d2d25ef4b471a7dd0b571964528912c20ad9de2d15c3722424a2b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:31:01Z","title_canon_sha256":"deb00c96106b0b6018eb9600770df4e5dcfad28407e0fa1b1adc335066b738b7"},"schema_version":"1.0","source":{"id":"1612.00128","kind":"arxiv","version":1}},"canonical_sha256":"6de6589a35f1b0c1999a74356572ba490796878aa614b35c0ca422107966b8c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de6589a35f1b0c1999a74356572ba490796878aa614b35c0ca422107966b8c0","first_computed_at":"2026-05-18T00:53:23.988832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:23.988832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XIukCAL0xAbbIbMUSK4FcFNWEdsHdxJT4LI9p+W7diuBdw3RRNXpOrljaPSpDwQFJoWn86uZxjz3BCWBaP9ODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:23.989286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6c01bc08e0a08fea3ba194616fb3b63195b0353f55cef6eb1bf3ceed30ab242","sha256:d724ba35b78ba57d7633eeac55fb5757af8e4d74761dd86f4b1e4e354845df5c"],"state_sha256":"a3fed69852a3c7937695354d9884e24b0ec811c5adc29cebcebb990bab066abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9DdUZFVzXCy+SL63BaWb2KJ267U79bsNIpWf4nuwYZ2sY4oMWPfyPFc3CuEjBa+dR14BPmUSIexuMvBkcvDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:16:10.847746Z","bundle_sha256":"1aae6fd2bc53ae67baf2e3b1942c69b4d93d1d21fe8c2ad1ecb804d3868a121f"}}