{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:STT3ZGSBAWPNYLUYOUNWWSL5P3","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":"ba628e5fbeb9ef798c796ce5fab3ac623aa88cdcd469138988d5708d5a8f412c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-01-31T22:19:49Z","title_canon_sha256":"736bbbbe0eed440914d85b03e58a3e42f2fb475a3be1d5e9f63fffff76fb619a"},"schema_version":"1.0","source":{"id":"2202.00119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.00119","created_at":"2026-07-05T07:55:55Z"},{"alias_kind":"arxiv_version","alias_value":"2202.00119v2","created_at":"2026-07-05T07:55:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00119","created_at":"2026-07-05T07:55:55Z"},{"alias_kind":"pith_short_12","alias_value":"STT3ZGSBAWPN","created_at":"2026-07-05T07:55:55Z"},{"alias_kind":"pith_short_16","alias_value":"STT3ZGSBAWPNYLUY","created_at":"2026-07-05T07:55:55Z"},{"alias_kind":"pith_short_8","alias_value":"STT3ZGSB","created_at":"2026-07-05T07:55:55Z"}],"graph_snapshots":[{"event_id":"sha256:7242331c5d863fd3bbb1373249093e68e9f1b7af50c98aa021a92febed8390e0","target":"graph","created_at":"2026-07-05T07:55:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.00119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a constant level. A recent work by Fawzi, Grospellier and Leverrier (FOCS 2018) building on a result by Gottesman (QIC 2013) has shown that the space overhead can be asymptotically reduced to a constant independent of the circuit provided we only consider circuits with a length bounded by a polynomial in the width. In this work, using a minimal model for quantum fau","authors_text":"Ala Shayeghi, Alexander M\\\"uller-Hermes, Omar Fawzi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-01-31T22:19:49Z","title":"A lower bound on the space overhead of fault-tolerant quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00119","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:0488226dd417767d1ac88ab5916bc2a8eb08e9fe3f54d97aef32ab6672d5158e","target":"record","created_at":"2026-07-05T07:55:55Z","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":"ba628e5fbeb9ef798c796ce5fab3ac623aa88cdcd469138988d5708d5a8f412c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-01-31T22:19:49Z","title_canon_sha256":"736bbbbe0eed440914d85b03e58a3e42f2fb475a3be1d5e9f63fffff76fb619a"},"schema_version":"1.0","source":{"id":"2202.00119","kind":"arxiv","version":2}},"canonical_sha256":"94e7bc9a41059edc2e98751b6b497d7ee3b8c1c0fdc48529ccec9d29d46426a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94e7bc9a41059edc2e98751b6b497d7ee3b8c1c0fdc48529ccec9d29d46426a9","first_computed_at":"2026-07-05T07:55:55.907439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:55.907439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UfLyV1bVL2sBXFMrUGeTs4OL/Ks9f6DG4ugP2dGf1zI3CCxaRuTo8qooilELOAnEej7essn7WxmvzWOVfaM/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:55.907900Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.00119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0488226dd417767d1ac88ab5916bc2a8eb08e9fe3f54d97aef32ab6672d5158e","sha256:7242331c5d863fd3bbb1373249093e68e9f1b7af50c98aa021a92febed8390e0"],"state_sha256":"11af9d0d218b50e3b9983f17c5ed9f681f690b8b6253fb8b9323dabd8fc65c90"}