{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CNZBSZ4Y4WAVIPECHK6YTHNSMD","short_pith_number":"pith:CNZBSZ4Y","schema_version":"1.0","canonical_sha256":"1372196798e581543c823abd899db260e9883ddb0335aac22285795751a3e5c3","source":{"kind":"arxiv","id":"2312.00885","version":3},"attestation_state":"computed","paper":{"title":"Divisible minimal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Sascha Kurz, Vladimir Chubenko","submitted_at":"2023-12-01T19:25:57Z","abstract_excerpt":"Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\\mathbb{F}_q$ is denoted by $m(k,q)$. Here we determine $m(7,2)$, $m(8,2)$, and $m(9,2)$, as well as full classifications of all codes attaining $m(k,2)$ for $k\\le 7$ and those attaining $m(9,2)$. We give improved upper bounds for $m(k,2)$ for all $10\\le k\\le 17$. It turns out that in many cases the attaining extremal codes have the property that the weights of all codew"},"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":"2312.00885","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-01T19:25:57Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"768d910c3fdc4897b6a32b95e1f045992720b861343b4b7250a9286b189f8cbf","abstract_canon_sha256":"13b4cb539eb2f8d3a4eb0b49224b08f1276a7235a1c4fd7d9446aa4f889ebd78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:27.052853Z","signature_b64":"cIuaE4nwUjr3b1z7HNfUW7rMw1LQX9r6oGDR+ARb9NS2fpJXFlH4n//c/StRYAMmGTkZHvzmCBdB/xJR2cv/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1372196798e581543c823abd899db260e9883ddb0335aac22285795751a3e5c3","last_reissued_at":"2026-07-05T11:16:27.052247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:27.052247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divisible minimal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Sascha Kurz, Vladimir Chubenko","submitted_at":"2023-12-01T19:25:57Z","abstract_excerpt":"Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\\mathbb{F}_q$ is denoted by $m(k,q)$. Here we determine $m(7,2)$, $m(8,2)$, and $m(9,2)$, as well as full classifications of all codes attaining $m(k,2)$ for $k\\le 7$ and those attaining $m(9,2)$. We give improved upper bounds for $m(k,2)$ for all $10\\le k\\le 17$. It turns out that in many cases the attaining extremal codes have the property that the weights of all codew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.00885","kind":"arxiv","version":3},"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/2312.00885/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":"2312.00885","created_at":"2026-07-05T11:16:27.052344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.00885v3","created_at":"2026-07-05T11:16:27.052344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.00885","created_at":"2026-07-05T11:16:27.052344+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNZBSZ4Y4WAV","created_at":"2026-07-05T11:16:27.052344+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNZBSZ4Y4WAVIPEC","created_at":"2026-07-05T11:16:27.052344+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNZBSZ4Y","created_at":"2026-07-05T11:16:27.052344+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/CNZBSZ4Y4WAVIPECHK6YTHNSMD","json":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD.json","graph_json":"https://pith.science/api/pith-number/CNZBSZ4Y4WAVIPECHK6YTHNSMD/graph.json","events_json":"https://pith.science/api/pith-number/CNZBSZ4Y4WAVIPECHK6YTHNSMD/events.json","paper":"https://pith.science/paper/CNZBSZ4Y"},"agent_actions":{"view_html":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD","download_json":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD.json","view_paper":"https://pith.science/paper/CNZBSZ4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.00885&json=true","fetch_graph":"https://pith.science/api/pith-number/CNZBSZ4Y4WAVIPECHK6YTHNSMD/graph.json","fetch_events":"https://pith.science/api/pith-number/CNZBSZ4Y4WAVIPECHK6YTHNSMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD/action/storage_attestation","attest_author":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD/action/author_attestation","sign_citation":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD/action/citation_signature","submit_replication":"https://pith.science/pith/CNZBSZ4Y4WAVIPECHK6YTHNSMD/action/replication_record"}},"created_at":"2026-07-05T11:16:27.052344+00:00","updated_at":"2026-07-05T11:16:27.052344+00:00"}