{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P3XNPGNVSBHGPZYB2DLH43TMTS","short_pith_number":"pith:P3XNPGNV","schema_version":"1.0","canonical_sha256":"7eeed799b5904e67e701d0d67e6e6c9cbe7f5ad8d4d48c6a537a865c3b8400a4","source":{"kind":"arxiv","id":"1407.0085","version":2},"attestation_state":"computed","paper":{"title":"Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall","submitted_at":"2014-07-01T00:46:14Z","abstract_excerpt":"In this paper we present a quantum algorithm solving the triangle finding problem in unweighted graphs with query complexity $\\tilde O(n^{5/4})$, where $n$ denotes the number of vertices in the graph. This improves the previous upper bound $O(n^{9/7})=O(n^{1.285...})$ recently obtained by Lee, Magniez and Santha. Our result shows, for the first time, that in the quantum query complexity setting unweighted triangle finding is easier than its edge-weighted version, since for finding an edge-weighted triangle Belovs and Rosmanis proved that any quantum algorithm requires $\\Omega(n^{9/7}/\\sqrt{\\lo"},"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":"1407.0085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-01T00:46:14Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"6c3a37af93a8feed004223dddd42a367e56b454cb43ea3658f761ec45935b3c5","abstract_canon_sha256":"53f8276684b72084c13385f3e42f48e2e318574e1e77297d691600c185521b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:36.722335Z","signature_b64":"fcp4nG9Jhl3VBAdWlpA7DywKXrV9c4UWA9EtrnkstFWm2PuerpDEHP2NEJWSURCggCgCISN+u58Q7KMFUemcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eeed799b5904e67e701d0d67e6e6c9cbe7f5ad8d4d48c6a537a865c3b8400a4","last_reissued_at":"2026-07-05T03:19:36.721947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:36.721947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall","submitted_at":"2014-07-01T00:46:14Z","abstract_excerpt":"In this paper we present a quantum algorithm solving the triangle finding problem in unweighted graphs with query complexity $\\tilde O(n^{5/4})$, where $n$ denotes the number of vertices in the graph. This improves the previous upper bound $O(n^{9/7})=O(n^{1.285...})$ recently obtained by Lee, Magniez and Santha. Our result shows, for the first time, that in the quantum query complexity setting unweighted triangle finding is easier than its edge-weighted version, since for finding an edge-weighted triangle Belovs and Rosmanis proved that any quantum algorithm requires $\\Omega(n^{9/7}/\\sqrt{\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0085","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1407.0085/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1407.0085","created_at":"2026-07-05T03:19:36.722007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0085v2","created_at":"2026-07-05T03:19:36.722007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0085","created_at":"2026-07-05T03:19:36.722007+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3XNPGNVSBHG","created_at":"2026-07-05T03:19:36.722007+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3XNPGNVSBHGPZYB","created_at":"2026-07-05T03:19:36.722007+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3XNPGNV","created_at":"2026-07-05T03:19:36.722007+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS","json":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS.json","graph_json":"https://pith.science/api/pith-number/P3XNPGNVSBHGPZYB2DLH43TMTS/graph.json","events_json":"https://pith.science/api/pith-number/P3XNPGNVSBHGPZYB2DLH43TMTS/events.json","paper":"https://pith.science/paper/P3XNPGNV"},"agent_actions":{"view_html":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS","download_json":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS.json","view_paper":"https://pith.science/paper/P3XNPGNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0085&json=true","fetch_graph":"https://pith.science/api/pith-number/P3XNPGNVSBHGPZYB2DLH43TMTS/graph.json","fetch_events":"https://pith.science/api/pith-number/P3XNPGNVSBHGPZYB2DLH43TMTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS/action/storage_attestation","attest_author":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS/action/author_attestation","sign_citation":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS/action/citation_signature","submit_replication":"https://pith.science/pith/P3XNPGNVSBHGPZYB2DLH43TMTS/action/replication_record"}},"created_at":"2026-07-05T03:19:36.722007+00:00","updated_at":"2026-07-05T03:19:36.722007+00:00"}