{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SBLGWAEKWWAHP5QYIBDDPHIFZX","short_pith_number":"pith:SBLGWAEK","schema_version":"1.0","canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","source":{"kind":"arxiv","id":"1711.01623","version":3},"attestation_state":"computed","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"},"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":"1711.01623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:45:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9b9718664e1c398221f498bb006129fe753b05849c4453d2b0272008c546444c","abstract_canon_sha256":"ad84adf577f6a3fa619655cdae3a5bd7ba9175aa7c0ea1cb1fb8e68d3dca1157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:04.411203Z","signature_b64":"yKjrJ84j2R9F47tdikYiO3oktB+8PtaL36Vw1VXBSqFQxGBDA9YLCLfC6qQpylxmRxpfJEj5fsZ9OgGM3rEcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","last_reissued_at":"2026-05-18T00:28:04.410542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:04.410542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01623","created_at":"2026-05-18T00:28:04.410647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01623v3","created_at":"2026-05-18T00:28:04.410647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01623","created_at":"2026-05-18T00:28:04.410647+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBLGWAEKWWAH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBLGWAEKWWAHP5QY","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBLGWAEK","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX","json":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX.json","graph_json":"https://pith.science/api/pith-number/SBLGWAEKWWAHP5QYIBDDPHIFZX/graph.json","events_json":"https://pith.science/api/pith-number/SBLGWAEKWWAHP5QYIBDDPHIFZX/events.json","paper":"https://pith.science/paper/SBLGWAEK"},"agent_actions":{"view_html":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX","download_json":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX.json","view_paper":"https://pith.science/paper/SBLGWAEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01623&json=true","fetch_graph":"https://pith.science/api/pith-number/SBLGWAEKWWAHP5QYIBDDPHIFZX/graph.json","fetch_events":"https://pith.science/api/pith-number/SBLGWAEKWWAHP5QYIBDDPHIFZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/action/storage_attestation","attest_author":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/action/author_attestation","sign_citation":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/action/citation_signature","submit_replication":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/action/replication_record"}},"created_at":"2026-05-18T00:28:04.410647+00:00","updated_at":"2026-05-18T00:28:04.410647+00:00"}