{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2LQZVL73SHLP3AHD7B6UFX653C","short_pith_number":"pith:2LQZVL73","canonical_record":{"source":{"id":"1108.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T14:45:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa84c51ad536a954d16bbcabc1bb927e69e467792543adb46721d28766e66aec","abstract_canon_sha256":"1b909d29945f993e63b13fbebb3894de73cece39c901f8d70a8e464bc98f4bbc"},"schema_version":"1.0"},"canonical_sha256":"d2e19aaffb91d6fd80e3f87d42dfddd887264e441470604f74ca8af73c94cf70","source":{"kind":"arxiv","id":"1108.5104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5104","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5104v1","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5104","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"2LQZVL73SHLP","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LQZVL73SHLP3AHD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LQZVL73","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2LQZVL73SHLP3AHD7B6UFX653C","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T14:45:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa84c51ad536a954d16bbcabc1bb927e69e467792543adb46721d28766e66aec","abstract_canon_sha256":"1b909d29945f993e63b13fbebb3894de73cece39c901f8d70a8e464bc98f4bbc"},"schema_version":"1.0"},"canonical_sha256":"d2e19aaffb91d6fd80e3f87d42dfddd887264e441470604f74ca8af73c94cf70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:45.407535Z","signature_b64":"j+/gc1hiFBgkD+nZwA//HdC+N5gzdWCUcSa/qXm0Ot4R5G5C+fMi36jYcS5EHjT7/ImZcd0vrqo6aGBttpaHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e19aaffb91d6fd80e3f87d42dfddd887264e441470604f74ca8af73c94cf70","last_reissued_at":"2026-05-18T04:14:45.407105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:45.407105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5104","source_version":1,"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-18T04:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p4v5pFU4eQ5g5uWevPJsycpdNAOu7FyIfCzukAFo3dKvLnsTdcilUJm79XZMiBSS1fvGg9muhG6P80sVqlMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:14:47.256050Z"},"content_sha256":"4857b0c9d3bb558f190cdcadc2839fe48bf8c83c54b57e395226a7aa2067f50e","schema_version":"1.0","event_id":"sha256:4857b0c9d3bb558f190cdcadc2839fe48bf8c83c54b57e395226a7aa2067f50e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2LQZVL73SHLP3AHD7B6UFX653C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Linear Programming Bounds on Sizes of Constant-Weight Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan","submitted_at":"2011-08-25T14:45:57Z","abstract_excerpt":"Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \\leq 28$. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5104","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"},"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-18T04:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvmZLevBAmUZ6O3lrkDh1BDq2+LIutfADknHHskoWFfux8JmAzcU3L4AN79/pnhFyB0ZosG+aDGIrWYmq0KlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:14:47.256721Z"},"content_sha256":"c5efc90f2ff266b8932258e0ce460d3c9a4e9106a3fb02b05ad186980d3a4b20","schema_version":"1.0","event_id":"sha256:c5efc90f2ff266b8932258e0ce460d3c9a4e9106a3fb02b05ad186980d3a4b20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LQZVL73SHLP3AHD7B6UFX653C/bundle.json","state_url":"https://pith.science/pith/2LQZVL73SHLP3AHD7B6UFX653C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LQZVL73SHLP3AHD7B6UFX653C/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-05-21T22:14:47Z","links":{"resolver":"https://pith.science/pith/2LQZVL73SHLP3AHD7B6UFX653C","bundle":"https://pith.science/pith/2LQZVL73SHLP3AHD7B6UFX653C/bundle.json","state":"https://pith.science/pith/2LQZVL73SHLP3AHD7B6UFX653C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LQZVL73SHLP3AHD7B6UFX653C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2LQZVL73SHLP3AHD7B6UFX653C","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":"1b909d29945f993e63b13fbebb3894de73cece39c901f8d70a8e464bc98f4bbc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T14:45:57Z","title_canon_sha256":"aa84c51ad536a954d16bbcabc1bb927e69e467792543adb46721d28766e66aec"},"schema_version":"1.0","source":{"id":"1108.5104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5104","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5104v1","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5104","created_at":"2026-05-18T04:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"2LQZVL73SHLP","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LQZVL73SHLP3AHD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LQZVL73","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:c5efc90f2ff266b8932258e0ce460d3c9a4e9106a3fb02b05ad186980d3a4b20","target":"graph","created_at":"2026-05-18T04:14: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"},"paper":{"abstract_excerpt":"Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \\leq 28$. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.","authors_text":"Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T14:45:57Z","title":"Improved Linear Programming Bounds on Sizes of Constant-Weight Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5104","kind":"arxiv","version":1},"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:4857b0c9d3bb558f190cdcadc2839fe48bf8c83c54b57e395226a7aa2067f50e","target":"record","created_at":"2026-05-18T04:14: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":"1b909d29945f993e63b13fbebb3894de73cece39c901f8d70a8e464bc98f4bbc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T14:45:57Z","title_canon_sha256":"aa84c51ad536a954d16bbcabc1bb927e69e467792543adb46721d28766e66aec"},"schema_version":"1.0","source":{"id":"1108.5104","kind":"arxiv","version":1}},"canonical_sha256":"d2e19aaffb91d6fd80e3f87d42dfddd887264e441470604f74ca8af73c94cf70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2e19aaffb91d6fd80e3f87d42dfddd887264e441470604f74ca8af73c94cf70","first_computed_at":"2026-05-18T04:14:45.407105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:45.407105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+/gc1hiFBgkD+nZwA//HdC+N5gzdWCUcSa/qXm0Ot4R5G5C+fMi36jYcS5EHjT7/ImZcd0vrqo6aGBttpaHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:45.407535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4857b0c9d3bb558f190cdcadc2839fe48bf8c83c54b57e395226a7aa2067f50e","sha256:c5efc90f2ff266b8932258e0ce460d3c9a4e9106a3fb02b05ad186980d3a4b20"],"state_sha256":"627e13646d66561e984f20f1cf0c2abf3012d5379a9b19a7a581f1c513e56581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1zQVjKqKru8WcSQ1d56mO1CKzkFNx9mxBeR2foY54//uyUXZ5pxlPRua+dXb03CA420o1iXxnT0CF76ZNmSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:14:47.260028Z","bundle_sha256":"b4dc0ad71d379c76354b16de02055755ccf457e655d65b063c8e758193a0cb99"}}