{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DXU3X5WTJUUAZG5LWEOWTKRYSB","short_pith_number":"pith:DXU3X5WT","canonical_record":{"source":{"id":"2605.23120","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T00:43:13Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"6101d3301e31334ab67e8fb6cf34cdf316e774d5a515b5a42f7dc8f335d1a6da","abstract_canon_sha256":"b83b31be342b718eded25d8be9942171ecf4f1b05ddaf9a8d3e379f49edcd5fb"},"schema_version":"1.0"},"canonical_sha256":"1de9bbf6d34d280c9babb11d69aa38905a7aee4fd057aae62afce68c769c4d52","source":{"kind":"arxiv","id":"2605.23120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23120","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23120v1","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23120","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"DXU3X5WTJUUA","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"DXU3X5WTJUUAZG5L","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"DXU3X5WT","created_at":"2026-05-25T02:01:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DXU3X5WTJUUAZG5LWEOWTKRYSB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23120","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T00:43:13Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"6101d3301e31334ab67e8fb6cf34cdf316e774d5a515b5a42f7dc8f335d1a6da","abstract_canon_sha256":"b83b31be342b718eded25d8be9942171ecf4f1b05ddaf9a8d3e379f49edcd5fb"},"schema_version":"1.0"},"canonical_sha256":"1de9bbf6d34d280c9babb11d69aa38905a7aee4fd057aae62afce68c769c4d52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:39.275184Z","signature_b64":"aeJV5q7XJLC5eIU8dKb5dPCDAeVp1Qxh85mxSwJSxsiW79KBcH3wSZXeBP6y2K+bP04Rn+8ABhOc/JhO3xrCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de9bbf6d34d280c9babb11d69aa38905a7aee4fd057aae62afce68c769c4d52","last_reissued_at":"2026-05-25T02:01:39.274658Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:39.274658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23120","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-25T02:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlB0ruQvZLgDjKbO4Gfg6NcD1gtLkjGihl1nIA/0QbBMJCXNz6P9uMZ3Tg8G7JI+rI07iDsRSRzk4n/b218BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:03:31.773124Z"},"content_sha256":"d400c712b6812c01aecfc72f27a30c7ee711e96cf24a8a9cdb842be0a79e035f","schema_version":"1.0","event_id":"sha256:d400c712b6812c01aecfc72f27a30c7ee711e96cf24a8a9cdb842be0a79e035f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DXU3X5WTJUUAZG5LWEOWTKRYSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Closure of LCD-to-GI Reductions via Generalized Inner Products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Keita Ishizuka","submitted_at":"2026-05-22T00:43:13Z","abstract_excerpt":"The Permutation Equivalence Problem (PEP) for linear codes is a fundamental problem in coding theory and cryptography. A recent reduction shows that PEP for Linear Complementary Dual (LCD) codes reduces to Graph Isomorphism (GI) via orthogonal projectors, but is restricted to codes with trivial hull. We prove that this approach extends to bilinear forms $M = aI + bJ$, and that no other nondegenerate symmetric form yields a valid reduction. A code is reducible if and only if its hull dimension is at most $1$ with an explicit condition on the hull vector; in characteristic $2$, only LCD codes ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23120","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23120/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-25T02:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGmgRLuBcFft7EZqeds5FLrV880W9S3iWbbj2VX3qftiKiKE6WJl1Q9VjneGVX5GtIo95G+MU94hwz39XtaOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:03:31.773918Z"},"content_sha256":"b8ca67096cc67b340d274ea25483744980e96e70631f42a78dfa8f78112cd272","schema_version":"1.0","event_id":"sha256:b8ca67096cc67b340d274ea25483744980e96e70631f42a78dfa8f78112cd272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/bundle.json","state_url":"https://pith.science/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/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-08T02:03:31Z","links":{"resolver":"https://pith.science/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB","bundle":"https://pith.science/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/bundle.json","state":"https://pith.science/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXU3X5WTJUUAZG5LWEOWTKRYSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DXU3X5WTJUUAZG5LWEOWTKRYSB","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":"b83b31be342b718eded25d8be9942171ecf4f1b05ddaf9a8d3e379f49edcd5fb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T00:43:13Z","title_canon_sha256":"6101d3301e31334ab67e8fb6cf34cdf316e774d5a515b5a42f7dc8f335d1a6da"},"schema_version":"1.0","source":{"id":"2605.23120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23120","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23120v1","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23120","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"DXU3X5WTJUUA","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"DXU3X5WTJUUAZG5L","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"DXU3X5WT","created_at":"2026-05-25T02:01:39Z"}],"graph_snapshots":[{"event_id":"sha256:b8ca67096cc67b340d274ea25483744980e96e70631f42a78dfa8f78112cd272","target":"graph","created_at":"2026-05-25T02:01:39Z","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/2605.23120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Permutation Equivalence Problem (PEP) for linear codes is a fundamental problem in coding theory and cryptography. A recent reduction shows that PEP for Linear Complementary Dual (LCD) codes reduces to Graph Isomorphism (GI) via orthogonal projectors, but is restricted to codes with trivial hull. We prove that this approach extends to bilinear forms $M = aI + bJ$, and that no other nondegenerate symmetric form yields a valid reduction. A code is reducible if and only if its hull dimension is at most $1$ with an explicit condition on the hull vector; in characteristic $2$, only LCD codes ar","authors_text":"Keita Ishizuka","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T00:43:13Z","title":"The Closure of LCD-to-GI Reductions via Generalized Inner Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23120","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:d400c712b6812c01aecfc72f27a30c7ee711e96cf24a8a9cdb842be0a79e035f","target":"record","created_at":"2026-05-25T02:01:39Z","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":"b83b31be342b718eded25d8be9942171ecf4f1b05ddaf9a8d3e379f49edcd5fb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T00:43:13Z","title_canon_sha256":"6101d3301e31334ab67e8fb6cf34cdf316e774d5a515b5a42f7dc8f335d1a6da"},"schema_version":"1.0","source":{"id":"2605.23120","kind":"arxiv","version":1}},"canonical_sha256":"1de9bbf6d34d280c9babb11d69aa38905a7aee4fd057aae62afce68c769c4d52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de9bbf6d34d280c9babb11d69aa38905a7aee4fd057aae62afce68c769c4d52","first_computed_at":"2026-05-25T02:01:39.274658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:39.274658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aeJV5q7XJLC5eIU8dKb5dPCDAeVp1Qxh85mxSwJSxsiW79KBcH3wSZXeBP6y2K+bP04Rn+8ABhOc/JhO3xrCDg==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:39.275184Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d400c712b6812c01aecfc72f27a30c7ee711e96cf24a8a9cdb842be0a79e035f","sha256:b8ca67096cc67b340d274ea25483744980e96e70631f42a78dfa8f78112cd272"],"state_sha256":"40ee225dcf54f76bc0dfacd2c8bacfe522cdfaf3d15b066c73effcbf73ddbc18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5DxJ1udpya/uw96dUHi4G51IXnZSpPGIZUn7oUpelcG+iTDzWCoxlGrjPPeh44CDrA9FPbX7vV+1TSZnzHsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:03:31.778689Z","bundle_sha256":"f070f19bcce30009e8b5f27fa05d177ccf393add1cb5e5aff2b8c68a39836795"}}