{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:G2YJQZSF4SMYWQSX3ZLGBIVJC2","short_pith_number":"pith:G2YJQZSF","schema_version":"1.0","canonical_sha256":"36b0986645e4998b4257de5660a2a9168516ecd06a8c6f3419b165b22aa04f6f","source":{"kind":"arxiv","id":"0802.4137","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant quantum computation in concatenation of verified cluster states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Katsuji Yamamoto, Keisuke Fujii","submitted_at":"2008-02-28T08:27:20Z","abstract_excerpt":"A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery operation, where a suitable code such as the Steane's 7-qubit code is adopted for transversal operations. This simple concatenated construction of verified cluster states achieves a high noise threshold ~1%, and restrains the divergence of resources."},"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":"0802.4137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-02-28T08:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"b5eaefd49105f065a1f71c1b6fb8bd0dd2ef99e4e445ce62c8e395c50802143e","abstract_canon_sha256":"a12baa379ee4efc5169860d88a9594ebfbe518ce8a3a58e5d69570bce924a057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.095256Z","signature_b64":"LbE1GLiNQWi7t8q6PcUYS8GuYPQUMrQhMndB95DuTWH8r2e8VQeARL09IAwGkY2Q9R7ur15XKigs8ZivQOMcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b0986645e4998b4257de5660a2a9168516ecd06a8c6f3419b165b22aa04f6f","last_reissued_at":"2026-05-18T04:42:02.094763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.094763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant quantum computation in concatenation of verified cluster states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Katsuji Yamamoto, Keisuke Fujii","submitted_at":"2008-02-28T08:27:20Z","abstract_excerpt":"A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery operation, where a suitable code such as the Steane's 7-qubit code is adopted for transversal operations. This simple concatenated construction of verified cluster states achieves a high noise threshold ~1%, and restrains the divergence of resources."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.4137","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0802.4137","created_at":"2026-05-18T04:42:02.094855+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.4137v2","created_at":"2026-05-18T04:42:02.094855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.4137","created_at":"2026-05-18T04:42:02.094855+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2YJQZSF4SMY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2YJQZSF4SMYWQSX","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2YJQZSF","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2","json":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2.json","graph_json":"https://pith.science/api/pith-number/G2YJQZSF4SMYWQSX3ZLGBIVJC2/graph.json","events_json":"https://pith.science/api/pith-number/G2YJQZSF4SMYWQSX3ZLGBIVJC2/events.json","paper":"https://pith.science/paper/G2YJQZSF"},"agent_actions":{"view_html":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2","download_json":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2.json","view_paper":"https://pith.science/paper/G2YJQZSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.4137&json=true","fetch_graph":"https://pith.science/api/pith-number/G2YJQZSF4SMYWQSX3ZLGBIVJC2/graph.json","fetch_events":"https://pith.science/api/pith-number/G2YJQZSF4SMYWQSX3ZLGBIVJC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2/action/storage_attestation","attest_author":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2/action/author_attestation","sign_citation":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2/action/citation_signature","submit_replication":"https://pith.science/pith/G2YJQZSF4SMYWQSX3ZLGBIVJC2/action/replication_record"}},"created_at":"2026-05-18T04:42:02.094855+00:00","updated_at":"2026-05-18T04:42:02.094855+00:00"}