{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OIPZFOZZJCIV7S2VTNL2OO2Q7B","short_pith_number":"pith:OIPZFOZZ","canonical_record":{"source":{"id":"1202.6530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-29T12:28:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f085cfd8440838bd645bec90ce3deb2f7d5ea06a2edb6cc1c1fd0432afeb5231","abstract_canon_sha256":"c20f34df8ac56e40eff2e8ae692fb9de21494f188967a60de7ca63fa111dfc5a"},"schema_version":"1.0"},"canonical_sha256":"721f92bb3948915fcb559b57a73b50f877bd712a3463ff204db7b4372ea49210","source":{"kind":"arxiv","id":"1202.6530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6530","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6530v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6530","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"OIPZFOZZJCIV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OIPZFOZZJCIV7S2V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OIPZFOZZ","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OIPZFOZZJCIV7S2VTNL2OO2Q7B","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-29T12:28:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f085cfd8440838bd645bec90ce3deb2f7d5ea06a2edb6cc1c1fd0432afeb5231","abstract_canon_sha256":"c20f34df8ac56e40eff2e8ae692fb9de21494f188967a60de7ca63fa111dfc5a"},"schema_version":"1.0"},"canonical_sha256":"721f92bb3948915fcb559b57a73b50f877bd712a3463ff204db7b4372ea49210","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.253045Z","signature_b64":"P5uYwakauA6JLb4bpNY75ISr1k/wvxgqiTBhlSWXdnjJnJjFPODSIIsc5zVmk1WO6BgnJ/D09vSPPEEgThV0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721f92bb3948915fcb559b57a73b50f877bd712a3463ff204db7b4372ea49210","last_reissued_at":"2026-05-18T04:01:12.252403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.252403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6530","source_version":1,"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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psqmwn2VcdESdlQlRF7iT/2PZ9zg03Az5sKe/D+hA4e0RkRCVpULICIIWf07b4pGbGwszxmHxYssAnfKVLMsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:40:41.988858Z"},"content_sha256":"8b1ca16708a45710ffe5589e040192d6a7b27fb0226a3d8ebeaa71707d546ce8","schema_version":"1.0","event_id":"sha256:8b1ca16708a45710ffe5589e040192d6a7b27fb0226a3d8ebeaa71707d546ce8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OIPZFOZZJCIV7S2VTNL2OO2Q7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Quantum Turing Machine Halting Deterministically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Li Yang, Min Liang","submitted_at":"2012-02-29T12:28:20Z","abstract_excerpt":"We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we construct a SR-QTM which is universal for all near-trivial transformations. This means there exists a QTM which is universal for the above subclass. Finally we prove that SR-QTM is computational equivalent with ordinary QTM in the bounded error setting. It can be seen that, because SR-QTM has the same time steps for different branches of computation, the halt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6530","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":""},"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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWFfRS6vGuO5Y1OtUOY8P/e3cudB2a1ywG5FNN+4CVb2b7g0aeDDFpCauQR3V/9M/kg9OgMRfpwxDwW1ZouUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:40:41.989217Z"},"content_sha256":"a8ea87b97c73bcc17b71557ccb57b3ade14b01bb0912a482a9ff772a6ea5df82","schema_version":"1.0","event_id":"sha256:a8ea87b97c73bcc17b71557ccb57b3ade14b01bb0912a482a9ff772a6ea5df82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/bundle.json","state_url":"https://pith.science/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/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-27T19:40:41Z","links":{"resolver":"https://pith.science/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B","bundle":"https://pith.science/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/bundle.json","state":"https://pith.science/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIPZFOZZJCIV7S2VTNL2OO2Q7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OIPZFOZZJCIV7S2VTNL2OO2Q7B","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":"c20f34df8ac56e40eff2e8ae692fb9de21494f188967a60de7ca63fa111dfc5a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-29T12:28:20Z","title_canon_sha256":"f085cfd8440838bd645bec90ce3deb2f7d5ea06a2edb6cc1c1fd0432afeb5231"},"schema_version":"1.0","source":{"id":"1202.6530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6530","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6530v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6530","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"OIPZFOZZJCIV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OIPZFOZZJCIV7S2V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OIPZFOZZ","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:a8ea87b97c73bcc17b71557ccb57b3ade14b01bb0912a482a9ff772a6ea5df82","target":"graph","created_at":"2026-05-18T04:01:12Z","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":"We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we construct a SR-QTM which is universal for all near-trivial transformations. This means there exists a QTM which is universal for the above subclass. Finally we prove that SR-QTM is computational equivalent with ordinary QTM in the bounded error setting. It can be seen that, because SR-QTM has the same time steps for different branches of computation, the halt","authors_text":"Li Yang, Min Liang","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-29T12:28:20Z","title":"On Quantum Turing Machine Halting Deterministically"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6530","kind":"arxiv","version":1},"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:8b1ca16708a45710ffe5589e040192d6a7b27fb0226a3d8ebeaa71707d546ce8","target":"record","created_at":"2026-05-18T04:01:12Z","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":"c20f34df8ac56e40eff2e8ae692fb9de21494f188967a60de7ca63fa111dfc5a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-29T12:28:20Z","title_canon_sha256":"f085cfd8440838bd645bec90ce3deb2f7d5ea06a2edb6cc1c1fd0432afeb5231"},"schema_version":"1.0","source":{"id":"1202.6530","kind":"arxiv","version":1}},"canonical_sha256":"721f92bb3948915fcb559b57a73b50f877bd712a3463ff204db7b4372ea49210","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"721f92bb3948915fcb559b57a73b50f877bd712a3463ff204db7b4372ea49210","first_computed_at":"2026-05-18T04:01:12.252403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:12.252403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5uYwakauA6JLb4bpNY75ISr1k/wvxgqiTBhlSWXdnjJnJjFPODSIIsc5zVmk1WO6BgnJ/D09vSPPEEgThV0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:12.253045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b1ca16708a45710ffe5589e040192d6a7b27fb0226a3d8ebeaa71707d546ce8","sha256:a8ea87b97c73bcc17b71557ccb57b3ade14b01bb0912a482a9ff772a6ea5df82"],"state_sha256":"e9636fecc41bc521af72ae9892542bfaa61d12d3f51337f2f35cc220c46035fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVmMZDqIY6rcVRZbPtxnQ93gf+41X+Pxvlzo+7rqfzzYuapTIDbI16U1VACMY+k1aJ1XoUc9Q1701GaDptY0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:40:41.991522Z","bundle_sha256":"2aa9ee1206e51cbc7370b905c3ec3273d7546de09916d948c793e975ee59eb20"}}