{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SXOYBEDMFLSR6MTP77M4GC2XQE","short_pith_number":"pith:SXOYBEDM","canonical_record":{"source":{"id":"2508.09082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-12T17:03:59Z","cross_cats_sorted":["cs.DM","math.IT","quant-ph"],"title_canon_sha256":"e9dbb66389aa56bef90db4439d26387e81f81ac85f8f36fa1953f8226b86b29a","abstract_canon_sha256":"4706f06c84e62ef71686180a8bf3089d216f3f58bc1c3e4bad579367bc42353e"},"schema_version":"1.0"},"canonical_sha256":"95dd80906c2ae51f326fffd9c30b57813976ddcfb0729cdb9e0592a9ba6ce516","source":{"kind":"arxiv","id":"2508.09082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09082","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09082v1","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09082","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"SXOYBEDMFLSR","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"SXOYBEDMFLSR6MTP","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"SXOYBEDM","created_at":"2026-07-05T11:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SXOYBEDMFLSR6MTP77M4GC2XQE","target":"record","payload":{"canonical_record":{"source":{"id":"2508.09082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-12T17:03:59Z","cross_cats_sorted":["cs.DM","math.IT","quant-ph"],"title_canon_sha256":"e9dbb66389aa56bef90db4439d26387e81f81ac85f8f36fa1953f8226b86b29a","abstract_canon_sha256":"4706f06c84e62ef71686180a8bf3089d216f3f58bc1c3e4bad579367bc42353e"},"schema_version":"1.0"},"canonical_sha256":"95dd80906c2ae51f326fffd9c30b57813976ddcfb0729cdb9e0592a9ba6ce516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:39.482193Z","signature_b64":"CQfBXfUVLyVwQmzUEicGs2s0gFP6QiaKc4H11yhuQT6kA7nJrKm31yTBIAvl2ejfcEBEa3YIZAgBIWkL+ONFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95dd80906c2ae51f326fffd9c30b57813976ddcfb0729cdb9e0592a9ba6ce516","last_reissued_at":"2026-07-05T11:52:39.481694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:39.481694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.09082","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-07-05T11:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d34N9Sku3MVWnWp3QckvdXGzZ2gIMcznX6IL7pE15U59yRWowbV+5LcWp8+WMUYpJ40gIM5/9m8t/DWSRCVuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:45:43.025746Z"},"content_sha256":"e9d90bdeec33628c325b6c92fe1266873f34d6b65313332479829dc9028adeab","schema_version":"1.0","event_id":"sha256:e9d90bdeec33628c325b6c92fe1266873f34d6b65313332479829dc9028adeab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SXOYBEDMFLSR6MTP77M4GC2XQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Arun John Moncy, Josu Etxezarreta Martinez, Olatz Sanz Larrarte, Pedro M. Crespo, Reza Dastbasteh, Ruben M. Otxoa","submitted_at":"2025-08-12T17:03:59Z","abstract_excerpt":"We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are then applied to illustrate the existence and analyze two highly degenerate GB code families with parameters $[[d^2+1,2,d]]$ for odd $d \\geq 3$ and $[[d^2,2,d]]$ for even $d \\geq 4$, both having the property that each check qubit is connected to exactly four data qubits similar to surface codes. For the odd-distance family, we analyze the structure of low-wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09082","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/2508.09082/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-07-05T11:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+3iiU2zZWn++DvTn70apWBiKWW5xax6cP/ZBVsrHuA/hOmX0s/q+1BIzRmrsqPLq+pBiH9bkv7jhEX6nThPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:45:43.026140Z"},"content_sha256":"916a782cef1bff3511fe3ba5421a8ba362b07342ba13fda3c0b34b95cb541fc6","schema_version":"1.0","event_id":"sha256:916a782cef1bff3511fe3ba5421a8ba362b07342ba13fda3c0b34b95cb541fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/bundle.json","state_url":"https://pith.science/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/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-08-07T04:45:43Z","links":{"resolver":"https://pith.science/pith/SXOYBEDMFLSR6MTP77M4GC2XQE","bundle":"https://pith.science/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/bundle.json","state":"https://pith.science/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXOYBEDMFLSR6MTP77M4GC2XQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SXOYBEDMFLSR6MTP77M4GC2XQE","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":"4706f06c84e62ef71686180a8bf3089d216f3f58bc1c3e4bad579367bc42353e","cross_cats_sorted":["cs.DM","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-12T17:03:59Z","title_canon_sha256":"e9dbb66389aa56bef90db4439d26387e81f81ac85f8f36fa1953f8226b86b29a"},"schema_version":"1.0","source":{"id":"2508.09082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09082","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09082v1","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09082","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"SXOYBEDMFLSR","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"SXOYBEDMFLSR6MTP","created_at":"2026-07-05T11:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"SXOYBEDM","created_at":"2026-07-05T11:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:916a782cef1bff3511fe3ba5421a8ba362b07342ba13fda3c0b34b95cb541fc6","target":"graph","created_at":"2026-07-05T11:52: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/2508.09082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are then applied to illustrate the existence and analyze two highly degenerate GB code families with parameters $[[d^2+1,2,d]]$ for odd $d \\geq 3$ and $[[d^2,2,d]]$ for even $d \\geq 4$, both having the property that each check qubit is connected to exactly four data qubits similar to surface codes. For the odd-distance family, we analyze the structure of low-wei","authors_text":"Arun John Moncy, Josu Etxezarreta Martinez, Olatz Sanz Larrarte, Pedro M. Crespo, Reza Dastbasteh, Ruben M. Otxoa","cross_cats":["cs.DM","math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09082","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:e9d90bdeec33628c325b6c92fe1266873f34d6b65313332479829dc9028adeab","target":"record","created_at":"2026-07-05T11:52: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":"4706f06c84e62ef71686180a8bf3089d216f3f58bc1c3e4bad579367bc42353e","cross_cats_sorted":["cs.DM","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-12T17:03:59Z","title_canon_sha256":"e9dbb66389aa56bef90db4439d26387e81f81ac85f8f36fa1953f8226b86b29a"},"schema_version":"1.0","source":{"id":"2508.09082","kind":"arxiv","version":1}},"canonical_sha256":"95dd80906c2ae51f326fffd9c30b57813976ddcfb0729cdb9e0592a9ba6ce516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95dd80906c2ae51f326fffd9c30b57813976ddcfb0729cdb9e0592a9ba6ce516","first_computed_at":"2026-07-05T11:52:39.481694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:39.481694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CQfBXfUVLyVwQmzUEicGs2s0gFP6QiaKc4H11yhuQT6kA7nJrKm31yTBIAvl2ejfcEBEa3YIZAgBIWkL+ONFCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:39.482193Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.09082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9d90bdeec33628c325b6c92fe1266873f34d6b65313332479829dc9028adeab","sha256:916a782cef1bff3511fe3ba5421a8ba362b07342ba13fda3c0b34b95cb541fc6"],"state_sha256":"8516d8cacdb7527c1acb623c6c8e394a00e9a2003362d1e8c0099693bf89ce1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrTkreQ4yGXg/8axkwwliXXPwmIuQg4pqM5mfKA9hmdxnvIjWS0wx6VSjmMx7UfgAm2NQ8xWQmJlUJLsJQmrCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:45:43.029231Z","bundle_sha256":"a81472722ad209bac7a07f9e36cee88c43e1d774a6b8cb3744f04ddfd873ad5c"}}