{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SBLGWAEKWWAHP5QYIBDDPHIFZX","short_pith_number":"pith:SBLGWAEK","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"},"canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","source":{"kind":"arxiv","id":"1711.01623","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01623","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01623v3","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01623","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"SBLGWAEKWWAH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBLGWAEKWWAHP5QY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBLGWAEK","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SBLGWAEKWWAHP5QYIBDDPHIFZX","target":"record","payload":{"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"},"canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","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"},"source_kind":"arxiv","source_id":"1711.01623","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHF1ae4Pw2JvRYDjI/SOt2xbikXGV6f3D4uepcJUawKmKtg/ZAHFOLcrNd6Vi841gwdZFiTUjskdg7PIbAu0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:37:06.538331Z"},"content_sha256":"8a1861e85e4ebfcd011e63d359e33d3f3bb5a13a00175db761aeb03cab4f945c","schema_version":"1.0","event_id":"sha256:8a1861e85e4ebfcd011e63d359e33d3f3bb5a13a00175db761aeb03cab4f945c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SBLGWAEKWWAHP5QYIBDDPHIFZX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7c62i17ETooPqwATmZno16JkIKng54HJk377tZV56lJoyja2K3hFgHBiGrO8/e+9dp9R+6yIghrzqR/uLQUuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:37:06.538972Z"},"content_sha256":"0dda2f427e670b9cad33b604a5e2ada6b159725de2fd78b9defe696b31bf959b","schema_version":"1.0","event_id":"sha256:0dda2f427e670b9cad33b604a5e2ada6b159725de2fd78b9defe696b31bf959b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/bundle.json","state_url":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T14:37:06Z","links":{"resolver":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX","bundle":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/bundle.json","state":"https://pith.science/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBLGWAEKWWAHP5QYIBDDPHIFZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SBLGWAEKWWAHP5QYIBDDPHIFZX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad84adf577f6a3fa619655cdae3a5bd7ba9175aa7c0ea1cb1fb8e68d3dca1157","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:45:37Z","title_canon_sha256":"9b9718664e1c398221f498bb006129fe753b05849c4453d2b0272008c546444c"},"schema_version":"1.0","source":{"id":"1711.01623","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01623","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01623v3","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01623","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"SBLGWAEKWWAH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBLGWAEKWWAHP5QY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBLGWAEK","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:0dda2f427e670b9cad33b604a5e2ada6b159725de2fd78b9defe696b31bf959b","target":"graph","created_at":"2026-05-18T00:28:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amir Abboud, Christoph Lenzen, Keren Censor-Hillel, Seri Khoury","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:45:37Z","title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01623","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a1861e85e4ebfcd011e63d359e33d3f3bb5a13a00175db761aeb03cab4f945c","target":"record","created_at":"2026-05-18T00:28:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad84adf577f6a3fa619655cdae3a5bd7ba9175aa7c0ea1cb1fb8e68d3dca1157","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:45:37Z","title_canon_sha256":"9b9718664e1c398221f498bb006129fe753b05849c4453d2b0272008c546444c"},"schema_version":"1.0","source":{"id":"1711.01623","kind":"arxiv","version":3}},"canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90566b008ab58077f6184046379d05cdfd3ab097a9f6381059b895bf1d0e698d","first_computed_at":"2026-05-18T00:28:04.410542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:04.410542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKjrJ84j2R9F47tdikYiO3oktB+8PtaL36Vw1VXBSqFQxGBDA9YLCLfC6qQpylxmRxpfJEj5fsZ9OgGM3rEcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:04.411203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01623","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a1861e85e4ebfcd011e63d359e33d3f3bb5a13a00175db761aeb03cab4f945c","sha256:0dda2f427e670b9cad33b604a5e2ada6b159725de2fd78b9defe696b31bf959b"],"state_sha256":"f57bf9e895b5e3fecea24131c5c0f80d839efa356e3217072fad7e39cda1f487"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmvBL8bNUAk16LEfwENoIT1Tcy/I3O68VHZrmyTnCt0l0hk7/rT6y8o+FET50D68XrwFENHsMgRWRJhcto0UDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:37:06.542234Z","bundle_sha256":"be5ce92afafed644f8a586d7c14a52b00e830c93ad7e9deb76e3c5facbc5f98f"}}