{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KCPASEZCCJHWUAN2XT7TTOSKDH","short_pith_number":"pith:KCPASEZC","schema_version":"1.0","canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","source":{"kind":"arxiv","id":"2303.17172","version":2},"attestation_state":"computed","paper":{"title":"Lengths of divisible codes with restricted column multiplicities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Sascha Kurz, Theresa K\\\"orner","submitted_at":"2023-03-30T06:13:37Z","abstract_excerpt":"We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of $q^r$-divisible codes over $\\mathbb{F}_q$. We also give a few computational results for field sizes $q>2$. Non-existence results of divisible codes with restricted column multiplicities for a given length have applications e.g. in Galois geometry and can be used for upper bounds on the maximum cardinality of subspace codes."},"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":"2303.17172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-30T06:13:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9a259305f4dd27c49c53eece43e7c078d88f45dc29ca331e098bb262a0e8183f","abstract_canon_sha256":"fa7625189563f57036fd5ff071fc46f7a702990b4a45340e3f09f33a9dee0c5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:41.181822Z","signature_b64":"QJQ/BU/ez7hkyUlQNH85O+cbp6errDJ/NjagJVnoWvk6d/XBGjSUnJObzgqXaiDqq7/cur510hq+2yAj2/jXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","last_reissued_at":"2026-07-05T07:08:41.181363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:41.181363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lengths of divisible codes with restricted column multiplicities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Sascha Kurz, Theresa K\\\"orner","submitted_at":"2023-03-30T06:13:37Z","abstract_excerpt":"We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of $q^r$-divisible codes over $\\mathbb{F}_q$. We also give a few computational results for field sizes $q>2$. Non-existence results of divisible codes with restricted column multiplicities for a given length have applications e.g. in Galois geometry and can be used for upper bounds on the maximum cardinality of subspace codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17172","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.17172/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":"2303.17172","created_at":"2026-07-05T07:08:41.181422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17172v2","created_at":"2026-07-05T07:08:41.181422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17172","created_at":"2026-07-05T07:08:41.181422+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCPASEZCCJHW","created_at":"2026-07-05T07:08:41.181422+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCPASEZCCJHWUAN2","created_at":"2026-07-05T07:08:41.181422+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCPASEZC","created_at":"2026-07-05T07:08:41.181422+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/KCPASEZCCJHWUAN2XT7TTOSKDH","json":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH.json","graph_json":"https://pith.science/api/pith-number/KCPASEZCCJHWUAN2XT7TTOSKDH/graph.json","events_json":"https://pith.science/api/pith-number/KCPASEZCCJHWUAN2XT7TTOSKDH/events.json","paper":"https://pith.science/paper/KCPASEZC"},"agent_actions":{"view_html":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH","download_json":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH.json","view_paper":"https://pith.science/paper/KCPASEZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17172&json=true","fetch_graph":"https://pith.science/api/pith-number/KCPASEZCCJHWUAN2XT7TTOSKDH/graph.json","fetch_events":"https://pith.science/api/pith-number/KCPASEZCCJHWUAN2XT7TTOSKDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/action/storage_attestation","attest_author":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/action/author_attestation","sign_citation":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/action/citation_signature","submit_replication":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/action/replication_record"}},"created_at":"2026-07-05T07:08:41.181422+00:00","updated_at":"2026-07-05T07:08:41.181422+00:00"}