Pith. sign in

Paper Citation Record · LEDGER

Communication Complexity of Collision

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

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

pith.paper-citation-record.v1
2208.00029 v2

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-08T06:32:00.761636+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-04T05:30:50.372494Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-10T06:06:50.446531Z

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 3604eafa-f4d0-406a-a7bf-042bf1b1d4e0 · inbound

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy cites this paper.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Communication Complexity of Collision

Reference 15

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.447969Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b3a86687665ad3fcbc9030c5d0fcb367874a798db500abb9a308dadd67b898b6

Observation c5b06d5e-03f7-42c6-9c9d-58d63cd86cc8 · inbound

Optimal Unambiguous DNFs and Alon-Saks-Seymour cites this paper.

Optimal Unambiguous DNFs and Alon-Saks-Seymour Communication Complexity of Collision

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-04T05:30:50.372494Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-04T05:30:50.372494Z digest=sha256:201325ecb6bc598f0697de463645ec08a3c3815e62bd0ad64dbdc88106802460