Pith. sign in

Paper Citation Record · LEDGER

Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function

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

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

pith.paper-citation-record.v1
0904.2759 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-15T06:32:42.880941+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-15T16:24:36.949849Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-14T14:00:18.842103Z

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 ba5a2c06-3bac-490e-b28d-feb977350a94 · inbound

Span Programs and Quantum Space Complexity cites this paper.

Span Programs and Quantum Space Complexity Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function

Reference 19

Resolution
verified exact
local_arxiv, observed 2026-08-14T14:00:18.848761Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-14T14:00:18.796484Z digest=sha256:6649b77a99376ae320f0ded35c9978f3bcde134be10b007f0c29166ca71e319f

Observation efe69128-2f34-42e7-a6b9-c9e6e2f4a86c · inbound

The Compressed Oracle is a Worthy (Multiplicative) Adversary cites this paper.

The Compressed Oracle is a Worthy (Multiplicative) Adversary Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-15T16:24:36.949849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T16:24:36.949849Z digest=sha256:96c2973a464c5874cea6690ae75858ac0292acad02b3580f440f195fd64768b6