{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IXEAZBIE5PTV5FFQ45U5BGTIXC","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":"17b3def3c20c2ad1c56362393e9d7c7921a15fe78ffeb2583771a11f98db3a96","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-08-23T04:39:56Z","title_canon_sha256":"7c9ddb25aeffad87d0c112da10bb8468ec90247764b3aa9f4f4c32d72c8c2954"},"schema_version":"1.0","source":{"id":"1908.08661","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08661","created_at":"2026-07-05T01:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08661v3","created_at":"2026-07-05T01:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08661","created_at":"2026-07-05T01:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"IXEAZBIE5PTV","created_at":"2026-07-05T01:52:33Z"},{"alias_kind":"pith_short_16","alias_value":"IXEAZBIE5PTV5FFQ","created_at":"2026-07-05T01:52:33Z"},{"alias_kind":"pith_short_8","alias_value":"IXEAZBIE","created_at":"2026-07-05T01:52:33Z"}],"graph_snapshots":[{"event_id":"sha256:0deafd1ab4fcf29347e97184724a519ef5aa20aebb307611dc1d8e1401d242b2","target":"graph","created_at":"2026-07-05T01:52: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all ternary LCD $[n,k]$ codes. The largest minimum weights $d_2(n,5)$ and $d_3(n,4)$ are partially determined. We also determine the largest minimum weights $d_2(n,n-5)$, $d_3(n,n-i)$ for $i \\in \\{2,3,4\\}$, and $d_3(n,k)$ for $n \\in \\{11,12,\\ldots,19\\}$.","authors_text":"Ken Saito, Makoto Araya, Masaaki Harada","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-08-23T04:39:56Z","title":"On the minimum weights of binary LCD codes and ternary LCD codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08661","kind":"arxiv","version":3},"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:f4bc36b27cfb3170c4de62a59838ed7ba9e893c2ca0feffb2e17d9fa729fa6df","target":"record","created_at":"2026-07-05T01:52: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":"17b3def3c20c2ad1c56362393e9d7c7921a15fe78ffeb2583771a11f98db3a96","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-08-23T04:39:56Z","title_canon_sha256":"7c9ddb25aeffad87d0c112da10bb8468ec90247764b3aa9f4f4c32d72c8c2954"},"schema_version":"1.0","source":{"id":"1908.08661","kind":"arxiv","version":3}},"canonical_sha256":"45c80c8504ebe75e94b0e769d09a68b8a0f9f42a475e2c1b6d0c019e5640e018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45c80c8504ebe75e94b0e769d09a68b8a0f9f42a475e2c1b6d0c019e5640e018","first_computed_at":"2026-07-05T01:52:33.302955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:33.302955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWBSH/hkEOa97XBT3f7r+TDf2CNUnTsoIdWAVpMv7+JRdiKsYYvEBsKKmEw9n8ubcxKmpaUIZje2qhLVm+t4Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:33.303501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08661","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4bc36b27cfb3170c4de62a59838ed7ba9e893c2ca0feffb2e17d9fa729fa6df","sha256:0deafd1ab4fcf29347e97184724a519ef5aa20aebb307611dc1d8e1401d242b2"],"state_sha256":"9961757507076c614e69ff1212bdec5e511f79f7c32bcec0987817d1543768c7"}