{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VYYBQAN75NWHGRN7QPEUYE5UHX","short_pith_number":"pith:VYYBQAN7","canonical_record":{"source":{"id":"1908.03294","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T03:28:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ceb42fcd6fcde741c8e23ae15971580ffde658678d5e14456034635fc8b323c9","abstract_canon_sha256":"84e3833e584851b5ffd9b7d02621c239fcd9f2cc27e51def0d0a5fd923383dbb"},"schema_version":"1.0"},"canonical_sha256":"ae301801bfeb6c7345bf83c94c13b43dd1f05d9a0515438fb64ca514fdecfbbc","source":{"kind":"arxiv","id":"1908.03294","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03294","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03294v3","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03294","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"VYYBQAN75NWH","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"VYYBQAN75NWHGRN7","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"VYYBQAN7","created_at":"2026-07-05T02:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VYYBQAN75NWHGRN7QPEUYE5UHX","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03294","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T03:28:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ceb42fcd6fcde741c8e23ae15971580ffde658678d5e14456034635fc8b323c9","abstract_canon_sha256":"84e3833e584851b5ffd9b7d02621c239fcd9f2cc27e51def0d0a5fd923383dbb"},"schema_version":"1.0"},"canonical_sha256":"ae301801bfeb6c7345bf83c94c13b43dd1f05d9a0515438fb64ca514fdecfbbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:03.896867Z","signature_b64":"zXYx3rhGT+8WJAdr99ACOd87zOlCjUuRAkso/CCkn7RpjkWbryU4M6Cd1H7I+sodb/Daos3KMchChlOuaaORBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae301801bfeb6c7345bf83c94c13b43dd1f05d9a0515438fb64ca514fdecfbbc","last_reissued_at":"2026-07-05T02:04:03.896399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:03.896399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03294","source_version":3,"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-07-05T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrnrbrRosQgPNzuQAxoXL7PIerlajV3ezG27XTNW7uUlHU1qFbiQ+6ZDmBZsjlEjG9+4stZW+ppjJjzTGIGLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:03:29.461163Z"},"content_sha256":"8cdfabf32aa80cb6918117795240458c53945107101ca9440657d1ac555768fb","schema_version":"1.0","event_id":"sha256:8cdfabf32aa80cb6918117795240458c53945107101ca9440657d1ac555768fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VYYBQAN75NWHGRN7QPEUYE5UHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization and classification of optimal LCD codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ken Saito, Makoto Araya, Masaaki Harada","submitted_at":"2019-08-09T03:28:38Z","abstract_excerpt":"Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\\mathbb{F}_q$ having large minimum weights for $q \\in \\{2,3\\}$. Using the characterization, we determine the largest minimum weights among LCD $[n,k]$ codes over $\\mathbb{F}_q$ for $(q,k) \\in \\{(2,4), (3,2),(3,3)\\}$. Moreover, we give a complete classification of optimal LCD $[n,k]$ codes over $\\mathbb{F}_q$ for $(q,k) \\in \\{(2,3), (2,4), (3,2),(3,3)\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03294","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03294/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wg7dQzVdOKWH7WYr3YepnOb56g9OL4vkbwFHkQFcFx4jgKbzgBBXjEHbgm7gkMuev7JppMOO5DyOrAXEUJwdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:03:29.461583Z"},"content_sha256":"958da71171943d877c6aaac56bcaa081040828dc05de7babd755a198749ac079","schema_version":"1.0","event_id":"sha256:958da71171943d877c6aaac56bcaa081040828dc05de7babd755a198749ac079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/bundle.json","state_url":"https://pith.science/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/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-08-20T11:03:29Z","links":{"resolver":"https://pith.science/pith/VYYBQAN75NWHGRN7QPEUYE5UHX","bundle":"https://pith.science/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/bundle.json","state":"https://pith.science/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYYBQAN75NWHGRN7QPEUYE5UHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VYYBQAN75NWHGRN7QPEUYE5UHX","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":"84e3833e584851b5ffd9b7d02621c239fcd9f2cc27e51def0d0a5fd923383dbb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T03:28:38Z","title_canon_sha256":"ceb42fcd6fcde741c8e23ae15971580ffde658678d5e14456034635fc8b323c9"},"schema_version":"1.0","source":{"id":"1908.03294","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03294","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03294v3","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03294","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"VYYBQAN75NWH","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"VYYBQAN75NWHGRN7","created_at":"2026-07-05T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"VYYBQAN7","created_at":"2026-07-05T02:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:958da71171943d877c6aaac56bcaa081040828dc05de7babd755a198749ac079","target":"graph","created_at":"2026-07-05T02:04:03Z","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.03294/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 trivially. We give a characterization of LCD codes over $\\mathbb{F}_q$ having large minimum weights for $q \\in \\{2,3\\}$. Using the characterization, we determine the largest minimum weights among LCD $[n,k]$ codes over $\\mathbb{F}_q$ for $(q,k) \\in \\{(2,4), (3,2),(3,3)\\}$. Moreover, we give a complete classification of optimal LCD $[n,k]$ codes over $\\mathbb{F}_q$ for $(q,k) \\in \\{(2,3), (2,4), (3,2),(3,3)\\}$.","authors_text":"Ken Saito, Makoto Araya, Masaaki Harada","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T03:28:38Z","title":"Characterization and classification of optimal LCD codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03294","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:8cdfabf32aa80cb6918117795240458c53945107101ca9440657d1ac555768fb","target":"record","created_at":"2026-07-05T02:04:03Z","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":"84e3833e584851b5ffd9b7d02621c239fcd9f2cc27e51def0d0a5fd923383dbb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-09T03:28:38Z","title_canon_sha256":"ceb42fcd6fcde741c8e23ae15971580ffde658678d5e14456034635fc8b323c9"},"schema_version":"1.0","source":{"id":"1908.03294","kind":"arxiv","version":3}},"canonical_sha256":"ae301801bfeb6c7345bf83c94c13b43dd1f05d9a0515438fb64ca514fdecfbbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae301801bfeb6c7345bf83c94c13b43dd1f05d9a0515438fb64ca514fdecfbbc","first_computed_at":"2026-07-05T02:04:03.896399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:03.896399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXYx3rhGT+8WJAdr99ACOd87zOlCjUuRAkso/CCkn7RpjkWbryU4M6Cd1H7I+sodb/Daos3KMchChlOuaaORBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:03.896867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03294","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cdfabf32aa80cb6918117795240458c53945107101ca9440657d1ac555768fb","sha256:958da71171943d877c6aaac56bcaa081040828dc05de7babd755a198749ac079"],"state_sha256":"47e3afc612d07f38016859231f532e58dc11265be6370ec115d8f97d1fabb738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLfWrp+riIyeg7JhvTTPo1MG2rToN5TbDhBbnLAQ6eJq9wuWKJhWRx90vt9nUlgiM+RQ6y1HbSp3qa189mk9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T11:03:29.463936Z","bundle_sha256":"7f41a85a8ea794f4a5ede65e7f582a4beaac6c9d12ee6b7e8b11ccaa377e2324"}}