{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CQVRYISCZUHIEFH72I3BGH3MWX","short_pith_number":"pith:CQVRYISC","schema_version":"1.0","canonical_sha256":"142b1c2242cd0e8214ffd236131f6cb5e0cefa6d1967a517f1d391524a21360c","source":{"kind":"arxiv","id":"1109.5135","version":3},"attestation_state":"computed","paper":{"title":"A learning graph based quantum query algorithm for finding constant-size subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Frederic Magniez, Miklos Santha, Troy Lee","submitted_at":"2011-09-23T17:27:24Z","abstract_excerpt":"Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity of determining if an $n$-vertex graph contains $H$ as a subgraph is $O(n^{2-2/k-t})$, where $ t = \\max{\\frac{k^2- 2(m+1)}{k(k+1)(m+1)}, \\frac{2k - d - 3}{k(d+1)(m-d+2)}}$. The previous best algorithm of Magniez et al. had complexity $\\widetilde O(n^{2-2/k})$."},"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.5135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-23T17:27:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"54c87c71e4f98c80d72697a1fcf412cfaf3db16b25319d799262a36898d56465","abstract_canon_sha256":"51da373f3c366e7f959809a496fdd89ecbf60159a041db40293ce1cbf2ff7753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:31.672876Z","signature_b64":"lrAWIi5KzDEQp+zh3gDicOkIXz0HF9oC7e+R0qry2McRZM6rNz0nUj4YQl77NvNVTxHI5LApY82Bjl6tvGc/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142b1c2242cd0e8214ffd236131f6cb5e0cefa6d1967a517f1d391524a21360c","last_reissued_at":"2026-05-18T03:46:31.671624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:31.671624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A learning graph based quantum query algorithm for finding constant-size subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Frederic Magniez, Miklos Santha, Troy Lee","submitted_at":"2011-09-23T17:27:24Z","abstract_excerpt":"Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity of determining if an $n$-vertex graph contains $H$ as a subgraph is $O(n^{2-2/k-t})$, where $ t = \\max{\\frac{k^2- 2(m+1)}{k(k+1)(m+1)}, \\frac{2k - d - 3}{k(d+1)(m-d+2)}}$. The previous best algorithm of Magniez et al. had complexity $\\widetilde O(n^{2-2/k})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5135","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":""},"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.5135","created_at":"2026-05-18T03:46:31.671780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5135v3","created_at":"2026-05-18T03:46:31.671780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5135","created_at":"2026-05-18T03:46:31.671780+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQVRYISCZUHI","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQVRYISCZUHIEFH7","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQVRYISC","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":120,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX","json":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX.json","graph_json":"https://pith.science/api/pith-number/CQVRYISCZUHIEFH72I3BGH3MWX/graph.json","events_json":"https://pith.science/api/pith-number/CQVRYISCZUHIEFH72I3BGH3MWX/events.json","paper":"https://pith.science/paper/CQVRYISC"},"agent_actions":{"view_html":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX","download_json":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX.json","view_paper":"https://pith.science/paper/CQVRYISC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5135&json=true","fetch_graph":"https://pith.science/api/pith-number/CQVRYISCZUHIEFH72I3BGH3MWX/graph.json","fetch_events":"https://pith.science/api/pith-number/CQVRYISCZUHIEFH72I3BGH3MWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX/action/storage_attestation","attest_author":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX/action/author_attestation","sign_citation":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX/action/citation_signature","submit_replication":"https://pith.science/pith/CQVRYISCZUHIEFH72I3BGH3MWX/action/replication_record"}},"created_at":"2026-05-18T03:46:31.671780+00:00","updated_at":"2026-05-18T03:46:31.671780+00:00"}