{"as_of":"2026-08-07T00:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4feec2f582eeb1edfa670ce91d163881e8cfe8b70cc2103464c9ce6e9881cf55","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T01:13:11.483599Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T20:38:56.102343Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-06T20:07:00.989598Z","submitted_at":"2025-02-13T06:08:01Z","title":"Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?","version":2},"cited_work":{"arxiv_id":"2502.08991","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08991","snapshot_observed_at":"2026-07-03T20:38:56.102343Z","title":"Task generalization with autoregressive compositional structure: Can learning fromd tasks generalize tod {t} tasks?arXiv preprint arXiv:2502.08991","venue":null,"work_id":"915dc00a-0ae5-480e-99b7-48a967a3144b","year":null},"citing_paper":{"arxiv_id":"2604.15306","last_updated":"2026-04-16T17:59:43Z","snapshot_observed_at":"2026-07-06T23:02:53.677687Z","submitted_at":"2026-04-16T17:59:43Z","title":"Generalization in LLM Problem Solving: The Case of the Shortest Path","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T10:37:45.355872Z"},"links":{"cited_paper":"/paper/2502.08991","citing_paper":"/paper/2604.15306"},"observation_digest":"sha256:4f13b31b7a02306989c8d7b4e217fe2419bab774866609f9b306f7ca5c95a58f","observation_id":"b02244a8-dde9-4b27-9c8f-467b56fadc67","resolution":{"observed_at":"2026-05-10T10:39:38.019624Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-06T20:07:00.989598Z","submitted_at":"2025-02-13T06:08:01Z","title":"Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?","version":2},"cited_work":{"arxiv_id":"2502.08991","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08991","snapshot_observed_at":"2026-07-03T20:38:56.102343Z","title":"Task generalization with autoregressive compositional structure: Can learning fromd tasks generalize tod {t} tasks?arXiv preprint arXiv:2502.08991","venue":null,"work_id":"915dc00a-0ae5-480e-99b7-48a967a3144b","year":null},"citing_paper":{"arxiv_id":"2606.18089","last_updated":"2026-07-05T17:40:26Z","snapshot_observed_at":"2026-07-12T13:34:39.011240Z","submitted_at":"2026-06-16T15:55:28Z","title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","version":1},"reference_index":145,"source":"arxiv_source","source_observed_at":"2026-06-27T01:13:11.483599Z"},"links":{"cited_paper":"/paper/2502.08991","citing_paper":"/paper/2606.18089"},"observation_digest":"sha256:8ceb32e41515c2f37d6f67098a2b0515549258da613de11261807a6d65b4dcce","observation_id":"393580e0-f8a0-4f1e-be5f-a887f9cdb9eb","resolution":{"observed_at":"2026-07-03T20:38:56.103753Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08991/citation-record","integrity":"/paper/2502.08991/integrity","json":"/paper/2502.08991/citation-record.json","paper":"/paper/2502.08991"},"outbound":[],"paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T20:07:00.989598Z","submitted_at":"2025-02-13T06:08:01Z","title":"Task Generalization With AutoRegressive Compositional Structure: Can Learning From $D$ Tasks Generalize to $D^{T}$ Tasks?"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.08991."}