Paper Citation Record · LEDGER

Quantum Lower Bounds by Polynomials

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

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

pith.paper-citation-record.v1
quant-ph/9802049 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 8 of 8 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 8 of 8 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T16:24:36.867856Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-01T14:15:47.273009Z

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 f6bd480e-5493-4a94-abf7-50dd8e6e0bf6 · inbound

Quantum Approximate Counting, Simplified cites this paper.

Quantum Approximate Counting, Simplified Quantum Lower Bounds by Polynomials

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-14T10:45:56.253900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e730529-5603-45e5-bce5-5c9edd9e8b48 · inbound

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

The Compressed Oracle is a Worthy (Multiplicative) Adversary Quantum Lower Bounds by Polynomials

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ec82aa0-d40c-41d8-806e-6dafb4397c48 · inbound

Tight Quantum Lower Bound for k-Distinctness cites this paper.

Tight Quantum Lower Bound for k-Distinctness Quantum Lower Bounds by Polynomials

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-05-10T23:50:52.279878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 6100f463-dcd4-49b2-939e-04c887b3d51b · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Quantum Lower Bounds by Polynomials

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-05-14T20:12:54.593595Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 8d663ab6-627c-4830-8a26-ce3da280b70c · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Quantum Lower Bounds by Polynomials

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-05-20T22:03:47.276340Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c6a45706-ecdc-404a-97c7-2e4b9a886c5e · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Quantum Lower Bounds by Polynomials

Reference 14

Resolution: verified exact; local_arxiv, observed 2026-07-01T14:15:47.274245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation ae490772-da88-44bb-8697-1d171ffbcbb0 · inbound

Answer Partitions and Oracle Access Determine Quantum Query Complexity cites this paper.

Answer Partitions and Oracle Access Determine Quantum Query Complexity Quantum Lower Bounds by Polynomials

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T14:15:22.343075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4f731b3-1bc8-496b-bbe2-92ee273a5dd4 · inbound

A Paturi Theorem for Signed Subcube Representations cites this paper.

A Paturi Theorem for Signed Subcube Representations Quantum Lower Bounds by Polynomials

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T11:49:44.756994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.