Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Simulating Weighted Automata over Sequences and Trees with Transformers
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.09728.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-14T03:23:31.727605Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation c6d404b7-c048-4a99-8141-710780aaff8f · inbound
Evaluating the Formal Reasoning Capabilities of Large Language Models through Chomsky Hierarchy cites this paper.
Evaluating the Formal Reasoning Capabilities of Large Language Models through Chomsky Hierarchy Simulating Weighted Automata over Sequences and Trees with Transformers
Reference 48
- Resolution
- verified exact
- arxiv_id, observed 2026-05-13T19:53:11.780117Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation ceb354c3-6768-45db-ab53-725788505630 · inbound
Syntactic Belief Update as the Driver of Garden Path Processing Difficulty cites this paper.
Syntactic Belief Update as the Driver of Garden Path Processing Difficulty Simulating Weighted Automata over Sequences and Trees with Transformers
Reference 214
- Resolution
- verified exact
- arxiv_id, observed 2026-06-26T04:38:58.474811Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 2895447b-d6ff-43e3-a17c-d9568c666b2e · inbound
From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP cites this paper.
From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Simulating Weighted Automata over Sequences and Trees with Transformers
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T03:23:31.727605Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.