{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T5SDEJYYHUD3VXMX6VP4WVZSJO","short_pith_number":"pith:T5SDEJYY","canonical_record":{"source":{"id":"2606.28452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"be3c7d269e487db3a2cd16e7aec0c6912e69ea681f6fa8578cec56ad1c590038","abstract_canon_sha256":"9c464df1ecb4f9b17d5ba76cd5656791dfbdc37b7bf80a00ffa0eb3d9be698f9"},"schema_version":"1.0"},"canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","source":{"kind":"arxiv","id":"2606.28452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28452","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28452v1","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28452","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"T5SDEJYYHUD3","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_16","alias_value":"T5SDEJYYHUD3VXMX","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_8","alias_value":"T5SDEJYY","created_at":"2026-06-30T00:15:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T5SDEJYYHUD3VXMX6VP4WVZSJO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"be3c7d269e487db3a2cd16e7aec0c6912e69ea681f6fa8578cec56ad1c590038","abstract_canon_sha256":"9c464df1ecb4f9b17d5ba76cd5656791dfbdc37b7bf80a00ffa0eb3d9be698f9"},"schema_version":"1.0"},"canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:14.631936Z","signature_b64":"SkFisbj47BdIk/h2YQCWGa+FYoH8WI+BqlZkSeismn1U+OOYXeNmob2oWddBJ9itSD6nte6zGykSkxIpfJyTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","last_reissued_at":"2026-06-30T00:15:14.631522Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:14.631522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28452","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-06-30T00:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuAV1lBNak+7GT8A6JN29J0L7PXNEsV7MxhWe9zCeNUA+p+G/uB4yS30eKyz2wFupOmNT0AVjUe5YuUv7BpnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T10:59:06.981493Z"},"content_sha256":"cbb82af472578f36dcb215fc9eb38323b99450d77cde8d9f6b4aa972038819e5","schema_version":"1.0","event_id":"sha256:cbb82af472578f36dcb215fc9eb38323b99450d77cde8d9f6b4aa972038819e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T5SDEJYYHUD3VXMX6VP4WVZSJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Wichert","submitted_at":"2026-06-26T09:41:42Z","abstract_excerpt":"In this work, we investigate quantum tree search via amplitude amplification. Amplitude amplification generalizes Grover's algorithm by replacing the Hadamard initialization with an arbitrary unitary $A$, with Grover's algorithm recovered as the special case of uniform initialization. We demonstrate the construction of a dynamic search tree of depth $m$ with query complexity $\\sqrt{\\left(b_{avg}\\right)^m}$ where $b_{avg}$ denotes the average branching factor, improving upon the commonly assumed $\\sqrt{\\left(b_{max}\\right)^m}$, where $b_{max}$ is the maximum branching factor. We further challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28452","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/2606.28452/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"},"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-06-30T00:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWWAn3EZQFbrZ9rEBkIT04eczei+enA6yPr9hbN51W/t/3j2FlGR2Jw00SIM1PZY1vNXkplMe5mkDboZb4V7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T10:59:06.981869Z"},"content_sha256":"55f67ec3a574c99750aa777d893572373f9f0795a85b70daca7560422d5dd50b","schema_version":"1.0","event_id":"sha256:55f67ec3a574c99750aa777d893572373f9f0795a85b70daca7560422d5dd50b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/bundle.json","state_url":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/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-01T10:59:06Z","links":{"resolver":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO","bundle":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/bundle.json","state":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T5SDEJYYHUD3VXMX6VP4WVZSJO","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":"9c464df1ecb4f9b17d5ba76cd5656791dfbdc37b7bf80a00ffa0eb3d9be698f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","title_canon_sha256":"be3c7d269e487db3a2cd16e7aec0c6912e69ea681f6fa8578cec56ad1c590038"},"schema_version":"1.0","source":{"id":"2606.28452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28452","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28452v1","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28452","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"T5SDEJYYHUD3","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_16","alias_value":"T5SDEJYYHUD3VXMX","created_at":"2026-06-30T00:15:14Z"},{"alias_kind":"pith_short_8","alias_value":"T5SDEJYY","created_at":"2026-06-30T00:15:14Z"}],"graph_snapshots":[{"event_id":"sha256:55f67ec3a574c99750aa777d893572373f9f0795a85b70daca7560422d5dd50b","target":"graph","created_at":"2026-06-30T00:15:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we investigate quantum tree search via amplitude amplification. Amplitude amplification generalizes Grover's algorithm by replacing the Hadamard initialization with an arbitrary unitary $A$, with Grover's algorithm recovered as the special case of uniform initialization. We demonstrate the construction of a dynamic search tree of depth $m$ with query complexity $\\sqrt{\\left(b_{avg}\\right)^m}$ where $b_{avg}$ denotes the average branching factor, improving upon the commonly assumed $\\sqrt{\\left(b_{max}\\right)^m}$, where $b_{max}$ is the maximum branching factor. We further challen","authors_text":"Andreas Wichert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","title":"Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28452","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:cbb82af472578f36dcb215fc9eb38323b99450d77cde8d9f6b4aa972038819e5","target":"record","created_at":"2026-06-30T00:15:14Z","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":"9c464df1ecb4f9b17d5ba76cd5656791dfbdc37b7bf80a00ffa0eb3d9be698f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","title_canon_sha256":"be3c7d269e487db3a2cd16e7aec0c6912e69ea681f6fa8578cec56ad1c590038"},"schema_version":"1.0","source":{"id":"2606.28452","kind":"arxiv","version":1}},"canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","first_computed_at":"2026-06-30T00:15:14.631522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T00:15:14.631522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SkFisbj47BdIk/h2YQCWGa+FYoH8WI+BqlZkSeismn1U+OOYXeNmob2oWddBJ9itSD6nte6zGykSkxIpfJyTAA==","signature_status":"signed_v1","signed_at":"2026-06-30T00:15:14.631936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbb82af472578f36dcb215fc9eb38323b99450d77cde8d9f6b4aa972038819e5","sha256:55f67ec3a574c99750aa777d893572373f9f0795a85b70daca7560422d5dd50b"],"state_sha256":"537a4eab19854c81a983177fcb655cfa119d4ba4142ffe4d3a33b0f91b53d328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E58WbWoAhHTd+6t7qR3guMIf55Ll1upfb4FMytPDFh0E2Y6CorY/qWWKzlhEfq/x2iald0Bx0V57Pqg04iqTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T10:59:06.984024Z","bundle_sha256":"ec786afb94db178733408f9037449b051e2f1214ebd41a67db44a45f138fc7fe"}}