Pith. sign in

Paper Citation Record · LEDGER

Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1905.12134.

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

pith.paper-citation-record.v1
1905.12134 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:12:27.690106Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-08T14:04:38.892779Z

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 0af95821-4c32-44bf-9231-92ea78eb7b5a · inbound

A quantum algorithm to count weighted ground states of classical spin Hamiltonians cites this paper.

A quantum algorithm to count weighted ground states of classical spin Hamiltonians Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-14T15:12:27.690106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T15:12:27.690106Z digest=sha256:c22ddd1024a305844fb08f2c2066cd1b34af102e2fb131bf9c1aa19a97ca675a

Observation 29dc1dec-3364-4f37-bfdc-35e731b5b5c7 · inbound

Optimizing quantum heuristics with meta-learning cites this paper.

Optimizing quantum heuristics with meta-learning Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Reference 24

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T14:26:55.578749Z digest=sha256:4e2f401d981ed3640eddc72eb369a2d9ef4914c3d42eb9bfba1fb2d1750b24bd

Observation 6d6c99b4-d07a-4396-b8d9-3e1790204996 · inbound

Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries cites this paper.

Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-12T21:29:34.685483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T21:29:34.685483Z digest=sha256:ed6c752195233ce20824557800bdc8bee6470251ede5b6aead3b334266a9f1e5

Observation 9df3d203-3101-4a02-b1a4-078e02d5234d · inbound

Reducing QUBO Density by Factoring Out Semi-Symmetries cites this paper.

Reducing QUBO Density by Factoring Out Semi-Symmetries Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-11T12:55:04.563254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T12:55:04.563254Z digest=sha256:ad175d0a4e4d53bda3f36ab6cba949ce274fa2cc987e10006abe4252e293fd96

Observation d3505a42-6e93-4d97-9a37-4a5588a5d27f · inbound

Feasibility-Preserving Quantum Search for Constrained Transportation Routing cites this paper.

Feasibility-Preserving Quantum Search for Constrained Transportation Routing Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Reference 2019

Resolution
verified exact
local_arxiv, observed 2026-08-08T14:04:38.897232Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-08T14:04:38.397791Z digest=sha256:afd1af772cdf80316a65d6fe24d13d2e727bed0331b116b537b3f24c472d7ef8