{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NBBXZS5UQCOAGL2RM37UB6UMBW","short_pith_number":"pith:NBBXZS5U","schema_version":"1.0","canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","source":{"kind":"arxiv","id":"1604.06022","version":3},"attestation_state":"computed","paper":{"title":"Constructing error-correcting binary codes using transitive permutation groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Antti Laaksonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2016-04-20T16:25:50Z","abstract_excerpt":"Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \\ge 5632$, $A_2(21,4) \\ge 40960$, $A_2(22,4) \\ge 81920$, $A_2(23,4) \\ge 163840$, $A_2(24,4) \\ge 327680$, $A_2(24,10) \\ge 136$, and $A_2(25,6) \\ge 17920$. The new lower bounds are a result of a systematic computer search over transitive permutation groups."},"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":"1604.06022","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-20T16:25:50Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"10c145a197d5c5a5abe1e16b7d8f2704013b1afc968556dfd58f81c44883db80","abstract_canon_sha256":"df33d759408dec3d6cc639273a90e336fbebfbd19c52a14706df396a50e02422"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.108873Z","signature_b64":"4cQIkaPZs2Q3rasWYxxgEEJlmMZkZ9FySXmghl/OQvM3yVWOL1Jft/bOnu4fDEnBIGCzC0CqttRkT/4QpRV4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","last_reissued_at":"2026-05-18T01:10:59.108384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.108384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing error-correcting binary codes using transitive permutation groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Antti Laaksonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2016-04-20T16:25:50Z","abstract_excerpt":"Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \\ge 5632$, $A_2(21,4) \\ge 40960$, $A_2(22,4) \\ge 81920$, $A_2(23,4) \\ge 163840$, $A_2(24,4) \\ge 327680$, $A_2(24,10) \\ge 136$, and $A_2(25,6) \\ge 17920$. The new lower bounds are a result of a systematic computer search over transitive permutation groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06022","kind":"arxiv","version":3},"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":"1604.06022","created_at":"2026-05-18T01:10:59.108454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06022v3","created_at":"2026-05-18T01:10:59.108454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06022","created_at":"2026-05-18T01:10:59.108454+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBBXZS5UQCOA","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBBXZS5UQCOAGL2R","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBBXZS5U","created_at":"2026-05-18T12:30:32.724797+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/NBBXZS5UQCOAGL2RM37UB6UMBW","json":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW.json","graph_json":"https://pith.science/api/pith-number/NBBXZS5UQCOAGL2RM37UB6UMBW/graph.json","events_json":"https://pith.science/api/pith-number/NBBXZS5UQCOAGL2RM37UB6UMBW/events.json","paper":"https://pith.science/paper/NBBXZS5U"},"agent_actions":{"view_html":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW","download_json":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW.json","view_paper":"https://pith.science/paper/NBBXZS5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06022&json=true","fetch_graph":"https://pith.science/api/pith-number/NBBXZS5UQCOAGL2RM37UB6UMBW/graph.json","fetch_events":"https://pith.science/api/pith-number/NBBXZS5UQCOAGL2RM37UB6UMBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/action/storage_attestation","attest_author":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/action/author_attestation","sign_citation":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/action/citation_signature","submit_replication":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/action/replication_record"}},"created_at":"2026-05-18T01:10:59.108454+00:00","updated_at":"2026-05-18T01:10:59.108454+00:00"}