{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MQ4U2CK52EXJQ77JB7MPSAMIFV","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":"5bff9155e9a6a4b1ae5ba884f46a6682584c478a3abf5d78d3a2f558db6e922f","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-21T04:59:13Z","title_canon_sha256":"82644273322974324bab92e001decf136546db006ba2c9e2389dfde9ddee30e7"},"schema_version":"1.0","source":{"id":"2010.10762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10762","created_at":"2026-07-05T01:44:54Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10762v1","created_at":"2026-07-05T01:44:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10762","created_at":"2026-07-05T01:44:54Z"},{"alias_kind":"pith_short_12","alias_value":"MQ4U2CK52EXJ","created_at":"2026-07-05T01:44:54Z"},{"alias_kind":"pith_short_16","alias_value":"MQ4U2CK52EXJQ77J","created_at":"2026-07-05T01:44:54Z"},{"alias_kind":"pith_short_8","alias_value":"MQ4U2CK5","created_at":"2026-07-05T01:44:54Z"}],"graph_snapshots":[{"event_id":"sha256:fc26121b2e2575f97a942f3a7828e87b2b3520821492283092df88df31190263","target":"graph","created_at":"2026-07-05T01:44:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.10762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Romar dela Cruz, Sascha Kurz","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-21T04:59:13Z","title":"On the maximum number of minimal codewords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10762","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:4012049e5bc415458cf4eff63c8029c55941f9f5ff7513c5dac78b2ee743114f","target":"record","created_at":"2026-07-05T01:44:54Z","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":"5bff9155e9a6a4b1ae5ba884f46a6682584c478a3abf5d78d3a2f558db6e922f","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-21T04:59:13Z","title_canon_sha256":"82644273322974324bab92e001decf136546db006ba2c9e2389dfde9ddee30e7"},"schema_version":"1.0","source":{"id":"2010.10762","kind":"arxiv","version":1}},"canonical_sha256":"64394d095dd12e987fe90fd8f901882d4ae32935772c844303642dd7501cdbe8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64394d095dd12e987fe90fd8f901882d4ae32935772c844303642dd7501cdbe8","first_computed_at":"2026-07-05T01:44:54.305770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:54.305770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kz//GGpJu61rzJhOvygEdoYaPL/LhPDYdvbYneuMQ7sy340bu23vd0dfHYydJwki73QQ81ohyaW3iG5qsG1EDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:54.306255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.10762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4012049e5bc415458cf4eff63c8029c55941f9f5ff7513c5dac78b2ee743114f","sha256:fc26121b2e2575f97a942f3a7828e87b2b3520821492283092df88df31190263"],"state_sha256":"18e2d477a62759fc9bc87e9b029c2ebfe71d5cb927c9579196966d80f3b1079b"}