{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3UGLEWZBTW7ABMMG5JI5HLXROA","short_pith_number":"pith:3UGLEWZB","schema_version":"1.0","canonical_sha256":"dd0cb25b219dbe00b186ea51d3aef1700ee5deaab07fc486f7fac7ad14179ae7","source":{"kind":"arxiv","id":"1109.4165","version":2},"attestation_state":"computed","paper":{"title":"Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yechao Zhu","submitted_at":"2011-09-19T20:23:09Z","abstract_excerpt":"We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether an $ n $-vertex graph contains a triangle, clique or star of some size. For a general subgraph $ H $ with $ k $ vertices, we show that $ H $ containment can be solved with quantum query complexity $ O(n^{2-\\frac{2}{k}-g(H)}) $, with $ g(H) $ a strictly positive function of $ H $. This is better than $ \\tilde{O}\\s{n^{2-2/k}} $ by Magniez et al. These results are obtained in the learning graph model of Belovs."},"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":"1109.4165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-19T20:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"583e8994eca64ba3884d2f0c9115a13dcceb1f2805c441a18110df822b853e2e","abstract_canon_sha256":"c9de7b425bd26a0a54dc4101d44496194db056d9429c3f113e11ca3bdf44706f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:36.582452Z","signature_b64":"qxxyxM8oWI6ZES5OWcJg4PxB5RHPOriO68bKctSaAOKf3s7R3JwFoOOtHdv8RAC1S/NSyPkj/5lZLSB5yhyrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd0cb25b219dbe00b186ea51d3aef1700ee5deaab07fc486f7fac7ad14179ae7","last_reissued_at":"2026-05-18T03:51:36.582004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:36.582004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yechao Zhu","submitted_at":"2011-09-19T20:23:09Z","abstract_excerpt":"We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether an $ n $-vertex graph contains a triangle, clique or star of some size. For a general subgraph $ H $ with $ k $ vertices, we show that $ H $ containment can be solved with quantum query complexity $ O(n^{2-\\frac{2}{k}-g(H)}) $, with $ g(H) $ a strictly positive function of $ H $. This is better than $ \\tilde{O}\\s{n^{2-2/k}} $ by Magniez et al. These results are obtained in the learning graph model of Belovs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4165","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1109.4165","created_at":"2026-05-18T03:51:36.582058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4165v2","created_at":"2026-05-18T03:51:36.582058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4165","created_at":"2026-05-18T03:51:36.582058+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UGLEWZBTW7A","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UGLEWZBTW7ABMMG","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UGLEWZB","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":126,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09017","citing_title":"Quantum algorithms for path and cycle containment problems","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA","json":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA.json","graph_json":"https://pith.science/api/pith-number/3UGLEWZBTW7ABMMG5JI5HLXROA/graph.json","events_json":"https://pith.science/api/pith-number/3UGLEWZBTW7ABMMG5JI5HLXROA/events.json","paper":"https://pith.science/paper/3UGLEWZB"},"agent_actions":{"view_html":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA","download_json":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA.json","view_paper":"https://pith.science/paper/3UGLEWZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4165&json=true","fetch_graph":"https://pith.science/api/pith-number/3UGLEWZBTW7ABMMG5JI5HLXROA/graph.json","fetch_events":"https://pith.science/api/pith-number/3UGLEWZBTW7ABMMG5JI5HLXROA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA/action/storage_attestation","attest_author":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA/action/author_attestation","sign_citation":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA/action/citation_signature","submit_replication":"https://pith.science/pith/3UGLEWZBTW7ABMMG5JI5HLXROA/action/replication_record"}},"created_at":"2026-05-18T03:51:36.582058+00:00","updated_at":"2026-05-18T03:51:36.582058+00:00"}