{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S3JCHREY7TIALNJTA4MVQZNYQW","short_pith_number":"pith:S3JCHREY","schema_version":"1.0","canonical_sha256":"96d223c498fcd005b53307195865b885850a2d87c6e90dfeb8361ea3ba988f03","source":{"kind":"arxiv","id":"2601.20600","version":2},"attestation_state":"computed","paper":{"title":"Shortest LCD embeddings of binary, ternary and quaternary linear codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haeun Lim, Ji-Hoon Hong, Jon-Lark Kim, Junmin An","submitted_at":"2026-01-28T13:38:17Z","abstract_excerpt":"In the recent years, there has been active research on self-orthogonal embeddings of linear codes since they yielded some optimal self-orthogonal codes. LCD codes have a trivial hull so they are counterparts of self-orthogonal codes. So it is a natural question whether one can embed linear codes into optimal LCD codes. To answer it, we first determine the number of columns to be added to a generator matrix of a linear code in order to embed the given code into an LCD code. Then we characterize all possible forms of shortest LCD embeddings of a linear code. As examples, we start from binary and"},"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":"2601.20600","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-28T13:38:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"537fff4aac1b51b65a0f094614a8a4f30b18ff02ca89b7bc6b84877b3286732b","abstract_canon_sha256":"9c941f3d703f9dc5195411769994531c10f4a7f9bc36370874ab0b13180f74a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:18.301697Z","signature_b64":"qenTAQSStgNEQ6yrFkK77YX5PVWHOWzejeR5GFIc8iQSEHf57ZBJMuY12cEtHl6QSrfxiIB7aMzi18hB3s8UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96d223c498fcd005b53307195865b885850a2d87c6e90dfeb8361ea3ba988f03","last_reissued_at":"2026-06-09T02:07:18.300707Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:18.300707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest LCD embeddings of binary, ternary and quaternary linear codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haeun Lim, Ji-Hoon Hong, Jon-Lark Kim, Junmin An","submitted_at":"2026-01-28T13:38:17Z","abstract_excerpt":"In the recent years, there has been active research on self-orthogonal embeddings of linear codes since they yielded some optimal self-orthogonal codes. LCD codes have a trivial hull so they are counterparts of self-orthogonal codes. So it is a natural question whether one can embed linear codes into optimal LCD codes. To answer it, we first determine the number of columns to be added to a generator matrix of a linear code in order to embed the given code into an LCD code. Then we characterize all possible forms of shortest LCD embeddings of a linear code. As examples, we start from binary and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20600","kind":"arxiv","version":2},"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/2601.20600/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.20600","created_at":"2026-06-09T02:07:18.300855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.20600v2","created_at":"2026-06-09T02:07:18.300855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20600","created_at":"2026-06-09T02:07:18.300855+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3JCHREY7TIA","created_at":"2026-06-09T02:07:18.300855+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3JCHREY7TIALNJT","created_at":"2026-06-09T02:07:18.300855+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3JCHREY","created_at":"2026-06-09T02:07:18.300855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.08843","citing_title":"Shortest Embeddings of Linear Codes with Arbitrary Hull Dimension","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW","json":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW.json","graph_json":"https://pith.science/api/pith-number/S3JCHREY7TIALNJTA4MVQZNYQW/graph.json","events_json":"https://pith.science/api/pith-number/S3JCHREY7TIALNJTA4MVQZNYQW/events.json","paper":"https://pith.science/paper/S3JCHREY"},"agent_actions":{"view_html":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW","download_json":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW.json","view_paper":"https://pith.science/paper/S3JCHREY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.20600&json=true","fetch_graph":"https://pith.science/api/pith-number/S3JCHREY7TIALNJTA4MVQZNYQW/graph.json","fetch_events":"https://pith.science/api/pith-number/S3JCHREY7TIALNJTA4MVQZNYQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW/action/storage_attestation","attest_author":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW/action/author_attestation","sign_citation":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW/action/citation_signature","submit_replication":"https://pith.science/pith/S3JCHREY7TIALNJTA4MVQZNYQW/action/replication_record"}},"created_at":"2026-06-09T02:07:18.300855+00:00","updated_at":"2026-06-09T02:07:18.300855+00:00"}