{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KCPASEZCCJHWUAN2XT7TTOSKDH","short_pith_number":"pith:KCPASEZC","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"},"canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","source":{"kind":"arxiv","id":"2303.17172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17172","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17172v2","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17172","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_12","alias_value":"KCPASEZCCJHW","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_16","alias_value":"KCPASEZCCJHWUAN2","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_8","alias_value":"KCPASEZC","created_at":"2026-07-05T07:08:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KCPASEZCCJHWUAN2XT7TTOSKDH","target":"record","payload":{"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"},"canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","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"},"source_kind":"arxiv","source_id":"2303.17172","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:08:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+CpAllFcSHzVq9jjecPkLDy/C11eMcdFUxmQNc+DBSk4f5C6aaw6EdQmcG7BCA6c76JX+WLWbuC4l+qO1AW/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T02:59:07.428810Z"},"content_sha256":"4ae06ab8de2a4b2720714fe20a9ce20e4387dff6f4b5eff4ac9476a5d8fceae7","schema_version":"1.0","event_id":"sha256:4ae06ab8de2a4b2720714fe20a9ce20e4387dff6f4b5eff4ac9476a5d8fceae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KCPASEZCCJHWUAN2XT7TTOSKDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:08:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvuBi77zcTDsADxnDzQ66MzOaTsDof98Xi4BvYBcgL0oZkklIV/ibagEoFHn63UUUK6Zm+hQB04QK6bOc8HfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T02:59:07.429317Z"},"content_sha256":"d527533d68332459235136914532f8ad7115ffd1e0c8bb653f34a69d37fefa94","schema_version":"1.0","event_id":"sha256:d527533d68332459235136914532f8ad7115ffd1e0c8bb653f34a69d37fefa94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/bundle.json","state_url":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T02:59:07Z","links":{"resolver":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH","bundle":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/bundle.json","state":"https://pith.science/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCPASEZCCJHWUAN2XT7TTOSKDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KCPASEZCCJHWUAN2XT7TTOSKDH","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":"fa7625189563f57036fd5ff071fc46f7a702990b4a45340e3f09f33a9dee0c5a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-30T06:13:37Z","title_canon_sha256":"9a259305f4dd27c49c53eece43e7c078d88f45dc29ca331e098bb262a0e8183f"},"schema_version":"1.0","source":{"id":"2303.17172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17172","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17172v2","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17172","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_12","alias_value":"KCPASEZCCJHW","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_16","alias_value":"KCPASEZCCJHWUAN2","created_at":"2026-07-05T07:08:41Z"},{"alias_kind":"pith_short_8","alias_value":"KCPASEZC","created_at":"2026-07-05T07:08:41Z"}],"graph_snapshots":[{"event_id":"sha256:d527533d68332459235136914532f8ad7115ffd1e0c8bb653f34a69d37fefa94","target":"graph","created_at":"2026-07-05T07:08:41Z","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/2303.17172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Sascha Kurz, Theresa K\\\"orner","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-30T06:13:37Z","title":"Lengths of divisible codes with restricted column multiplicities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17172","kind":"arxiv","version":2},"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:4ae06ab8de2a4b2720714fe20a9ce20e4387dff6f4b5eff4ac9476a5d8fceae7","target":"record","created_at":"2026-07-05T07:08:41Z","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":"fa7625189563f57036fd5ff071fc46f7a702990b4a45340e3f09f33a9dee0c5a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-30T06:13:37Z","title_canon_sha256":"9a259305f4dd27c49c53eece43e7c078d88f45dc29ca331e098bb262a0e8183f"},"schema_version":"1.0","source":{"id":"2303.17172","kind":"arxiv","version":2}},"canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509e091322124f6a01babcff39ba4a19eae9974c9b053d7025baa10477e6925c","first_computed_at":"2026-07-05T07:08:41.181363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:08:41.181363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QJQ/BU/ez7hkyUlQNH85O+cbp6errDJ/NjagJVnoWvk6d/XBGjSUnJObzgqXaiDqq7/cur510hq+2yAj2/jXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:08:41.181822Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.17172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ae06ab8de2a4b2720714fe20a9ce20e4387dff6f4b5eff4ac9476a5d8fceae7","sha256:d527533d68332459235136914532f8ad7115ffd1e0c8bb653f34a69d37fefa94"],"state_sha256":"61aa4b70aa11ab93b659594e8cfbe9387302d11fc00d760665a6b92d27880df6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpMvdN9MjcHxXAEzCJCOGAZ9gJhdzbN+T1hP6mxIQlttsmiztke0yUHUh/INc2szUgf0qpgy5M5yIS63d6kQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T02:59:07.434119Z","bundle_sha256":"79264c3a9cecfbcfb60ef7baffe23195d18ed3a9ba18f66fb3428d26db6f8e72"}}