Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2506.03014.
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-02T15:59:36.523869Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 12fb2ef4-475f-4021-abd1-07acf0b09769 · inbound
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization cites this paper.
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
Reference 2
- Resolution
- verified exact
- arxiv_id, observed 2026-08-07T00:51:05.716557Z
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 483bb773-f4c4-414d-9af3-e4ecd46501aa · inbound
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization cites this paper.
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T15:59:36.523869Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d9c198f1-4b0e-4d93-b665-c613f0099dc9 · inbound
Augmenting Imaginary-Time Evolution with Local Geometric Information cites this paper.
Augmenting Imaginary-Time Evolution with Local Geometric Information Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
Reference 31
- Resolution
- verified exact
- arxiv_id, observed 2026-08-07T00:51:05.716557Z
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.