{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N7DJDPHGYZ4HUXJCS4FICL64LZ","short_pith_number":"pith:N7DJDPHG","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"},"canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","source":{"kind":"arxiv","id":"2509.07041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.07041","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"arxiv_version","alias_value":"2509.07041v1","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07041","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_12","alias_value":"N7DJDPHGYZ4H","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_16","alias_value":"N7DJDPHGYZ4HUXJC","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_8","alias_value":"N7DJDPHG","created_at":"2026-07-05T12:07:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N7DJDPHGYZ4HUXJCS4FICL64LZ","target":"record","payload":{"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"},"canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","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"},"source_kind":"arxiv","source_id":"2509.07041","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-07-05T12:07:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgBHzfeLV3w4QZ90WBvyDocaanSq5xCvXqLoIMmiTGAvAPxzxyf99EMJIvLFcAIbKPZkT/sXGhzCf+OragMwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:29:51.889004Z"},"content_sha256":"ff8569a4395054f11e8e782894810221ed05846e76d92493820819f643e848e5","schema_version":"1.0","event_id":"sha256:ff8569a4395054f11e8e782894810221ed05846e76d92493820819f643e848e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N7DJDPHGYZ4HUXJCS4FICL64LZ","target":"graph","payload":{"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"},"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-07-05T12:07:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3hoalphU7QnOsERGqkdG+mB2pQ51kREqwq+zMEqW79AyZBVUF+X1gC7EBFR6yVYC63cqEZVrMuokjdmavmjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:29:51.889881Z"},"content_sha256":"26140589b2ac3cbb9263080569180dbd9cb287f8f328eb84f1994614c7598dec","schema_version":"1.0","event_id":"sha256:26140589b2ac3cbb9263080569180dbd9cb287f8f328eb84f1994614c7598dec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/bundle.json","state_url":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/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-08-10T05:29:51Z","links":{"resolver":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ","bundle":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/bundle.json","state":"https://pith.science/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7DJDPHGYZ4HUXJCS4FICL64LZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N7DJDPHGYZ4HUXJCS4FICL64LZ","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":"37853f9b8f9937f8eb2e3e794c6158ccb3f4ebfa961c0ad2102ceb4c0ae4a474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T10:12:32Z","title_canon_sha256":"1c8ed060bf31ac263b959f410e9207e587939e0c4a11ec1a46ac666dd3cc847a"},"schema_version":"1.0","source":{"id":"2509.07041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.07041","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"arxiv_version","alias_value":"2509.07041v1","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07041","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_12","alias_value":"N7DJDPHGYZ4H","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_16","alias_value":"N7DJDPHGYZ4HUXJC","created_at":"2026-07-05T12:07:14Z"},{"alias_kind":"pith_short_8","alias_value":"N7DJDPHG","created_at":"2026-07-05T12:07:14Z"}],"graph_snapshots":[{"event_id":"sha256:26140589b2ac3cbb9263080569180dbd9cb287f8f328eb84f1994614c7598dec","target":"graph","created_at":"2026-07-05T12:07: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/2509.07041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas Wichert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07041","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:ff8569a4395054f11e8e782894810221ed05846e76d92493820819f643e848e5","target":"record","created_at":"2026-07-05T12:07: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":"37853f9b8f9937f8eb2e3e794c6158ccb3f4ebfa961c0ad2102ceb4c0ae4a474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T10:12:32Z","title_canon_sha256":"1c8ed060bf31ac263b959f410e9207e587939e0c4a11ec1a46ac666dd3cc847a"},"schema_version":"1.0","source":{"id":"2509.07041","kind":"arxiv","version":1}},"canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fc691bce6c6787a5d22970a812fdc5e40ecaa6b96c3f8e66f9bf7ca5585eb19","first_computed_at":"2026-07-05T12:07:14.504720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:14.504720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgMxcQKD2qz5hk/Bro9LJszLg//Xd1er/G2AkzFq8glyZr7/3k8MDPEgztRxg08AEZNpGzAFwvnFcpIMIIhZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:14.505440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.07041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff8569a4395054f11e8e782894810221ed05846e76d92493820819f643e848e5","sha256:26140589b2ac3cbb9263080569180dbd9cb287f8f328eb84f1994614c7598dec"],"state_sha256":"db04efa5353d3dcfa29e074f3497b3a7db04a31b371c5f90a811eb0d8c78aa4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E16v7XS06EmUybmi9BA5bbY8Zu30BMt2111lOhWOwzWHx8tJ3y7yt77wRIOjhQymhcLRXcf6h1lc6kazkwSDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:29:51.903307Z","bundle_sha256":"386156f40ad5cae77fbb995b10f9f5ed3718cbfa33f79da93eafa0c329d22e41"}}