{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NWLQ7QO67SV6SQOZ3W7WHKCPI6","short_pith_number":"pith:NWLQ7QO6","canonical_record":{"source":{"id":"2512.11006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T08:17:18Z","cross_cats_sorted":[],"title_canon_sha256":"c2445775e27d366f5f476f6db39a945dfb37c50a579c3dffa7cacdc9a5d20ee2","abstract_canon_sha256":"9c44d6219f7f6c42ea19ce4ada80f5994c3a391bf637bedd903551f94954780b"},"schema_version":"1.0"},"canonical_sha256":"6d970fc1defcabe941d9ddbf63a84f4793021c2d75ef303665bbf1c780aea497","source":{"kind":"arxiv","id":"2512.11006","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NWLQ7QO67SV6SQOZ3W7WHKCPI6","target":"record","payload":{"canonical_record":{"source":{"id":"2512.11006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T08:17:18Z","cross_cats_sorted":[],"title_canon_sha256":"c2445775e27d366f5f476f6db39a945dfb37c50a579c3dffa7cacdc9a5d20ee2","abstract_canon_sha256":"9c44d6219f7f6c42ea19ce4ada80f5994c3a391bf637bedd903551f94954780b"},"schema_version":"1.0"},"canonical_sha256":"6d970fc1defcabe941d9ddbf63a84f4793021c2d75ef303665bbf1c780aea497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:08.256376Z","signature_b64":"t3RASgLJgxTRVvRu2PCjwEIZJGQojFnEmSBAx9guczYRJHuBrc8E3SgrWBFw44xibOPV1xMVHFBKCHwHzCr9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d970fc1defcabe941d9ddbf63a84f4793021c2d75ef303665bbf1c780aea497","last_reissued_at":"2026-06-03T01:05:08.255883Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:08.255883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.11006","source_version":3,"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-06-03T01:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghRIAVcNpO4OWrPXcRycc5OlTaNe2qlrQhYbm7RtUgGLMRRO25yPYMtlTO8XbGu08/ExGrdLULvCCelnnl7xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:52:04.060028Z"},"content_sha256":"45b837a2af47df52ede1bbacf2c097a1639afa2551853bc6ceb1c477e4666253","schema_version":"1.0","event_id":"sha256:45b837a2af47df52ede1bbacf2c097a1639afa2551853bc6ceb1c477e4666253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NWLQ7QO67SV6SQOZ3W7WHKCPI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undecidability of Hitting Times in Computably Described Quantum Dynamics: A No-Go Theorem for Universal Time Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Katsufumi Matsuura","submitted_at":"2025-12-11T08:17:18Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"53b64b3886bba4f49a31f46597d9b44488100f14d7be1e091236ced6f7b30bda"},"source":{"id":"2512.11006","kind":"arxiv","version":3},"verdict":{"id":"2351cb52-200b-4bd9-be57-3f944d338c07","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T23:36:34.934396Z","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.","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","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.","pith_extraction_headline":"No algorithm exists that can output the hitting time for every computable quantum state and unitary evolution."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.11006/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":2,"snapshot_sha256":"fdf99f67c4884a2192f67224435081234a9e057c89a2cc90a56bc528030651c5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2351cb52-200b-4bd9-be57-3f944d338c07"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN5jA7qrN0wrFck92F6r9UGAGh2uMC5qH9hI6Y0q2eXaXZrbCwg6J5PZTLsXKt70hyNTEqQ+X15oWKqjx93jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:52:04.060510Z"},"content_sha256":"1bfae7ff6e295ea04b45ef41106550fcb71dd58a1ac12fcf7aa6a540acce3ae8","schema_version":"1.0","event_id":"sha256:1bfae7ff6e295ea04b45ef41106550fcb71dd58a1ac12fcf7aa6a540acce3ae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/bundle.json","state_url":"https://pith.science/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/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-07-04T02:52:04Z","links":{"resolver":"https://pith.science/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6","bundle":"https://pith.science/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/bundle.json","state":"https://pith.science/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWLQ7QO67SV6SQOZ3W7WHKCPI6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLrsNWBifR/KZH0I7VQutWG5XxgB8/kHXJiJofZw+427/2zC0MVWrNEOyI59msflflgYBoDtHnl31chMysYcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:52:04.062767Z","bundle_sha256":"3a11dfd78debafb4094d9e68a829bdcca62787484db014e2006e6bb0f34f19a4"}}