{"paper":{"title":"Distributed Subgraph Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dennis Olivetti, Ioan Todinca, Ivan Rapaport, Pedro Montealegre, Pierre Fraigniaud","submitted_at":"2017-06-13T11:00:35Z","abstract_excerpt":"In the standard CONGEST model for distributed network computing, it is known that \"global\" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is $\\Omega(\\mbox{poly}(n))$ rounds in $n$-node networks with constant diameter. Surprisingly, \"local\" tasks such as detecting the presence of a 4-cycle as a subgraph also requires $\\widetilde{\\Omega}(\\sqrt{n})$ rounds, even using randomized algorithms, and the best known upper bound for detecting the presence of a 3-cycle is $\\widetilde{O}(n^{\\frac{2}{3}})$ rounds. The objective of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03996","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"}