{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4D6UVPMEHNDBAAUI3OPRQJIMFT","short_pith_number":"pith:4D6UVPME","schema_version":"1.0","canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","source":{"kind":"arxiv","id":"1803.09988","version":1},"attestation_state":"computed","paper":{"title":"Minimal Linear Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Zhengchun Zhou, Ziling Heng","submitted_at":"2018-03-27T09:42:19Z","abstract_excerpt":"As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{\\min}/w_{\\max}> (q-1)/q$ is a sufficient condition for a linear code over the finite field $\\gf(q)$ to be minimal, where $q$ is a prime power, $w_{\\min}$ and $w_{\\max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to pre"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.09988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4e6510bccf7bc0269ab2ece251134a7a08fe148be741593348dbe9a0148e29f","abstract_canon_sha256":"7eec00a54d2a44ee84b66eee699eec18246ca90515fade131379ec29fe8e3839"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.787597Z","signature_b64":"3G8Pg9F7QMWA7GdwsLeENk2lKzBeSNaJv9l6Gsa2cP/nZZVyE30vMWwzELvA90drMK2OuzzJrikupDuCM+LuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","last_reissued_at":"2026-05-18T00:20:00.786957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.786957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Linear Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Zhengchun Zhou, Ziling Heng","submitted_at":"2018-03-27T09:42:19Z","abstract_excerpt":"As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{\\min}/w_{\\max}> (q-1)/q$ is a sufficient condition for a linear code over the finite field $\\gf(q)$ to be minimal, where $q$ is a prime power, $w_{\\min}$ and $w_{\\max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09988","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.09988","created_at":"2026-05-18T00:20:00.787040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09988v1","created_at":"2026-05-18T00:20:00.787040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09988","created_at":"2026-05-18T00:20:00.787040+00:00"},{"alias_kind":"pith_short_12","alias_value":"4D6UVPMEHNDB","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4D6UVPMEHNDBAAUI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4D6UVPME","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT","json":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT.json","graph_json":"https://pith.science/api/pith-number/4D6UVPMEHNDBAAUI3OPRQJIMFT/graph.json","events_json":"https://pith.science/api/pith-number/4D6UVPMEHNDBAAUI3OPRQJIMFT/events.json","paper":"https://pith.science/paper/4D6UVPME"},"agent_actions":{"view_html":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT","download_json":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT.json","view_paper":"https://pith.science/paper/4D6UVPME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09988&json=true","fetch_graph":"https://pith.science/api/pith-number/4D6UVPMEHNDBAAUI3OPRQJIMFT/graph.json","fetch_events":"https://pith.science/api/pith-number/4D6UVPMEHNDBAAUI3OPRQJIMFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/action/storage_attestation","attest_author":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/action/author_attestation","sign_citation":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/action/citation_signature","submit_replication":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/action/replication_record"}},"created_at":"2026-05-18T00:20:00.787040+00:00","updated_at":"2026-05-18T00:20:00.787040+00:00"}