{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D4PSC2RACDX5GEGIPRWI6BNIXL","short_pith_number":"pith:D4PSC2RA","schema_version":"1.0","canonical_sha256":"1f1f216a2010efd310c87c6c8f05a8baf263cf7cd686ff2e40e8b90d7f2fe081","source":{"kind":"arxiv","id":"1008.1611","version":1},"attestation_state":"computed","paper":{"title":"Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alan C. H. Ling, San Ling, Son Hoang Dau, Yeow Meng Chee","submitted_at":"2010-08-10T01:02:07Z","abstract_excerpt":"An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of $d=2w-1$ has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances.\n  This paper provides a construction for quasicyclic optimal constant-composition and constant-weight codes of weight $w$ and distance $2w-1$ based on a new generalization of differ"},"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":"1008.1611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-10T01:02:07Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"52998ecfba82435481844b1820765dd0c8aa1a6e291cf4c2cc254ec9d1257bab","abstract_canon_sha256":"a58efeb42a0e1c4d80f0f3bb38d78b9141b3c4530b6c28f3bdad65464525629a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.708959Z","signature_b64":"7ZCzNNnvGPFVWhP/iwss+Q9lh/Ys/H3s2KXhQKlgf7clI8rdmdIN3yxyovkbUOE+B9bsYdaZ2GNUExND2ImtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f1f216a2010efd310c87c6c8f05a8baf263cf7cd686ff2e40e8b90d7f2fe081","last_reissued_at":"2026-05-18T04:42:23.708399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.708399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alan C. H. Ling, San Ling, Son Hoang Dau, Yeow Meng Chee","submitted_at":"2010-08-10T01:02:07Z","abstract_excerpt":"An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of $d=2w-1$ has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances.\n  This paper provides a construction for quasicyclic optimal constant-composition and constant-weight codes of weight $w$ and distance $2w-1$ based on a new generalization of differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1611","kind":"arxiv","version":1},"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":"1008.1611","created_at":"2026-05-18T04:42:23.708492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1611v1","created_at":"2026-05-18T04:42:23.708492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1611","created_at":"2026-05-18T04:42:23.708492+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4PSC2RACDX5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4PSC2RACDX5GEGI","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4PSC2RA","created_at":"2026-05-18T12:26:06.534383+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/D4PSC2RACDX5GEGIPRWI6BNIXL","json":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL.json","graph_json":"https://pith.science/api/pith-number/D4PSC2RACDX5GEGIPRWI6BNIXL/graph.json","events_json":"https://pith.science/api/pith-number/D4PSC2RACDX5GEGIPRWI6BNIXL/events.json","paper":"https://pith.science/paper/D4PSC2RA"},"agent_actions":{"view_html":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL","download_json":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL.json","view_paper":"https://pith.science/paper/D4PSC2RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1611&json=true","fetch_graph":"https://pith.science/api/pith-number/D4PSC2RACDX5GEGIPRWI6BNIXL/graph.json","fetch_events":"https://pith.science/api/pith-number/D4PSC2RACDX5GEGIPRWI6BNIXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL/action/storage_attestation","attest_author":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL/action/author_attestation","sign_citation":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL/action/citation_signature","submit_replication":"https://pith.science/pith/D4PSC2RACDX5GEGIPRWI6BNIXL/action/replication_record"}},"created_at":"2026-05-18T04:42:23.708492+00:00","updated_at":"2026-05-18T04:42:23.708492+00:00"}