{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NBBXZS5UQCOAGL2RM37UB6UMBW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df33d759408dec3d6cc639273a90e336fbebfbd19c52a14706df396a50e02422","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-20T16:25:50Z","title_canon_sha256":"10c145a197d5c5a5abe1e16b7d8f2704013b1afc968556dfd58f81c44883db80"},"schema_version":"1.0","source":{"id":"1604.06022","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06022","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06022v3","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06022","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"NBBXZS5UQCOA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBBXZS5UQCOAGL2R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBBXZS5U","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:b0a93818f5b829f7cbf7243b75fa7fc927c537252618bbb94bccf676dd5f2e69","target":"graph","created_at":"2026-05-18T01:10:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Antti Laaksonen, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-20T16:25:50Z","title":"Constructing error-correcting binary codes using transitive permutation groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06022","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:730b8b39bdf3fd1b36ceed86f9cecf644bd2c3174a152b92a2941d4f34ac4062","target":"record","created_at":"2026-05-18T01:10:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"df33d759408dec3d6cc639273a90e336fbebfbd19c52a14706df396a50e02422","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-20T16:25:50Z","title_canon_sha256":"10c145a197d5c5a5abe1e16b7d8f2704013b1afc968556dfd58f81c44883db80"},"schema_version":"1.0","source":{"id":"1604.06022","kind":"arxiv","version":3}},"canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","first_computed_at":"2026-05-18T01:10:59.108384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:59.108384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cQIkaPZs2Q3rasWYxxgEEJlmMZkZ9FySXmghl/OQvM3yVWOL1Jft/bOnu4fDEnBIGCzC0CqttRkT/4QpRV4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:59.108873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06022","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:730b8b39bdf3fd1b36ceed86f9cecf644bd2c3174a152b92a2941d4f34ac4062","sha256:b0a93818f5b829f7cbf7243b75fa7fc927c537252618bbb94bccf676dd5f2e69"],"state_sha256":"520d93bdd2561d7d270efd53b24b6fbbf05adccb1bb0ca0034cda761d6f7135d"}