{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HNDNZTQMQPXKEIDLBV4ZKFV225","short_pith_number":"pith:HNDNZTQM","canonical_record":{"source":{"id":"1504.04057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-15T21:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"4a8fe846f95099e9c4e17cd1e87ae156d599140612421e4c1aefa426f0531ed5","abstract_canon_sha256":"7b7ac19543522c34133b99cccf46839c4d7ca3c61997b3253060cef75a7d1256"},"schema_version":"1.0"},"canonical_sha256":"3b46dcce0c83eea2206b0d799516bad740f28d392968a91fd034c515cc159596","source":{"kind":"arxiv","id":"1504.04057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04057","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04057v1","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04057","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"HNDNZTQMQPXK","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNDNZTQMQPXKEIDL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNDNZTQM","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HNDNZTQMQPXKEIDLBV4ZKFV225","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-15T21:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"4a8fe846f95099e9c4e17cd1e87ae156d599140612421e4c1aefa426f0531ed5","abstract_canon_sha256":"7b7ac19543522c34133b99cccf46839c4d7ca3c61997b3253060cef75a7d1256"},"schema_version":"1.0"},"canonical_sha256":"3b46dcce0c83eea2206b0d799516bad740f28d392968a91fd034c515cc159596","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:49.523061Z","signature_b64":"esozSkX66f/PzhH2tuXXWM5kV9dmMCRFwnJ5ahHFXJQg0JB4rMjT1MLBRPpm1wOeIritz1ZBiWPDA68fRGPRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b46dcce0c83eea2206b0d799516bad740f28d392968a91fd034c515cc159596","last_reissued_at":"2026-05-18T00:30:49.522592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:49.522592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04057","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Kf3PXRt9cSOfRFc/ae21M5mY88bRxrobou5wvLFAflY5gA/z6Ix+FfCURxTIySh0nrqGqIjTTVblq1z8CvICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:58.176803Z"},"content_sha256":"9d314b529f790c0b92c798283aaf0b5537c4dbaa36dae06158f91d7f016e2f8b","schema_version":"1.0","event_id":"sha256:9d314b529f790c0b92c798283aaf0b5537c4dbaa36dae06158f91d7f016e2f8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HNDNZTQMQPXKEIDLBV4ZKFV225","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing the Frequency of Quantum Error Correction using the [[7,1,3]] Steane Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Abu-Nada, Ben Fortescue, Mark Byrd","submitted_at":"2015-04-15T21:52:19Z","abstract_excerpt":"A common assumption in analyses of error thresholds and quantum computing in general is that one applies fault-tolerant quantum error correction (FTQEC) after every gate. This, however, is known not to always be optimal if the FTQEC procedure itself can introduce errors. We investigate the effect of varying the number of logical gates between FTQEC operations, and in particular the case where failure of a postselection condition in FTQEC may cause FTQEC to be skipped with high probability.\n  By using a simplified model of errors induced in FTQEC, we derive an expression for the logical error r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04057","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtGznG1OuYqsQ9whhPFc/Qcurv2eeHXirfBFbccEXj37C6arhz2jqiwDPF7ivQLTatBSNJ8XBSOFGE6cCrW/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:58.177745Z"},"content_sha256":"df9aaa2c463c1676f5313e9594d8264b2ca0ebc94ed1ef410ecd9d7f1fdf8f18","schema_version":"1.0","event_id":"sha256:df9aaa2c463c1676f5313e9594d8264b2ca0ebc94ed1ef410ecd9d7f1fdf8f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/bundle.json","state_url":"https://pith.science/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T00:13:58Z","links":{"resolver":"https://pith.science/pith/HNDNZTQMQPXKEIDLBV4ZKFV225","bundle":"https://pith.science/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/bundle.json","state":"https://pith.science/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNDNZTQMQPXKEIDLBV4ZKFV225/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HNDNZTQMQPXKEIDLBV4ZKFV225","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":"7b7ac19543522c34133b99cccf46839c4d7ca3c61997b3253060cef75a7d1256","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-15T21:52:19Z","title_canon_sha256":"4a8fe846f95099e9c4e17cd1e87ae156d599140612421e4c1aefa426f0531ed5"},"schema_version":"1.0","source":{"id":"1504.04057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04057","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04057v1","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04057","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"HNDNZTQMQPXK","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNDNZTQMQPXKEIDL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNDNZTQM","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:df9aaa2c463c1676f5313e9594d8264b2ca0ebc94ed1ef410ecd9d7f1fdf8f18","target":"graph","created_at":"2026-05-18T00:30:49Z","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":"A common assumption in analyses of error thresholds and quantum computing in general is that one applies fault-tolerant quantum error correction (FTQEC) after every gate. This, however, is known not to always be optimal if the FTQEC procedure itself can introduce errors. We investigate the effect of varying the number of logical gates between FTQEC operations, and in particular the case where failure of a postselection condition in FTQEC may cause FTQEC to be skipped with high probability.\n  By using a simplified model of errors induced in FTQEC, we derive an expression for the logical error r","authors_text":"Ali Abu-Nada, Ben Fortescue, Mark Byrd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-15T21:52:19Z","title":"Optimizing the Frequency of Quantum Error Correction using the [[7,1,3]] Steane Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04057","kind":"arxiv","version":1},"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:9d314b529f790c0b92c798283aaf0b5537c4dbaa36dae06158f91d7f016e2f8b","target":"record","created_at":"2026-05-18T00:30:49Z","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":"7b7ac19543522c34133b99cccf46839c4d7ca3c61997b3253060cef75a7d1256","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-15T21:52:19Z","title_canon_sha256":"4a8fe846f95099e9c4e17cd1e87ae156d599140612421e4c1aefa426f0531ed5"},"schema_version":"1.0","source":{"id":"1504.04057","kind":"arxiv","version":1}},"canonical_sha256":"3b46dcce0c83eea2206b0d799516bad740f28d392968a91fd034c515cc159596","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b46dcce0c83eea2206b0d799516bad740f28d392968a91fd034c515cc159596","first_computed_at":"2026-05-18T00:30:49.522592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:49.522592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"esozSkX66f/PzhH2tuXXWM5kV9dmMCRFwnJ5ahHFXJQg0JB4rMjT1MLBRPpm1wOeIritz1ZBiWPDA68fRGPRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:49.523061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d314b529f790c0b92c798283aaf0b5537c4dbaa36dae06158f91d7f016e2f8b","sha256:df9aaa2c463c1676f5313e9594d8264b2ca0ebc94ed1ef410ecd9d7f1fdf8f18"],"state_sha256":"570b5738a270fc4919b30da5e33b71c111fe673efd11b0cc78599f5dd4ffbd92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQHtCUkBNul5elNyhWf/f8ypLJgV3N2ByILMMSYMqt87Eh23amp8K48V/1pd9xX3HnVqbHyL+8OZ2A2JnQjQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:13:58.182762Z","bundle_sha256":"948a138aa34a905881f684ca14a092f5937734f7738b9762137a0ec33bc299bf"}}