{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KZPZX5C2BGAX2IBFQZOPXAEZS6","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":"873151c3a22204fc156dc937aad3da648d98f5981ed8c902ffd80737511596c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-05T10:42:57Z","title_canon_sha256":"db3c21f451974f12fbd941a72750a7caad9ea740229c3b5ba15d61f585e8d2a1"},"schema_version":"1.0","source":{"id":"2605.03616","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03616","created_at":"2026-05-29T02:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03616v2","created_at":"2026-05-29T02:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03616","created_at":"2026-05-29T02:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"KZPZX5C2BGAX","created_at":"2026-05-29T02:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"KZPZX5C2BGAX2IBF","created_at":"2026-05-29T02:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"KZPZX5C2","created_at":"2026-05-29T02:05:45Z"}],"graph_snapshots":[{"event_id":"sha256:e7e60508ba048e0aa8e3490c9b84332f1f8dc1c47e3a86886e3ced3e802a34e0","target":"graph","created_at":"2026-05-29T02:05:45Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Under a uniform depolarizing noise model with idle noise, the proposed protocol substantially reduces the injection-and-cultivation discard rate and the expected number of attempts required to obtain an accepted early-stage candidate. At a physical error rate of p=2×10^{-3}, the injection-and-cultivation expected attempts are reduced by 45.46% for d1=3 and by 72.91% for d1=5, relative to the single-site MSC baseline. In the direct full-cycle evaluation including escape, the expected attempts per kept logical output are further reduced by 49.04% for d1=3 and by 78.69% for d1=5."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The escape stage and the decoder-based acceptance procedure can be kept identical to the single-site baseline without introducing new error sources or changing the logical-error behavior, and the uniform depolarizing noise model with idle noise accurately captures the relevant hardware behavior during multiplexing."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In-patch multiplexing reduces expected attempts for early-stage magic-state cultivation by 45.46% (d1=3) to 72.91% (d1=5) and full-cycle attempts by 49-79% at p=2e-3, while final logical error rates stay governed by the escape-stage threshold."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In-patch multiplexing reduces expected attempts in magic-state cultivation by creating multiple early opportunities inside one logical patch."}],"snapshot_sha256":"e6dd34d4db0a1e6bf8e42cd03a3d8a36463466f7d2efb738fd9ff7535f38148c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T13:37:35.276907Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.914587Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:12:06.436147Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03616/integrity.json","findings":[],"snapshot_sha256":"8d3ff1f0f71fc87c34f4732169ef2ae693672b40a01c509e6d2d59966de3f4b8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fault-tolerant quantum computing requires high-fidelity logical magic states for implementing non-Clifford operations. Magic-state cultivation provides a lower-overhead route to logical magic-state preparation, but its efficiency is limited by postselection loss during the early injection-and-cultivation stages. In this work, we propose an in-patch multiplexing scheme that uses early-stage idle resources within a single logical patch to create multiple local cultivation opportunities. A candidate that passes the early stages is forwarded to the standard escape pathway, while the escape stage a","authors_text":"Aniket Patra, Dongmin Kim, Jeonggeun Seo, Youngsun Han","cross_cats":[],"headline":"In-patch multiplexing reduces expected attempts in magic-state cultivation by creating multiple early opportunities inside one logical patch.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-05T10:42:57Z","title":"Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03616","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T17:07:34.146653Z","id":"2244a258-4aac-4154-8a3e-5f6acc7fde06","model_set":{"reader":"grok-4.3"},"one_line_summary":"In-patch multiplexing reduces expected attempts for early-stage magic-state cultivation by 45.46% (d1=3) to 72.91% (d1=5) and full-cycle attempts by 49-79% at p=2e-3, while final logical error rates stay governed by the escape-stage threshold.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In-patch multiplexing reduces expected attempts in magic-state cultivation by creating multiple early opportunities inside one logical patch.","strongest_claim":"Under a uniform depolarizing noise model with idle noise, the proposed protocol substantially reduces the injection-and-cultivation discard rate and the expected number of attempts required to obtain an accepted early-stage candidate. At a physical error rate of p=2×10^{-3}, the injection-and-cultivation expected attempts are reduced by 45.46% for d1=3 and by 72.91% for d1=5, relative to the single-site MSC baseline. In the direct full-cycle evaluation including escape, the expected attempts per kept logical output are further reduced by 49.04% for d1=3 and by 78.69% for d1=5.","weakest_assumption":"The escape stage and the decoder-based acceptance procedure can be kept identical to the single-site baseline without introducing new error sources or changing the logical-error behavior, and the uniform depolarizing noise model with idle noise accurately captures the relevant hardware behavior during multiplexing."}},"verdict_id":"2244a258-4aac-4154-8a3e-5f6acc7fde06"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b93aa3eb239a618b3d83c35da2501bc7a765c085795c8d07bd858d514a191d20","target":"record","created_at":"2026-05-29T02:05:45Z","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":"873151c3a22204fc156dc937aad3da648d98f5981ed8c902ffd80737511596c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-05T10:42:57Z","title_canon_sha256":"db3c21f451974f12fbd941a72750a7caad9ea740229c3b5ba15d61f585e8d2a1"},"schema_version":"1.0","source":{"id":"2605.03616","kind":"arxiv","version":2}},"canonical_sha256":"565f9bf45a09817d2025865cfb809997a91700d91970b8b8c9c60703a9cf6e7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"565f9bf45a09817d2025865cfb809997a91700d91970b8b8c9c60703a9cf6e7e","first_computed_at":"2026-05-29T02:05:45.767618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T02:05:45.767618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJGf0HJAt7xoxXpmxJcooDFIoP8a9ogmNOsoSvys/yp8pGG2SLSgCNmt/AqY/mTdkGTuB2DnMxgVhb2JX4vTCw==","signature_status":"signed_v1","signed_at":"2026-05-29T02:05:45.768529Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03616","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b93aa3eb239a618b3d83c35da2501bc7a765c085795c8d07bd858d514a191d20","sha256:e7e60508ba048e0aa8e3490c9b84332f1f8dc1c47e3a86886e3ced3e802a34e0"],"state_sha256":"ddb7b80afcca013df3468764be4b0b1d6280b0eab7f57efdafa0411d85aa67dd"}