{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PMOCBJRRZJCCHJOZOAZLLDNBAQ","short_pith_number":"pith:PMOCBJRR","schema_version":"1.0","canonical_sha256":"7b1c20a631ca4423a5d97032b58da10415470c144855fa3f35901dca8ba3c95a","source":{"kind":"arxiv","id":"1802.00148","version":2},"attestation_state":"computed","paper":{"title":"How many weights can a linear code have ?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"G\\'erard D. Cohen, Hongwei Zhu, Minjia Shi, Patrick Sol\\'e","submitted_at":"2018-02-01T03:48:02Z","abstract_excerpt":"We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general case when both $k$ and $q$ are $\\ge 3.$ A refinement $L(n,k,q),$ as well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and studied."},"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":"1802.00148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-01T03:48:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e43ffebf9c2d95c3bb26da81d7ecf0a319df17d20cedf41461cf94a2e2d3070a","abstract_canon_sha256":"594a0cd1a3f1f2a9e7c42c641e7ec099169080ffe56cac57c03153235f857029"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:32.823386Z","signature_b64":"4FQhp4ah05DoeiLK9Qg/J/6lW8kxViBwRdQ/omcQNTAED+3AE2A4hSR6dS/h548AhFrf3THTJHBMCVB6cYAUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1c20a631ca4423a5d97032b58da10415470c144855fa3f35901dca8ba3c95a","last_reissued_at":"2026-05-18T00:17:32.822828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:32.822828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How many weights can a linear code have ?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"G\\'erard D. Cohen, Hongwei Zhu, Minjia Shi, Patrick Sol\\'e","submitted_at":"2018-02-01T03:48:02Z","abstract_excerpt":"We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general case when both $k$ and $q$ are $\\ge 3.$ A refinement $L(n,k,q),$ as well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00148","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.00148","created_at":"2026-05-18T00:17:32.822916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00148v2","created_at":"2026-05-18T00:17:32.822916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00148","created_at":"2026-05-18T00:17:32.822916+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMOCBJRRZJCC","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMOCBJRRZJCCHJOZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMOCBJRR","created_at":"2026-05-18T12:32:46.962924+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/PMOCBJRRZJCCHJOZOAZLLDNBAQ","json":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ.json","graph_json":"https://pith.science/api/pith-number/PMOCBJRRZJCCHJOZOAZLLDNBAQ/graph.json","events_json":"https://pith.science/api/pith-number/PMOCBJRRZJCCHJOZOAZLLDNBAQ/events.json","paper":"https://pith.science/paper/PMOCBJRR"},"agent_actions":{"view_html":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ","download_json":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ.json","view_paper":"https://pith.science/paper/PMOCBJRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00148&json=true","fetch_graph":"https://pith.science/api/pith-number/PMOCBJRRZJCCHJOZOAZLLDNBAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PMOCBJRRZJCCHJOZOAZLLDNBAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ/action/storage_attestation","attest_author":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ/action/author_attestation","sign_citation":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ/action/citation_signature","submit_replication":"https://pith.science/pith/PMOCBJRRZJCCHJOZOAZLLDNBAQ/action/replication_record"}},"created_at":"2026-05-18T00:17:32.822916+00:00","updated_at":"2026-05-18T00:17:32.822916+00:00"}