{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:VCSDQ4FP6JKXBTNAX4N2ERQ36Q","short_pith_number":"pith:VCSDQ4FP","schema_version":"1.0","canonical_sha256":"a8a43870aff25570cda0bf1ba2461bf430dbb5769d5c1fdbd393196ab4b02e5e","source":{"kind":"arxiv","id":"0706.1217","version":1},"attestation_state":"computed","paper":{"title":"Constant Weight Codes: A Geometric Approach Based on Dissections","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chao Tian, N. J. A. Sloane, Vinay A. Vaishampayan","submitted_at":"2007-06-08T17:41:24Z","abstract_excerpt":"We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight of the code. The encoder and decoder mappings are then interpreted as a bijection between a certain hyper-rectangle and a polytope in this Euclidean space. An inductive dissection algorithm is developed for constructing such a bijection. We prove that the algorithm is correct and then analyze its complexity. The complexity depends on the weight of the code,"},"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":"0706.1217","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-06-08T17:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"5af3dd8a4d47bd81bb5bab57b1327cd820a501b071f65144f59c40b7cfce6a23","abstract_canon_sha256":"13387a95821a58200c74ee107a12f75fa56b61d7a97e1887feead7ac470a84a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:46.910371Z","signature_b64":"Ag87A0TSyqqYKQyE0klr52jK6RZLzpakHjuG05cHBvl/EsBUNWmF0AZpGWW37SQyY7Odu+oKJQnYQPaVIBN4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a43870aff25570cda0bf1ba2461bf430dbb5769d5c1fdbd393196ab4b02e5e","last_reissued_at":"2026-05-18T02:42:46.909936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:46.909936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Weight Codes: A Geometric Approach Based on Dissections","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chao Tian, N. J. A. Sloane, Vinay A. Vaishampayan","submitted_at":"2007-06-08T17:41:24Z","abstract_excerpt":"We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight of the code. The encoder and decoder mappings are then interpreted as a bijection between a certain hyper-rectangle and a polytope in this Euclidean space. An inductive dissection algorithm is developed for constructing such a bijection. We prove that the algorithm is correct and then analyze its complexity. The complexity depends on the weight of the code,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.1217","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":"0706.1217","created_at":"2026-05-18T02:42:46.909992+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.1217v1","created_at":"2026-05-18T02:42:46.909992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.1217","created_at":"2026-05-18T02:42:46.909992+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCSDQ4FP6JKX","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCSDQ4FP6JKXBTNA","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCSDQ4FP","created_at":"2026-05-18T12:25:56.245647+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/VCSDQ4FP6JKXBTNAX4N2ERQ36Q","json":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q.json","graph_json":"https://pith.science/api/pith-number/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/graph.json","events_json":"https://pith.science/api/pith-number/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/events.json","paper":"https://pith.science/paper/VCSDQ4FP"},"agent_actions":{"view_html":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q","download_json":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q.json","view_paper":"https://pith.science/paper/VCSDQ4FP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.1217&json=true","fetch_graph":"https://pith.science/api/pith-number/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/graph.json","fetch_events":"https://pith.science/api/pith-number/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/action/storage_attestation","attest_author":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/action/author_attestation","sign_citation":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/action/citation_signature","submit_replication":"https://pith.science/pith/VCSDQ4FP6JKXBTNAX4N2ERQ36Q/action/replication_record"}},"created_at":"2026-05-18T02:42:46.909992+00:00","updated_at":"2026-05-18T02:42:46.909992+00:00"}