{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X66DVJZMJDHIQHPXDS4A7XICMA","short_pith_number":"pith:X66DVJZM","schema_version":"1.0","canonical_sha256":"bfbc3aa72c48ce881df71cb80fdd026014ed0b4dcc95570d8772d23c98e93b21","source":{"kind":"arxiv","id":"1811.12456","version":3},"attestation_state":"computed","paper":{"title":"Comparing neural network based decoders for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carmen G. Almudever, Koen Bertels, Savvas Varsamopoulos","submitted_at":"2018-11-29T19:57:03Z","abstract_excerpt":"Matching algorithms can be used for identifying errors in quantum systems, being the most famous the Blossom algorithm. Recent works have shown that small distance quantum error correction codes can be efficiently decoded by employing machine learning techniques based on neural networks (NN). Various NN-based decoders have been proposed to enhance the decoding performance and the decoding time. Their implementation differs in how the decoding is performed, at logical or physical level, as well as in several neural network related parameters. In this work, we implement and compare two NN-based "},"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":"1811.12456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-29T19:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"08b4479d8d5c3ffea3b4f25b59e9915b83ad53f05ab06a938c7cb48b5a4f7b9d","abstract_canon_sha256":"7a9fedce336402eeb9d7fd27d0bbccc4e8fd4e82bc40903e2b17b2bc57862b18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:47.882073Z","signature_b64":"uWiTEfBq6/qKNAHBTNYS0ZR/9k5gJcX1kVhJ9jhzRKStSDlBeOqwotFlDYBG9/yqlEhZyG0fMoLenn6acLk9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbc3aa72c48ce881df71cb80fdd026014ed0b4dcc95570d8772d23c98e93b21","last_reissued_at":"2026-07-05T00:21:47.881594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:47.881594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing neural network based decoders for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carmen G. Almudever, Koen Bertels, Savvas Varsamopoulos","submitted_at":"2018-11-29T19:57:03Z","abstract_excerpt":"Matching algorithms can be used for identifying errors in quantum systems, being the most famous the Blossom algorithm. Recent works have shown that small distance quantum error correction codes can be efficiently decoded by employing machine learning techniques based on neural networks (NN). Various NN-based decoders have been proposed to enhance the decoding performance and the decoding time. Their implementation differs in how the decoding is performed, at logical or physical level, as well as in several neural network related parameters. In this work, we implement and compare two NN-based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12456","kind":"arxiv","version":3},"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/1811.12456/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":"1811.12456","created_at":"2026-07-05T00:21:47.881645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12456v3","created_at":"2026-07-05T00:21:47.881645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12456","created_at":"2026-07-05T00:21:47.881645+00:00"},{"alias_kind":"pith_short_12","alias_value":"X66DVJZMJDHI","created_at":"2026-07-05T00:21:47.881645+00:00"},{"alias_kind":"pith_short_16","alias_value":"X66DVJZMJDHIQHPX","created_at":"2026-07-05T00:21:47.881645+00:00"},{"alias_kind":"pith_short_8","alias_value":"X66DVJZM","created_at":"2026-07-05T00:21:47.881645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA","json":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA.json","graph_json":"https://pith.science/api/pith-number/X66DVJZMJDHIQHPXDS4A7XICMA/graph.json","events_json":"https://pith.science/api/pith-number/X66DVJZMJDHIQHPXDS4A7XICMA/events.json","paper":"https://pith.science/paper/X66DVJZM"},"agent_actions":{"view_html":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA","download_json":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA.json","view_paper":"https://pith.science/paper/X66DVJZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12456&json=true","fetch_graph":"https://pith.science/api/pith-number/X66DVJZMJDHIQHPXDS4A7XICMA/graph.json","fetch_events":"https://pith.science/api/pith-number/X66DVJZMJDHIQHPXDS4A7XICMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA/action/storage_attestation","attest_author":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA/action/author_attestation","sign_citation":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA/action/citation_signature","submit_replication":"https://pith.science/pith/X66DVJZMJDHIQHPXDS4A7XICMA/action/replication_record"}},"created_at":"2026-07-05T00:21:47.881645+00:00","updated_at":"2026-07-05T00:21:47.881645+00:00"}