{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TCVTKVBJW2MMZCFIXCPUAA62GO","short_pith_number":"pith:TCVTKVBJ","canonical_record":{"source":{"id":"1906.02621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-06T14:49:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8c160a71b8122d4713ff722b109ce6235406210d6311a65acfbca1addcf80314","abstract_canon_sha256":"11385a06a7579975e5d6798d82fb4020ffa8828d86d02048d682862ce0834607"},"schema_version":"1.0"},"canonical_sha256":"98ab355429b698cc88a8b89f4003da33a25484906c4c09056a030292577846c4","source":{"kind":"arxiv","id":"1906.02621","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02621","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02621v2","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02621","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_12","alias_value":"TCVTKVBJW2MM","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_16","alias_value":"TCVTKVBJW2MMZCFI","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_8","alias_value":"TCVTKVBJ","created_at":"2026-07-05T00:54:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TCVTKVBJW2MMZCFIXCPUAA62GO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-06T14:49:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8c160a71b8122d4713ff722b109ce6235406210d6311a65acfbca1addcf80314","abstract_canon_sha256":"11385a06a7579975e5d6798d82fb4020ffa8828d86d02048d682862ce0834607"},"schema_version":"1.0"},"canonical_sha256":"98ab355429b698cc88a8b89f4003da33a25484906c4c09056a030292577846c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:45.281587Z","signature_b64":"Zth2JEI126ejSl/EsSAPKJy4m1KretLe1tkT6GqE+2bXJKDtyY44pPga1hhijx6QCrTUJUIQkcDAvR530qC/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ab355429b698cc88a8b89f4003da33a25484906c4c09056a030292577846c4","last_reissued_at":"2026-07-05T00:54:45.281086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:45.281086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02621","source_version":2,"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-07-05T00:54:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhpzI3kDiKGMbTzl3vcG3grmQ/G9jHWlHgeB7tKj/I1t8t/83ys8Ah0/7HUhpbRQoWXBq+KjQ3y47h9a7GaxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:54:20.258488Z"},"content_sha256":"2ed787b92c1f63d1281ab019beffacb4a475187b1c605e6c7a330c63ee03c421","schema_version":"1.0","event_id":"sha256:2ed787b92c1f63d1281ab019beffacb4a475187b1c605e6c7a330c63ee03c421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TCVTKVBJW2MMZCFIXCPUAA62GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The ${[46,9,20]_2}$ code is unique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2019-06-06T14:49:28Z","abstract_excerpt":"The minimum distance of all binary linear codes with dimension at most eight is known. The smallest open case for dimension nine is length $n=46$ with known bounds $19\\le d\\le 20$. Here we present a $[46,9,20]_2$ code and show its uniqueness. Interestingly enough, this unique optimal code is asymmetric, i.e., it has a trivial automorphism group. Additionally, we show the non-existence of $[47,10,20]_2$ and $[85,9,40]_2$ codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02621","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.02621/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:54:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NTbfSyJGzGebF13d/PZOMa0doXRWPPRGbfschfDxpQ4n0IREdDIXX4KzQhD2uqVrMbBUf48k4QXkHgwhBw4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:54:20.259441Z"},"content_sha256":"ca43ef08da04a731d66d7af33336e8bf6d31f83b4bafa4194fb6d97acf4ef811","schema_version":"1.0","event_id":"sha256:ca43ef08da04a731d66d7af33336e8bf6d31f83b4bafa4194fb6d97acf4ef811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/bundle.json","state_url":"https://pith.science/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/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-08-11T10:54:20Z","links":{"resolver":"https://pith.science/pith/TCVTKVBJW2MMZCFIXCPUAA62GO","bundle":"https://pith.science/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/bundle.json","state":"https://pith.science/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCVTKVBJW2MMZCFIXCPUAA62GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TCVTKVBJW2MMZCFIXCPUAA62GO","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":"11385a06a7579975e5d6798d82fb4020ffa8828d86d02048d682862ce0834607","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-06T14:49:28Z","title_canon_sha256":"8c160a71b8122d4713ff722b109ce6235406210d6311a65acfbca1addcf80314"},"schema_version":"1.0","source":{"id":"1906.02621","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02621","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02621v2","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02621","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_12","alias_value":"TCVTKVBJW2MM","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_16","alias_value":"TCVTKVBJW2MMZCFI","created_at":"2026-07-05T00:54:45Z"},{"alias_kind":"pith_short_8","alias_value":"TCVTKVBJ","created_at":"2026-07-05T00:54:45Z"}],"graph_snapshots":[{"event_id":"sha256:ca43ef08da04a731d66d7af33336e8bf6d31f83b4bafa4194fb6d97acf4ef811","target":"graph","created_at":"2026-07-05T00:54:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1906.02621/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum distance of all binary linear codes with dimension at most eight is known. The smallest open case for dimension nine is length $n=46$ with known bounds $19\\le d\\le 20$. Here we present a $[46,9,20]_2$ code and show its uniqueness. Interestingly enough, this unique optimal code is asymmetric, i.e., it has a trivial automorphism group. Additionally, we show the non-existence of $[47,10,20]_2$ and $[85,9,40]_2$ codes.","authors_text":"Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-06T14:49:28Z","title":"The ${[46,9,20]_2}$ code is unique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02621","kind":"arxiv","version":2},"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:2ed787b92c1f63d1281ab019beffacb4a475187b1c605e6c7a330c63ee03c421","target":"record","created_at":"2026-07-05T00:54:45Z","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":"11385a06a7579975e5d6798d82fb4020ffa8828d86d02048d682862ce0834607","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-06T14:49:28Z","title_canon_sha256":"8c160a71b8122d4713ff722b109ce6235406210d6311a65acfbca1addcf80314"},"schema_version":"1.0","source":{"id":"1906.02621","kind":"arxiv","version":2}},"canonical_sha256":"98ab355429b698cc88a8b89f4003da33a25484906c4c09056a030292577846c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98ab355429b698cc88a8b89f4003da33a25484906c4c09056a030292577846c4","first_computed_at":"2026-07-05T00:54:45.281086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:45.281086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zth2JEI126ejSl/EsSAPKJy4m1KretLe1tkT6GqE+2bXJKDtyY44pPga1hhijx6QCrTUJUIQkcDAvR530qC/Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:45.281587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02621","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ed787b92c1f63d1281ab019beffacb4a475187b1c605e6c7a330c63ee03c421","sha256:ca43ef08da04a731d66d7af33336e8bf6d31f83b4bafa4194fb6d97acf4ef811"],"state_sha256":"731287114b7fa697458d59ccd5975dd44754602d11c68874f8ecbb5ce359919f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wogBJopzURuO+wRZdqtCNHgIELKcAxRVabmcwbGzf2wKAhPQIJrd+YHz0wUFOR0PdIkPhDBw+w0TyCoHjtzuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:54:20.265423Z","bundle_sha256":"272a02e3ae2e820271ac5c2a920f4c7043faa5c794218f3bd1cc5523ec693fec"}}