{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NBBXZS5UQCOAGL2RM37UB6UMBW","short_pith_number":"pith:NBBXZS5U","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"},"canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","source":{"kind":"arxiv","id":"1604.06022","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NBBXZS5UQCOAGL2RM37UB6UMBW","target":"record","payload":{"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"},"canonical_sha256":"68437ccbb4809c032f5166ff40fa8c0d9474fa2707417c54162ed4b3c1933355","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"},"source_kind":"arxiv","source_id":"1604.06022","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAQoj8gaq8B1z/ebHQXxuN8dQLlA251eKXxuM+mLALgupdiODhuyTjltwMpFYVBTpE3nS3tRFXwpEm9nAYtkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:18:37.515313Z"},"content_sha256":"730b8b39bdf3fd1b36ceed86f9cecf644bd2c3174a152b92a2941d4f34ac4062","schema_version":"1.0","event_id":"sha256:730b8b39bdf3fd1b36ceed86f9cecf644bd2c3174a152b92a2941d4f34ac4062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NBBXZS5UQCOAGL2RM37UB6UMBW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GsOXTz1cBDlAu4ZV1QfnDEFLkPah8rUeKAvmPq2yXCKLjPRYo2ZstJJ1OeWZNmVZrDoy9ybUfEF1oKVus2vzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:18:37.515688Z"},"content_sha256":"b0a93818f5b829f7cbf7243b75fa7fc927c537252618bbb94bccf676dd5f2e69","schema_version":"1.0","event_id":"sha256:b0a93818f5b829f7cbf7243b75fa7fc927c537252618bbb94bccf676dd5f2e69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/bundle.json","state_url":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T23:18:37Z","links":{"resolver":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW","bundle":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/bundle.json","state":"https://pith.science/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBBXZS5UQCOAGL2RM37UB6UMBW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f48A9DOXqrU1uCRgkC/U7z4BZYV4BMa2qUJ7OBp2Gz0+HNjxedDQdr1gMIlXdhvzRfMeZZH7n20RPFIZwR9jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:18:37.517552Z","bundle_sha256":"dfde05775934d15184cce37e051ed508e10da9f2db23059e9501f85a68aa8f70"}}