{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5GKG7KGP74JRRV2YUIYLJ5GEGI","short_pith_number":"pith:5GKG7KGP","canonical_record":{"source":{"id":"1506.01955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5587c5f9e61e67dc558a96058450c54e865ac3db66205524738fbcd6feb688c","abstract_canon_sha256":"eee77e861e3e6d01d57751d186a427a30057e39c64bcd2c7ccd52d9f24937282"},"schema_version":"1.0"},"canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","source":{"kind":"arxiv","id":"1506.01955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01955","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01955v1","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01955","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"5GKG7KGP74JR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5GKG7KGP74JRRV2Y","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5GKG7KGP","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5GKG7KGP74JRRV2YUIYLJ5GEGI","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5587c5f9e61e67dc558a96058450c54e865ac3db66205524738fbcd6feb688c","abstract_canon_sha256":"eee77e861e3e6d01d57751d186a427a30057e39c64bcd2c7ccd52d9f24937282"},"schema_version":"1.0"},"canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:58.821801Z","signature_b64":"jd8rtz/OwnS9fAPK2dcAK0EwdwjzryaN93fw2m18GO9ap/KAZzyYIffErP8OpzpiFOdX9zEhUpFvUQs4uyI3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","last_reissued_at":"2026-05-18T01:55:58.821025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:58.821025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01955","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-18T01:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHBbj4gpX6jDtPH+igwOodrzWffDfXeJRCtSn7IgWSqvC61IiX8921WFrL73rmiote7uwCe3aPWzamNdVHNzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:35.551755Z"},"content_sha256":"8eed1aa7c2d5b9b51ac5bbb7ccb008f029082d38eda400beb048d22a7fc6933e","schema_version":"1.0","event_id":"sha256:8eed1aa7c2d5b9b51ac5bbb7ccb008f029082d38eda400beb048d22a7fc6933e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5GKG7KGP74JRRV2YUIYLJ5GEGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket Ozkaya, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Steven T. Dougherty","submitted_at":"2015-06-05T16:07:00Z","abstract_excerpt":"Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01955","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-18T01:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPM+4HwETS/m4i+e3vG8ozmt52mV4f8K+Uy6AE6QsWP3M+qh+lpcbY3qY2HY9TLUlpvsAXPSuBmO9w9DebeLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:35.552423Z"},"content_sha256":"c40a251c4b4bb356310c0639ee54ae3da6636c7747f12aa4a86b7baa844fda8f","schema_version":"1.0","event_id":"sha256:c40a251c4b4bb356310c0639ee54ae3da6636c7747f12aa4a86b7baa844fda8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/bundle.json","state_url":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/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-29T17:53:35Z","links":{"resolver":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI","bundle":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/bundle.json","state":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5GKG7KGP74JRRV2YUIYLJ5GEGI","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":"eee77e861e3e6d01d57751d186a427a30057e39c64bcd2c7ccd52d9f24937282","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","title_canon_sha256":"d5587c5f9e61e67dc558a96058450c54e865ac3db66205524738fbcd6feb688c"},"schema_version":"1.0","source":{"id":"1506.01955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01955","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01955v1","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01955","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"5GKG7KGP74JR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5GKG7KGP74JRRV2Y","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5GKG7KGP","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c40a251c4b4bb356310c0639ee54ae3da6636c7747f12aa4a86b7baa844fda8f","target":"graph","created_at":"2026-05-18T01:55:58Z","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":"Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters.","authors_text":"Buket Ozkaya, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Steven T. Dougherty","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","title":"The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01955","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:8eed1aa7c2d5b9b51ac5bbb7ccb008f029082d38eda400beb048d22a7fc6933e","target":"record","created_at":"2026-05-18T01:55:58Z","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":"eee77e861e3e6d01d57751d186a427a30057e39c64bcd2c7ccd52d9f24937282","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","title_canon_sha256":"d5587c5f9e61e67dc558a96058450c54e865ac3db66205524738fbcd6feb688c"},"schema_version":"1.0","source":{"id":"1506.01955","kind":"arxiv","version":1}},"canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","first_computed_at":"2026-05-18T01:55:58.821025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:58.821025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jd8rtz/OwnS9fAPK2dcAK0EwdwjzryaN93fw2m18GO9ap/KAZzyYIffErP8OpzpiFOdX9zEhUpFvUQs4uyI3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:58.821801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eed1aa7c2d5b9b51ac5bbb7ccb008f029082d38eda400beb048d22a7fc6933e","sha256:c40a251c4b4bb356310c0639ee54ae3da6636c7747f12aa4a86b7baa844fda8f"],"state_sha256":"8861728509bf49a87cb00662f075968b1b14911703930fb8e9952a478f484694"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftjdPVt34vjFqhNjJkTpBj/8VUGUHg/PP8Fkp+iCr0uzu4mH49c9dKzqSg3zBgoDTYVERhf4E6joYyMgzuJvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:53:35.555865Z","bundle_sha256":"064b7ec91ef633b01d41ace09031609d94e6bafd92ec6acdc7d0f2ec91a66eb3"}}