{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6W6ZVF7JNM6QYGXFSIPUSSOBHE","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":"08701c8029c79d366dde58a4e7d6597fd1e573182d35eb04b9278677c9dc406b","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-21T19:54:51Z","title_canon_sha256":"aa51627543f11d2f2b5579406add8db871b84dee57c61f8744e31eff2fc19815"},"schema_version":"1.0","source":{"id":"1509.06361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06361","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06361v2","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06361","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"6W6ZVF7JNM6Q","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6W6ZVF7JNM6QYGXF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6W6ZVF7J","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:57f9b9ab9b48e83730462fde938a83b232b67346a4021ce58da6ae23a04b9f25","target":"graph","created_at":"2026-05-18T01:32:20Z","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":"Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this paper we show:\n  \\[Q(f_H) = \\Omega\\left(\\sqrt{\\alpha_H \\cdot n}\\right),\\] where $Q(f_H)$ denotes the quantum query complexity of $f_H$.\n  As a consequence we obtain a lower bounds for $Q(f_H)$ in terms of several other parameters of $H$ such as the average degree, minimum vertex cover, chromatic number, and the critical probability.\n  We also use the above bound","authors_text":"Raghav Kulkarni, Supartha Podder","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-21T19:54:51Z","title":"Quantum Query Complexity of Subgraph Isomorphism and Homomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06361","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:e56762cf5824fbfdf8481b413cfd58c1f9cf9e8bdd3458bf868a859ed0f44110","target":"record","created_at":"2026-05-18T01:32:20Z","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":"08701c8029c79d366dde58a4e7d6597fd1e573182d35eb04b9278677c9dc406b","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-21T19:54:51Z","title_canon_sha256":"aa51627543f11d2f2b5579406add8db871b84dee57c61f8744e31eff2fc19815"},"schema_version":"1.0","source":{"id":"1509.06361","kind":"arxiv","version":2}},"canonical_sha256":"f5bd9a97e96b3d0c1ae5921f4949c1392a11ec6ac7b617274a4ec987ac98a200","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5bd9a97e96b3d0c1ae5921f4949c1392a11ec6ac7b617274a4ec987ac98a200","first_computed_at":"2026-05-18T01:32:20.487785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:20.487785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZpZChm9b3wde1wqY4hb70XBe0Ik5/2GrcM50iOl1FZWPpMD8Yr7N+i3hnjZ2xoUT+NhWvXMCtDsfDzpqMeVpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:20.488649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e56762cf5824fbfdf8481b413cfd58c1f9cf9e8bdd3458bf868a859ed0f44110","sha256:57f9b9ab9b48e83730462fde938a83b232b67346a4021ce58da6ae23a04b9f25"],"state_sha256":"a7f3ec134c8c1f503a66f91fb3c4d68e12923610f85228f969d22aae176db6d2"}