{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MMCFFYZDS7DBOZFBXXKBSM6HXY","short_pith_number":"pith:MMCFFYZD","canonical_record":{"source":{"id":"1808.03877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-11T23:56:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ddbc4aed6d3952f2ed70c9015439d8120c51fa8ded70af08a4395795b35c1f1","abstract_canon_sha256":"26734ed6dbc9e7d49487da9a8c5e9c7e70bd62014c65f0d461c3c0615a78c960"},"schema_version":"1.0"},"canonical_sha256":"630452e32397c61764a1bdd41933c7be1faab069fe7b2ab99d63980ff7d87b25","source":{"kind":"arxiv","id":"1808.03877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03877","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03877v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03877","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"MMCFFYZDS7DB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMCFFYZDS7DBOZFB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMCFFYZD","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MMCFFYZDS7DBOZFBXXKBSM6HXY","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-11T23:56:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ddbc4aed6d3952f2ed70c9015439d8120c51fa8ded70af08a4395795b35c1f1","abstract_canon_sha256":"26734ed6dbc9e7d49487da9a8c5e9c7e70bd62014c65f0d461c3c0615a78c960"},"schema_version":"1.0"},"canonical_sha256":"630452e32397c61764a1bdd41933c7be1faab069fe7b2ab99d63980ff7d87b25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.464305Z","signature_b64":"rmxPV1/zA9TRAnLBohODJegwCP4xYGJr0vJ39R0nWKyrmJDxjl8yoflrHapQjfsejwIEGHQbvQmb7DG0dXZpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630452e32397c61764a1bdd41933c7be1faab069fe7b2ab99d63980ff7d87b25","last_reissued_at":"2026-05-18T00:08:19.463641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.463641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03877","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1C7ZoyOngyUJrdkVJrt4kOLyvwDPNUZmNATITiN1chBFVrFQ7ds4+RNOkWd7Hh4IXHQOXcN3sFzT3S9MtulCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:14:45.662960Z"},"content_sha256":"52d67125a81630f38f81198008b3db812b0dc9de5a0442209324f267723d12d3","schema_version":"1.0","event_id":"sha256:52d67125a81630f38f81198008b3db812b0dc9de5a0442209324f267723d12d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MMCFFYZDS7DBOZFBXXKBSM6HXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Several classes of minimal linear codes with few weights from weakly regular plateaued functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmet S{\\i}nak, Sihem Mesnager","submitted_at":"2018-08-11T23:56:48Z","abstract_excerpt":"Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods of linear codes based on functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three weight linear co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03877","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4q0fRyp0Ps22+FMnO29ZjudFY6dGDgYGqkcEZBcYSfm/xrrLkTgmEPpWjvuZ0E1Z3qNOvBSa7Ft92nnNv3nUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:14:45.663308Z"},"content_sha256":"3030a3295e0a91f7eb4d7bf09987058ebb1e32114e3bea69e43cc1534182997f","schema_version":"1.0","event_id":"sha256:3030a3295e0a91f7eb4d7bf09987058ebb1e32114e3bea69e43cc1534182997f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/bundle.json","state_url":"https://pith.science/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/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-22T09:14:45Z","links":{"resolver":"https://pith.science/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY","bundle":"https://pith.science/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/bundle.json","state":"https://pith.science/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMCFFYZDS7DBOZFBXXKBSM6HXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MMCFFYZDS7DBOZFBXXKBSM6HXY","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":"26734ed6dbc9e7d49487da9a8c5e9c7e70bd62014c65f0d461c3c0615a78c960","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-11T23:56:48Z","title_canon_sha256":"3ddbc4aed6d3952f2ed70c9015439d8120c51fa8ded70af08a4395795b35c1f1"},"schema_version":"1.0","source":{"id":"1808.03877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03877","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03877v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03877","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"MMCFFYZDS7DB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMCFFYZDS7DBOZFB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMCFFYZD","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:3030a3295e0a91f7eb4d7bf09987058ebb1e32114e3bea69e43cc1534182997f","target":"graph","created_at":"2026-05-18T00:08:19Z","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":"Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods of linear codes based on functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three weight linear co","authors_text":"Ahmet S{\\i}nak, Sihem Mesnager","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-11T23:56:48Z","title":"Several classes of minimal linear codes with few weights from weakly regular plateaued functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03877","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:52d67125a81630f38f81198008b3db812b0dc9de5a0442209324f267723d12d3","target":"record","created_at":"2026-05-18T00:08:19Z","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":"26734ed6dbc9e7d49487da9a8c5e9c7e70bd62014c65f0d461c3c0615a78c960","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-11T23:56:48Z","title_canon_sha256":"3ddbc4aed6d3952f2ed70c9015439d8120c51fa8ded70af08a4395795b35c1f1"},"schema_version":"1.0","source":{"id":"1808.03877","kind":"arxiv","version":1}},"canonical_sha256":"630452e32397c61764a1bdd41933c7be1faab069fe7b2ab99d63980ff7d87b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630452e32397c61764a1bdd41933c7be1faab069fe7b2ab99d63980ff7d87b25","first_computed_at":"2026-05-18T00:08:19.463641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.463641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rmxPV1/zA9TRAnLBohODJegwCP4xYGJr0vJ39R0nWKyrmJDxjl8yoflrHapQjfsejwIEGHQbvQmb7DG0dXZpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.464305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d67125a81630f38f81198008b3db812b0dc9de5a0442209324f267723d12d3","sha256:3030a3295e0a91f7eb4d7bf09987058ebb1e32114e3bea69e43cc1534182997f"],"state_sha256":"488708f1857a6ea229a7b185fa05ac404442488c931aba9693b2318c28efa7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNIgox0qff5E5dt5WxPnoe88Fvqff04cYT/47ecFuGtxJuToykHJcATPO6ems0+Km2fZXox/D8IefBfnUVb1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:14:45.665288Z","bundle_sha256":"ec63b67644ead012d1f7a89771d43b0f7a895dd823918b7a62ab25329f936b13"}}