{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QLEVSY6YCEEJ6UXMOGB75KZO42","short_pith_number":"pith:QLEVSY6Y","canonical_record":{"source":{"id":"2007.07040","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-07-14T13:57:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb775f0508c18e7396a5854448c6684da7d5e6005db988efc022cb3f004197d5","abstract_canon_sha256":"ef620afcb36c2031d307cb13d4102944e7851e42749e0259bec999c5036989b2"},"schema_version":"1.0"},"canonical_sha256":"82c95963d811089f52ec7183feab2ee68f0646edd54c50669476b9294e261808","source":{"kind":"arxiv","id":"2007.07040","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07040","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07040v4","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07040","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"QLEVSY6YCEEJ","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_16","alias_value":"QLEVSY6YCEEJ6UXM","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_8","alias_value":"QLEVSY6Y","created_at":"2026-07-05T05:55:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QLEVSY6YCEEJ6UXMOGB75KZO42","target":"record","payload":{"canonical_record":{"source":{"id":"2007.07040","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-07-14T13:57:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb775f0508c18e7396a5854448c6684da7d5e6005db988efc022cb3f004197d5","abstract_canon_sha256":"ef620afcb36c2031d307cb13d4102944e7851e42749e0259bec999c5036989b2"},"schema_version":"1.0"},"canonical_sha256":"82c95963d811089f52ec7183feab2ee68f0646edd54c50669476b9294e261808","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:37.706334Z","signature_b64":"xWE9kcaztSJFb0YxZARXNSHz2TkfqPEKZM9l7WZZY9P7ZtgqvNsvqSLuKS2iuUKAHTCWvIGrkP1/xDHJbnW6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82c95963d811089f52ec7183feab2ee68f0646edd54c50669476b9294e261808","last_reissued_at":"2026-07-05T05:55:37.705867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:37.705867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.07040","source_version":4,"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-05T05:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSG+STop5LrHoTlgN89jwWIF5AYqLVDYU7+HiKw9Bg3aVZGjqa2VH8Hgo8fMuvChPivJqGawiQwoIbGP7mDhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:42:19.387184Z"},"content_sha256":"9b891e52efb64bd0bbe5e64c2314fc591366f82181ef5dfbee47b01f8c1c0b7a","schema_version":"1.0","event_id":"sha256:9b891e52efb64bd0bbe5e64c2314fc591366f82181ef5dfbee47b01f8c1c0b7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QLEVSY6YCEEJ6UXMOGB75KZO42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid divide-and-conquer approach for tree search algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alfons Laarman, Mathys Rennela, Sebastiaan Brand, Vedran Dunjko","submitted_at":"2020-07-14T13:57:12Z","abstract_excerpt":"One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations. Finding methods that achieve useful quantum improvements under size limitations is thus a key question in the field. In this vein, it was recently shown that a hybrid classical-quantum method can help provide polynomial speed-ups to classical divide-and-conquer algorithms, even when only given access to a quantum computer much smaller than the problem itself. In this work, we study the hybrid divide-and-conquer method in the context of tree search algorithms, and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07040","kind":"arxiv","version":4},"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/2007.07040/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-05T05:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Dc1eWo46g13EuccAz+vqFjBoWWSRHUnDnh2zgsNtjrZMSfEzLaSOdkCRA+ljAGTbbA5rYn4EnwKYKyg8LjFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:42:19.388125Z"},"content_sha256":"e082698d5fbb9883ba4f354939e987c0b8a973184b707758af61aa7e293f1ec8","schema_version":"1.0","event_id":"sha256:e082698d5fbb9883ba4f354939e987c0b8a973184b707758af61aa7e293f1ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/bundle.json","state_url":"https://pith.science/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/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-18T21:42:19Z","links":{"resolver":"https://pith.science/pith/QLEVSY6YCEEJ6UXMOGB75KZO42","bundle":"https://pith.science/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/bundle.json","state":"https://pith.science/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLEVSY6YCEEJ6UXMOGB75KZO42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QLEVSY6YCEEJ6UXMOGB75KZO42","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":"ef620afcb36c2031d307cb13d4102944e7851e42749e0259bec999c5036989b2","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-07-14T13:57:12Z","title_canon_sha256":"eb775f0508c18e7396a5854448c6684da7d5e6005db988efc022cb3f004197d5"},"schema_version":"1.0","source":{"id":"2007.07040","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07040","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07040v4","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07040","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"QLEVSY6YCEEJ","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_16","alias_value":"QLEVSY6YCEEJ6UXM","created_at":"2026-07-05T05:55:37Z"},{"alias_kind":"pith_short_8","alias_value":"QLEVSY6Y","created_at":"2026-07-05T05:55:37Z"}],"graph_snapshots":[{"event_id":"sha256:e082698d5fbb9883ba4f354939e987c0b8a973184b707758af61aa7e293f1ec8","target":"graph","created_at":"2026-07-05T05:55:37Z","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/2007.07040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations. Finding methods that achieve useful quantum improvements under size limitations is thus a key question in the field. In this vein, it was recently shown that a hybrid classical-quantum method can help provide polynomial speed-ups to classical divide-and-conquer algorithms, even when only given access to a quantum computer much smaller than the problem itself. In this work, we study the hybrid divide-and-conquer method in the context of tree search algorithms, and e","authors_text":"Alfons Laarman, Mathys Rennela, Sebastiaan Brand, Vedran Dunjko","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-07-14T13:57:12Z","title":"Hybrid divide-and-conquer approach for tree search algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07040","kind":"arxiv","version":4},"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:9b891e52efb64bd0bbe5e64c2314fc591366f82181ef5dfbee47b01f8c1c0b7a","target":"record","created_at":"2026-07-05T05:55:37Z","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":"ef620afcb36c2031d307cb13d4102944e7851e42749e0259bec999c5036989b2","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-07-14T13:57:12Z","title_canon_sha256":"eb775f0508c18e7396a5854448c6684da7d5e6005db988efc022cb3f004197d5"},"schema_version":"1.0","source":{"id":"2007.07040","kind":"arxiv","version":4}},"canonical_sha256":"82c95963d811089f52ec7183feab2ee68f0646edd54c50669476b9294e261808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82c95963d811089f52ec7183feab2ee68f0646edd54c50669476b9294e261808","first_computed_at":"2026-07-05T05:55:37.705867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:55:37.705867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWE9kcaztSJFb0YxZARXNSHz2TkfqPEKZM9l7WZZY9P7ZtgqvNsvqSLuKS2iuUKAHTCWvIGrkP1/xDHJbnW6Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:55:37.706334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.07040","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b891e52efb64bd0bbe5e64c2314fc591366f82181ef5dfbee47b01f8c1c0b7a","sha256:e082698d5fbb9883ba4f354939e987c0b8a973184b707758af61aa7e293f1ec8"],"state_sha256":"3993af1f94d5287bd6ebaa5e347c77996fc14fb97c1a5d39586c6d8facc0742d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wF2j8dBJpljexJpHyIeD+1Pxucu8tZWmCPbBKcZR/Mel0GBfU/JIGpfi1thJrwFqCoJ2JZ2byNFmkQkZWbZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T21:42:19.454000Z","bundle_sha256":"4ef916eb14ff5fff149e8f698b90ce3f79cd0d35f5ba22ad18a927ea7d59067b"}}