{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XFUNGVWYVLTAVD4PC6KJUQJIAH","short_pith_number":"pith:XFUNGVWY","schema_version":"1.0","canonical_sha256":"b968d356d8aae60a8f8f17949a412801f5ca18eae047b8959f621bd51d283495","source":{"kind":"arxiv","id":"2103.14209","version":1},"attestation_state":"computed","paper":{"title":"QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder for Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masaaki Kondo, Masamitsu Tanaka, Yasunari Suzuki, Yosuke Ueno, Yutaka Tabuchi","submitted_at":"2021-03-26T01:51:15Z","abstract_excerpt":"Due to the low error tolerance of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing. Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods. % One of the challenges of QEC is its high complexity and computational demand. QEC needs to be very power-efficient since the power budget is limited inside of a dilution refrigerator for superconducting qubits by which one of the most successful quantum computers (QCs) is built. In this paper, we propose an online-QEC algorithm and its ha"},"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":"2103.14209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-26T01:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"783f1f5117a9522b38ffa649c9fccb24097096310cac8b78944ad5fc495ab71e","abstract_canon_sha256":"cd509478d0e3ceba5bfa92b72a1728d00d9596c256da3a7c09c78bb6fd377fe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:55.088390Z","signature_b64":"9hXAdJ5LTILqnjBYydVBtxMIJaVITlCZD95KV/FkzbzDFtc9qAOJIuSrlV+6pkadPA3z3dtbJe1vvdgy5aQcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b968d356d8aae60a8f8f17949a412801f5ca18eae047b8959f621bd51d283495","last_reissued_at":"2026-07-05T04:47:55.087910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:55.087910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder for Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masaaki Kondo, Masamitsu Tanaka, Yasunari Suzuki, Yosuke Ueno, Yutaka Tabuchi","submitted_at":"2021-03-26T01:51:15Z","abstract_excerpt":"Due to the low error tolerance of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing. Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods. % One of the challenges of QEC is its high complexity and computational demand. QEC needs to be very power-efficient since the power budget is limited inside of a dilution refrigerator for superconducting qubits by which one of the most successful quantum computers (QCs) is built. In this paper, we propose an online-QEC algorithm and its ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14209","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/2103.14209/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":"2103.14209","created_at":"2026-07-05T04:47:55.087967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.14209v1","created_at":"2026-07-05T04:47:55.087967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14209","created_at":"2026-07-05T04:47:55.087967+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFUNGVWYVLTA","created_at":"2026-07-05T04:47:55.087967+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFUNGVWYVLTAVD4P","created_at":"2026-07-05T04:47:55.087967+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFUNGVWY","created_at":"2026-07-05T04:47:55.087967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH","json":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH.json","graph_json":"https://pith.science/api/pith-number/XFUNGVWYVLTAVD4PC6KJUQJIAH/graph.json","events_json":"https://pith.science/api/pith-number/XFUNGVWYVLTAVD4PC6KJUQJIAH/events.json","paper":"https://pith.science/paper/XFUNGVWY"},"agent_actions":{"view_html":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH","download_json":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH.json","view_paper":"https://pith.science/paper/XFUNGVWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.14209&json=true","fetch_graph":"https://pith.science/api/pith-number/XFUNGVWYVLTAVD4PC6KJUQJIAH/graph.json","fetch_events":"https://pith.science/api/pith-number/XFUNGVWYVLTAVD4PC6KJUQJIAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH/action/storage_attestation","attest_author":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH/action/author_attestation","sign_citation":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH/action/citation_signature","submit_replication":"https://pith.science/pith/XFUNGVWYVLTAVD4PC6KJUQJIAH/action/replication_record"}},"created_at":"2026-07-05T04:47:55.087967+00:00","updated_at":"2026-07-05T04:47:55.087967+00:00"}