{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2EMMB7K5NSM7WSAO62PBMDUCL5","short_pith_number":"pith:2EMMB7K5","schema_version":"1.0","canonical_sha256":"d118c0fd5d6c99fb480ef69e160e825f6a74e1b30b7f0dc1bed05c0098c57757","source":{"kind":"arxiv","id":"2404.13202","version":2},"attestation_state":"computed","paper":{"title":"Lattice Surgery for Dummies","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avimita Chatterjee, Subrata Das, Swaroop Ghosh","submitted_at":"2024-04-19T22:20:21Z","abstract_excerpt":"Quantum error correction (QEC) plays a crucial role in correcting noise and paving the way for fault-tolerant quantum computing. This field has seen significant advancements, with new quantum error correction codes emerging regularly to address errors effectively. Among these, topological codes, particularly surface codes, stand out for their low error thresholds and feasibility for implementation in large-scale quantum computers. However, these codes are restricted to encoding a single qubit. Lattice surgery is crucial for enabling interactions among multiple encoded qubits or between the lat"},"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":"2404.13202","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-19T22:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"a5e903e0f72b7bacffa14fe9c49d27699bb91007bd36fd59a73910f615639322","abstract_canon_sha256":"1286e76c679c026080d6384fb0bf85827c9806e4bb2658b0526653d398c358b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:26.141270Z","signature_b64":"H2JWY2d9/gq16YlrNYIFaATHEWZq/hLbbU9T2WhRhkvlg7kZzRqrV2edzSib+iLrq2jkWKEFw9funyFDrUBYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d118c0fd5d6c99fb480ef69e160e825f6a74e1b30b7f0dc1bed05c0098c57757","last_reissued_at":"2026-07-05T10:32:26.140788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:26.140788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Surgery for Dummies","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avimita Chatterjee, Subrata Das, Swaroop Ghosh","submitted_at":"2024-04-19T22:20:21Z","abstract_excerpt":"Quantum error correction (QEC) plays a crucial role in correcting noise and paving the way for fault-tolerant quantum computing. This field has seen significant advancements, with new quantum error correction codes emerging regularly to address errors effectively. Among these, topological codes, particularly surface codes, stand out for their low error thresholds and feasibility for implementation in large-scale quantum computers. However, these codes are restricted to encoding a single qubit. Lattice surgery is crucial for enabling interactions among multiple encoded qubits or between the lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13202","kind":"arxiv","version":2},"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/2404.13202/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":"2404.13202","created_at":"2026-07-05T10:32:26.140849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13202v2","created_at":"2026-07-05T10:32:26.140849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13202","created_at":"2026-07-05T10:32:26.140849+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EMMB7K5NSM7","created_at":"2026-07-05T10:32:26.140849+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EMMB7K5NSM7WSAO","created_at":"2026-07-05T10:32:26.140849+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EMMB7K5","created_at":"2026-07-05T10:32:26.140849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5","json":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5.json","graph_json":"https://pith.science/api/pith-number/2EMMB7K5NSM7WSAO62PBMDUCL5/graph.json","events_json":"https://pith.science/api/pith-number/2EMMB7K5NSM7WSAO62PBMDUCL5/events.json","paper":"https://pith.science/paper/2EMMB7K5"},"agent_actions":{"view_html":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5","download_json":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5.json","view_paper":"https://pith.science/paper/2EMMB7K5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13202&json=true","fetch_graph":"https://pith.science/api/pith-number/2EMMB7K5NSM7WSAO62PBMDUCL5/graph.json","fetch_events":"https://pith.science/api/pith-number/2EMMB7K5NSM7WSAO62PBMDUCL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5/action/storage_attestation","attest_author":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5/action/author_attestation","sign_citation":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5/action/citation_signature","submit_replication":"https://pith.science/pith/2EMMB7K5NSM7WSAO62PBMDUCL5/action/replication_record"}},"created_at":"2026-07-05T10:32:26.140849+00:00","updated_at":"2026-07-05T10:32:26.140849+00:00"}