Pith. sign in

Paper Citation Record · LEDGER

Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion

As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1711.01623.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1711.01623 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T10:29:26.670428Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-14T10:18:58.365733Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 83e120ee-a962-4301-89c1-f82ce24b064a · inbound

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model cites this paper.

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-14T10:29:26.670428Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T10:29:26.670428Z digest=sha256:df3d593351236bc4314e4567a4e1a05e1d87081326d177a0ca933c0e12caa1d0

Observation 427c9ae0-36b6-4362-a68b-d987ed028cba · inbound

The Communication Complexity of Set Intersection and Multiple Equality Testing cites this paper.

The Communication Complexity of Set Intersection and Multiple Equality Testing Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-14T10:18:58.373359Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-14T10:18:58.174584Z digest=sha256:e59328036c9bf7cb6cae5b89306d482abe02c9601c92b91e94a4ccdad4323f5f