{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UKFTMTYMDX6J6OZINEG7TBSFJ6","short_pith_number":"pith:UKFTMTYM","schema_version":"1.0","canonical_sha256":"a28b364f0c1dfc9f3b28690df986454fbbcaf72e5dc85bde8980ba5d5ffa303c","source":{"kind":"arxiv","id":"1901.07535","version":2},"attestation_state":"computed","paper":{"title":"Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"quant-ph","authors_text":"Abhishek Kulkarni, Chaitanya Chinni, Dheeraj M. Pai, Kaushik Mitra, Pradeep Kiran Sarvepalli","submitted_at":"2019-01-21T11:42:04Z","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"},"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":"1901.07535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-21T11:42:04Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"1d3e41a518f2e2828f325431029e64e94ce04158338c089fc1406cc56250ab84","abstract_canon_sha256":"3155db40186c52cd7023605cd1d6ae06bc646835a06b08b7597f3907b2e047e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.041280Z","signature_b64":"vhaTiTYQNH8djEQifOOx8YIlNiTLiJbmzPQRayU1SRPvWtFIGEddxY8l55fmcscjmRaptEweNvDGCyhvCu6pBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a28b364f0c1dfc9f3b28690df986454fbbcaf72e5dc85bde8980ba5d5ffa303c","last_reissued_at":"2026-05-17T23:55:38.040863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.040863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"quant-ph","authors_text":"Abhishek Kulkarni, Chaitanya Chinni, Dheeraj M. Pai, Kaushik Mitra, Pradeep Kiran Sarvepalli","submitted_at":"2019-01-21T11:42:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07535","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":""},"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":"1901.07535","created_at":"2026-05-17T23:55:38.040923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07535v2","created_at":"2026-05-17T23:55:38.040923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07535","created_at":"2026-05-17T23:55:38.040923+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKFTMTYMDX6J","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKFTMTYMDX6J6OZI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKFTMTYM","created_at":"2026-05-18T12:33:30.264802+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/UKFTMTYMDX6J6OZINEG7TBSFJ6","json":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6.json","graph_json":"https://pith.science/api/pith-number/UKFTMTYMDX6J6OZINEG7TBSFJ6/graph.json","events_json":"https://pith.science/api/pith-number/UKFTMTYMDX6J6OZINEG7TBSFJ6/events.json","paper":"https://pith.science/paper/UKFTMTYM"},"agent_actions":{"view_html":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6","download_json":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6.json","view_paper":"https://pith.science/paper/UKFTMTYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/UKFTMTYMDX6J6OZINEG7TBSFJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/UKFTMTYMDX6J6OZINEG7TBSFJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6/action/storage_attestation","attest_author":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6/action/author_attestation","sign_citation":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6/action/citation_signature","submit_replication":"https://pith.science/pith/UKFTMTYMDX6J6OZINEG7TBSFJ6/action/replication_record"}},"created_at":"2026-05-17T23:55:38.040923+00:00","updated_at":"2026-05-17T23:55:38.040923+00:00"}