Pith. sign in

Paper Citation Record · LEDGER

On the Complexity of Random Quantum Computations and the Jones Polynomial

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

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

pith.paper-citation-record.v1
1711.00686 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-23T06:30:58.430688+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-14T11:58:40.920352Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T23:02:46.220034Z

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 0c25d0d0-af7b-40e5-a568-53a1d539f7c3 · inbound

Closing gaps of a quantum advantage with short-time Hamiltonian dynamics cites this paper.

Closing gaps of a quantum advantage with short-time Hamiltonian dynamics On the Complexity of Random Quantum Computations and the Jones Polynomial

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-14T11:58:40.920352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T11:58:40.920352Z digest=sha256:285b0097d95ae3d522ef8afb74018a0cbb8546896af4ba87bda69f9ca87088e6

Observation a08c13ed-6153-4574-8780-a72c64ea400f · inbound

Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity cites this paper.

Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity On the Complexity of Random Quantum Computations and the Jones Polynomial

Reference 23

Resolution
verified exact
local_arxiv, observed 2026-08-07T23:02:46.225692Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T23:02:45.225197Z digest=sha256:bd9902fbc5a9bad592b83762fbb90ee77c0af73bfb69b174d8da104a41fbea8a