{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J5OJWUCDUDKXGM5C6DOO74RXNU","short_pith_number":"pith:J5OJWUCD","schema_version":"1.0","canonical_sha256":"4f5c9b5043a0d57333a2f0dceff2376d2f5771fec800bef415e13c8b09e5d968","source":{"kind":"arxiv","id":"1310.2393","version":4},"attestation_state":"computed","paper":{"title":"A simple decoder for topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James R. Wootton","submitted_at":"2013-10-09T08:41:56Z","abstract_excerpt":"Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both i.i.d. and spatially correlated errors and is found to compare well with existing methods."},"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":"1310.2393","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-09T08:41:56Z","cross_cats_sorted":[],"title_canon_sha256":"6f006e21573fcf2dc467715ce4755771059836adbd4e61f36eacd56836675da5","abstract_canon_sha256":"3dee59fd0323d4b6b84a3b96f0892b3ceeeb191a1e637d666010102c816fb6e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:16.940918Z","signature_b64":"S9OgwLxuxRMJiSdt1EO7ldLe2PWKQy5rIp0p8R5aqldXdfIYgIMgKY4eQBZ2i0yIs4PBF3ieRXGzXMwFRD4BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5c9b5043a0d57333a2f0dceff2376d2f5771fec800bef415e13c8b09e5d968","last_reissued_at":"2026-05-18T02:19:16.940415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:16.940415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple decoder for topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James R. Wootton","submitted_at":"2013-10-09T08:41:56Z","abstract_excerpt":"Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both i.i.d. and spatially correlated errors and is found to compare well with existing methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2393","kind":"arxiv","version":4},"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":"1310.2393","created_at":"2026-05-18T02:19:16.940490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2393v4","created_at":"2026-05-18T02:19:16.940490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2393","created_at":"2026-05-18T02:19:16.940490+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5OJWUCDUDKX","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5OJWUCDUDKXGM5C","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5OJWUCD","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU","json":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU.json","graph_json":"https://pith.science/api/pith-number/J5OJWUCDUDKXGM5C6DOO74RXNU/graph.json","events_json":"https://pith.science/api/pith-number/J5OJWUCDUDKXGM5C6DOO74RXNU/events.json","paper":"https://pith.science/paper/J5OJWUCD"},"agent_actions":{"view_html":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU","download_json":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU.json","view_paper":"https://pith.science/paper/J5OJWUCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2393&json=true","fetch_graph":"https://pith.science/api/pith-number/J5OJWUCDUDKXGM5C6DOO74RXNU/graph.json","fetch_events":"https://pith.science/api/pith-number/J5OJWUCDUDKXGM5C6DOO74RXNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU/action/storage_attestation","attest_author":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU/action/author_attestation","sign_citation":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU/action/citation_signature","submit_replication":"https://pith.science/pith/J5OJWUCDUDKXGM5C6DOO74RXNU/action/replication_record"}},"created_at":"2026-05-18T02:19:16.940490+00:00","updated_at":"2026-05-18T02:19:16.940490+00:00"}