{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KDUFKXWBFXQ7LPISXQU5TJKIET","short_pith_number":"pith:KDUFKXWB","schema_version":"1.0","canonical_sha256":"50e8555ec12de1f5bd12bc29d9a54824e99798ffe6abdeb33e0aefe7caa98ce9","source":{"kind":"arxiv","id":"2209.06841","version":2},"attestation_state":"computed","paper":{"title":"The Future of Quantum Computing with Superconducting Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dario Gil, Jay M. Gambetta, Oliver Dial, Sergey Bravyi, Zaira Nazario","submitted_at":"2022-09-14T18:00:03Z","abstract_excerpt":"For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum al"},"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":"2209.06841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-14T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"5465d22df1db5622d6d9516cb57bfde7bfb89aa66fa9d7ae658cc4bb289d05d6","abstract_canon_sha256":"c0b3f319815659334a49fb048f5af2a9ddb3b0253e9d0338b2c0228a2af63e4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:55.004176Z","signature_b64":"ctFA5qSc6r87GqWO5PVXvGjztmLCoEiaiQAurKbRmbEYLNHJTF2OnwGnVmvQE+7SV4ZhXetk1qKvJBJO/9BIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e8555ec12de1f5bd12bc29d9a54824e99798ffe6abdeb33e0aefe7caa98ce9","last_reissued_at":"2026-07-05T05:19:55.003651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:55.003651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Future of Quantum Computing with Superconducting Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dario Gil, Jay M. Gambetta, Oliver Dial, Sergey Bravyi, Zaira Nazario","submitted_at":"2022-09-14T18:00:03Z","abstract_excerpt":"For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.06841","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/2209.06841/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":"2209.06841","created_at":"2026-07-05T05:19:55.003713+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.06841v2","created_at":"2026-07-05T05:19:55.003713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.06841","created_at":"2026-07-05T05:19:55.003713+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDUFKXWBFXQ7","created_at":"2026-07-05T05:19:55.003713+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDUFKXWBFXQ7LPIS","created_at":"2026-07-05T05:19:55.003713+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDUFKXWB","created_at":"2026-07-05T05:19:55.003713+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET","json":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET.json","graph_json":"https://pith.science/api/pith-number/KDUFKXWBFXQ7LPISXQU5TJKIET/graph.json","events_json":"https://pith.science/api/pith-number/KDUFKXWBFXQ7LPISXQU5TJKIET/events.json","paper":"https://pith.science/paper/KDUFKXWB"},"agent_actions":{"view_html":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET","download_json":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET.json","view_paper":"https://pith.science/paper/KDUFKXWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.06841&json=true","fetch_graph":"https://pith.science/api/pith-number/KDUFKXWBFXQ7LPISXQU5TJKIET/graph.json","fetch_events":"https://pith.science/api/pith-number/KDUFKXWBFXQ7LPISXQU5TJKIET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET/action/storage_attestation","attest_author":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET/action/author_attestation","sign_citation":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET/action/citation_signature","submit_replication":"https://pith.science/pith/KDUFKXWBFXQ7LPISXQU5TJKIET/action/replication_record"}},"created_at":"2026-07-05T05:19:55.003713+00:00","updated_at":"2026-07-05T05:19:55.003713+00:00"}