{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QIIYQYNWS22QCYMRI2LJY4HD2G","short_pith_number":"pith:QIIYQYNW","schema_version":"1.0","canonical_sha256":"82118861b696b501619146969c70e3d1997fb9d34159e364cd944885acc95d68","source":{"kind":"arxiv","id":"1511.08889","version":1},"attestation_state":"computed","paper":{"title":"The joint weight enumerator of an LCD code and its dual","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.MG","authors_text":"Adel Alahmadi, Mathieu Dutour Sikiri\\'c, Michel Deza, Patrick Sol\\'e","submitted_at":"2015-11-28T10:49:41Z","abstract_excerpt":"A binary linear code is called {\\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension $4$ and order $12$. Also, we sketch a Gleason formula for this weight enumerator."},"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":"1511.08889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2015-11-28T10:49:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"215ca62889a5f5e8f18891b3d0bf08dfd561cbaebdd18ed9548be134ad20b5a1","abstract_canon_sha256":"87a8359e8fa0e67dd3b5c21b23fb3ec2d9efce5eb706bcc8b280e7509bc54f71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:46.166206Z","signature_b64":"OtOkLry/Aa7QJ9YJAo2MszMsPN5NmN+9C0Cn2DRb6NMI6KKxQIsZDv52Kq/VV338BVEx71tozIXs+3n9pHnTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82118861b696b501619146969c70e3d1997fb9d34159e364cd944885acc95d68","last_reissued_at":"2026-05-18T01:25:46.165718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:46.165718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The joint weight enumerator of an LCD code and its dual","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.MG","authors_text":"Adel Alahmadi, Mathieu Dutour Sikiri\\'c, Michel Deza, Patrick Sol\\'e","submitted_at":"2015-11-28T10:49:41Z","abstract_excerpt":"A binary linear code is called {\\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension $4$ and order $12$. Also, we sketch a Gleason formula for this weight enumerator."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08889","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":"1511.08889","created_at":"2026-05-18T01:25:46.165792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08889v1","created_at":"2026-05-18T01:25:46.165792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08889","created_at":"2026-05-18T01:25:46.165792+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIIYQYNWS22Q","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIIYQYNWS22QCYMR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIIYQYNW","created_at":"2026-05-18T12:29:37.295048+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/QIIYQYNWS22QCYMRI2LJY4HD2G","json":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G.json","graph_json":"https://pith.science/api/pith-number/QIIYQYNWS22QCYMRI2LJY4HD2G/graph.json","events_json":"https://pith.science/api/pith-number/QIIYQYNWS22QCYMRI2LJY4HD2G/events.json","paper":"https://pith.science/paper/QIIYQYNW"},"agent_actions":{"view_html":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G","download_json":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G.json","view_paper":"https://pith.science/paper/QIIYQYNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08889&json=true","fetch_graph":"https://pith.science/api/pith-number/QIIYQYNWS22QCYMRI2LJY4HD2G/graph.json","fetch_events":"https://pith.science/api/pith-number/QIIYQYNWS22QCYMRI2LJY4HD2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G/action/storage_attestation","attest_author":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G/action/author_attestation","sign_citation":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G/action/citation_signature","submit_replication":"https://pith.science/pith/QIIYQYNWS22QCYMRI2LJY4HD2G/action/replication_record"}},"created_at":"2026-05-18T01:25:46.165792+00:00","updated_at":"2026-05-18T01:25:46.165792+00:00"}