{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MQ4U2CK52EXJQ77JB7MPSAMIFV","short_pith_number":"pith:MQ4U2CK5","schema_version":"1.0","canonical_sha256":"64394d095dd12e987fe90fd8f901882d4ae32935772c844303642dd7501cdbe8","source":{"kind":"arxiv","id":"2010.10762","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of minimal codewords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Romar dela Cruz, Sascha Kurz","submitted_at":"2020-10-21T04:59:13Z","abstract_excerpt":"Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number are presented. We determine the exact values for the case of linear codes of dimension $k$ and length $k+2$ and for small values of the length and dimension. We also give a formula for the number of minimal codewords of linear codes of dimension $k$ and length $k+3$."},"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":"2010.10762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-21T04:59:13Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"82644273322974324bab92e001decf136546db006ba2c9e2389dfde9ddee30e7","abstract_canon_sha256":"5bff9155e9a6a4b1ae5ba884f46a6682584c478a3abf5d78d3a2f558db6e922f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:54.306255Z","signature_b64":"kz//GGpJu61rzJhOvygEdoYaPL/LhPDYdvbYneuMQ7sy340bu23vd0dfHYydJwki73QQ81ohyaW3iG5qsG1EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64394d095dd12e987fe90fd8f901882d4ae32935772c844303642dd7501cdbe8","last_reissued_at":"2026-07-05T01:44:54.305770Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:54.305770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of minimal codewords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Romar dela Cruz, Sascha Kurz","submitted_at":"2020-10-21T04:59:13Z","abstract_excerpt":"Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number are presented. We determine the exact values for the case of linear codes of dimension $k$ and length $k+2$ and for small values of the length and dimension. We also give a formula for the number of minimal codewords of linear codes of dimension $k$ and length $k+3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10762","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.10762/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.10762","created_at":"2026-07-05T01:44:54.305839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.10762v1","created_at":"2026-07-05T01:44:54.305839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10762","created_at":"2026-07-05T01:44:54.305839+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQ4U2CK52EXJ","created_at":"2026-07-05T01:44:54.305839+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQ4U2CK52EXJQ77J","created_at":"2026-07-05T01:44:54.305839+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQ4U2CK5","created_at":"2026-07-05T01:44:54.305839+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/MQ4U2CK52EXJQ77JB7MPSAMIFV","json":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV.json","graph_json":"https://pith.science/api/pith-number/MQ4U2CK52EXJQ77JB7MPSAMIFV/graph.json","events_json":"https://pith.science/api/pith-number/MQ4U2CK52EXJQ77JB7MPSAMIFV/events.json","paper":"https://pith.science/paper/MQ4U2CK5"},"agent_actions":{"view_html":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV","download_json":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV.json","view_paper":"https://pith.science/paper/MQ4U2CK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.10762&json=true","fetch_graph":"https://pith.science/api/pith-number/MQ4U2CK52EXJQ77JB7MPSAMIFV/graph.json","fetch_events":"https://pith.science/api/pith-number/MQ4U2CK52EXJQ77JB7MPSAMIFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV/action/storage_attestation","attest_author":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV/action/author_attestation","sign_citation":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV/action/citation_signature","submit_replication":"https://pith.science/pith/MQ4U2CK52EXJQ77JB7MPSAMIFV/action/replication_record"}},"created_at":"2026-07-05T01:44:54.305839+00:00","updated_at":"2026-07-05T01:44:54.305839+00:00"}