{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GPIYIRTSP7YUOUMFAXPRJRTBCF","short_pith_number":"pith:GPIYIRTS","schema_version":"1.0","canonical_sha256":"33d18446727ff147518505df14c6611176ccda8dc1a48ee524e69c1788407b85","source":{"kind":"arxiv","id":"1008.1927","version":1},"attestation_state":"computed","paper":{"title":"A new class of codes over Z_2 x Z_2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.CO","authors_text":"Gerald Hoehn, Julia Galstad","submitted_at":"2010-08-11T14:56:28Z","abstract_excerpt":"We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in detail. We classify self-dual L-codes up to length 10 and provide tables for these codes and their weight enumerators up to length 4. We also discuss extremal codes for which a nearly complete classification is obtained."},"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.1927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T14:56:28Z","cross_cats_sorted":["math.QA"],"title_canon_sha256":"9e64301563b6e8e6409d296cc99464c5fc6e12da5b883d5a07bdda9857bffb2e","abstract_canon_sha256":"32028660c8c0e7b9d2b631f44e42c13d9a14d7d81482e00a51452c08181a1162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:22.693489Z","signature_b64":"ufIYvZUA8Tz5MeJPZimGPymxbCVSTy5cj35ZNalZcS+7IIksPQgfSFLW7vUWovehjg1nHafOtujsO6DF2dHRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d18446727ff147518505df14c6611176ccda8dc1a48ee524e69c1788407b85","last_reissued_at":"2026-05-18T04:42:22.693025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:22.693025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new class of codes over Z_2 x Z_2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.CO","authors_text":"Gerald Hoehn, Julia Galstad","submitted_at":"2010-08-11T14:56:28Z","abstract_excerpt":"We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in detail. We classify self-dual L-codes up to length 10 and provide tables for these codes and their weight enumerators up to length 4. We also discuss extremal codes for which a nearly complete classification is obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1927","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.1927","created_at":"2026-05-18T04:42:22.693094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1927v1","created_at":"2026-05-18T04:42:22.693094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1927","created_at":"2026-05-18T04:42:22.693094+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPIYIRTSP7YU","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPIYIRTSP7YUOUMF","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPIYIRTS","created_at":"2026-05-18T12:26:07.630475+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/GPIYIRTSP7YUOUMFAXPRJRTBCF","json":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF.json","graph_json":"https://pith.science/api/pith-number/GPIYIRTSP7YUOUMFAXPRJRTBCF/graph.json","events_json":"https://pith.science/api/pith-number/GPIYIRTSP7YUOUMFAXPRJRTBCF/events.json","paper":"https://pith.science/paper/GPIYIRTS"},"agent_actions":{"view_html":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF","download_json":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF.json","view_paper":"https://pith.science/paper/GPIYIRTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1927&json=true","fetch_graph":"https://pith.science/api/pith-number/GPIYIRTSP7YUOUMFAXPRJRTBCF/graph.json","fetch_events":"https://pith.science/api/pith-number/GPIYIRTSP7YUOUMFAXPRJRTBCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF/action/storage_attestation","attest_author":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF/action/author_attestation","sign_citation":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF/action/citation_signature","submit_replication":"https://pith.science/pith/GPIYIRTSP7YUOUMFAXPRJRTBCF/action/replication_record"}},"created_at":"2026-05-18T04:42:22.693094+00:00","updated_at":"2026-05-18T04:42:22.693094+00:00"}