Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.04683.
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-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-12T15:19:00.287255Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-12T15:19:00.633476Z
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 818efe62-2810-403b-96b2-7b404c388c9c · inbound
Depth-first search for tensor rank and border rank over finite fields cites this paper.
Depth-first search for tensor rank and border rank over finite fields Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
Reference 2
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:19:00.641678Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.