{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:77NCLM2SPEWXLVRQ4CX7HFIMAA","short_pith_number":"pith:77NCLM2S","canonical_record":{"source":{"id":"1704.06774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-22T09:52:09Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"01e590736efd0b2c9926ad3cabc0179487f27fbe264aba635923ccf4e13d2998","abstract_canon_sha256":"ba875aa8d3ad513b3486605c3d1a8ee0967df4d6879432cf7df257ca80b140d4"},"schema_version":"1.0"},"canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","source":{"kind":"arxiv","id":"1704.06774","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06774","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06774v3","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06774","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"77NCLM2SPEWX","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_16","alias_value":"77NCLM2SPEWXLVRQ","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_8","alias_value":"77NCLM2S","created_at":"2026-07-05T05:28:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:77NCLM2SPEWXLVRQ4CX7HFIMAA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-22T09:52:09Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"01e590736efd0b2c9926ad3cabc0179487f27fbe264aba635923ccf4e13d2998","abstract_canon_sha256":"ba875aa8d3ad513b3486605c3d1a8ee0967df4d6879432cf7df257ca80b140d4"},"schema_version":"1.0"},"canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:39.817874Z","signature_b64":"T+A+Jbpc0N6yIjcZIAH04UVWRCtoQjw8KJzQvFZ7qxfGxHqvpGsXpey4sPR6MlYTq9VhwT/K68YqiAJbpc9TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","last_reissued_at":"2026-07-05T05:28:39.817522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:39.817522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06774","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-07-05T05:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JV2ZTJfCW2emlcdRU94AMGjUUWeVPVrmGvbe2smLdy1QYyATR5ScIq0CAcHYWx1OJ/L3r+MP15P1Jppph9VuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:03:34.590235Z"},"content_sha256":"75b41b72f67171432c0cc2e580893f1be7ed629061a3f49e0bf6ae765ffa916e","schema_version":"1.0","event_id":"sha256:75b41b72f67171432c0cc2e580893f1be7ed629061a3f49e0bf6ae765ffa916e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:77NCLM2SPEWXLVRQ4CX7HFIMAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Martins Kokainis","submitted_at":"2017-04-22T09:52:09Z","abstract_excerpt":"We study quantum algorithms on search trees of unknown structure, in a model where the tree can be discovered by local exploration. That is, we are given the root of the tree and access to a black box which, given a vertex $v$, outputs the children of $v$.\n  We construct a quantum algorithm which, given such access to a search tree of depth at most $n$, estimates the size of the tree $T$ within a factor of $1\\pm \\delta$ in $\\tilde{O}(\\sqrt{nT})$ steps. More generally, the same algorithm can be used to estimate size of directed acyclic graphs (DAGs) in a similar model.\n  We then show two applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06774","kind":"arxiv","version":3},"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/1704.06774/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:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sv9vbOOFQiUroiYGL7K/86mYKmWySb15Xj9EAr11km+9jP+Pgy7c4Mac6XU9OCO4lT6qJZgHIPYfVMf9bNMHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:03:34.590965Z"},"content_sha256":"f7afc85a2c2f7844abcd926785b31a1c3387fd1552b678f4eead858c0afa3e88","schema_version":"1.0","event_id":"sha256:f7afc85a2c2f7844abcd926785b31a1c3387fd1552b678f4eead858c0afa3e88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/bundle.json","state_url":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/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-07T06:03:34Z","links":{"resolver":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA","bundle":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/bundle.json","state":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:77NCLM2SPEWXLVRQ4CX7HFIMAA","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":"ba875aa8d3ad513b3486605c3d1a8ee0967df4d6879432cf7df257ca80b140d4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-22T09:52:09Z","title_canon_sha256":"01e590736efd0b2c9926ad3cabc0179487f27fbe264aba635923ccf4e13d2998"},"schema_version":"1.0","source":{"id":"1704.06774","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06774","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06774v3","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06774","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"77NCLM2SPEWX","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_16","alias_value":"77NCLM2SPEWXLVRQ","created_at":"2026-07-05T05:28:39Z"},{"alias_kind":"pith_short_8","alias_value":"77NCLM2S","created_at":"2026-07-05T05:28:39Z"}],"graph_snapshots":[{"event_id":"sha256:f7afc85a2c2f7844abcd926785b31a1c3387fd1552b678f4eead858c0afa3e88","target":"graph","created_at":"2026-07-05T05:28:39Z","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/1704.06774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study quantum algorithms on search trees of unknown structure, in a model where the tree can be discovered by local exploration. That is, we are given the root of the tree and access to a black box which, given a vertex $v$, outputs the children of $v$.\n  We construct a quantum algorithm which, given such access to a search tree of depth at most $n$, estimates the size of the tree $T$ within a factor of $1\\pm \\delta$ in $\\tilde{O}(\\sqrt{nT})$ steps. More generally, the same algorithm can be used to estimate size of directed acyclic graphs (DAGs) in a similar model.\n  We then show two applic","authors_text":"Andris Ambainis, Martins Kokainis","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-22T09:52:09Z","title":"Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06774","kind":"arxiv","version":3},"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:75b41b72f67171432c0cc2e580893f1be7ed629061a3f49e0bf6ae765ffa916e","target":"record","created_at":"2026-07-05T05:28:39Z","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":"ba875aa8d3ad513b3486605c3d1a8ee0967df4d6879432cf7df257ca80b140d4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-22T09:52:09Z","title_canon_sha256":"01e590736efd0b2c9926ad3cabc0179487f27fbe264aba635923ccf4e13d2998"},"schema_version":"1.0","source":{"id":"1704.06774","kind":"arxiv","version":3}},"canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","first_computed_at":"2026-07-05T05:28:39.817522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:28:39.817522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T+A+Jbpc0N6yIjcZIAH04UVWRCtoQjw8KJzQvFZ7qxfGxHqvpGsXpey4sPR6MlYTq9VhwT/K68YqiAJbpc9TDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:28:39.817874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06774","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75b41b72f67171432c0cc2e580893f1be7ed629061a3f49e0bf6ae765ffa916e","sha256:f7afc85a2c2f7844abcd926785b31a1c3387fd1552b678f4eead858c0afa3e88"],"state_sha256":"8768d1211edeb3a10d226e6950b728a071af8b9e65da1335551e5429f081bd72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"564hHLFo4Qy1hqxYMR1uisXTk2GOxWdSe1rsLmzD8oUGpVyBoKQaT0F+11avRLA+2p/X2ORFPc9GgTLOPMbXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:03:34.595045Z","bundle_sha256":"9d9f52a0767f0d3771d78462aa726ac12846ea2eb848fbadbf64bba8192d192c"}}