Pith. sign in

Paper Citation Record · LEDGER

Quantum communication complexity of symmetric predicates

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

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

pith.paper-citation-record.v1
quant-ph/0204025 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-07-10T06:05:38.945129Z

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.432813Z

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 5e3b9e51-fd29-48de-bd80-66929a67d1b2 · inbound

Quantum ring all-reduce: communication and privacy advantages for distributed learning cites this paper.

Quantum ring all-reduce: communication and privacy advantages for distributed learning Quantum communication complexity of symmetric predicates

Reference 29

Resolution
verified exact
local_arxiv, observed 2026-07-04T04:09:34.028130Z

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=pdf_text observed=2026-06-26T17:16:39.928093Z digest=sha256:276523a21d11b65eaf625d21f1ee2a7641d452b32ab20bc61d11222e6f7e7d3c

Observation 254df442-ceb5-4100-9648-ad5c88f9346b · inbound

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

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum communication complexity of symmetric predicates

Reference 44

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

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:e011305c4e08f0df32029a7d8e57ddd13c1a470917506e4d46cde945704d2e62