{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D4HJW6HH6U2GBZW6TBGGZOXO7G","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":"1260ef5e6fe52d373fcb73b3dc507b28a987c9ea55b74055f5f7b2646e50d590","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-10T12:11:25Z","title_canon_sha256":"dfc0a79afdc220ef30be0ed1ea33bf240efbdd4d333d617d336a6b9d2d0f26a7"},"schema_version":"1.0","source":{"id":"2606.11987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11987","created_at":"2026-06-11T01:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11987v1","created_at":"2026-06-11T01:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11987","created_at":"2026-06-11T01:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"D4HJW6HH6U2G","created_at":"2026-06-11T01:10:41Z"},{"alias_kind":"pith_short_16","alias_value":"D4HJW6HH6U2GBZW6","created_at":"2026-06-11T01:10:41Z"},{"alias_kind":"pith_short_8","alias_value":"D4HJW6HH","created_at":"2026-06-11T01:10:41Z"}],"graph_snapshots":[{"event_id":"sha256:a96909cadcfad39b69b5566fd0ff897538ffd3de48a4c765d0a14248f2d9e86e","target":"graph","created_at":"2026-06-11T01:10:41Z","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/2606.11987/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\\mathsf{X}}$ and $H_{\\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\\mathsf{X}}$ and $H_{\\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity o","authors_text":"Kirsten D. Morris, Patricija \\v{S}apokait\\.e, Ragnar Freij-Hollanti","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11987","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:fb391c56a45d36c9a405d876e0c7b016253783d9046856b8afafa15fd2db6a62","target":"record","created_at":"2026-06-11T01:10:41Z","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":"1260ef5e6fe52d373fcb73b3dc507b28a987c9ea55b74055f5f7b2646e50d590","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-10T12:11:25Z","title_canon_sha256":"dfc0a79afdc220ef30be0ed1ea33bf240efbdd4d333d617d336a6b9d2d0f26a7"},"schema_version":"1.0","source":{"id":"2606.11987","kind":"arxiv","version":1}},"canonical_sha256":"1f0e9b78e7f53460e6de984c6cbaeef99884c9a79fb9a1a35aa291a888e81128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f0e9b78e7f53460e6de984c6cbaeef99884c9a79fb9a1a35aa291a888e81128","first_computed_at":"2026-06-11T01:10:41.189761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:41.189761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sasr3OZxzlYHNiy10HKAryJ1iaROveC0kA0oGnZA5P8A29nvKluUPojXz4Z3N+LSpeysSVPRhnIxBORnouLVDw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:41.190634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb391c56a45d36c9a405d876e0c7b016253783d9046856b8afafa15fd2db6a62","sha256:a96909cadcfad39b69b5566fd0ff897538ffd3de48a4c765d0a14248f2d9e86e"],"state_sha256":"867ff2ba2d5435eada129a3d58921c8265d428323a263d7090fb0f454185c8e5"}