{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:L4FSPVE4JHHMCGYAVL4RVWQHT3","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":"5811a4787a85906b5f840674a4ae295a03e69719365134c90ca3439da0022e13","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-12-19T04:34:08Z","title_canon_sha256":"5739e1d92f994868c12eaeefd5b607f19babcd4f68f4d74c7ec65896e854ae35"},"schema_version":"1.0","source":{"id":"math/0612535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612535","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612535v1","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612535","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"L4FSPVE4JHHM","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"L4FSPVE4JHHMCGYA","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"L4FSPVE4","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:241d00fa92028b1321c0adb9747657b5792976d988615c0663940e7a2f445eb6","target":"graph","created_at":"2026-05-18T02:42:39Z","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":"One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this theorem to different types of codes, always on a case-by-case basis. In this paper I state the theorem and then describe the far-reaching generalization that Gabriele Nebe, Eric Rains and I have developed which includes all the earlier generalizations at once. The full proof has just appeared in our book \"Self-Dual Codes and Invariant Theory\" (Springer, 2006)","authors_text":"N. J. A. Sloane","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2006-12-19T04:34:08Z","title":"Gleason's Theorem on Self-Dual Codes and Its Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612535","kind":"arxiv","version":1},"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:f7af72786cac6f319701e105ef927117727a4332c3b3ccb787f7b203fea8392f","target":"record","created_at":"2026-05-18T02:42:39Z","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":"5811a4787a85906b5f840674a4ae295a03e69719365134c90ca3439da0022e13","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-12-19T04:34:08Z","title_canon_sha256":"5739e1d92f994868c12eaeefd5b607f19babcd4f68f4d74c7ec65896e854ae35"},"schema_version":"1.0","source":{"id":"math/0612535","kind":"arxiv","version":1}},"canonical_sha256":"5f0b27d49c49cec11b00aaf91ada079ee112ac7bd6a79e536f847de7b341fa77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0b27d49c49cec11b00aaf91ada079ee112ac7bd6a79e536f847de7b341fa77","first_computed_at":"2026-05-18T02:42:39.968580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:39.968580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozOBkq1vku5NlzUiojHMzxijja0xkFq1GzrfUPsA8vCy0AaEP8QJISEa9cEPcPfzcpGzYAsndcXrSCC6r7xWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:39.969261Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0612535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7af72786cac6f319701e105ef927117727a4332c3b3ccb787f7b203fea8392f","sha256:241d00fa92028b1321c0adb9747657b5792976d988615c0663940e7a2f445eb6"],"state_sha256":"b5290635abd66d51f5a3e11c3452d04d3d98c5f7eb2baa5866d4441b938ed418"}