{"paper":{"title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Christoph Lenzen, Keren Censor-Hillel, Seri Khoury","submitted_at":"2017-11-05T17:45:37Z","abstract_excerpt":"We introduce a novel lower bound technique for distributed graph algorithms under bandwidth limitations.\n  We define the notion of \\emph{fooling views} and exemplify its strength by proving two new lower bounds for triangle membership in the CONGEST(B) model:\n  (i) Any $1$-round algorithm requires $B\\geq c\\Delta \\log n$ for a constant $c>0$.\n  (ii) If $B=1$, even in constant-degree graphs any algorithm must take $\\Omega(\\log^* n)$ rounds.\n  The implication of the former is the first proven separation between the LOCAL and the CONGEST models for deterministic triangle membership.\n  The latter r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01623","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":""},"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"}