Pith. sign in

Paper Citation Record · LEDGER

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

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

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

pith.paper-citation-record.v1
0807.1267 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-12T06:34:41.77262+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-12T10:51:07.875221Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-05-22T14:11:38.803411Z

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 eb4f3e94-c81c-4f09-aa46-55b4ad4946d8 · inbound

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity cites this paper.

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-12T10:51:07.875221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T10:51:07.875221Z digest=sha256:f76bd83b33c13b5e6b6510164447dbc235671e25df4ea5e3234d1a758116692b

Observation c39f93b1-cac7-4b31-a301-807c7a024a91 · inbound

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement cites this paper.

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-05-22T14:11:38.806763Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-05-22T14:07:49.930498Z digest=sha256:b10ddb3a737af45da6f58e2d5b12428479fe62d3fb6ce77bb23bfbd1c60f937a