{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N7DJDPHGYZ4HUXJCS4FICL64LZ","short_pith_number":"pith:N7DJDPHG","schema_version":"1.0","canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","source":{"kind":"arxiv","id":"2509.07041","version":1},"attestation_state":"computed","paper":{"title":"Nested Grover's Algorithm for Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Wichert","submitted_at":"2025-09-08T10:12:32Z","abstract_excerpt":"We investigate optimizing quantum tree search algorithms by employing a nested Grover Algorithm. This approach seeks to enhance results compared to previous Grover-based methods by expanding the tree of partial assignments to a specific depth and conducting a quantum search within the subset of remaining assignments. The study explores the implications and constraints of this approach, providing a foundation for quantum artificial intelligence applications. Instead of utilizing conventional heuristic functions that are incompatible with quantum tree search, we introduce the partial candidate s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.07041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T10:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"1c8ed060bf31ac263b959f410e9207e587939e0c4a11ec1a46ac666dd3cc847a","abstract_canon_sha256":"37853f9b8f9937f8eb2e3e794c6158ccb3f4ebfa961c0ad2102ceb4c0ae4a474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:14.505440Z","signature_b64":"zgMxcQKD2qz5hk/Bro9LJszLg//Xd1er/G2AkzFq8glyZr7/3k8MDPEgztRxg08AEZNpGzAFwvnFcpIMIIhZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","last_reissued_at":"2026-07-05T12:07:14.504720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:14.504720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested Grover's Algorithm for Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Wichert","submitted_at":"2025-09-08T10:12:32Z","abstract_excerpt":"We investigate optimizing quantum tree search algorithms by employing a nested Grover Algorithm. This approach seeks to enhance results compared to previous Grover-based methods by expanding the tree of partial assignments to a specific depth and conducting a quantum search within the subset of remaining assignments. The study explores the implications and constraints of this approach, providing a foundation for quantum artificial intelligence applications. Instead of utilizing conventional heuristic functions that are incompatible with quantum tree search, we introduce the partial candidate s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07041","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/2509.07041/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.07041","created_at":"2026-07-05T12:07:14.504818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07041v1","created_at":"2026-07-05T12:07:14.504818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07041","created_at":"2026-07-05T12:07:14.504818+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7DJDPHGYZ4H","created_at":"2026-07-05T12:07:14.504818+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7DJDPHGYZ4HUXJC","created_at":"2026-07-05T12:07:14.504818+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7DJDPHG","created_at":"2026-07-05T12:07:14.504818+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ","json":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ.json","graph_json":"https://pith.science/api/pith-number/N7DJDPHGYZ4HUXJCS4FICL64LZ/graph.json","events_json":"https://pith.science/api/pith-number/N7DJDPHGYZ4HUXJCS4FICL64LZ/events.json","paper":"https://pith.science/paper/N7DJDPHG"},"agent_actions":{"view_html":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ","download_json":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ.json","view_paper":"https://pith.science/paper/N7DJDPHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07041&json=true","fetch_graph":"https://pith.science/api/pith-number/N7DJDPHGYZ4HUXJCS4FICL64LZ/graph.json","fetch_events":"https://pith.science/api/pith-number/N7DJDPHGYZ4HUXJCS4FICL64LZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/action/storage_attestation","attest_author":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/action/author_attestation","sign_citation":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/action/citation_signature","submit_replication":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/action/replication_record"}},"created_at":"2026-07-05T12:07:14.504818+00:00","updated_at":"2026-07-05T12:07:14.504818+00:00"}