{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ULFJZTBYJ2UQT5TTSIMKBVDE4B","short_pith_number":"pith:ULFJZTBY","canonical_record":{"source":{"id":"1701.04165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T04:49:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa6184c2c6bb68de0f96b53f9a6844e44cb0c5b3495eda75e4f0b7f1f14125cb","abstract_canon_sha256":"184d174bd40d333f023116a9216736f6ef7aac5fb49c5e9c0ba4b69b2b03cc14"},"schema_version":"1.0"},"canonical_sha256":"a2ca9ccc384ea909f6739218a0d464e06fd1c71037e17b234cc0529b3dbeb5fe","source":{"kind":"arxiv","id":"1701.04165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04165","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04165v1","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04165","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULFJZTBYJ2UQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULFJZTBYJ2UQT5TT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULFJZTBY","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ULFJZTBYJ2UQT5TTSIMKBVDE4B","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T04:49:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa6184c2c6bb68de0f96b53f9a6844e44cb0c5b3495eda75e4f0b7f1f14125cb","abstract_canon_sha256":"184d174bd40d333f023116a9216736f6ef7aac5fb49c5e9c0ba4b69b2b03cc14"},"schema_version":"1.0"},"canonical_sha256":"a2ca9ccc384ea909f6739218a0d464e06fd1c71037e17b234cc0529b3dbeb5fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:47.637738Z","signature_b64":"C2NFrasP+WIQHDoyC+varlMjwt6OPTDenz+XFsifRSZNVErRBA/t1LfJSSx9b8BWBg07nPPCLeeqDGeLcqA8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2ca9ccc384ea909f6739218a0d464e06fd1c71037e17b234cc0529b3dbeb5fe","last_reissued_at":"2026-05-18T00:52:47.637007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:47.637007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04165","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-18T00:52:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1PBkbJTMtxqrfVeZpkhUaVnJ9gXfPzmVztfs4T4kYGlYU5qAI4MrpMoxOi/4rOP8zuZ5behDpWY6TwQbiRoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:03.550540Z"},"content_sha256":"0cd2ece82e807fbcec1773dbbba6573986b8c9680d88dae18994bb198cf474f4","schema_version":"1.0","event_id":"sha256:0cd2ece82e807fbcec1773dbbba6573986b8c9680d88dae18994bb198cf474f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ULFJZTBYJ2UQT5TTSIMKBVDE4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Bounds on Binary LCD Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byung-Sun Won, Jon-Lark Kim, Lucky Galvez, Nari Lee, Young Gun Roe","submitted_at":"2017-01-16T04:49:33Z","abstract_excerpt":"A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\\perp}$ satisfies $C \\cap C^{\\perp}$= $\\left\\{ \\mathbf{0}\\right\\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of $d$ among $[n,k,d]$ binary LCD codes. We give exact values of $LCD{[}n,k{]}$ for $1 \\le k \\le n \\le 12$.\n  We also show that $LCD[n,n-i]=2$ for any $i\\geq2$ and $n\\geq2^{i}$. Furthermore, we show that $LCD[n,k]\\leq LCD[n,k-1]$ for $k$ odd and $LCD[n,k]\\leq LCD[n,k-2]$ for $k$ even."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04165","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-18T00:52:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZRux3gTiaio2LFd6as6dbuiWubCUBsX9ioLQ8EtCq0jzcOcHHYaGplL+oOXhkDgCOxqfPJ0BdGZNddECnD3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:26:03.550902Z"},"content_sha256":"240fa96dd59c2d725961a8f5ee307817ccee89b04fbfc036661dbd38b37349be","schema_version":"1.0","event_id":"sha256:240fa96dd59c2d725961a8f5ee307817ccee89b04fbfc036661dbd38b37349be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/bundle.json","state_url":"https://pith.science/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/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-02T10:26:03Z","links":{"resolver":"https://pith.science/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B","bundle":"https://pith.science/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/bundle.json","state":"https://pith.science/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULFJZTBYJ2UQT5TTSIMKBVDE4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ULFJZTBYJ2UQT5TTSIMKBVDE4B","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":"184d174bd40d333f023116a9216736f6ef7aac5fb49c5e9c0ba4b69b2b03cc14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T04:49:33Z","title_canon_sha256":"aa6184c2c6bb68de0f96b53f9a6844e44cb0c5b3495eda75e4f0b7f1f14125cb"},"schema_version":"1.0","source":{"id":"1701.04165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04165","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04165v1","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04165","created_at":"2026-05-18T00:52:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULFJZTBYJ2UQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULFJZTBYJ2UQT5TT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULFJZTBY","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:240fa96dd59c2d725961a8f5ee307817ccee89b04fbfc036661dbd38b37349be","target":"graph","created_at":"2026-05-18T00:52:47Z","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":"A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\\perp}$ satisfies $C \\cap C^{\\perp}$= $\\left\\{ \\mathbf{0}\\right\\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of $d$ among $[n,k,d]$ binary LCD codes. We give exact values of $LCD{[}n,k{]}$ for $1 \\le k \\le n \\le 12$.\n  We also show that $LCD[n,n-i]=2$ for any $i\\geq2$ and $n\\geq2^{i}$. Furthermore, we show that $LCD[n,k]\\leq LCD[n,k-1]$ for $k$ odd and $LCD[n,k]\\leq LCD[n,k-2]$ for $k$ even.","authors_text":"Byung-Sun Won, Jon-Lark Kim, Lucky Galvez, Nari Lee, Young Gun Roe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T04:49:33Z","title":"Some Bounds on Binary LCD Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04165","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:0cd2ece82e807fbcec1773dbbba6573986b8c9680d88dae18994bb198cf474f4","target":"record","created_at":"2026-05-18T00:52:47Z","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":"184d174bd40d333f023116a9216736f6ef7aac5fb49c5e9c0ba4b69b2b03cc14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T04:49:33Z","title_canon_sha256":"aa6184c2c6bb68de0f96b53f9a6844e44cb0c5b3495eda75e4f0b7f1f14125cb"},"schema_version":"1.0","source":{"id":"1701.04165","kind":"arxiv","version":1}},"canonical_sha256":"a2ca9ccc384ea909f6739218a0d464e06fd1c71037e17b234cc0529b3dbeb5fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2ca9ccc384ea909f6739218a0d464e06fd1c71037e17b234cc0529b3dbeb5fe","first_computed_at":"2026-05-18T00:52:47.637007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:47.637007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2NFrasP+WIQHDoyC+varlMjwt6OPTDenz+XFsifRSZNVErRBA/t1LfJSSx9b8BWBg07nPPCLeeqDGeLcqA8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:47.637738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cd2ece82e807fbcec1773dbbba6573986b8c9680d88dae18994bb198cf474f4","sha256:240fa96dd59c2d725961a8f5ee307817ccee89b04fbfc036661dbd38b37349be"],"state_sha256":"c0963f0cb2b72be85162b3908f7f19265a9cd11134bc56b9ccb5e6bf6befe390"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NGUw32/kO995y9MJCNXiAyYNVo1wKaA754TdvqjHSfz6sRKFXyMw+3I32grSNTOTEdZQ6ql1RzmjTvAuvRcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:26:03.553077Z","bundle_sha256":"8bab18e0240afa87b82a947f94bd8196dba6b6a2ffb7417d1b1349654522546b"}}