{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NZD4ZPYLA6F2JWQJMAPVZB2WLV","short_pith_number":"pith:NZD4ZPYL","schema_version":"1.0","canonical_sha256":"6e47ccbf0b078ba4da09601f5c87565d485ee6e3e35bb7cc41a754f4d847a6fc","source":{"kind":"arxiv","id":"0909.2526","version":2},"attestation_state":"computed","paper":{"title":"Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Olli Pottonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2009-09-14T12:04:50Z","abstract_excerpt":"The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \\\"Osterg{\\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes."},"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":"0909.2526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-14T12:04:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39e1c9463e23df3079b676db023aab9eb10b803d66efb9b52d9d5b1ca51c1146","abstract_canon_sha256":"aaf2aad3a334f925c659e73bce35b06cf791a2eb977fe80d1b16acf26fad89ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:47.846796Z","signature_b64":"Cqh9HJMsVkn7YHznZrsulhKYXOw6zklIwWaFpORt7VFafLZfUCdfYfK0TvCfDeS6IPHvMgZUVZmc5u4FqmfMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e47ccbf0b078ba4da09601f5c87565d485ee6e3e35bb7cc41a754f4d847a6fc","last_reissued_at":"2026-05-18T04:27:47.846094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:47.846094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Olli Pottonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2009-09-14T12:04:50Z","abstract_excerpt":"The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \\\"Osterg{\\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2526","kind":"arxiv","version":2},"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":"0909.2526","created_at":"2026-05-18T04:27:47.846202+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.2526v2","created_at":"2026-05-18T04:27:47.846202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2526","created_at":"2026-05-18T04:27:47.846202+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZD4ZPYLA6F2","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZD4ZPYLA6F2JWQJ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZD4ZPYL","created_at":"2026-05-18T12:26:01.383474+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/NZD4ZPYLA6F2JWQJMAPVZB2WLV","json":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV.json","graph_json":"https://pith.science/api/pith-number/NZD4ZPYLA6F2JWQJMAPVZB2WLV/graph.json","events_json":"https://pith.science/api/pith-number/NZD4ZPYLA6F2JWQJMAPVZB2WLV/events.json","paper":"https://pith.science/paper/NZD4ZPYL"},"agent_actions":{"view_html":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV","download_json":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV.json","view_paper":"https://pith.science/paper/NZD4ZPYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.2526&json=true","fetch_graph":"https://pith.science/api/pith-number/NZD4ZPYLA6F2JWQJMAPVZB2WLV/graph.json","fetch_events":"https://pith.science/api/pith-number/NZD4ZPYLA6F2JWQJMAPVZB2WLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV/action/storage_attestation","attest_author":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV/action/author_attestation","sign_citation":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV/action/citation_signature","submit_replication":"https://pith.science/pith/NZD4ZPYLA6F2JWQJMAPVZB2WLV/action/replication_record"}},"created_at":"2026-05-18T04:27:47.846202+00:00","updated_at":"2026-05-18T04:27:47.846202+00:00"}