{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PWKBJBPUWMYCLWC7COI656RTMX","short_pith_number":"pith:PWKBJBPU","schema_version":"1.0","canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","source":{"kind":"arxiv","id":"1305.1021","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Quantum Query Complexity of Graph Collision","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs, Kaspars Balodis, Raitis Ozols","submitted_at":"2013-05-05T15:40:13Z","abstract_excerpt":"We present three new quantum algorithms in the quantum query model for \\textsc{graph-collision} problem: \\begin{itemize} \\item an algorithm based on tree decomposition that uses $O\\left(\\sqrt{n}t^{\\sfrac{1}{6}}\\right)$ queries where $t$ is the treewidth of the graph; \\item an algorithm constructed on a span program that improves a result by Gavinsky and Ito. The algorithm uses $O(\\sqrt{n}+\\sqrt{\\alpha^{**}})$ queries, where $\\alpha^{**}(G)$ is a graph parameter defined by \\[\\alpha^{**}(G):=\\min_{VC\\text{-- vertex cover of}G}{\\max_{\\substack{I\\subseteq VC\\\\I\\text{-- independent set}}}{\\sum_{v\\i"},"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":"1305.1021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2013-05-05T15:40:13Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"2cd84bed5b386eff1d6631eb26c2a43f9c0cb6a506e0c0d80f883da90280e087","abstract_canon_sha256":"0956fbd39a8f9c408fd3c49ee00cbd1a7521d55e1bc5abf9bbe92a3bc3a02e14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:31.111676Z","signature_b64":"szF6bXyrj0GdIITt3CC2h2q8U3jDH7sfQs/ueHx39vqA+ovVoWG7ZhsXQDLUxPZqAaVNZrcI2XjP+6E/mYYuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d941485f4b33025d85f1391eefa3365d27a43d8ff572ebea319f5116194c4f5","last_reissued_at":"2026-05-18T03:26:31.111210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:31.111210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Quantum Query Complexity of Graph Collision","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs, Kaspars Balodis, Raitis Ozols","submitted_at":"2013-05-05T15:40:13Z","abstract_excerpt":"We present three new quantum algorithms in the quantum query model for \\textsc{graph-collision} problem: \\begin{itemize} \\item an algorithm based on tree decomposition that uses $O\\left(\\sqrt{n}t^{\\sfrac{1}{6}}\\right)$ queries where $t$ is the treewidth of the graph; \\item an algorithm constructed on a span program that improves a result by Gavinsky and Ito. The algorithm uses $O(\\sqrt{n}+\\sqrt{\\alpha^{**}})$ queries, where $\\alpha^{**}(G)$ is a graph parameter defined by \\[\\alpha^{**}(G):=\\min_{VC\\text{-- vertex cover of}G}{\\max_{\\substack{I\\subseteq VC\\\\I\\text{-- independent set}}}{\\sum_{v\\i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1021","kind":"arxiv","version":1},"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":"1305.1021","created_at":"2026-05-18T03:26:31.111285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1021v1","created_at":"2026-05-18T03:26:31.111285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1021","created_at":"2026-05-18T03:26:31.111285+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWKBJBPUWMYC","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWKBJBPUWMYCLWC7","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWKBJBPU","created_at":"2026-05-18T12:27:57.521954+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/PWKBJBPUWMYCLWC7COI656RTMX","json":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX.json","graph_json":"https://pith.science/api/pith-number/PWKBJBPUWMYCLWC7COI656RTMX/graph.json","events_json":"https://pith.science/api/pith-number/PWKBJBPUWMYCLWC7COI656RTMX/events.json","paper":"https://pith.science/paper/PWKBJBPU"},"agent_actions":{"view_html":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX","download_json":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX.json","view_paper":"https://pith.science/paper/PWKBJBPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1021&json=true","fetch_graph":"https://pith.science/api/pith-number/PWKBJBPUWMYCLWC7COI656RTMX/graph.json","fetch_events":"https://pith.science/api/pith-number/PWKBJBPUWMYCLWC7COI656RTMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/action/storage_attestation","attest_author":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/action/author_attestation","sign_citation":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/action/citation_signature","submit_replication":"https://pith.science/pith/PWKBJBPUWMYCLWC7COI656RTMX/action/replication_record"}},"created_at":"2026-05-18T03:26:31.111285+00:00","updated_at":"2026-05-18T03:26:31.111285+00:00"}