{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5FKDMIGY4CHXCLHUUVMWQY7HZT","short_pith_number":"pith:5FKDMIGY","canonical_record":{"source":{"id":"2407.07689","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-10T14:17:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"343a8434a4c305963ea6f3933730ebcf127dba26bb2a6fc21cfd12f8233f33dc","abstract_canon_sha256":"053468d0e99e9caf871413814023ebcc53b3c0968581aaed3cce92bdc080a4b8"},"schema_version":"1.0"},"canonical_sha256":"e9543620d8e08f712cf4a5596863e7ccf9357bbbefad78f49b63efe23e9ce1c6","source":{"kind":"arxiv","id":"2407.07689","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07689","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07689v5","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07689","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"5FKDMIGY4CHX","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"5FKDMIGY4CHXCLHU","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"5FKDMIGY","created_at":"2026-05-20T00:01:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5FKDMIGY4CHXCLHUUVMWQY7HZT","target":"record","payload":{"canonical_record":{"source":{"id":"2407.07689","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-10T14:17:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"343a8434a4c305963ea6f3933730ebcf127dba26bb2a6fc21cfd12f8233f33dc","abstract_canon_sha256":"053468d0e99e9caf871413814023ebcc53b3c0968581aaed3cce92bdc080a4b8"},"schema_version":"1.0"},"canonical_sha256":"e9543620d8e08f712cf4a5596863e7ccf9357bbbefad78f49b63efe23e9ce1c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:32.362114Z","signature_b64":"iN0YlIs+i/lAfAinJmDBIQStVOxVBIiExlRWWuCD+8zUdDX2Kuf+WJPmaQhFtU1wmX0w5bOpo7IttZEJVUTnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9543620d8e08f712cf4a5596863e7ccf9357bbbefad78f49b63efe23e9ce1c6","last_reissued_at":"2026-05-20T00:01:32.361241Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:32.361241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.07689","source_version":5,"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-20T00:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qI8cleQ0/9S2ElswiPms1q3302fRGRdcboIi//YmnO20SWlBXCxZKpEqLclZe8GMCk4hJK87tt8wGOru+KH1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:58.885225Z"},"content_sha256":"ce1f6b4184c819f1b2ac16e73abdfef5670a96b84f650d17b8723e4b699af279","schema_version":"1.0","event_id":"sha256:ce1f6b4184c819f1b2ac16e73abdfef5670a96b84f650d17b8723e4b699af279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5FKDMIGY4CHXCLHUUVMWQY7HZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary LCD Codes and Their Graph Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Keita Ishizuka","submitted_at":"2024-07-10T14:17:33Z","abstract_excerpt":"We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the intersection array parameters. This necessary and sufficient criterion strengthens the previously known sufficient conditions and unifies the cases of complete, Hamming, Johnson, and Grassmann graphs. As further applications, we prove that non-isomorphic conference graphs with $q \\equiv 1 \\pmod 8$ yield inequivalent codes and we classify all simple graphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07689","kind":"arxiv","version":5},"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/2407.07689/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-05-20T00:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vxalr5BoKGaPOQvN4oS5x/pzadWPdCVSLGSeG08jyTNbfm8nXWV7qrS0rbPK+xiAoYrjVsDSaF54Isu1MQUFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:58.885621Z"},"content_sha256":"2ae74fa95886a9095b2a3edb7f28f19b51776f2216e3590d9e25fca48dd50567","schema_version":"1.0","event_id":"sha256:2ae74fa95886a9095b2a3edb7f28f19b51776f2216e3590d9e25fca48dd50567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/bundle.json","state_url":"https://pith.science/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/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-08T13:40:58Z","links":{"resolver":"https://pith.science/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT","bundle":"https://pith.science/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/bundle.json","state":"https://pith.science/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FKDMIGY4CHXCLHUUVMWQY7HZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5FKDMIGY4CHXCLHUUVMWQY7HZT","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":"053468d0e99e9caf871413814023ebcc53b3c0968581aaed3cce92bdc080a4b8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-10T14:17:33Z","title_canon_sha256":"343a8434a4c305963ea6f3933730ebcf127dba26bb2a6fc21cfd12f8233f33dc"},"schema_version":"1.0","source":{"id":"2407.07689","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07689","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07689v5","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07689","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"5FKDMIGY4CHX","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"5FKDMIGY4CHXCLHU","created_at":"2026-05-20T00:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"5FKDMIGY","created_at":"2026-05-20T00:01:32Z"}],"graph_snapshots":[{"event_id":"sha256:2ae74fa95886a9095b2a3edb7f28f19b51776f2216e3590d9e25fca48dd50567","target":"graph","created_at":"2026-05-20T00:01:32Z","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/2407.07689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the intersection array parameters. This necessary and sufficient criterion strengthens the previously known sufficient conditions and unifies the cases of complete, Hamming, Johnson, and Grassmann graphs. As further applications, we prove that non-isomorphic conference graphs with $q \\equiv 1 \\pmod 8$ yield inequivalent codes and we classify all simple graphs w","authors_text":"Keita Ishizuka","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-10T14:17:33Z","title":"Binary LCD Codes and Their Graph Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07689","kind":"arxiv","version":5},"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:ce1f6b4184c819f1b2ac16e73abdfef5670a96b84f650d17b8723e4b699af279","target":"record","created_at":"2026-05-20T00:01:32Z","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":"053468d0e99e9caf871413814023ebcc53b3c0968581aaed3cce92bdc080a4b8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-10T14:17:33Z","title_canon_sha256":"343a8434a4c305963ea6f3933730ebcf127dba26bb2a6fc21cfd12f8233f33dc"},"schema_version":"1.0","source":{"id":"2407.07689","kind":"arxiv","version":5}},"canonical_sha256":"e9543620d8e08f712cf4a5596863e7ccf9357bbbefad78f49b63efe23e9ce1c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9543620d8e08f712cf4a5596863e7ccf9357bbbefad78f49b63efe23e9ce1c6","first_computed_at":"2026-05-20T00:01:32.361241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:32.361241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iN0YlIs+i/lAfAinJmDBIQStVOxVBIiExlRWWuCD+8zUdDX2Kuf+WJPmaQhFtU1wmX0w5bOpo7IttZEJVUTnBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:32.362114Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.07689","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce1f6b4184c819f1b2ac16e73abdfef5670a96b84f650d17b8723e4b699af279","sha256:2ae74fa95886a9095b2a3edb7f28f19b51776f2216e3590d9e25fca48dd50567"],"state_sha256":"c90e83b4154b89cfe99c1a684537348f246e754700dc8a349d71c3b734880005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hlAwcNSRMN80FGL7blP6LCBKIb3xPoC3L9J3Kdx0SSes23Op+AEQ1Je3kDbFAa9BsA5oTCbqGRW6yNpqn5UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:40:58.887701Z","bundle_sha256":"a3ec75e3f5fcb8deb02a7671a58394a9a278394887abc887896e2d94631cd7b2"}}