Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T15:19:00.356533Z
Paper Citation Record · LEDGER
Depth-first search for tensor rank and border rank over finite fields
As of 13 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2411.14676.
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
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
11 of 11 outbound references displayed
- verified exact5
- verified fuzzy0
- unresolved6
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation d8e0a2ac-57dd-4d00-98dc-0d4c4c6c57a4 · outbound
This paper cites Generalizations of Matrix Multiplication can solve the Light Bulb Problem.
Depth-first search for tensor rank and border rank over finite fields Generalizations of Matrix Multiplication can solve the Light Bulb Problem
Reference 1
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:19:00.680920Z
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.
Observation 818efe62-2810-403b-96b2-7b404c388c9c · outbound
This paper cites Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming.
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.
Observation 24cccf0c-8161-49e0-a553-6ccedf6a6d7b · outbound
This paper cites an unresolved cited work.
Depth-first search for tensor rank and border rank over finite fields Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T15:19:00.772214Z
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.
Observation a3340fd7-c447-4643-acf4-44029e3819e0 · outbound
This paper cites Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs.
Depth-first search for tensor rank and border rank over finite fields Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs
Reference 4
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:19:00.610488Z
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.
Observation 28adafc1-c1c5-49bd-8b40-1ea5f69a34d4 · outbound
This paper cites an unresolved cited work.
Depth-first search for tensor rank and border rank over finite fields Unresolved cited work
Reference 5
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T15:19:00.739021Z
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.
Observation 7784e81a-5539-405a-9765-945ed864b94c · outbound
This paper cites A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications.
Depth-first search for tensor rank and border rank over finite fields A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T15:19:00.315081Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f2defcc8-95f1-4833-8619-86a0225546b8 · outbound
This paper cites an unresolved cited work.
Depth-first search for tensor rank and border rank over finite fields Unresolved cited work
Reference 7
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T15:19:00.711502Z
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.
Observation a9dc8e52-c5a4-4c05-872a-7491058dba8c · outbound
This paper cites Local Search for Fast Matrix Multiplication.
Depth-first search for tensor rank and border rank over finite fields Local Search for Fast Matrix Multiplication
Reference 8
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:19:00.514691Z
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.
Observation c1fb12eb-030d-4d12-acbd-209c8eaf5731 · outbound
This paper cites an unresolved cited work.
Depth-first search for tensor rank and border rank over finite fields Unresolved cited work
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T15:19:00.339736Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 10d07502-23d7-4103-9451-4ce1e667369b · outbound
This paper cites Flip Graphs for Matrix Multiplication.
Depth-first search for tensor rank and border rank over finite fields Flip Graphs for Matrix Multiplication
Reference 10
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:19:00.471218Z
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.
Observation 552c14bb-ff67-4ecf-b1a6-87d388100266 · outbound
This paper cites How hard is the tensor rank?.
Depth-first search for tensor rank and border rank over finite fields How hard is the tensor rank?
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T15:19:00.356533Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.