Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1209.2408.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T19:23:26.359570Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-12T10:55:43.433601Z
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 22ed1d6c-d0ab-433c-933f-624b9889514c · inbound
The Complexity of Order-Finding for ROABPs cites this paper.
The Complexity of Order-Finding for ROABPs Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
Reference 21
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T10:55:43.437960Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation fbb1d50b-e4f0-4572-8b3f-2d9cff3fc83e · inbound
Lower Bounds against the Ideal Proof System in Finite Fields cites this paper.
Lower Bounds against the Ideal Proof System in Finite Fields Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
Reference 2013
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T19:23:26.359570Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2e3c6e0b-b45a-4803-895a-e51435904177 · inbound
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs cites this paper.
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
Reference 2013
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:14:05.195221Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.