{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:66MJUZF6GANVWS5EHFWRMDKPL6","short_pith_number":"pith:66MJUZF6","schema_version":"1.0","canonical_sha256":"f7989a64be301b5b4ba4396d160d4f5fbb4f4d0b8dcceca6cf1fe2ad0d32d832","source":{"kind":"arxiv","id":"1909.06732","version":4},"attestation_state":"computed","paper":{"title":"On maximum-likelihood decoding with circuit-level errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko","submitted_at":"2019-09-15T04:31:50Z","abstract_excerpt":"Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate qua"},"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":"1909.06732","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-09-15T04:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"100d3e3650d9a73a6ae44b2ebb63b5045801b06a0bf716d4c7aed9d777533f3c","abstract_canon_sha256":"a4c72afa20b43d94e4ce55167236f517b115bd12ec0c126248f56cbd9b18874d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:05.506947Z","signature_b64":"1Zf/PgpB11qHCWcy+13GjbrOJ0JHKDwTHKlNLxoznN70+Psvs1y3Y15gvTNACDj1xdN8VSfrJqxQwfQvT6iPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7989a64be301b5b4ba4396d160d4f5fbb4f4d0b8dcceca6cf1fe2ad0d32d832","last_reissued_at":"2026-07-05T01:26:05.506482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:05.506482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximum-likelihood decoding with circuit-level errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko","submitted_at":"2019-09-15T04:31:50Z","abstract_excerpt":"Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06732","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.06732/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":"1909.06732","created_at":"2026-07-05T01:26:05.506552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06732v4","created_at":"2026-07-05T01:26:05.506552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06732","created_at":"2026-07-05T01:26:05.506552+00:00"},{"alias_kind":"pith_short_12","alias_value":"66MJUZF6GANV","created_at":"2026-07-05T01:26:05.506552+00:00"},{"alias_kind":"pith_short_16","alias_value":"66MJUZF6GANVWS5E","created_at":"2026-07-05T01:26:05.506552+00:00"},{"alias_kind":"pith_short_8","alias_value":"66MJUZF6","created_at":"2026-07-05T01:26:05.506552+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15758","citing_title":"A partition function framework for estimating logical error curves in stabilizer codes","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6","json":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6.json","graph_json":"https://pith.science/api/pith-number/66MJUZF6GANVWS5EHFWRMDKPL6/graph.json","events_json":"https://pith.science/api/pith-number/66MJUZF6GANVWS5EHFWRMDKPL6/events.json","paper":"https://pith.science/paper/66MJUZF6"},"agent_actions":{"view_html":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6","download_json":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6.json","view_paper":"https://pith.science/paper/66MJUZF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06732&json=true","fetch_graph":"https://pith.science/api/pith-number/66MJUZF6GANVWS5EHFWRMDKPL6/graph.json","fetch_events":"https://pith.science/api/pith-number/66MJUZF6GANVWS5EHFWRMDKPL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6/action/storage_attestation","attest_author":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6/action/author_attestation","sign_citation":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6/action/citation_signature","submit_replication":"https://pith.science/pith/66MJUZF6GANVWS5EHFWRMDKPL6/action/replication_record"}},"created_at":"2026-07-05T01:26:05.506552+00:00","updated_at":"2026-07-05T01:26:05.506552+00:00"}