{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHLL3N6OUPMYCP7JCB2XEBPPQG","short_pith_number":"pith:KHLL3N6O","canonical_record":{"source":{"id":"1709.02195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-07T12:09:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"93e1ef46271bf4b42fe81773d73c2af08d55b7d9a04e6aa46a542e8e81f11fee","abstract_canon_sha256":"742f29487fffcce1e92becc58ada63127798a465ea7e94ac75748bc28ceea4aa"},"schema_version":"1.0"},"canonical_sha256":"51d6bdb7cea3d9813fe910757205ef819ad81fd56d6e76a23ae87e51a2d71bd6","source":{"kind":"arxiv","id":"1709.02195","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02195","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02195v2","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02195","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"KHLL3N6OUPMY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHLL3N6OUPMYCP7J","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHLL3N6O","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHLL3N6OUPMYCP7JCB2XEBPPQG","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-07T12:09:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"93e1ef46271bf4b42fe81773d73c2af08d55b7d9a04e6aa46a542e8e81f11fee","abstract_canon_sha256":"742f29487fffcce1e92becc58ada63127798a465ea7e94ac75748bc28ceea4aa"},"schema_version":"1.0"},"canonical_sha256":"51d6bdb7cea3d9813fe910757205ef819ad81fd56d6e76a23ae87e51a2d71bd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.183738Z","signature_b64":"rQkqxelU8bive2lFSrIgl6Pvhw56cXoKua+G1eImZe3AzuoszfE9ptj1Lzhu/ll8AhBfGc4A9aDAFTcqQTMpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d6bdb7cea3d9813fe910757205ef819ad81fd56d6e76a23ae87e51a2d71bd6","last_reissued_at":"2026-05-17T23:59:33.183143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.183143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02195","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-05-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crwSIQPOpufTUYa1c1UoDdpxITIxdPLixdYDNB/R2EKFwlP9L/84M1hsXZ+Rz6nGHZrDtLWxQZYbmKiesibaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:22.746958Z"},"content_sha256":"284a1c6023ebd52731930fd52399922ff3d17d99a8ebac1ff448a29adbd41d3f","schema_version":"1.0","event_id":"sha256:284a1c6023ebd52731930fd52399922ff3d17d99a8ebac1ff448a29adbd41d3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHLL3N6OUPMYCP7JCB2XEBPPQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniqueness of codes using semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Andries E. Brouwer, Sven C. Polak","submitted_at":"2017-09-07T12:09:04Z","abstract_excerpt":"For $n,d,w \\in \\mathbb{N}$, let $A(n,d,w)$ denote the maximum size of a binary code of word length $n$, minimum distance $d$ and constant weight $w$. Schrijver recently showed using semidefinite programming that $A(23,8,11)=1288$, and the second author that $A(22,8,11)=672$ and $A(22,8,10)=616$. Here we show uniqueness of the codes achieving these bounds.\n  Let $A(n,d)$ denote the maximum size of a binary code of word length $n$ and minimum distance $d$. Gijswijt, Mittelmann and Schrijver showed that $A(20,8)=256$. We show that there are several nonisomorphic codes achieving this bound, and cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02195","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":""},"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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TEtKkoF1jf1u0gHdMT197UEwAB+WdDAiHOsrD85VfaSAbgfvSvaUnHTdo/v11oowE/W418AWULTyjWkKrOrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:22.747308Z"},"content_sha256":"7f753ecd1534f86e1ed55f5eeed31ac1b0ff71273fe087349dcd76d548c2bbe6","schema_version":"1.0","event_id":"sha256:7f753ecd1534f86e1ed55f5eeed31ac1b0ff71273fe087349dcd76d548c2bbe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/bundle.json","state_url":"https://pith.science/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/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-01T14:37:22Z","links":{"resolver":"https://pith.science/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG","bundle":"https://pith.science/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/bundle.json","state":"https://pith.science/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHLL3N6OUPMYCP7JCB2XEBPPQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHLL3N6OUPMYCP7JCB2XEBPPQG","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":"742f29487fffcce1e92becc58ada63127798a465ea7e94ac75748bc28ceea4aa","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-07T12:09:04Z","title_canon_sha256":"93e1ef46271bf4b42fe81773d73c2af08d55b7d9a04e6aa46a542e8e81f11fee"},"schema_version":"1.0","source":{"id":"1709.02195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02195","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02195v2","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02195","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"KHLL3N6OUPMY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHLL3N6OUPMYCP7J","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHLL3N6O","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:7f753ecd1534f86e1ed55f5eeed31ac1b0ff71273fe087349dcd76d548c2bbe6","target":"graph","created_at":"2026-05-17T23:59:33Z","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":"For $n,d,w \\in \\mathbb{N}$, let $A(n,d,w)$ denote the maximum size of a binary code of word length $n$, minimum distance $d$ and constant weight $w$. Schrijver recently showed using semidefinite programming that $A(23,8,11)=1288$, and the second author that $A(22,8,11)=672$ and $A(22,8,10)=616$. Here we show uniqueness of the codes achieving these bounds.\n  Let $A(n,d)$ denote the maximum size of a binary code of word length $n$ and minimum distance $d$. Gijswijt, Mittelmann and Schrijver showed that $A(20,8)=256$. We show that there are several nonisomorphic codes achieving this bound, and cl","authors_text":"Andries E. Brouwer, Sven C. Polak","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-07T12:09:04Z","title":"Uniqueness of codes using semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02195","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:284a1c6023ebd52731930fd52399922ff3d17d99a8ebac1ff448a29adbd41d3f","target":"record","created_at":"2026-05-17T23:59:33Z","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":"742f29487fffcce1e92becc58ada63127798a465ea7e94ac75748bc28ceea4aa","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-07T12:09:04Z","title_canon_sha256":"93e1ef46271bf4b42fe81773d73c2af08d55b7d9a04e6aa46a542e8e81f11fee"},"schema_version":"1.0","source":{"id":"1709.02195","kind":"arxiv","version":2}},"canonical_sha256":"51d6bdb7cea3d9813fe910757205ef819ad81fd56d6e76a23ae87e51a2d71bd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d6bdb7cea3d9813fe910757205ef819ad81fd56d6e76a23ae87e51a2d71bd6","first_computed_at":"2026-05-17T23:59:33.183143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:33.183143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQkqxelU8bive2lFSrIgl6Pvhw56cXoKua+G1eImZe3AzuoszfE9ptj1Lzhu/ll8AhBfGc4A9aDAFTcqQTMpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:33.183738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:284a1c6023ebd52731930fd52399922ff3d17d99a8ebac1ff448a29adbd41d3f","sha256:7f753ecd1534f86e1ed55f5eeed31ac1b0ff71273fe087349dcd76d548c2bbe6"],"state_sha256":"4e79b53060f86cb5aac71c96b79bb2ce81126a33e8f3ffc1106186e135f87e7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDIlGh0ShqYN7dssftAYAVEWu1kNlYeFXB6LXOi1Jduy1PsO/IP2jMFEknzpnVeC+HEKdOqOpWGbR7X9V2xHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:37:22.749442Z","bundle_sha256":"516615b87b7d644714a283c21cc3165c25d1d6ef5c15f7e8542ddc8389ea54e2"}}