{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4AZIB3DJF3F5KFC2WTFRO26A4Z","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":"8555a8079d475d0fe681aa276d84d393722fc885a7edbf52d78c541fd7b88042","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-06T21:01:07Z","title_canon_sha256":"0a3614935b1de2ee1a4e02bd3ed32fa9d4f4752f6aed83dfcfd87a6dccba1ca4"},"schema_version":"1.0","source":{"id":"1511.02235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02235","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02235v2","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02235","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"4AZIB3DJF3F5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4AZIB3DJF3F5KFC2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4AZIB3DJ","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:75e30b1c2fc9a10a539f56224fe3a559d35c0e35e136154a0926be4be262e670","target":"graph","created_at":"2026-05-18T00:46:59Z","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"},"paper":{"abstract_excerpt":"We show that the quantum query complexity of evaluating NAND-tree instances with average choice complexity at most $W$ is $O(W)$, where average choice complexity is a measure of the difficulty of winning the associated two-player game. This generalizes a superpolynomial speedup over classical query complexity due to Zhan et al. [Zhan et al., ITCS 2012, 249-265]. We further show that the player with a winning strategy for the two-player game associated with the NAND-tree can win the game with an expected $\\widetilde{O}(N^{1/4}\\sqrt{{\\cal C}(x)})$ quantum queries against a random opponent, where","authors_text":"Shelby Kimmel, Stacey Jeffery","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-06T21:01:07Z","title":"NAND-Trees, Average Choice Complexity, and Effective Resistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02235","kind":"arxiv","version":2},"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:c81e1bf3e3687fecccab35a4a64c4ac4e412829fae0928580451ec1f812cbc6b","target":"record","created_at":"2026-05-18T00:46:59Z","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":"8555a8079d475d0fe681aa276d84d393722fc885a7edbf52d78c541fd7b88042","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-06T21:01:07Z","title_canon_sha256":"0a3614935b1de2ee1a4e02bd3ed32fa9d4f4752f6aed83dfcfd87a6dccba1ca4"},"schema_version":"1.0","source":{"id":"1511.02235","kind":"arxiv","version":2}},"canonical_sha256":"e03280ec692ecbd5145ab4cb176bc0e66cf826bcfd3e60d093edef6f1bdce26d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e03280ec692ecbd5145ab4cb176bc0e66cf826bcfd3e60d093edef6f1bdce26d","first_computed_at":"2026-05-18T00:46:59.819688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:59.819688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BqTIZQrCA+c521Oy3LqsG4Hxl+sklu3XMSyJyTOgwKxRkvr29sLXvs0sWnPOgLlWB7Kacu1HwRvspyAZ4mGtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:59.820242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c81e1bf3e3687fecccab35a4a64c4ac4e412829fae0928580451ec1f812cbc6b","sha256:75e30b1c2fc9a10a539f56224fe3a559d35c0e35e136154a0926be4be262e670"],"state_sha256":"bb343bb8d215be43219908b09e8607e3fc5886412325c6c8500233b1677ea790"}