{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5UXGOQ7WMH57RYYFSF4C5UCXA3","short_pith_number":"pith:5UXGOQ7W","schema_version":"1.0","canonical_sha256":"ed2e6743f661fbf8e30591782ed05706e778d614f2765e926f18b6fa1c54b88e","source":{"kind":"arxiv","id":"1707.00650","version":4},"attestation_state":"computed","paper":{"title":"On the lengths of divisible codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Michael Kiermaier, Sascha Kurz","submitted_at":"2017-07-03T17:00:02Z","abstract_excerpt":"In this article, the effective lengths of all $q^r$-divisible linear codes over $\\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that there exists a $q^r$-divisible $\\mathbb{F}_q$-linear code of effective length $n$ if and only if the leading coefficient of the $S_q(r)$-adic expansion of $n$ is non-negative. Furthermore, the maximum weight of a $q^r$-divisible code of effective length $n$ is at most $\\sigma q^r$, where $\\sigma$ denotes the cross-sum of the $S_q(r)$-adic expansion of $n$. Th"},"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":"1707.00650","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T17:00:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9a15d177467caf4c803ef4bdb98ce1f4284ffb83c82417a5a437286c2b204ae3","abstract_canon_sha256":"f7a875001581035ff069e5bf43147940c60dc053d4918f5aaeda39dc10504161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:14.838939Z","signature_b64":"7nGDIWiKqNDKw7L1fnOa+l9AyNHSXZjPDma0V/7kJlgq2yn66nAh7RxElLXnrNSxfHKHsJoOOXDUKAe8jzo8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2e6743f661fbf8e30591782ed05706e778d614f2765e926f18b6fa1c54b88e","last_reissued_at":"2026-07-05T00:37:14.838508Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:14.838508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the lengths of divisible codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Michael Kiermaier, Sascha Kurz","submitted_at":"2017-07-03T17:00:02Z","abstract_excerpt":"In this article, the effective lengths of all $q^r$-divisible linear codes over $\\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that there exists a $q^r$-divisible $\\mathbb{F}_q$-linear code of effective length $n$ if and only if the leading coefficient of the $S_q(r)$-adic expansion of $n$ is non-negative. Furthermore, the maximum weight of a $q^r$-divisible code of effective length $n$ is at most $\\sigma q^r$, where $\\sigma$ denotes the cross-sum of the $S_q(r)$-adic expansion of $n$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00650","kind":"arxiv","version":4},"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/1707.00650/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":"1707.00650","created_at":"2026-07-05T00:37:14.838565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00650v4","created_at":"2026-07-05T00:37:14.838565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00650","created_at":"2026-07-05T00:37:14.838565+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UXGOQ7WMH57","created_at":"2026-07-05T00:37:14.838565+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UXGOQ7WMH57RYYF","created_at":"2026-07-05T00:37:14.838565+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UXGOQ7W","created_at":"2026-07-05T00:37:14.838565+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/5UXGOQ7WMH57RYYFSF4C5UCXA3","json":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3.json","graph_json":"https://pith.science/api/pith-number/5UXGOQ7WMH57RYYFSF4C5UCXA3/graph.json","events_json":"https://pith.science/api/pith-number/5UXGOQ7WMH57RYYFSF4C5UCXA3/events.json","paper":"https://pith.science/paper/5UXGOQ7W"},"agent_actions":{"view_html":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3","download_json":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3.json","view_paper":"https://pith.science/paper/5UXGOQ7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00650&json=true","fetch_graph":"https://pith.science/api/pith-number/5UXGOQ7WMH57RYYFSF4C5UCXA3/graph.json","fetch_events":"https://pith.science/api/pith-number/5UXGOQ7WMH57RYYFSF4C5UCXA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3/action/storage_attestation","attest_author":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3/action/author_attestation","sign_citation":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3/action/citation_signature","submit_replication":"https://pith.science/pith/5UXGOQ7WMH57RYYFSF4C5UCXA3/action/replication_record"}},"created_at":"2026-07-05T00:37:14.838565+00:00","updated_at":"2026-07-05T00:37:14.838565+00:00"}