{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UXGOQ7WMH57RYYFSF4C5UCXA3","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":"f7a875001581035ff069e5bf43147940c60dc053d4918f5aaeda39dc10504161","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T17:00:02Z","title_canon_sha256":"9a15d177467caf4c803ef4bdb98ce1f4284ffb83c82417a5a437286c2b204ae3"},"schema_version":"1.0","source":{"id":"1707.00650","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00650","created_at":"2026-07-05T00:37:14Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00650v4","created_at":"2026-07-05T00:37:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00650","created_at":"2026-07-05T00:37:14Z"},{"alias_kind":"pith_short_12","alias_value":"5UXGOQ7WMH57","created_at":"2026-07-05T00:37:14Z"},{"alias_kind":"pith_short_16","alias_value":"5UXGOQ7WMH57RYYF","created_at":"2026-07-05T00:37:14Z"},{"alias_kind":"pith_short_8","alias_value":"5UXGOQ7W","created_at":"2026-07-05T00:37:14Z"}],"graph_snapshots":[{"event_id":"sha256:bcb411f566818c06cb6ed796b0d00b165aef2c627edf82affdb14566996f7efc","target":"graph","created_at":"2026-07-05T00:37:14Z","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/1707.00650/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Michael Kiermaier, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T17:00:02Z","title":"On the lengths of divisible codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00650","kind":"arxiv","version":4},"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:e79c72267cc1ca14660ea3689600a306262dbf3799a1c2a3868c571d7e6ba216","target":"record","created_at":"2026-07-05T00:37:14Z","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":"f7a875001581035ff069e5bf43147940c60dc053d4918f5aaeda39dc10504161","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T17:00:02Z","title_canon_sha256":"9a15d177467caf4c803ef4bdb98ce1f4284ffb83c82417a5a437286c2b204ae3"},"schema_version":"1.0","source":{"id":"1707.00650","kind":"arxiv","version":4}},"canonical_sha256":"ed2e6743f661fbf8e30591782ed05706e778d614f2765e926f18b6fa1c54b88e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed2e6743f661fbf8e30591782ed05706e778d614f2765e926f18b6fa1c54b88e","first_computed_at":"2026-07-05T00:37:14.838508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:37:14.838508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nGDIWiKqNDKw7L1fnOa+l9AyNHSXZjPDma0V/7kJlgq2yn66nAh7RxElLXnrNSxfHKHsJoOOXDUKAe8jzo8Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:37:14.838939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00650","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e79c72267cc1ca14660ea3689600a306262dbf3799a1c2a3868c571d7e6ba216","sha256:bcb411f566818c06cb6ed796b0d00b165aef2c627edf82affdb14566996f7efc"],"state_sha256":"50fb090630c42c888773698f3111be8651cb373d10ab425ba3c0922f1377bd90"}