Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1303.2042.
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-06T06:34:29.942622+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-10T08:07:58.802765Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-10T08:16:58.895226Z
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 c04696a7-ec15-46fd-8213-2f8334f97b0f · inbound
BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis cites this paper.
BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
Reference 24
- Resolution
- verified exact
- local_arxiv, observed 2026-06-30T06:44:19.769900Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation d813c386-9dc2-44d4-9477-e32ff42fe94e · inbound
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks cites this paper.
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
Reference 78
- Resolution
- verified exact
- local_arxiv, observed 2026-07-10T08:16:58.896472Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.