{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NWLQ7QO67SV6SQOZ3W7WHKCPI6","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":"9c44d6219f7f6c42ea19ce4ada80f5994c3a391bf637bedd903551f94954780b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T08:17:18Z","title_canon_sha256":"c2445775e27d366f5f476f6db39a945dfb37c50a579c3dffa7cacdc9a5d20ee2"},"schema_version":"1.0","source":{"id":"2512.11006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.11006","created_at":"2026-06-03T01:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2512.11006v3","created_at":"2026-06-03T01:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11006","created_at":"2026-06-03T01:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"NWLQ7QO67SV6","created_at":"2026-06-03T01:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"NWLQ7QO67SV6SQOZ","created_at":"2026-06-03T01:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"NWLQ7QO6","created_at":"2026-06-03T01:05:08Z"}],"graph_snapshots":[{"event_id":"sha256:1bfae7ff6e295ea04b45ef41106550fcb71dd58a1ac12fcf7aa6a540acce3ae8","target":"graph","created_at":"2026-06-03T01:05:08Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that there is no total algorithm that outputs this hitting time for all inputs; equivalently, the total UHTP is undecidable via a reduction from the halting problem. Operationally, we show a no-go theorem: for any fixed accuracy parameters, there is no universal finite-resource protocol that, for all computably described inputs, correctly outputs the hitting time while obeying uniform finite upper bounds on observation time and on dissipation/work."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proofs assume systems capable of embedding universal computation via reversible computation into unitary dynamics and a fixed-target beacon construction with continuous-time lifting via piecewise-constant Hamiltonians."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Unitary Hitting Time Problem is undecidable by reduction from the halting problem, with an operational no-go for any universal finite-time protocol."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution."}],"snapshot_sha256":"53b64b3886bba4f49a31f46597d9b44488100f14d7be1e091236ced6f7b30bda"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fdf99f67c4884a2192f67224435081234a9e057c89a2cc90a56bc528030651c5"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.11006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Unitary Hitting Time Problem (UHTP) in quantum dynamics. Given computably described pure states |a>, |b> and a time-dependent unitary U(t), define the hitting time as the infimum of t > 0 such that the fidelity between U(t)|a> and |b> reaches a fixed threshold (with infinity if the threshold is never reached). We prove that there is no total algorithm that outputs this hitting time for all inputs; equivalently, the total UHTP is undecidable via a reduction from the halting problem. Operationally, we show a no-go theorem: for any fixed accuracy parameters, there is no universal fin","authors_text":"Katsufumi Matsuura","cross_cats":[],"headline":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T08:17:18Z","title":"Undecidability of Hitting Times in Computably Described Quantum Dynamics: A No-Go Theorem for Universal Time Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.11006","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T23:36:34.934396Z","id":"2351cb52-200b-4bd9-be57-3f944d338c07","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Unitary Hitting Time Problem is undecidable by reduction from the halting problem, with an operational no-go for any universal finite-time protocol.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution.","strongest_claim":"We prove that there is no total algorithm that outputs this hitting time for all inputs; equivalently, the total UHTP is undecidable via a reduction from the halting problem. Operationally, we show a no-go theorem: for any fixed accuracy parameters, there is no universal finite-resource protocol that, for all computably described inputs, correctly outputs the hitting time while obeying uniform finite upper bounds on observation time and on dissipation/work.","weakest_assumption":"The proofs assume systems capable of embedding universal computation via reversible computation into unitary dynamics and a fixed-target beacon construction with continuous-time lifting via piecewise-constant Hamiltonians."}},"verdict_id":"2351cb52-200b-4bd9-be57-3f944d338c07"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:45b837a2af47df52ede1bbacf2c097a1639afa2551853bc6ceb1c477e4666253","target":"record","created_at":"2026-06-03T01:05:08Z","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":"9c44d6219f7f6c42ea19ce4ada80f5994c3a391bf637bedd903551f94954780b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T08:17:18Z","title_canon_sha256":"c2445775e27d366f5f476f6db39a945dfb37c50a579c3dffa7cacdc9a5d20ee2"},"schema_version":"1.0","source":{"id":"2512.11006","kind":"arxiv","version":3}},"canonical_sha256":"6d970fc1defcabe941d9ddbf63a84f4793021c2d75ef303665bbf1c780aea497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d970fc1defcabe941d9ddbf63a84f4793021c2d75ef303665bbf1c780aea497","first_computed_at":"2026-06-03T01:05:08.255883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:08.255883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t3RASgLJgxTRVvRu2PCjwEIZJGQojFnEmSBAx9guczYRJHuBrc8E3SgrWBFw44xibOPV1xMVHFBKCHwHzCr9BA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:08.256376Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.11006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45b837a2af47df52ede1bbacf2c097a1639afa2551853bc6ceb1c477e4666253","sha256:1bfae7ff6e295ea04b45ef41106550fcb71dd58a1ac12fcf7aa6a540acce3ae8"],"state_sha256":"e283bcae9b7540f13b06fc82e75ded62fcc9369eee22937ae4d35f8d525af1a5"}