{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Q3TMVYRATJZNS7TQZLYNO2VGW5","short_pith_number":"pith:Q3TMVYRA","schema_version":"1.0","canonical_sha256":"86e6cae2209a72d97e70caf0d76aa6b764a7b72c9238e78e9f16c38c857df8a3","source":{"kind":"arxiv","id":"1212.3467","version":1},"attestation_state":"computed","paper":{"title":"Improved Semidefinite Programming Bound on Sizes of Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Hyun Kwang Kim, Phan Thanh Toan","submitted_at":"2012-12-14T13:27:55Z","abstract_excerpt":"Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to Schrijver's semidefinite programming bound, which is obtained from block-diagonalising the Terwilliger algebra of the Hamming cube, we obtain two new upper bounds on $A(n,d)$, namely $A(18,8) \\leq 71$ and $A(19,8) \\leq 131$. Twenty three new upper bounds on $A(n,d,w)$ for $n \\leq 28$ are also obtained by a similar way."},"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":"1212.3467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T13:27:55Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"e448336b1966e247b244d44a4e3dd51eb3e44a1cdb33723a53057977e8ff785e","abstract_canon_sha256":"b29e7c931b2b386d18dbfe812d99b9474d94d6974e67a75cc9015f0a0afcfd2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:24.556692Z","signature_b64":"CFmGpT7jcFrGw3LdSDh+KmqpuGwJ3mQQ3TcWI6WSqCVEaEUBUjxgPGj/PCjrUinjVjQgrAusQXaNUvVoKjY/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e6cae2209a72d97e70caf0d76aa6b764a7b72c9238e78e9f16c38c857df8a3","last_reissued_at":"2026-05-18T03:38:24.555916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:24.555916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Semidefinite Programming Bound on Sizes of Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Hyun Kwang Kim, Phan Thanh Toan","submitted_at":"2012-12-14T13:27:55Z","abstract_excerpt":"Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to Schrijver's semidefinite programming bound, which is obtained from block-diagonalising the Terwilliger algebra of the Hamming cube, we obtain two new upper bounds on $A(n,d)$, namely $A(18,8) \\leq 71$ and $A(19,8) \\leq 131$. Twenty three new upper bounds on $A(n,d,w)$ for $n \\leq 28$ are also obtained by a similar way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3467","kind":"arxiv","version":1},"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":"1212.3467","created_at":"2026-05-18T03:38:24.556031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3467v1","created_at":"2026-05-18T03:38:24.556031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3467","created_at":"2026-05-18T03:38:24.556031+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3TMVYRATJZN","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3TMVYRATJZNS7TQ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3TMVYRA","created_at":"2026-05-18T12:27:18.751474+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/Q3TMVYRATJZNS7TQZLYNO2VGW5","json":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5.json","graph_json":"https://pith.science/api/pith-number/Q3TMVYRATJZNS7TQZLYNO2VGW5/graph.json","events_json":"https://pith.science/api/pith-number/Q3TMVYRATJZNS7TQZLYNO2VGW5/events.json","paper":"https://pith.science/paper/Q3TMVYRA"},"agent_actions":{"view_html":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5","download_json":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5.json","view_paper":"https://pith.science/paper/Q3TMVYRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3467&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3TMVYRATJZNS7TQZLYNO2VGW5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3TMVYRATJZNS7TQZLYNO2VGW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5/action/storage_attestation","attest_author":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5/action/author_attestation","sign_citation":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5/action/citation_signature","submit_replication":"https://pith.science/pith/Q3TMVYRATJZNS7TQZLYNO2VGW5/action/replication_record"}},"created_at":"2026-05-18T03:38:24.556031+00:00","updated_at":"2026-05-18T03:38:24.556031+00:00"}