{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:5PCAQQBYGQ4C6GWYJOS6TIKUSJ","short_pith_number":"pith:5PCAQQBY","schema_version":"1.0","canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","source":{"kind":"arxiv","id":"quant-ph/0310134","version":3},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for the Triangle Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Magniez, Mario Szegedy, Miklos Santha","submitted_at":"2003-10-21T16:26:16Z","abstract_excerpt":"We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\\cite{gro96}. The first algorithm uses only $O(\\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Pr"},"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":"quant-ph/0310134","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"4cace214907e1f8e1ba8679ef7441acc02333f8db2c04420fb544d6dfcbfaeb9","abstract_canon_sha256":"9e55e0ef5580b19572c5f0fd9d62164823dae52660f4c31d751905afb785141d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:49:45.668739Z","signature_b64":"R5KQ5D3fKmzrZzaW0+Byc7jbm3Oz+795w9Am+ktHiYlfU3xC+r27XzdZulFLNpVp49PVH49WD8PC/WHdlo76Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","last_reissued_at":"2026-07-04T14:49:45.668347Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:49:45.668347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for the Triangle Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Magniez, Mario Szegedy, Miklos Santha","submitted_at":"2003-10-21T16:26:16Z","abstract_excerpt":"We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\\cite{gro96}. The first algorithm uses only $O(\\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0310134/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":"quant-ph/0310134","created_at":"2026-07-04T14:49:45.668402+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310134v3","created_at":"2026-07-04T14:49:45.668402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310134","created_at":"2026-07-04T14:49:45.668402+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PCAQQBYGQ4C","created_at":"2026-07-04T14:49:45.668402+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PCAQQBYGQ4C6GWY","created_at":"2026-07-04T14:49:45.668402+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PCAQQBY","created_at":"2026-07-04T14:49:45.668402+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":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ","json":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ.json","graph_json":"https://pith.science/api/pith-number/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/graph.json","events_json":"https://pith.science/api/pith-number/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/events.json","paper":"https://pith.science/paper/5PCAQQBY"},"agent_actions":{"view_html":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ","download_json":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ.json","view_paper":"https://pith.science/paper/5PCAQQBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0310134&json=true","fetch_graph":"https://pith.science/api/pith-number/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/action/storage_attestation","attest_author":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/action/author_attestation","sign_citation":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/action/citation_signature","submit_replication":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/action/replication_record"}},"created_at":"2026-07-04T14:49:45.668402+00:00","updated_at":"2026-07-04T14:49:45.668402+00:00"}