{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UKFTMTYMDX6J6OZINEG7TBSFJ6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3155db40186c52cd7023605cd1d6ae06bc646835a06b08b7597f3907b2e047e0","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-21T11:42:04Z","title_canon_sha256":"1d3e41a518f2e2828f325431029e64e94ce04158338c089fc1406cc56250ab84"},"schema_version":"1.0","source":{"id":"1901.07535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07535","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07535v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07535","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"UKFTMTYMDX6J","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UKFTMTYMDX6J6OZI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UKFTMTYM","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:6bd8a5c6b5ddf523ede15eeb482c556249c0dc82ad918224ca8bb78074290087","target":"graph","created_at":"2026-05-17T23:55:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recent developments in the field of deep learning have motivated many researchers to apply these methods to problems in quantum information. Torlai and Melko first proposed a decoder for surface codes based on neural networks. Since then, many other researchers have applied neural networks to study a variety of problems in the context of decoding. An important development in this regard was due to Varsamopoulos et al. who proposed a two-step decoder using neural networks. Subsequent work of Maskara et al. used the same concept for decoding for various noise models. We propose a similar two-ste","authors_text":"Abhishek Kulkarni, Chaitanya Chinni, Dheeraj M. Pai, Kaushik Mitra, Pradeep Kiran Sarvepalli","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-21T11:42:04Z","title":"Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07535","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:39640198f962ce72d1b6400184a0112c5b67a4b8851ecc721c354a3c43eac264","target":"record","created_at":"2026-05-17T23:55:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3155db40186c52cd7023605cd1d6ae06bc646835a06b08b7597f3907b2e047e0","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-21T11:42:04Z","title_canon_sha256":"1d3e41a518f2e2828f325431029e64e94ce04158338c089fc1406cc56250ab84"},"schema_version":"1.0","source":{"id":"1901.07535","kind":"arxiv","version":2}},"canonical_sha256":"a28b364f0c1dfc9f3b28690df986454fbbcaf72e5dc85bde8980ba5d5ffa303c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a28b364f0c1dfc9f3b28690df986454fbbcaf72e5dc85bde8980ba5d5ffa303c","first_computed_at":"2026-05-17T23:55:38.040863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:38.040863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhaTiTYQNH8djEQifOOx8YIlNiTLiJbmzPQRayU1SRPvWtFIGEddxY8l55fmcscjmRaptEweNvDGCyhvCu6pBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:38.041280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39640198f962ce72d1b6400184a0112c5b67a4b8851ecc721c354a3c43eac264","sha256:6bd8a5c6b5ddf523ede15eeb482c556249c0dc82ad918224ca8bb78074290087"],"state_sha256":"968e2084877593970b245c1d61b6c73a3eb934514dc7c800f800b075259b88ff"}