Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?
As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.08991.
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-06T06:34:29.942622+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-27T01:13:11.483599Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-03T20:38:56.102343Z
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 b02244a8-dde9-4b27-9c8f-467b56fadc67 · inbound
Generalization in LLM Problem Solving: The Case of the Shortest Path cites this paper.
Generalization in LLM Problem Solving: The Case of the Shortest Path Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?
Reference 1
- Resolution
- verified exact
- arxiv_id, observed 2026-05-10T10:39:38.019624Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 393580e0-f8a0-4f1e-be5f-a887f9cdb9eb · inbound
From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning cites this paper.
From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?
Reference 145
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-03T20:38:56.103753Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.