Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Quick design of feasible tensor networks for constrained combinatorial optimization
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.01699.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T21:59:29.977739Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T05:21:07.220530Z
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 75a14fa3-afe4-4c4e-a296-38348cb2d7ba · inbound
Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization cites this paper.
Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization Quick design of feasible tensor networks for constrained combinatorial optimization
Reference 37
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T21:59:29.977739Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f2eef250-224b-4928-ab93-0444eca82736 · inbound
Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN cites this paper.
Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN Quick design of feasible tensor networks for constrained combinatorial optimization
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T17:16:31.519531Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a3a68a26-2cec-402c-a940-022522f011bb · inbound
Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions cites this paper.
Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions Quick design of feasible tensor networks for constrained combinatorial optimization
Reference 35
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T05:21:07.227813Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.