Pith. sign in

Paper Citation Record · LEDGER

Quantum algorithms and lower bounds for convex optimization

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

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

pith.paper-citation-record.v1
1809.01731 v3

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-14T14:14:41.637002Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T19:57:43.706804Z

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 b30ab5c1-597a-4009-ba5c-9cbae35e8525 · inbound

Quantum algorithm for estimating volumes of convex bodies cites this paper.

Quantum algorithm for estimating volumes of convex bodies Quantum algorithms and lower bounds for convex optimization

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-14T14:14:41.637002Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:14:41.637002Z digest=sha256:13c4f254ab1fdd9abd0a6f759f646977a4545b09140f59100b74563e03e5d142

Observation 8324d44d-4eae-452a-9e92-a0aa89568a9c · inbound

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities cites this paper.

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities Quantum algorithms and lower bounds for convex optimization

Reference 22

Resolution
verified exact
local_arxiv, observed 2026-08-06T19:57:43.739225Z

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=pdf_text observed=2026-08-06T19:57:37.959201Z digest=sha256:4d3030ade670f8afd71fcda8dc3d202b7eca6bc00044e7c7705a98efe803f6a9