{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UQCZPLPZXFWZDUATJKXAHIRPOG","short_pith_number":"pith:UQCZPLPZ","schema_version":"1.0","canonical_sha256":"a40597adf9b96d91d0134aae03a22f7195e1da84ddf031374b098abc56299e60","source":{"kind":"arxiv","id":"2212.11890","version":1},"attestation_state":"computed","paper":{"title":"Decoding surface codes with deep reinforcement learning and probabilistic policy reuse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Elisha Siddiqui Matekole, Esther Ye, Ramya Iyer, Samuel Yen-Chi Chen","submitted_at":"2022-12-22T17:24:32Z","abstract_excerpt":"Quantum computing (QC) promises significant advantages on certain hard computational tasks over classical computers. However, current quantum hardware, also known as noisy intermediate-scale quantum computers (NISQ), are still unable to carry out computations faithfully mainly because of the lack of quantum error correction (QEC) capability. A significant amount of theoretical studies have provided various types of QEC codes; one of the notable topological codes is the surface code, and its features, such as the requirement of only nearest-neighboring two-qubit control gates and a large error "},"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":"2212.11890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-22T17:24:32Z","cross_cats_sorted":["cs.AI","cs.ET","cs.LG","cs.NE"],"title_canon_sha256":"8f3b1b88dd1af56157542766016219193e32bccb89ed3e8ff8c3a47e1d49c3cf","abstract_canon_sha256":"31778468829db251d081eadc365490925187a44d52c7d9a24ad9dbb7db39f9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:44.454185Z","signature_b64":"K6+6InsMZUguKWrZTBEVbsa4JLZaZ8zGg7csRBMSVHVxpB5YAGTmHweAb2avUgUTEn+ZeyKALWsYPBLq7cDRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40597adf9b96d91d0134aae03a22f7195e1da84ddf031374b098abc56299e60","last_reissued_at":"2026-07-05T05:27:44.453747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:44.453747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding surface codes with deep reinforcement learning and probabilistic policy reuse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Elisha Siddiqui Matekole, Esther Ye, Ramya Iyer, Samuel Yen-Chi Chen","submitted_at":"2022-12-22T17:24:32Z","abstract_excerpt":"Quantum computing (QC) promises significant advantages on certain hard computational tasks over classical computers. However, current quantum hardware, also known as noisy intermediate-scale quantum computers (NISQ), are still unable to carry out computations faithfully mainly because of the lack of quantum error correction (QEC) capability. A significant amount of theoretical studies have provided various types of QEC codes; one of the notable topological codes is the surface code, and its features, such as the requirement of only nearest-neighboring two-qubit control gates and a large error "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11890","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/2212.11890/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":"2212.11890","created_at":"2026-07-05T05:27:44.453802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.11890v1","created_at":"2026-07-05T05:27:44.453802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11890","created_at":"2026-07-05T05:27:44.453802+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQCZPLPZXFWZ","created_at":"2026-07-05T05:27:44.453802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQCZPLPZXFWZDUAT","created_at":"2026-07-05T05:27:44.453802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQCZPLPZ","created_at":"2026-07-05T05:27:44.453802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03948","citing_title":"Real-time decoding of quantum error correction codes using high-performance computing","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG","json":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG.json","graph_json":"https://pith.science/api/pith-number/UQCZPLPZXFWZDUATJKXAHIRPOG/graph.json","events_json":"https://pith.science/api/pith-number/UQCZPLPZXFWZDUATJKXAHIRPOG/events.json","paper":"https://pith.science/paper/UQCZPLPZ"},"agent_actions":{"view_html":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG","download_json":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG.json","view_paper":"https://pith.science/paper/UQCZPLPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.11890&json=true","fetch_graph":"https://pith.science/api/pith-number/UQCZPLPZXFWZDUATJKXAHIRPOG/graph.json","fetch_events":"https://pith.science/api/pith-number/UQCZPLPZXFWZDUATJKXAHIRPOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG/action/storage_attestation","attest_author":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG/action/author_attestation","sign_citation":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG/action/citation_signature","submit_replication":"https://pith.science/pith/UQCZPLPZXFWZDUATJKXAHIRPOG/action/replication_record"}},"created_at":"2026-07-05T05:27:44.453802+00:00","updated_at":"2026-07-05T05:27:44.453802+00:00"}