{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:K2LCXDCIEX2CKURDF5PMAC74UG","short_pith_number":"pith:K2LCXDCI","canonical_record":{"source":{"id":"2307.03283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T20:38:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ffed7fec326582c914c816491c2da2f69f3de9562c7763476c44678d593c91e8","abstract_canon_sha256":"990bd7d696fbdf7b112c9e55ac4735a823bb6257bd662c06436aa6ddc48335a3"},"schema_version":"1.0"},"canonical_sha256":"56962b8c4825f42552232f5ec00bfca19fa00cd22a170771783e97332337dc74","source":{"kind":"arxiv","id":"2307.03283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03283","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03283v1","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03283","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"K2LCXDCIEX2C","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_16","alias_value":"K2LCXDCIEX2CKURD","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_8","alias_value":"K2LCXDCI","created_at":"2026-07-05T06:28:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:K2LCXDCIEX2CKURDF5PMAC74UG","target":"record","payload":{"canonical_record":{"source":{"id":"2307.03283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T20:38:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ffed7fec326582c914c816491c2da2f69f3de9562c7763476c44678d593c91e8","abstract_canon_sha256":"990bd7d696fbdf7b112c9e55ac4735a823bb6257bd662c06436aa6ddc48335a3"},"schema_version":"1.0"},"canonical_sha256":"56962b8c4825f42552232f5ec00bfca19fa00cd22a170771783e97332337dc74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:40.369506Z","signature_b64":"BLKQoJJ4MUhwk2OhOXBYAy7A6pLTg8HPrZEJu9Wywgpv+h4aEwN4C7ArLL53megArgMoSbeHHGUekqapY/gCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56962b8c4825f42552232f5ec00bfca19fa00cd22a170771783e97332337dc74","last_reissued_at":"2026-07-05T06:28:40.369079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:40.369079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.03283","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-05T06:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycxgiztUN1wwDLascdJI1STZCJGjaMvSjgHqvaCa41HqMECoKSD/IF9dWq1EuCwgs38tQoVAC6ZVmUZKG2AkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:49:12.422304Z"},"content_sha256":"2637d0192376cffca942255582b23089f261643c15f4a18cf4a879db053fa218","schema_version":"1.0","event_id":"sha256:2637d0192376cffca942255582b23089f261643c15f4a18cf4a879db053fa218"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:K2LCXDCIEX2CKURDF5PMAC74UG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved rate-distance trade-offs for quantum codes with restricted connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anirudh Krishna, Nou\\'edyn Baspin, Ray Li, Venkatesan Guruswami","submitted_at":"2023-07-06T20:38:34Z","abstract_excerpt":"For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi & Terhal (BT) and Bravyi, Poulin & Terhal (BPT) established that geometric locality constrains code properties -- for instance $[[n,k,d]]$ quantum codes defined by local checks on the $D$-dimensional lattice must obey $k d^{2/(D-1)} \\le O(n)$. Baspin and Krishna studied the more general question of how the connectivity graph associated with a quantum code constrains the code parameters. These trade-offs apply to a ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03283","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/2307.03283/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-05T06:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXrseQKtVDMIIdLlBVCgszJYhFuXUCwxygkhTGZwzxcfX7K1Yj2vQJfhzspReE8bEuDp0BGJImpX30oJnbPfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:49:12.422890Z"},"content_sha256":"bc4e861de8f3ada200ad37eea6e51e0930d3a93a5d5c108c076249b1ebd4d03e","schema_version":"1.0","event_id":"sha256:bc4e861de8f3ada200ad37eea6e51e0930d3a93a5d5c108c076249b1ebd4d03e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2LCXDCIEX2CKURDF5PMAC74UG/bundle.json","state_url":"https://pith.science/pith/K2LCXDCIEX2CKURDF5PMAC74UG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2LCXDCIEX2CKURDF5PMAC74UG/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-05T08:49:12Z","links":{"resolver":"https://pith.science/pith/K2LCXDCIEX2CKURDF5PMAC74UG","bundle":"https://pith.science/pith/K2LCXDCIEX2CKURDF5PMAC74UG/bundle.json","state":"https://pith.science/pith/K2LCXDCIEX2CKURDF5PMAC74UG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2LCXDCIEX2CKURDF5PMAC74UG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:K2LCXDCIEX2CKURDF5PMAC74UG","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":"990bd7d696fbdf7b112c9e55ac4735a823bb6257bd662c06436aa6ddc48335a3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T20:38:34Z","title_canon_sha256":"ffed7fec326582c914c816491c2da2f69f3de9562c7763476c44678d593c91e8"},"schema_version":"1.0","source":{"id":"2307.03283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03283","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03283v1","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03283","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"K2LCXDCIEX2C","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_16","alias_value":"K2LCXDCIEX2CKURD","created_at":"2026-07-05T06:28:40Z"},{"alias_kind":"pith_short_8","alias_value":"K2LCXDCI","created_at":"2026-07-05T06:28:40Z"}],"graph_snapshots":[{"event_id":"sha256:bc4e861de8f3ada200ad37eea6e51e0930d3a93a5d5c108c076249b1ebd4d03e","target":"graph","created_at":"2026-07-05T06:28:40Z","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/2307.03283/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi & Terhal (BT) and Bravyi, Poulin & Terhal (BPT) established that geometric locality constrains code properties -- for instance $[[n,k,d]]$ quantum codes defined by local checks on the $D$-dimensional lattice must obey $k d^{2/(D-1)} \\le O(n)$. Baspin and Krishna studied the more general question of how the connectivity graph associated with a quantum code constrains the code parameters. These trade-offs apply to a ri","authors_text":"Anirudh Krishna, Nou\\'edyn Baspin, Ray Li, Venkatesan Guruswami","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T20:38:34Z","title":"Improved rate-distance trade-offs for quantum codes with restricted connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03283","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:2637d0192376cffca942255582b23089f261643c15f4a18cf4a879db053fa218","target":"record","created_at":"2026-07-05T06:28:40Z","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":"990bd7d696fbdf7b112c9e55ac4735a823bb6257bd662c06436aa6ddc48335a3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T20:38:34Z","title_canon_sha256":"ffed7fec326582c914c816491c2da2f69f3de9562c7763476c44678d593c91e8"},"schema_version":"1.0","source":{"id":"2307.03283","kind":"arxiv","version":1}},"canonical_sha256":"56962b8c4825f42552232f5ec00bfca19fa00cd22a170771783e97332337dc74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56962b8c4825f42552232f5ec00bfca19fa00cd22a170771783e97332337dc74","first_computed_at":"2026-07-05T06:28:40.369079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:28:40.369079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BLKQoJJ4MUhwk2OhOXBYAy7A6pLTg8HPrZEJu9Wywgpv+h4aEwN4C7ArLL53megArgMoSbeHHGUekqapY/gCAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:28:40.369506Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.03283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2637d0192376cffca942255582b23089f261643c15f4a18cf4a879db053fa218","sha256:bc4e861de8f3ada200ad37eea6e51e0930d3a93a5d5c108c076249b1ebd4d03e"],"state_sha256":"9c13864386207be5fb384f18e3150f59bbd9968c8b4074c352569a0f09e37e88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4bLZAmkUMTIQo+DcE0cWvShlQDZ1e0hWm48w274Rk56vC3X1PZ6z+o6wN7oeDk/diGmsX7rJhRsjauwtlaqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:49:12.430288Z","bundle_sha256":"31bf6cebf2fd85f2cfbded848d02c9856d4d34857c5a05d97f72aafdddfce770"}}