{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IBIFGQUWFGEEEGQ2IHWRBN55DH","short_pith_number":"pith:IBIFGQUW","schema_version":"1.0","canonical_sha256":"40505342962988421a1a41ed10b7bd19e695bfdea5f4e8d8aeb96ba3e420dbfb","source":{"kind":"arxiv","id":"1212.5197","version":1},"attestation_state":"computed","paper":{"title":"Seven new champion linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alexander M. Kasprzyk, Gavin Brown","submitted_at":"2012-12-20T19:18:02Z","abstract_excerpt":"We exhibit seven linear codes exceeding the current best known minimum distance d for their dimension k and block length n. Each code is defined over F_8, and their invariants [n,k,d] are given by [49,13,27], [49,14,26], [49,16,24], [49,17,23], [49,19,21], [49,25,16] and [49,26,15]. Our method includes an exhaustive search of all monomial evaluation codes generated by points in the [0,5]x[0,5] lattice square."},"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":"1212.5197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-20T19:18:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"39afc4d45943c0918da318d63e3c4f293c32e2688e5f407ab3f3d7fc64526212","abstract_canon_sha256":"8e194bfe1baa94aba51ca3cef0e34d015289ac2bcb33d4743d787048f15af889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:34.740683Z","signature_b64":"0qIkzPCF9u7U8m5s+NA6yt4PKTWHDHZN3ZsSTUexTZFHbYLWatAjfZQae71jrHUAOlzDa3Y2srTftOQ2btlfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40505342962988421a1a41ed10b7bd19e695bfdea5f4e8d8aeb96ba3e420dbfb","last_reissued_at":"2026-05-18T03:25:34.739919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:34.739919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seven new champion linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alexander M. Kasprzyk, Gavin Brown","submitted_at":"2012-12-20T19:18:02Z","abstract_excerpt":"We exhibit seven linear codes exceeding the current best known minimum distance d for their dimension k and block length n. Each code is defined over F_8, and their invariants [n,k,d] are given by [49,13,27], [49,14,26], [49,16,24], [49,17,23], [49,19,21], [49,25,16] and [49,26,15]. Our method includes an exhaustive search of all monomial evaluation codes generated by points in the [0,5]x[0,5] lattice square."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5197","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":"1212.5197","created_at":"2026-05-18T03:25:34.740034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5197v1","created_at":"2026-05-18T03:25:34.740034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5197","created_at":"2026-05-18T03:25:34.740034+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBIFGQUWFGEE","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBIFGQUWFGEEEGQ2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBIFGQUW","created_at":"2026-05-18T12:27:09.501522+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/IBIFGQUWFGEEEGQ2IHWRBN55DH","json":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH.json","graph_json":"https://pith.science/api/pith-number/IBIFGQUWFGEEEGQ2IHWRBN55DH/graph.json","events_json":"https://pith.science/api/pith-number/IBIFGQUWFGEEEGQ2IHWRBN55DH/events.json","paper":"https://pith.science/paper/IBIFGQUW"},"agent_actions":{"view_html":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH","download_json":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH.json","view_paper":"https://pith.science/paper/IBIFGQUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5197&json=true","fetch_graph":"https://pith.science/api/pith-number/IBIFGQUWFGEEEGQ2IHWRBN55DH/graph.json","fetch_events":"https://pith.science/api/pith-number/IBIFGQUWFGEEEGQ2IHWRBN55DH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH/action/storage_attestation","attest_author":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH/action/author_attestation","sign_citation":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH/action/citation_signature","submit_replication":"https://pith.science/pith/IBIFGQUWFGEEEGQ2IHWRBN55DH/action/replication_record"}},"created_at":"2026-05-18T03:25:34.740034+00:00","updated_at":"2026-05-18T03:25:34.740034+00:00"}