{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UZPLQJJTPBMUAIY6KGHOFDXOHQ","short_pith_number":"pith:UZPLQJJT","canonical_record":{"source":{"id":"1312.2496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T16:22:25Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"title_canon_sha256":"128c8eaf784e7e5391e5373321a3a08d293303f99df683d44c26e2a7a2940e42","abstract_canon_sha256":"fee559a6868591967bfe81489042065bb6764f92619a59f2234b45cf29d0b3cc"},"schema_version":"1.0"},"canonical_sha256":"a65eb82533785940231e518ee28eee3c242d69f26f654aaebd534036b910589e","source":{"kind":"arxiv","id":"1312.2496","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2496","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2496v2","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2496","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"UZPLQJJTPBMU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UZPLQJJTPBMUAIY6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UZPLQJJT","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UZPLQJJTPBMUAIY6KGHOFDXOHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T16:22:25Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"title_canon_sha256":"128c8eaf784e7e5391e5373321a3a08d293303f99df683d44c26e2a7a2940e42","abstract_canon_sha256":"fee559a6868591967bfe81489042065bb6764f92619a59f2234b45cf29d0b3cc"},"schema_version":"1.0"},"canonical_sha256":"a65eb82533785940231e518ee28eee3c242d69f26f654aaebd534036b910589e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.860614Z","signature_b64":"w2wwDDrWNEPb0R5++VH8g7MPiWD5Coc0doEmyflgHB9VLrVwUJ1msQ4e7eOYCOi/m60MwJx1wYZOCFgYxmwABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65eb82533785940231e518ee28eee3c242d69f26f654aaebd534036b910589e","last_reissued_at":"2026-05-18T02:26:02.860098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.860098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2496","source_version":2,"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-18T02:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeiTuBBxfQXsbJknRm2KxQzRbUJpqRsxQSd/Uv6zIjZjYEZEG35DHgrSvFjMTYOllfFX9ye6tGzmDPwcBcLMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:50.864668Z"},"content_sha256":"891e3a3e3821c348c251fca965a06c00206e51c2f3cec34261f9894399599287","schema_version":"1.0","event_id":"sha256:891e3a3e3821c348c251fca965a06c00206e51c2f3cec34261f9894399599287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UZPLQJJTPBMUAIY6KGHOFDXOHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the hardness of classically simulating the one clean qubit model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"primary_cat":"quant-ph","authors_text":"Joseph F. Fitzsimons, Keisuke Fujii, Tomoyuki Morimae","submitted_at":"2013-12-09T16:22:25Z","abstract_excerpt":"Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all other qubits in a completely-mixed state, with only a single qubit measurement at the end of the computation [E. Knill and R. Laflamme, Phys. Rev. Lett. {\\bf81}, 5672 (1998)]. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this paper, we introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2496","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"},"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-18T02:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Srjd4tYLIG2EZcrY/7gFuyz33dHdmEc5EFD7/zputlbKudwltZLKQ8Jdu/Zlrv1txEboA1Gy0lTqiVTkfdX3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:50.865359Z"},"content_sha256":"5daf455a3b3bf5322b45068350d6e9c5896d723e1913ccd7367c58a34dc79706","schema_version":"1.0","event_id":"sha256:5daf455a3b3bf5322b45068350d6e9c5896d723e1913ccd7367c58a34dc79706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/bundle.json","state_url":"https://pith.science/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/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-26T06:14:50Z","links":{"resolver":"https://pith.science/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ","bundle":"https://pith.science/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/bundle.json","state":"https://pith.science/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZPLQJJTPBMUAIY6KGHOFDXOHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UZPLQJJTPBMUAIY6KGHOFDXOHQ","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":"fee559a6868591967bfe81489042065bb6764f92619a59f2234b45cf29d0b3cc","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T16:22:25Z","title_canon_sha256":"128c8eaf784e7e5391e5373321a3a08d293303f99df683d44c26e2a7a2940e42"},"schema_version":"1.0","source":{"id":"1312.2496","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2496","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2496v2","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2496","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"UZPLQJJTPBMU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UZPLQJJTPBMUAIY6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UZPLQJJT","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:5daf455a3b3bf5322b45068350d6e9c5896d723e1913ccd7367c58a34dc79706","target":"graph","created_at":"2026-05-18T02:26:02Z","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":"Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all other qubits in a completely-mixed state, with only a single qubit measurement at the end of the computation [E. Knill and R. Laflamme, Phys. Rev. Lett. {\\bf81}, 5672 (1998)]. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this paper, we introduce","authors_text":"Joseph F. Fitzsimons, Keisuke Fujii, Tomoyuki Morimae","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T16:22:25Z","title":"On the hardness of classically simulating the one clean qubit model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2496","kind":"arxiv","version":2},"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:891e3a3e3821c348c251fca965a06c00206e51c2f3cec34261f9894399599287","target":"record","created_at":"2026-05-18T02:26:02Z","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":"fee559a6868591967bfe81489042065bb6764f92619a59f2234b45cf29d0b3cc","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T16:22:25Z","title_canon_sha256":"128c8eaf784e7e5391e5373321a3a08d293303f99df683d44c26e2a7a2940e42"},"schema_version":"1.0","source":{"id":"1312.2496","kind":"arxiv","version":2}},"canonical_sha256":"a65eb82533785940231e518ee28eee3c242d69f26f654aaebd534036b910589e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65eb82533785940231e518ee28eee3c242d69f26f654aaebd534036b910589e","first_computed_at":"2026-05-18T02:26:02.860098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:02.860098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2wwDDrWNEPb0R5++VH8g7MPiWD5Coc0doEmyflgHB9VLrVwUJ1msQ4e7eOYCOi/m60MwJx1wYZOCFgYxmwABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:02.860614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2496","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:891e3a3e3821c348c251fca965a06c00206e51c2f3cec34261f9894399599287","sha256:5daf455a3b3bf5322b45068350d6e9c5896d723e1913ccd7367c58a34dc79706"],"state_sha256":"92e5cd125ef0e1842f7fbdba78e8e6cd7bdcb835fe67caf7f8633070ba378bc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/AGw9f6C+IEQZ0O5u92nIuIQczGSOdTPvczzaZKmm30M7pYBLXPuN73E+kxQY3k3lRojK8xlevpf9/3HtgvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:14:50.871834Z","bundle_sha256":"e44563cda1ecbef6a6bae8e269792237a12878b23fd5c7deddd06e01bcc6e267"}}