Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.05900.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T14:26:31.849367Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-10T12:17:03.877222Z
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 2b0ba416-635e-4487-a5e0-f6f50e05d3e6 · inbound
Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model cites this paper.
Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Reference 62
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-07-10T12:17:03.878644Z
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.
Observation 4b86f367-e9ee-4199-93b9-5dcbe8262833 · inbound
Evaluating QAOA expectation values can be as hard as counting optimal solutions cites this paper.
Evaluating QAOA expectation values can be as hard as counting optimal solutions Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T14:26:31.849367Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.