{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:L3NZRPYPC6MLW7O3IWL5QKK2EI","short_pith_number":"pith:L3NZRPYP","schema_version":"1.0","canonical_sha256":"5edb98bf0f1798bb7ddb4597d8295a2214d053ad7880dfb6e4a51aa06e698af0","source":{"kind":"arxiv","id":"quant-ph/0010033","version":1},"attestation_state":"computed","paper":{"title":"Quantum computing via measurements only","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hans J. Briegel (LMU Munich), Robert Raussendorf","submitted_at":"2000-10-07T19:54:17Z","abstract_excerpt":"A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of qua"},"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":"quant-ph/0010033","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-10-07T19:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"203bb0906dc2491fbf42f212024afd5ec526ad3226899b7a840ca8556a6e7cd2","abstract_canon_sha256":"7bb6975a1b834acb2f7af62057e8cafaf46fefebfbcc4a77586324c66d1e25e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:32.370607Z","signature_b64":"rnQTvOmWzaQY38Sb1opYAZg0TvOVZTYJmSYE0RR9iJlzmsgePHis26pghEKu8inTgfrIPXo/s37JtvwHojh8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5edb98bf0f1798bb7ddb4597d8295a2214d053ad7880dfb6e4a51aa06e698af0","last_reissued_at":"2026-07-04T14:45:32.370273Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:32.370273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computing via measurements only","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hans J. Briegel (LMU Munich), Robert Raussendorf","submitted_at":"2000-10-07T19:54:17Z","abstract_excerpt":"A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0010033","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0010033/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":"quant-ph/0010033","created_at":"2026-07-04T14:45:32.370337+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0010033v1","created_at":"2026-07-04T14:45:32.370337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0010033","created_at":"2026-07-04T14:45:32.370337+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3NZRPYPC6ML","created_at":"2026-07-04T14:45:32.370337+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3NZRPYPC6MLW7O3","created_at":"2026-07-04T14:45:32.370337+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3NZRPYP","created_at":"2026-07-04T14:45:32.370337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.28404","citing_title":"On the existence of fully inseparable biseparable Gaussian states","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"1906.10929","citing_title":"Entanglement Certification $-$ From Theory to Experiment","ref_index":182,"is_internal_anchor":true},{"citing_arxiv_id":"2412.18504","citing_title":"The $S=\\frac{1}{2}$ XY and XYZ models on the two or higher dimensional hypercubic lattice do not possess nontrivial local conserved quantities","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2510.12457","citing_title":"Experimental verification of multi-copy activation of genuine multipartite entanglement","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25424","citing_title":"A graph-aware bounded distance decoder for all stabilizer codes","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI","json":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI.json","graph_json":"https://pith.science/api/pith-number/L3NZRPYPC6MLW7O3IWL5QKK2EI/graph.json","events_json":"https://pith.science/api/pith-number/L3NZRPYPC6MLW7O3IWL5QKK2EI/events.json","paper":"https://pith.science/paper/L3NZRPYP"},"agent_actions":{"view_html":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI","download_json":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI.json","view_paper":"https://pith.science/paper/L3NZRPYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0010033&json=true","fetch_graph":"https://pith.science/api/pith-number/L3NZRPYPC6MLW7O3IWL5QKK2EI/graph.json","fetch_events":"https://pith.science/api/pith-number/L3NZRPYPC6MLW7O3IWL5QKK2EI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI/action/storage_attestation","attest_author":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI/action/author_attestation","sign_citation":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI/action/citation_signature","submit_replication":"https://pith.science/pith/L3NZRPYPC6MLW7O3IWL5QKK2EI/action/replication_record"}},"created_at":"2026-07-04T14:45:32.370337+00:00","updated_at":"2026-07-04T14:45:32.370337+00:00"}