{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KSUVXGGQYDVICWGYTOXR3FDGFD","short_pith_number":"pith:KSUVXGGQ","schema_version":"1.0","canonical_sha256":"54a95b98d0c0ea8158d89baf1d946628d2a7a8e0565644da7f244545fd41c6e4","source":{"kind":"arxiv","id":"2407.09423","version":1},"attestation_state":"computed","paper":{"title":"SSIP: automated surgery with quantum LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan","submitted_at":"2024-07-12T16:50:01Z","abstract_excerpt":"We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. SSIP is flexible: it is capable of performing both external surgery, that is surgery between two codeblocks, and internal surgery, that is surgery within the same codeblock. Under the hood, it performs linear algebra over $\\mathbb{F}_2$ governed by universal constructions in the category of chain complexes. We demonstrate on quantum Low-Density Parity Check (qLDPC) codes, which are not topological codes in general, and are of interest for near-term f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.09423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-12T16:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"b82c4f271416f00f4cac6504badccbadfb8cb394b2b0c3f370ac77ed5c458a28","abstract_canon_sha256":"0d18136d472a1448da5343b3ca43368b609c16497a484dfc422c615a38fdb3b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:18.899918Z","signature_b64":"+m/idH7jCK1um810hfissgDR2Yj7bKx2Qo3t93seAQHCpFmX4IJF0pLFUG3+Mn7nZkmfcnVpamKC7F4hyehVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54a95b98d0c0ea8158d89baf1d946628d2a7a8e0565644da7f244545fd41c6e4","last_reissued_at":"2026-07-05T08:43:18.899553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:18.899553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SSIP: automated surgery with quantum LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan","submitted_at":"2024-07-12T16:50:01Z","abstract_excerpt":"We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. SSIP is flexible: it is capable of performing both external surgery, that is surgery between two codeblocks, and internal surgery, that is surgery within the same codeblock. Under the hood, it performs linear algebra over $\\mathbb{F}_2$ governed by universal constructions in the category of chain complexes. We demonstrate on quantum Low-Density Parity Check (qLDPC) codes, which are not topological codes in general, and are of interest for near-term f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09423","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/2407.09423/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.09423","created_at":"2026-07-05T08:43:18.899616+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09423v1","created_at":"2026-07-05T08:43:18.899616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09423","created_at":"2026-07-05T08:43:18.899616+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSUVXGGQYDVI","created_at":"2026-07-05T08:43:18.899616+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSUVXGGQYDVICWGY","created_at":"2026-07-05T08:43:18.899616+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSUVXGGQ","created_at":"2026-07-05T08:43:18.899616+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02213","citing_title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2410.11942","citing_title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21746","citing_title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2511.04430","citing_title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04151","citing_title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD","json":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD.json","graph_json":"https://pith.science/api/pith-number/KSUVXGGQYDVICWGYTOXR3FDGFD/graph.json","events_json":"https://pith.science/api/pith-number/KSUVXGGQYDVICWGYTOXR3FDGFD/events.json","paper":"https://pith.science/paper/KSUVXGGQ"},"agent_actions":{"view_html":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD","download_json":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD.json","view_paper":"https://pith.science/paper/KSUVXGGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09423&json=true","fetch_graph":"https://pith.science/api/pith-number/KSUVXGGQYDVICWGYTOXR3FDGFD/graph.json","fetch_events":"https://pith.science/api/pith-number/KSUVXGGQYDVICWGYTOXR3FDGFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD/action/storage_attestation","attest_author":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD/action/author_attestation","sign_citation":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD/action/citation_signature","submit_replication":"https://pith.science/pith/KSUVXGGQYDVICWGYTOXR3FDGFD/action/replication_record"}},"created_at":"2026-07-05T08:43:18.899616+00:00","updated_at":"2026-07-05T08:43:18.899616+00:00"}