Pith. sign in

Paper Citation Record · LEDGER

An XOR Lemma for Deterministic Communication Complexity

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

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

pith.paper-citation-record.v1
2407.01802 v1

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-21T06:32:19.484+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-12T17:08:49.012741Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-11T19:42:17.777037Z

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 ae0adab2-ea12-43ab-8acf-e9dcf6cd292c · inbound

Strong XOR Lemma for Information Complexity cites this paper.

Strong XOR Lemma for Information Complexity An XOR Lemma for Deterministic Communication Complexity

Reference 2007

Resolution
unresolved
no resolver link, observed 2026-08-12T17:08:49.012741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T17:08:49.012741Z digest=sha256:ae2f4a3a9fb8fb77f90364243d228a0a94bc89943ae438b6d8ae899f13ae31fc

Observation f60409b6-3fb3-443e-8aa6-85bfc641fb8b · inbound

Direct Sums for Parity Decision Trees cites this paper.

Direct Sums for Parity Decision Trees An XOR Lemma for Deterministic Communication Complexity

Reference 33

Resolution
verified exact
local_arxiv, observed 2026-08-11T19:42:17.780450Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-11T19:42:17.178027Z digest=sha256:2f6b514e110e63ec61938123a019bd84229a84dc21fee8e789df0ebf50a83fb0