{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6MB6IRGCQTKAALG6CKKBBBKV5F","short_pith_number":"pith:6MB6IRGC","schema_version":"1.0","canonical_sha256":"f303e444c284d4002cde1294108555e94fa2ea61bc6cc34a40ecdfd0201b0686","source":{"kind":"arxiv","id":"1512.07719","version":2},"attestation_state":"computed","paper":{"title":"Linear Size Constant-Composition Codes Meeting the Johnson Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Xiande Zhang, Yeow Meng Chee","submitted_at":"2015-12-24T05:14:08Z","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"},"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":"1512.07719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T05:14:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"73ecf5ba294d094098f5dc92b74cf75497f8a473a52b21bb2a9a46a3a4d1466f","abstract_canon_sha256":"15d26edfacce379ffecfc8cd9d26ea1181688a2036594352a40c43f32d5565ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.953464Z","signature_b64":"hXQ3fyPqTR9aiyBOF7YRYVtD/E/6+0AqQ5rzlBvB3MDrxwI1c/cNMlUi+H8NqqHtjzyPpkYI0EKpCNyshg+bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f303e444c284d4002cde1294108555e94fa2ea61bc6cc34a40ecdfd0201b0686","last_reissued_at":"2026-05-18T01:09:41.952842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.952842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Size Constant-Composition Codes Meeting the Johnson Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Xiande Zhang, Yeow Meng Chee","submitted_at":"2015-12-24T05:14:08Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07719","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":""},"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":"1512.07719","created_at":"2026-05-18T01:09:41.952917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07719v2","created_at":"2026-05-18T01:09:41.952917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07719","created_at":"2026-05-18T01:09:41.952917+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MB6IRGCQTKA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MB6IRGCQTKAALG6","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MB6IRGC","created_at":"2026-05-18T12:29:07.941421+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/6MB6IRGCQTKAALG6CKKBBBKV5F","json":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F.json","graph_json":"https://pith.science/api/pith-number/6MB6IRGCQTKAALG6CKKBBBKV5F/graph.json","events_json":"https://pith.science/api/pith-number/6MB6IRGCQTKAALG6CKKBBBKV5F/events.json","paper":"https://pith.science/paper/6MB6IRGC"},"agent_actions":{"view_html":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F","download_json":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F.json","view_paper":"https://pith.science/paper/6MB6IRGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07719&json=true","fetch_graph":"https://pith.science/api/pith-number/6MB6IRGCQTKAALG6CKKBBBKV5F/graph.json","fetch_events":"https://pith.science/api/pith-number/6MB6IRGCQTKAALG6CKKBBBKV5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F/action/storage_attestation","attest_author":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F/action/author_attestation","sign_citation":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F/action/citation_signature","submit_replication":"https://pith.science/pith/6MB6IRGCQTKAALG6CKKBBBKV5F/action/replication_record"}},"created_at":"2026-05-18T01:09:41.952917+00:00","updated_at":"2026-05-18T01:09:41.952917+00:00"}