{"as_of":"2026-08-16T00:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a256a9ca6a34b14c477a73af07ba26ea9635644b3b06c23c593cb7de1342cfb0","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:10:14.485065Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:59:20.162242Z","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-10T11:50:22.203414Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08991","snapshot_observed_at":"2026-08-07T04:59:20.162242Z","title":"Task generalization with autoregressive compositional structure: Can learning from d tasks generalize to d^t tasks? arXiv preprint arXiv:2502.08991, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09251","last_updated":"2025-08-04T16:57:32Z","snapshot_observed_at":"2026-08-14T23:22:53.510036Z","submitted_at":"2025-06-10T21:22:51Z","title":"Extrapolation by Association: Length Generalization Transfer in Transformers","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:59:20.162242Z"},"links":{"cited_paper":"/paper/2502.08991","citing_paper":"/paper/2506.09251"},"observation_digest":"sha256:63ce77627a27eae2dd652f3d51c4bed760e5aab47ce11f86cc7be7890d465e99","observation_id":"33880408-792c-4816-8f9c-0f58a1f37073","resolution":{"observed_at":"2026-08-07T04:59:20.162242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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:aa692dda0b5de2826244c8127a227d09de778726e89416685a07159260190aa1","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T11:50:22.203414Z","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:f6f67c55b11313224114c18e524d9f0a0a7c327c7852139f3ea674cf6009a4fa","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.280082Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.280082Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:21a45ea9efce4952b155f6008c1c362740abc1ffa3dce89d41c2971a1f833bef","observation_id":"62aea5a4-be93-4f7a-b6d8-7c2e6c75a887","resolution":{"observed_at":"2026-08-07T23:10:14.280082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.138972Z","title":"How far can transformers reason? the locality barrier and inductive scratchpad","venue":null,"work_id":"04a3a106-8080-4a09-ab65-b8c94e074382","year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.287463Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:f20ccb9f73f99a3b66da2abc54e4f42641fbbda76ee3074d0ffda75484bede4a","observation_id":"0153bb8b-a30f-4a6b-8b59-bb62c4d17c0f","resolution":{"observed_at":"2026-08-07T23:10:15.145154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.119457Z","title":"and Bengio, Y","venue":null,"work_id":"c26c0703-95de-4e56-8269-4849cf469806","year":2017},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.293128Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:98e2e1543acbdca87e1db49736944cd93574ccbe9589edb9f545210e7588340b","observation_id":"924bd262-4e8a-4ceb-a6fc-5bc32624580b","resolution":{"observed_at":"2026-08-07T23:10:15.125955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.095395Z","title":null,"venue":null,"work_id":"4aba39a2-7555-48c0-a35f-02c299b11bd1","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.298762Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:1269de9e8dee10aad99c0d61783ca01485caa69dc5c2ed49d83264c3e2865aee","observation_id":"7fa4a20c-eaac-4e4c-9216-ec1a73cd7659","resolution":{"observed_at":"2026-08-07T23:10:15.101687Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","submitted_at":"2019-07-05T15:26:26Z","title":"Invariant Risk Minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.02893","snapshot_observed_at":"2026-08-07T23:10:14.304636Z","title":"Invariant risk minimization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.304636Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:8d8167dd0d3a2595801940ec490fb46fc2d15f90ad74c39bd2584a692cb06310","observation_id":"75adaf68-3c6d-4afc-8ce7-abd4448c08c3","resolution":{"observed_at":"2026-08-07T23:10:14.304636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15936","last_updated":"2023-11-06T00:36:24Z","snapshot_observed_at":"2026-08-14T06:41:35.816066Z","submitted_at":"2023-07-29T09:22:54Z","title":"A Theory for Emergence of Complex Skills in Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15936","snapshot_observed_at":"2026-08-07T23:10:14.310979Z","title":"and Goyal, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.310979Z"},"links":{"cited_paper":"/paper/2307.15936","citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:0520af36baf45828adb8e37de34ad8b0f8d2421a5deeda8c97731edd998305f4","observation_id":"6d037a70-9788-4a97-9627-28f2f26a3cf5","resolution":{"observed_at":"2026-08-07T23:10:14.310979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.076975Z","title":"Transformers as statisticians: Provable in-context learning with in-context algorithm selection","venue":null,"work_id":"bbce97ee-df60-4707-9f30-725dd6a74471","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.317694Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:c1dae7d9305c926d2c1bf192bc27564558a3e460006c144a1767f41798fb7898","observation_id":"e88e531d-12c4-431c-be9c-1ffd59953628","resolution":{"observed_at":"2026-08-07T23:10:15.082589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.059206Z","title":"and Urner, R","venue":null,"work_id":"77d51254-84fa-4d63-bf01-4b13f2b7f92a","year":2014},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.323553Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:598b8ef16c17a490334708278da0e36e6c96ce27a118986185e9acde6a4db0d3","observation_id":"e0efbde0-df55-4f85-b71d-932c6f80aeb4","resolution":{"observed_at":"2026-08-07T23:10:15.064939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.041011Z","title":"Understanding in-context learning in transformers and LLM s by learning to learn discrete functions","venue":null,"work_id":"27c38e54-2da8-49d3-bd97-35cacf48955a","year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.328834Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:0e95bbbfb13cacf569df1705fbf40a3c5892bc93d66e299cd958ee8db4a69273","observation_id":"1c9a15f2-ad4e-4f36-b68e-78474f51bea7","resolution":{"observed_at":"2026-08-07T23:10:15.046470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.333746Z","title":"D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.333746Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:e0da8a5ff4b99b8458ac3e5b63bef6dae7d0d11c9e38aff1f47ffa530028f39c","observation_id":"b6a749bc-76bc-44e0-9487-0977fdee26c1","resolution":{"observed_at":"2026-08-07T23:10:14.333746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:15.011056Z","title":"Learning bounds for importance weighting","venue":null,"work_id":"ba1afb2a-25fb-497b-a5c3-8e8661101049","year":2010},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.339167Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:c683a0823c7c26e9045ec6219a18366448edfd40e42e59521a3cd9b4a273111a","observation_id":"c25facf7-9000-4ad5-8dba-82f3cc751dfc","resolution":{"observed_at":"2026-08-07T23:10:15.017566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.992286Z","title":"S., Koushik, J., Singh, A., and P \\'o czos, B","venue":null,"work_id":"dd95a65c-096c-4bdb-9d44-495b8dd867cb","year":2017},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.344675Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:de0b6133f43eed86bfa6ad182e6b7795dabd95b9854cd529f12b9f856bb63451","observation_id":"bc32888e-2a2d-401f-9d0b-5e92843bf9fd","resolution":{"observed_at":"2026-08-07T23:10:14.998964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.974196Z","title":"Distributionally robust losses for latent covariate mixtures","venue":null,"work_id":"aa69eb2e-7601-4937-a486-67818673b520","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.350265Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:da64b9a6bcf8037b1e909f33b4c479c0459b90ef50ca6e59a8cd935103b5077e","observation_id":"35d20199-66ed-4056-a0ef-af79bc14d9e8","resolution":{"observed_at":"2026-08-07T23:10:14.979593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.957349Z","title":"L., Jiang, L., Lin, B","venue":null,"work_id":"bef476d3-f91f-4efa-ab10-107bbaa0ebf3","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.356052Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:afa3009cb43e54eacc14ca328e2f51712ffef348d9b1306c0fea56d1ded6e614","observation_id":"1a73132f-4949-4874-9d37-6e6c152352b4","resolution":{"observed_at":"2026-08-07T23:10:14.962907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.940422Z","title":"S., and Valiant, G","venue":null,"work_id":"701766d7-3c93-4da7-914e-ec4c74dae83d","year":2022},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.361832Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:7d6703be6acfcaa7667a028c002c60b4306e4dec42715bf4db2c3d6c48b7ff28","observation_id":"bde05660-c5eb-480b-b506-2778bedaecd8","resolution":{"observed_at":"2026-08-07T23:10:14.945925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.923238Z","title":"Instruct-skillmix: A powerful pipeline for llm instruction tuning","venue":null,"work_id":"810c888e-8af1-4520-8248-a420c6ad6386","year":2025},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.366695Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:770da4b5e87d4f5e34d1ddb8295f2d745cc0c29f92bf1d8d1f40ba306f4a1411","observation_id":"4c76ca32-5ed3-4f26-9243-f056d20f4db0","resolution":{"observed_at":"2026-08-07T23:10:14.928932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.906232Z","title":"Measuring compositional generalization: A comprehensive method on realistic data","venue":null,"work_id":"91d2d111-8b9e-4c5e-bc57-e8d3ee06654e","year":2020},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.371708Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:77b99200284c5c4d479c0d7d7518a94de65b8a68219e3f751f29b214d56b9567","observation_id":"999df2fa-119e-44b3-8af4-a8c116bad283","resolution":{"observed_at":"2026-08-07T23:10:14.912147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.376523Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.376523Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:95478c1565a8ad4f65e7d252889f25b1119ba98a9387f8110e4feccce016695a","observation_id":"97f8fbd3-52b7-4e3e-a67b-94fe78deabe7","resolution":{"observed_at":"2026-08-07T23:10:14.376523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.381963Z","title":"and Martinet, G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.381963Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:cb304670cc82cc620da5870f407ae12dd09f0bdfe22439f2b0097760c39dd0e2","observation_id":"6db14cab-7fae-41c9-913e-20eff14460bc","resolution":{"observed_at":"2026-08-07T23:10:14.381963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.865113Z","title":"and Baroni, M","venue":null,"work_id":"956c7ffd-a183-41eb-bc8c-17581f1d8eb0","year":2018},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.387788Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:14efe52202df0ae041d50002ecc4a9cd8d0c13cdebdf913b6192d8594b3e3488","observation_id":"0a3d8ac9-66d6-4824-bea0-8582f3732b69","resolution":{"observed_at":"2026-08-07T23:10:14.870747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.847625Z","title":"Near-optimal linear regression under distribution shift","venue":null,"work_id":"fc5160f4-4ac8-415b-8b42-f1ccf56ca8f2","year":2021},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.393334Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:d34582a6f33ddd48139e148040926cf99c80ed4a40c3bcaad7d4ddbcdf9dd529","observation_id":"8f67344f-aad9-4c64-aefb-41455b28fc04","resolution":{"observed_at":"2026-08-07T23:10:14.852964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.829947Z","title":"E., Papailiopoulos, D., and Oymak, S","venue":null,"work_id":"8465f990-203e-453c-a47d-c6a1f3f0ef21","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.398853Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:b67c00a791875ab6f09bf779b26b76eb13956809a8c7860809facd61e5a494b0","observation_id":"88fb128e-1ae8-49cf-a731-8f3842999ca9","resolution":{"observed_at":"2026-08-07T23:10:14.835428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.812688Z","title":"and Stachenfeld, K","venue":null,"work_id":"cb6a94c2-314c-4f7b-866e-460d5d1421dc","year":2025},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.403832Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:101568b83e0b433a1cb702efe46b66131bd60156abdc3b36d880bc6d513cf7ab","observation_id":"083c735f-4e75-4d3e-a084-292b7b9cf967","resolution":{"observed_at":"2026-08-07T23:10:14.818514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.794441Z","title":null,"venue":null,"work_id":"9a426884-262f-4569-ae5c-08a173971709","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.408814Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:177bd7dc8342668d3991cf789444b72b732db847941e691358c95959bd3ce2c7","observation_id":"77878615-63e6-4435-9eff-22704501f82e","resolution":{"observed_at":"2026-08-07T23:10:14.800681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.413618Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.413618Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:067cd6f18f73ab11c79cf9a787d787ba4435cef75676514e4ef0e764bf9ce2f5","observation_id":"1325c223-ad76-49c5-9bdb-1c3c5e33185f","resolution":{"observed_at":"2026-08-07T23:10:14.413618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.763833Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":"bdd9a3d9-f060-49a1-8153-3c5366ac148c","year":2009},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.418585Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:f9c293b277b9132721bf0e34e7de9fb4090fc9521efc9968e7c507874eae226c","observation_id":"6aad1bfb-0c11-4b31-b29a-959e79369dcf","resolution":{"observed_at":"2026-08-07T23:10:14.769652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.746014Z","title":"M., Yang, F., Duchi, J., and Liang, P","venue":null,"work_id":"d3fc176e-450a-492e-8b18-d651469293f9","year":2020},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.423653Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:3438c8c35315dd9ade2137d9964f774ace3cdb1892f8ec4a45fe8984ead2f7f5","observation_id":"247e6d12-133f-41b8-9a37-335c01f52891","resolution":{"observed_at":"2026-08-07T23:10:14.751151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.728769Z","title":"Y., Padmakumar, V., Joshi, N., Kazemi, M., Kim, N., and He, H","venue":null,"work_id":"6c9ad445-f93d-40f9-8438-826070315ebe","year":2023},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.428500Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:fc273f864ac9ddf4ccc2e28b98c3ec0b7f555401a79f456be381a7e9df4a2beb","observation_id":"f0c22ce3-2071-4c01-bd02-27e0e3578c4c","resolution":{"observed_at":"2026-08-07T23:10:14.734372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.711990Z","title":"M., Von Oswald, J., Pascanu, R., Sacramento, J., and Steger, A","venue":null,"work_id":"b120567b-ea51-41df-944f-8dbd1b808b0a","year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.434234Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:564eccd8819557bed2b599efe0765ca7121844aef4704bb928189cd20914410d","observation_id":"f53b3e7e-2e6d-482a-bd0d-ffdda26056c2","resolution":{"observed_at":"2026-08-07T23:10:14.717244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.694667Z","title":"Out-of-distribution generalization via composition: a lens through induction heads in transformers","venue":null,"work_id":"068da993-55db-424c-aa24-9c9c734d3920","year":2025},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.439460Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:6026ab63592a600efdd859bd4f5ba03287dd0c40cde3ff8aa778981f02e6b3f3","observation_id":"b4d72497-09bb-4e5b-8080-f084fc31d32d","resolution":{"observed_at":"2026-08-07T23:10:14.700090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.444257Z","title":"Covariate shift adaptation by importance weighted cross validation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.444257Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:97f24e15ae3d9c5a092f115f35b3eb45dfc2aae511bbe64146b303ef468fd483","observation_id":"4d128c4b-71d7-4905-80fe-fee12b9b1fb9","resolution":{"observed_at":"2026-08-07T23:10:14.444257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.664816Z","title":"H., Hashimoto, T., Vinyals, O., Liang, P., Dean, J., and Fedus, W","venue":null,"work_id":"684bba5a-39e6-4801-951e-6510686aea28","year":2022},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.448847Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:98feb91b694abd194a5f30f6d9e95f6927739eaf8a8a14aef246d443f1a603fb","observation_id":"37b26579-18f0-4cd6-b09f-af1463ae99f7","resolution":{"observed_at":"2026-08-07T23:10:14.671092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.647448Z","title":"From sparse dependence to sparse attention: Unveiling how chain-of-thought enhances transformer sample efficiency","venue":null,"work_id":"4fef71b1-ca77-43f1-988e-dcbfcd56f03e","year":2025},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.453447Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:8fc977d084b458880d12a8d1acdbbae94bcb5ae5a69b8aab32bab49d3ff4b436","observation_id":"a59d0f81-e176-49c5-87d3-fc061784cfa4","resolution":{"observed_at":"2026-08-07T23:10:14.652867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.629347Z","title":"Compositional generalization from first principles","venue":null,"work_id":"402bc8af-6687-46b8-9194-1eba4152aae9","year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.458108Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:d74123ed23380ab08a3db772933ae25d1995bb48bb3de06b5bc42948886f3639","observation_id":"7aa64d73-8eac-435d-b3ad-b9b734c68ccb","resolution":{"observed_at":"2026-08-07T23:10:14.634476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.611760Z","title":"Transformers: State-of-the-art natural language processing","venue":null,"work_id":"9ddba5a2-358c-455b-ac0d-d9a815dd60c7","year":2020},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.462973Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:9ebcadcc6167994ca8aa74c7c4ad58f5e0ecfa287f19d3861ffb89b27c22dce9","observation_id":"65ae73e0-2392-4e54-b835-826e49d8e599","resolution":{"observed_at":"2026-08-07T23:10:14.617868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.592493Z","title":"Do large language models have compositional ability? an investigation into limitations and scalability","venue":null,"work_id":"53a11482-0e2c-4eec-a46a-114f23336326","year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.468358Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:3cab60fd7ca509da2063d13cd55ef50fdc784472a2b576df217e8cf51c8678a5","observation_id":"354eac17-cda4-41fa-ac96-3e69543a0b5b","resolution":{"observed_at":"2026-08-07T23:10:14.599849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.473760Z","title":"Towards a theoretical framework of out-of-distribution generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.473760Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:847eedd79b86244995fcf2a64fd90cf1d9adfb4f1a223e06b75e09c783fbf05a","observation_id":"c75f9c5d-be2b-4a30-b4dc-92bc57e582fc","resolution":{"observed_at":"2026-08-07T23:10:14.473760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.479644Z","title":"Can models learn skill composition from examples? Advances in Neural Information Processing Systems, 37: 0 102393--102427, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.479644Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:0a9f38eaccd9e50fcdf02003507f1f69acd119abba510b90f35c6c104aa81dbe","observation_id":"f0358ef3-3830-4caf-9417-1d990115148a","resolution":{"observed_at":"2026-08-07T23:10:14.479644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:10:14.485065Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T23:10:14.485065Z"},"links":{"citing_paper":"/paper/2502.08991"},"observation_digest":"sha256:a486dbe1e225f9708a8a3dc8eb9c0712138be70069c31e91a316fdb3ff6c7441","observation_id":"d6bcc1c9-cbc2-4027-892c-4be536d522be","resolution":{"observed_at":"2026-08-07T23:10:14.485065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.08991","last_updated":"2025-06-09T02:02:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T11:50:22.203414Z","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":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":39},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 3 inbound Pith citation observations for arXiv:2502.08991."}