{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3ZRK4C4CG3SYCTYE2SQ23LPVOJ","short_pith_number":"pith:3ZRK4C4C","schema_version":"1.0","canonical_sha256":"de62ae0b8236e5814f04d4a1adadf5725afe62064c7de07a98ac5374c1a629e2","source":{"kind":"arxiv","id":"1908.11488","version":2},"attestation_state":"computed","paper":{"title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Fr\\'ed\\'eric Magniez, Taisuke Izumi","submitted_at":"2019-08-30T00:10:08Z","abstract_excerpt":"This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the classical round complexity of triangle finding (as well as triangle listing) from the trivial upper bound $O(n)$ to $\\tilde O(n^{1/3})$, where~$n$ denotes the number of vertices in the graph. In this paper we present a quantum distributed algorithm that solves the triangle finding problem in $\\tilde O(n^{1/4})$ rounds in the CONGEST model. This gives another"},"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":"1908.11488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-30T00:10:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"be7295922a76eaae0ea21812c08abb6188f52f6422dc3d6f86dbb4337a2217f0","abstract_canon_sha256":"2be6d3b241d26388c4f8c3275f7a548a1763ce8dffa47045423c33748467b1e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:38.041129Z","signature_b64":"fiIDdeil3o6B6X+VruWKG2FzThSJUIUslJbfZLFPCFegh/UBxxs0KiXUrNy6O+EFPpdQdWjgNCbrbewy7OT9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de62ae0b8236e5814f04d4a1adadf5725afe62064c7de07a98ac5374c1a629e2","last_reissued_at":"2026-07-05T03:19:38.040785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:38.040785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Fr\\'ed\\'eric Magniez, Taisuke Izumi","submitted_at":"2019-08-30T00:10:08Z","abstract_excerpt":"This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the classical round complexity of triangle finding (as well as triangle listing) from the trivial upper bound $O(n)$ to $\\tilde O(n^{1/3})$, where~$n$ denotes the number of vertices in the graph. In this paper we present a quantum distributed algorithm that solves the triangle finding problem in $\\tilde O(n^{1/4})$ rounds in the CONGEST model. This gives another"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11488","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/1908.11488/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":"1908.11488","created_at":"2026-07-05T03:19:38.040842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11488v2","created_at":"2026-07-05T03:19:38.040842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11488","created_at":"2026-07-05T03:19:38.040842+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZRK4C4CG3SY","created_at":"2026-07-05T03:19:38.040842+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZRK4C4CG3SYCTYE","created_at":"2026-07-05T03:19:38.040842+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZRK4C4C","created_at":"2026-07-05T03:19:38.040842+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":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ","json":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ.json","graph_json":"https://pith.science/api/pith-number/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/graph.json","events_json":"https://pith.science/api/pith-number/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/events.json","paper":"https://pith.science/paper/3ZRK4C4C"},"agent_actions":{"view_html":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ","download_json":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ.json","view_paper":"https://pith.science/paper/3ZRK4C4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11488&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/action/storage_attestation","attest_author":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/action/author_attestation","sign_citation":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/action/citation_signature","submit_replication":"https://pith.science/pith/3ZRK4C4CG3SYCTYE2SQ23LPVOJ/action/replication_record"}},"created_at":"2026-07-05T03:19:38.040842+00:00","updated_at":"2026-07-05T03:19:38.040842+00:00"}