{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XCJG4WNQLBFOZT6RBTSJILNP2G","short_pith_number":"pith:XCJG4WNQ","schema_version":"1.0","canonical_sha256":"b8926e59b0584aeccfd10ce4942dafd1b1e61728c66a4f9fd73ac8a56aa4e069","source":{"kind":"arxiv","id":"2311.05605","version":5},"attestation_state":"computed","paper":{"title":"A Spin-Optical Quantum Computing Architecture","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexia Salavrakos, Gr\\'egoire de Gliniasty, Paul Hilaire, Pierre-Emmanuel Emeriau, Shane Mansfield, Stephen C. Wein","submitted_at":"2023-11-09T18:59:05Z","abstract_excerpt":"We introduce an adaptable and modular hybrid architecture designed for fault-tolerant quantum computing. It combines quantum emitters and linear-optical entangling gates to leverage the strength of both matter-based and photonic-based approaches. A key feature of the architecture is its practicality, grounded in the utilisation of experimentally proven optical components. Our framework enables the execution of any quantum error correcting code, but in particular maintains scalability for low-density parity check codes by exploiting built-in non-local connectivity through distant optical links."},"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":"2311.05605","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-09T18:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"d3cd00ed33ac9f46a19aee96c95fda4109a737749d761eca170655982ebd6665","abstract_canon_sha256":"89cc1b677b36b4a3ed6fc3a2112c289c1ce4bff0cb4701e91e8fe1748803dc09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:08.474803Z","signature_b64":"uFOUWEKgVhdzg53AgKkW/nnDow8gGwMOFRmbd/C3wNAJasJIvX7g2tuxwXOIicU54wIH11Gsp5nbiG4UUTKSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8926e59b0584aeccfd10ce4942dafd1b1e61728c66a4f9fd73ac8a56aa4e069","last_reissued_at":"2026-07-05T08:47:08.474280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:08.474280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Spin-Optical Quantum Computing Architecture","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexia Salavrakos, Gr\\'egoire de Gliniasty, Paul Hilaire, Pierre-Emmanuel Emeriau, Shane Mansfield, Stephen C. Wein","submitted_at":"2023-11-09T18:59:05Z","abstract_excerpt":"We introduce an adaptable and modular hybrid architecture designed for fault-tolerant quantum computing. It combines quantum emitters and linear-optical entangling gates to leverage the strength of both matter-based and photonic-based approaches. A key feature of the architecture is its practicality, grounded in the utilisation of experimentally proven optical components. Our framework enables the execution of any quantum error correcting code, but in particular maintains scalability for low-density parity check codes by exploiting built-in non-local connectivity through distant optical links."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05605","kind":"arxiv","version":5},"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/2311.05605/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":"2311.05605","created_at":"2026-07-05T08:47:08.474348+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.05605v5","created_at":"2026-07-05T08:47:08.474348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05605","created_at":"2026-07-05T08:47:08.474348+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCJG4WNQLBFO","created_at":"2026-07-05T08:47:08.474348+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCJG4WNQLBFOZT6R","created_at":"2026-07-05T08:47:08.474348+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCJG4WNQ","created_at":"2026-07-05T08:47:08.474348+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18375","citing_title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G","json":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G.json","graph_json":"https://pith.science/api/pith-number/XCJG4WNQLBFOZT6RBTSJILNP2G/graph.json","events_json":"https://pith.science/api/pith-number/XCJG4WNQLBFOZT6RBTSJILNP2G/events.json","paper":"https://pith.science/paper/XCJG4WNQ"},"agent_actions":{"view_html":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G","download_json":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G.json","view_paper":"https://pith.science/paper/XCJG4WNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.05605&json=true","fetch_graph":"https://pith.science/api/pith-number/XCJG4WNQLBFOZT6RBTSJILNP2G/graph.json","fetch_events":"https://pith.science/api/pith-number/XCJG4WNQLBFOZT6RBTSJILNP2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G/action/storage_attestation","attest_author":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G/action/author_attestation","sign_citation":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G/action/citation_signature","submit_replication":"https://pith.science/pith/XCJG4WNQLBFOZT6RBTSJILNP2G/action/replication_record"}},"created_at":"2026-07-05T08:47:08.474348+00:00","updated_at":"2026-07-05T08:47:08.474348+00:00"}