{"as_of":"2026-08-18T09:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af2791e8976e7e0e444cfe36d83759fc268bf2998b466419eb358b0d4c707eff","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:43:02.792410Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.11364/citation-record","integrity":"/paper/2411.11364/integrity","json":"/paper/2411.11364/citation-record.json","paper":"/paper/2411.11364"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.02512","last_updated":"2025-01-15T03:23:39Z","snapshot_observed_at":"2026-08-16T13:21:30.491341Z","submitted_at":"2024-09-04T08:21:47Z","title":"Continual Diffuser (CoD): Mastering Continual Offline Reinforcement Learning with Experience Rehearsal","version":2},"cited_work":{"arxiv_id":"2409.02512","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.02512","snapshot_observed_at":"2026-08-12T18:43:02.937500Z","title":"Continual Diffuser (CoD): Mastering Continual Offline Reinforcement Learning with Experience Rehearsal","venue":"cs.LG","work_id":"8c6d5c8d-aa74-4b4a-990c-00a545d4558e","year":2024},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.743725Z"},"links":{"cited_paper":"/paper/2409.02512","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:c14e968d26f414d7ffec750eb06ea1a1b97298a3738fedba1e98bf7c65f2c5a6","observation_id":"492b9325-5d1f-4314-88f1-23a4ce261f3d","resolution":{"observed_at":"2026-08-12T18:43:02.942633Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T18:43:03.062274Z","title":"Merging decision transformers: Weight averaging for form- ing multi-task policies","venue":null,"work_id":"f4bfae38-23d8-4a0b-a58d-8f8c780f8ebc","year":2024},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.752679Z"},"links":{"citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:9f43546f482519d8aed2091efdd74ce7860c542ccec997037273f5b1ebfbd497","observation_id":"9e214f58-064d-4f9d-a688-313a39ce7ce6","resolution":{"observed_at":"2026-08-12T18:43:03.066575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.01643","last_updated":"2020-11-01T23:50:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-04T17:00:15Z","title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.01643","snapshot_observed_at":"2026-08-12T18:43:02.757009Z","title":"Offline reinforcement learning: Tuto- rial, review, and perspectives on open problems","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.757009Z"},"links":{"cited_paper":"/paper/2005.01643","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:e0deaccd048882aa2657b21164288bc431704377e3c9e79d1ea25870e7a9fd19","observation_id":"fb4209c1-50ce-4b10-9444-46a4b35a1433","resolution":{"observed_at":"2026-08-12T18:43:02.757009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-12T18:43:02.765627Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.765627Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:c5e57227a3e1a7d59b78993cbfbb71a3b7c0d94e81c81e9aa5380059941a6a5d","observation_id":"fce135ad-4685-4a96-9c9b-dbfae5d5279e","resolution":{"observed_at":"2026-08-12T18:43:02.765627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.04671","last_updated":"2022-10-22T14:34:44Z","snapshot_observed_at":"2026-08-16T23:40:37.342111Z","submitted_at":"2016-06-15T08:20:51Z","title":"Progressive Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.04671","snapshot_observed_at":"2026-08-12T18:43:02.770151Z","title":"Progressive neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.770151Z"},"links":{"cited_paper":"/paper/1606.04671","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:d7ff20975678b4892a45e9f387c21b8f055bbf9002097ad05214d7b1118df589","observation_id":"0a4f1e8c-0551-40c0-b356-3208de4efe06","resolution":{"observed_at":"2026-08-12T18:43:02.770151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02576","last_updated":"2024-06-17T16:04:27Z","snapshot_observed_at":"2026-08-17T23:23:56.346746Z","submitted_at":"2024-01-04T23:44:35Z","title":"t-DGR: A Trajectory-Based Deep Generative Replay Method for Continual Learning in Decision Making","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02576","snapshot_observed_at":"2026-08-12T18:43:02.774690Z","title":"t-dgr: A trajectory-based deep generative replay method for continual learning in decision making","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.774690Z"},"links":{"cited_paper":"/paper/2401.02576","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:62f279268e738c2c8b1f4948665985cb33bfcf0f5a0ee1389d4a2a85bed24db2","observation_id":"31a53479-bd7f-4433-9596-05097faefc12","resolution":{"observed_at":"2026-08-12T18:43:02.774690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01698","last_updated":"2023-08-03T11:33:50Z","snapshot_observed_at":"2026-08-17T03:21:20.555597Z","submitted_at":"2023-08-03T11:33:50Z","title":"Balanced Destruction-Reconstruction Dynamics for Memory-replay Class Incremental Learning","version":1},"cited_work":{"arxiv_id":"2308.01698","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.01698","snapshot_observed_at":"2026-08-12T18:43:02.833972Z","title":"Balanced Destruction-Reconstruction Dynamics for Memory-replay Class Incremental Learning","venue":"cs.CV","work_id":"29956ffa-6b25-4c93-881c-0a687e06a06e","year":2023},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.779039Z"},"links":{"cited_paper":"/paper/2308.01698","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:bf4302fdd54aac0c7ed22224e87eabc96f58f8c8f4db2a7156f8c150900d0e0d","observation_id":"1c49ffab-c00d-41c2-8a79-759697d104bc","resolution":{"observed_at":"2026-08-12T18:43:02.840699Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T18:43:03.045520Z","title":null,"venue":null,"work_id":"069af30d-01a4-4040-aef9-3f3ca4638454","year":2022},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.783658Z"},"links":{"citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:640124a893e500d38cebbada8ad98fc5e6b398fb9f344fc5deb19fadede7b0e4","observation_id":"e1e270dc-1b3a-413a-8d50-130b122187de","resolution":{"observed_at":"2026-08-12T18:43:03.052836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T18:43:03.029060Z","title":null,"venue":null,"work_id":"16f7acd3-3465-40d0-ad40-1981cde7d3b1","year":2024},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.788298Z"},"links":{"citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:9ae08e8fcb586e6da5ab2af4e5bc7530ef1706efe32ff096d5ff66d22431ad54","observation_id":"23dc4be9-2448-4cea-a043-4816697601cf","resolution":{"observed_at":"2026-08-12T18:43:03.033737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T18:43:03.011748Z","title":"In contrast, regularization-based and rehearsal-based methods introduce additional loss terms to mitigate catastrophic forgetting","venue":null,"work_id":"d3e64a2d-11c2-4a0b-b93d-a067ec40af93","year":2022},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.792410Z"},"links":{"citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:ee283d1c1218e350e005b09d8162f91483c8b7b5b5f3bf53e23bba11cf4170f1","observation_id":"ef5243dd-cdf0-4791-87dc-a0d844c903e0","resolution":{"observed_at":"2026-08-12T18:43:03.017312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.06169","last_updated":"2021-10-12T17:05:05Z","snapshot_observed_at":"2026-08-13T07:57:56.087944Z","submitted_at":"2021-10-12T17:05:05Z","title":"Offline Reinforcement Learning with Implicit Q-Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.06169","snapshot_observed_at":"2026-08-12T18:43:02.748298Z","title":"Offline reinforcement learning with implicit q- learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.748298Z"},"links":{"cited_paper":"/paper/2110.06169","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:d7ef456d5ce92ab17b66dd170dc3800353c9a3f08353162d942cd7a6ed5a66b7","observation_id":"8fa348ff-459a-421f-8677-502e70672e88","resolution":{"observed_at":"2026-08-12T18:43:02.748298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12094","last_updated":"2024-10-27T04:46:58Z","snapshot_observed_at":"2026-08-17T20:42:37.335823Z","submitted_at":"2024-05-20T15:05:47Z","title":"Is Mamba Compatible with Trajectory Optimization in Offline Reinforcement Learning?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12094","snapshot_observed_at":"2026-08-12T18:43:02.726068Z","title":"Is mamba compatible with trajectory optimization in offline rein- forcement learning? arXiv preprint arXiv:2405.12094,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.726068Z"},"links":{"cited_paper":"/paper/2405.12094","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:c4b657afefc1fdb382e958fa45f2effe71b78de61615cd87864f3a8563003629","observation_id":"f1596077-3fed-4702-b872-d3586f90ee8c","resolution":{"observed_at":"2026-08-12T18:43:02.726068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13804","last_updated":"2024-04-20T08:39:55Z","snapshot_observed_at":"2026-08-17T09:17:10.640213Z","submitted_at":"2023-05-23T08:16:44Z","title":"OER: Offline Experience Replay for Continual Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13804","snapshot_observed_at":"2026-08-12T18:43:02.734624Z","title":"Oer: Offline experience replay for continual offline reinforce- ment learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.734624Z"},"links":{"cited_paper":"/paper/2305.13804","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:1020b6d95aefded3ba7a600a13b848e69816c0dd83d9adc447ef6487c485fffa","observation_id":"31607587-facf-4d87-aa1b-4756d7114e95","resolution":{"observed_at":"2026-08-12T18:43:02.734624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.00420","last_updated":"2019-01-09T11:11:47Z","snapshot_observed_at":"2026-08-15T06:05:04.839393Z","submitted_at":"2018-12-02T16:39:19Z","title":"Efficient Lifelong Learning with A-GEM","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.00420","snapshot_observed_at":"2026-08-12T18:43:02.720966Z","title":"Riemannian walk for incremental learning: Understanding forgetting and intransigence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.720966Z"},"links":{"cited_paper":"/paper/1812.00420","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:ee0b2c4f34186c7517806ff64b5cd64b64023f62d6d5b10b3119af439ff94e50","observation_id":"c432601c-beec-4caa-9361-be3d2d71009e","resolution":{"observed_at":"2026-08-12T18:43:02.720966Z","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-12T18:43:02.730607Z","title":"Off-policy deep reinforcement learning without exploration","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.730607Z"},"links":{"citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:9a019c6e2dd95921fe69f43f017d53c87e70c551b623a15cc5b86a90ac7e4b8c","observation_id":"374a8992-ed8a-43da-80e1-9aa8c588381b","resolution":{"observed_at":"2026-08-12T18:43:02.730607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10628","last_updated":"2018-05-20T14:51:43Z","snapshot_observed_at":"2026-08-14T20:19:14.327014Z","submitted_at":"2017-10-29T15:30:58Z","title":"Variational Continual Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10628","snapshot_observed_at":"2026-08-12T18:43:02.761308Z","title":"Variational continual learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.761308Z"},"links":{"cited_paper":"/paper/1710.10628","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:4381d75098ee68c4b85c0460a7e47ecf664817dc6215236c5d0a27e2cbd1913f","observation_id":"71f4c87a-8d58-44b1-ae0d-a2c67a171689","resolution":{"observed_at":"2026-08-12T18:43:02.761308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-17T18:04:53.578114Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-12T18:43:02.739411Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T18:43:02.739411Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2411.11364"},"observation_digest":"sha256:13cd036c835b686cb806a23c7db45edf4ab823fb520540715d60a13646a0f502","observation_id":"3666ea64-1760-4a4e-8f54-422824ee58d2","resolution":{"observed_at":"2026-08-12T18:43:02.739411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.11364","last_updated":"2024-11-18T08:20:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T20:13:40.082991Z","submitted_at":"2024-11-18T08:20:21Z","title":"Continual Task Learning through Adaptive Policy Self-Composition"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":17},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2411.11364."}