{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6MB6IRGCQTKAALG6CKKBBBKV5F","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":"15d26edfacce379ffecfc8cd9d26ea1181688a2036594352a40c43f32d5565ec","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T05:14:08Z","title_canon_sha256":"73ecf5ba294d094098f5dc92b74cf75497f8a473a52b21bb2a9a46a3a4d1466f"},"schema_version":"1.0","source":{"id":"1512.07719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07719","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07719v2","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07719","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"6MB6IRGCQTKA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6MB6IRGCQTKAALG6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6MB6IRGC","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:e609c1323ab9e52a2106e2577f321f25db7f0678b81eb09e104f7d6e782071c0","target":"graph","created_at":"2026-05-18T01:09: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"},"paper":{"abstract_excerpt":"The Johnson-type upper bound on the maximum size of a code of length $n$, distance $d=2w-1$ and constant composition ${\\overline{w}}$ is $\\lfloor\\dfrac{n}{w_1}\\rfloor$, where $w$ is the total weight and $w_1$ is the largest component of ${\\overline{w}}$. Recently, Chee et al. proved that this upper bound can be achieved for all constant-composition codes of sufficiently large lengths. Let $N_{ccc}({\\overline{w}})$ be the smallest such length. The determination of $N_{ccc}({\\overline{w}})$ is trivial for binary codes. This paper provides a lower bound on $N_{ccc}({\\overline{w}})$, which is show","authors_text":"Xiande Zhang, Yeow Meng Chee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T05:14:08Z","title":"Linear Size Constant-Composition Codes Meeting the Johnson Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07719","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:d9be45e8bfae9484f7ec8ad5139920313aa7a7d1517616db2d54158ef8c7f020","target":"record","created_at":"2026-05-18T01:09: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":"15d26edfacce379ffecfc8cd9d26ea1181688a2036594352a40c43f32d5565ec","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T05:14:08Z","title_canon_sha256":"73ecf5ba294d094098f5dc92b74cf75497f8a473a52b21bb2a9a46a3a4d1466f"},"schema_version":"1.0","source":{"id":"1512.07719","kind":"arxiv","version":2}},"canonical_sha256":"f303e444c284d4002cde1294108555e94fa2ea61bc6cc34a40ecdfd0201b0686","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f303e444c284d4002cde1294108555e94fa2ea61bc6cc34a40ecdfd0201b0686","first_computed_at":"2026-05-18T01:09:41.952842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.952842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXQ3fyPqTR9aiyBOF7YRYVtD/E/6+0AqQ5rzlBvB3MDrxwI1c/cNMlUi+H8NqqHtjzyPpkYI0EKpCNyshg+bCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.953464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9be45e8bfae9484f7ec8ad5139920313aa7a7d1517616db2d54158ef8c7f020","sha256:e609c1323ab9e52a2106e2577f321f25db7f0678b81eb09e104f7d6e782071c0"],"state_sha256":"62b3dc6c933b8e755f8481b3b1ee825dc5d43ef49a40250d01e8a23cf0a386f6"}