{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PETAWR26UD7WP6DHG2GZIJJUFD","short_pith_number":"pith:PETAWR26","schema_version":"1.0","canonical_sha256":"79260b475ea0ff67f867368d94253428e9e855ab5042476c1e373988bb88a1ca","source":{"kind":"arxiv","id":"1111.0228","version":1},"attestation_state":"computed","paper":{"title":"Classification of extremal and $s$-extremal binary self-dual codes of length 38","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos Aguilar-Melchor, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Philippe Gaborit","submitted_at":"2011-11-01T15:59:01Z","abstract_excerpt":"In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$ codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of $s$-extremal $[38,19,6]$ codes permits to achieve the classification of all $s$-extremal codes with d=6."},"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":"1111.0228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-01T15:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"9d11b8e1bd780504b885b0b74ebcd1130a8dc74b22860f3674a6126296625d12","abstract_canon_sha256":"315cc0beadaf3b8392443c3bd8804e3f0a750c5b94787d86dd51805e1b652621"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.172238Z","signature_b64":"san0yjd/0IJ6ut582DfKgy+UjheLG49hiT1Ag4qHh/NhCEbVQCHDKay/DBRRazp6CUWZ8JHMGKYdstMGWcENBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79260b475ea0ff67f867368d94253428e9e855ab5042476c1e373988bb88a1ca","last_reissued_at":"2026-05-18T04:09:46.171626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.171626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of extremal and $s$-extremal binary self-dual codes of length 38","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos Aguilar-Melchor, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Philippe Gaborit","submitted_at":"2011-11-01T15:59:01Z","abstract_excerpt":"In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$ codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of $s$-extremal $[38,19,6]$ codes permits to achieve the classification of all $s$-extremal codes with d=6."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0228","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":"1111.0228","created_at":"2026-05-18T04:09:46.171709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0228v1","created_at":"2026-05-18T04:09:46.171709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0228","created_at":"2026-05-18T04:09:46.171709+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/PETAWR26UD7WP6DHG2GZIJJUFD","json":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD.json","graph_json":"https://pith.science/api/pith-number/PETAWR26UD7WP6DHG2GZIJJUFD/graph.json","events_json":"https://pith.science/api/pith-number/PETAWR26UD7WP6DHG2GZIJJUFD/events.json","paper":"https://pith.science/paper/PETAWR26"},"agent_actions":{"view_html":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD","download_json":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD.json","view_paper":"https://pith.science/paper/PETAWR26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0228&json=true","fetch_graph":"https://pith.science/api/pith-number/PETAWR26UD7WP6DHG2GZIJJUFD/graph.json","fetch_events":"https://pith.science/api/pith-number/PETAWR26UD7WP6DHG2GZIJJUFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD/action/storage_attestation","attest_author":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD/action/author_attestation","sign_citation":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD/action/citation_signature","submit_replication":"https://pith.science/pith/PETAWR26UD7WP6DHG2GZIJJUFD/action/replication_record"}},"created_at":"2026-05-18T04:09:46.171709+00:00","updated_at":"2026-05-18T04:09:46.171709+00:00"}