{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:77NCLM2SPEWXLVRQ4CX7HFIMAA","short_pith_number":"pith:77NCLM2S","schema_version":"1.0","canonical_sha256":"ffda25b352792d75d630e0aff3950c002ef862687e31593ca6a31b0e5ae70505","source":{"kind":"arxiv","id":"1704.06774","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.06774","created_at":"2026-07-05T05:28:39.817576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06774v3","created_at":"2026-07-05T05:28:39.817576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06774","created_at":"2026-07-05T05:28:39.817576+00:00"},{"alias_kind":"pith_short_12","alias_value":"77NCLM2SPEWX","created_at":"2026-07-05T05:28:39.817576+00:00"},{"alias_kind":"pith_short_16","alias_value":"77NCLM2SPEWXLVRQ","created_at":"2026-07-05T05:28:39.817576+00:00"},{"alias_kind":"pith_short_8","alias_value":"77NCLM2S","created_at":"2026-07-05T05:28:39.817576+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/77NCLM2SPEWXLVRQ4CX7HFIMAA","json":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA.json","graph_json":"https://pith.science/api/pith-number/77NCLM2SPEWXLVRQ4CX7HFIMAA/graph.json","events_json":"https://pith.science/api/pith-number/77NCLM2SPEWXLVRQ4CX7HFIMAA/events.json","paper":"https://pith.science/paper/77NCLM2S"},"agent_actions":{"view_html":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA","download_json":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA.json","view_paper":"https://pith.science/paper/77NCLM2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06774&json=true","fetch_graph":"https://pith.science/api/pith-number/77NCLM2SPEWXLVRQ4CX7HFIMAA/graph.json","fetch_events":"https://pith.science/api/pith-number/77NCLM2SPEWXLVRQ4CX7HFIMAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/action/storage_attestation","attest_author":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/action/author_attestation","sign_citation":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/action/citation_signature","submit_replication":"https://pith.science/pith/77NCLM2SPEWXLVRQ4CX7HFIMAA/action/replication_record"}},"created_at":"2026-07-05T05:28:39.817576+00:00","updated_at":"2026-07-05T05:28:39.817576+00:00"}