{"as_of":"2026-08-04T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58911b318afc427c9c4adad462e0dfc6220b716d637d4771dff177e6bf8524d0","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T10:25:24.418200Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T04:13:20.992325Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.16780","snapshot_observed_at":"2026-08-01T04:13:20.992325Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22931","last_updated":"2026-07-24T22:12:15Z","snapshot_observed_at":"2026-08-01T04:13:17.845261Z","submitted_at":"2026-07-24T22:12:15Z","title":"Spectral-Aware Analytic Class-Incremental Learning for Long-Tailed Distributions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T04:13:20.992325Z"},"links":{"cited_paper":"/paper/2211.16780","citing_paper":"/paper/2607.22931"},"observation_digest":"sha256:caf8dd2827da9eaad8d317ee14b5b9ff2a735ffe934715d656a80742e1891249","observation_id":"66cd439a-df0e-44ff-95a2-dfdcb849bbd7","resolution":{"observed_at":"2026-08-01T04:13:20.992325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.16780/citation-record","integrity":"/paper/2211.16780/integrity","json":"/paper/2211.16780/citation-record.json","paper":"/paper/2211.16780"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online continual learning with maximal interfered retrieval","venue":null,"work_id":"cbf9ff96-df9e-4c2c-ad76-1a3ac8e1b02b","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:ded064d406a3da42bb004e4d8541d739619ddf3c5dfe0dbac56850df7c9e1455","observation_id":"8c744e02-64a8-4938-b716-2cd4216fab6a","resolution":{"observed_at":"2026-05-24T10:26:08.572937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Incremental multi-domain learning with network latent tensor factorization","venue":null,"work_id":"b2eacd6c-f976-40bd-85e3-b8e128b1d7b9","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:376729a567a5c9e2659942ab865a8339256738c9e269637cf95fe4646337862d","observation_id":"1d0d2a41-9207-4b91-992b-aa45f7493184","resolution":{"observed_at":"2026-05-24T10:26:08.587113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"New insights on reducing abrupt representation change in online continual learning","venue":null,"work_id":"9d2bf540-e0e5-4ad0-a051-118fe591020b","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:1240576aa3d0fc6f71a6e57ffd1dab10a7e53bfade1be7a58b20c7b67859d820","observation_id":"2ff954e0-ed8a-45a2-b7ca-dbf1039bb257","resolution":{"observed_at":"2026-05-24T10:26:08.590693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Efficient lifelong learning with a-GEM","venue":null,"work_id":"ab33450c-a3c1-451d-a0bd-364ed4d40153","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:3bfcdab52f216e305d8f00c2f55851057aa1fe0a990bda8a90db75b3e1bab7fc","observation_id":"2947b5e2-0d16-4979-97ad-f200b7a15968","resolution":{"observed_at":"2026-05-24T10:26:08.556524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Continual learning with tiny episodic memo- ries","venue":null,"work_id":"57bf4b1f-9fbe-4543-ae1c-7b62842f4018","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:9298b4e97bdf68b634543d691be0a80e0746df7c08849d27fbb3f52ac70354b1","observation_id":"7387be50-20b1-4801-b759-de8be4b5e10d","resolution":{"observed_at":"2026-05-24T10:26:08.559913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online continual learning from imbalanced data","venue":null,"work_id":"cc777eef-485c-44b4-8587-3eff37ebd2dd","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:fa90da5eb7c48e5b984aa7ccfa38c9618483fb87d7a73c69a59ba425dd2d4622","observation_id":"ecd42d3b-9b05-48e6-87dd-ac5c449b3c8b","resolution":{"observed_at":"2026-05-24T10:26:08.480243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A continual learning survey: Defying forgetting in classification tasks.IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(7):3366–3385","venue":null,"work_id":"0466c460-2a53-401e-aee7-7eebe7e4145f","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:ae654f7e994c24637f9dd6f282a1f03ec014f30ea0d08a64a54c5589f79b6a24","observation_id":"c9b4bc34-65ca-4275-a1c2-55e394414bb5","resolution":{"observed_at":"2026-05-24T10:26:08.602760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Continual prototype evolution: Learning online from non-stationary data streams","venue":null,"work_id":"0d50a188-f1ab-4783-94e0-096d3a731040","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:5e370f32919482df26ac4188aa41ff99eb7fe040c08d26ae90544f9f2870b3b9","observation_id":"0ead07c8-9b7b-41a3-93fe-830e37e503e3","resolution":{"observed_at":"2026-05-24T10:26:08.614890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Stochastic optimization for large-scale optimal trans- port","venue":null,"work_id":"ff32879c-7931-4e4a-b956-6c3abcca9f8f","year":null},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:b73cef0fae0bbec2089897cc70d25deb4c7d8f2e301018d59ff25328401a4ecd","observation_id":"2d611967-35a0-4ffe-b8b7-dbe02519b592","resolution":{"observed_at":"2026-05-24T10:26:08.546470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C","venue":null,"work_id":"4e4ba69a-5dd1-4f0b-a7dc-8d1d31b17cda","year":2014},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:61ea027e45cf358df1d4259293473362889173c36bd31c34afb9a2ea2e6e616c","observation_id":"9f496174-f308-4945-b3fe-85b3d7fe20ec","resolution":{"observed_at":"2026-05-24T10:26:08.550108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Not just selection, but exploration: Online class-incremental contin- ual learning via dual view consistency","venue":null,"work_id":"6684c3cf-6a3a-45ce-9b5d-8697e583c9bb","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:2be81a6af730de4fa3bf15d79100591137712f47fa7d43a3786242e33e49267b","observation_id":"4963ac13-d0ad-4406-9a70-5dc61fbf299d","resolution":{"observed_at":"2026-05-24T10:26:08.563367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Improved schemes for episodic memory-based lifelong learn- ing","venue":null,"work_id":"f756486a-c30e-4bf6-ab9e-520b33bf9429","year":null},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:5f49a571ff9a8ae39d66bb20d3aae22a0248bfe3cde3d6b0b1ab86fe72a9ee42","observation_id":"772f2c90-1e1d-4fa0-b4da-4e4fb93a4b89","resolution":{"observed_at":"2026-05-24T10:26:08.556307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"35eb70d9-0548-4b25-ac83-202368a30e1e","year":2016},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:d92f389d964860e38a0d0b9de7fc8e82a87db0dbfbbf51c059903b091c5a7597","observation_id":"a10fbc8d-1158-4c37-8dc3-0ba791cc16a8","resolution":{"observed_at":"2026-05-24T10:26:08.569812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning a unified classifier incrementally via rebalancing","venue":null,"work_id":"8b213e62-9faf-4c57-b481-05569f336dda","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:f2907f5ddccc8ebf4f000279da58d92c969d761d812d4148c549bc607e3bcd26","observation_id":"75cac80f-06a7-42d7-bdca-e4ccc4803522","resolution":{"observed_at":"2026-05-24T10:26:08.587916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-01T18:34:23.156273Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":"1611.01144","doi":"10.48550/arxiv.1611.01144","metadata_source":"pith","pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Categorical Reparameterization with Gumbel-Softmax","venue":"stat.ML","work_id":"050fb4ab-62d4-4150-866a-77bc502eca22","year":2016},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:b901c375103e4dea42d5833cdf5fe2f9214817920a7cbee30fa57fe396096e26","observation_id":"3934a3fe-0382-4667-bf63-5a1eb136fa91","resolution":{"observed_at":"2026-05-24T10:26:08.033543Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-19T16:22:27.608765+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-19T16:22:27.608765+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Continual learning of a mixed sequence of similar and dissimilar tasks","venue":null,"work_id":"7208444b-7de1-4352-b48c-c0b761e7cc15","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:467b2fee6ce642f7767ec234adf2116ed19dd13dae7405ac6ea60170ae9a0dfd","observation_id":"6871d67d-4419-4be3-a769-d605ac8a878b","resolution":{"observed_at":"2026-05-24T10:26:08.582158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Overcoming catastrophic forgetting in neural net- works","venue":null,"work_id":"91c3cfbc-7b6e-4ac5-a842-787ed4aa4155","year":2017},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:641b2fa1b83a6e72f07f098542fa46f2b027791fbc1f32e4fad655815348c4d6","observation_id":"f7334073-c097-46c1-a2ca-45d43895fb8b","resolution":{"observed_at":"2026-05-24T10:26:08.596388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning from students: Online contrastive distillation net- work for general continual learning","venue":null,"work_id":"11d20fb5-a13b-4740-b736-3051bd543d38","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:0abea0589607101a2424af39f890c3015ab96272f658072745cfc223f13b82a0","observation_id":"a03f5880-f2aa-42ec-ae7d-1ae52772d3b7","resolution":{"observed_at":"2026-05-24T10:26:08.538160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning without forget- ting","venue":null,"work_id":"98bfcdfb-2f08-4c51-905d-9c60a2d56584","year":2017},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:deaec31691af9e898d94befe5592701860c2b0201be1d0bf73005415d7c9b879","observation_id":"a88e3aa4-6019-4733-ba7d-101c52a8ed86","resolution":{"observed_at":"2026-05-24T10:26:08.536331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Supervised contrastive replay: Revisiting the nearest class mean classifier in online class-incremental continual learning","venue":null,"work_id":"e2d9f427-d82e-40e0-92c8-cf3d008eeaea","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:61957c09968d56044832f80edb290c97a936ef475474dc74f0c079f91641ce84","observation_id":"1281d996-a865-4a95-9c5e-e730a1c8056a","resolution":{"observed_at":"2026-05-24T10:26:08.539742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Au- tonomous vehicles: theoretical and practical challenges","venue":null,"work_id":"a8351b86-d0cb-41bd-a1a1-505b9ebe0ac1","year":2018},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:fb19faa7591b5713e3ba227e561c36e5c17f7c6306af4d73eb3c1907a4c9037e","observation_id":"07404c33-d090-4c48-9f0b-f7b122504b82","resolution":{"observed_at":"2026-05-24T10:26:08.488663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Class- incremental learning: survey and performance evaluation on image classification","venue":null,"work_id":"1082ff90-1bb1-4baa-92ff-722e27b4ec5d","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:514719dbb12e71991918a31f3a7f0b95f8084731f3b47538eb97ad45659db937","observation_id":"6af1f2fd-6ac3-41a1-8039-e42e4a102bb5","resolution":{"observed_at":"2026-05-24T10:26:08.532299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Adaptive grasping for a small humanoid robot utilizing force- and electric current sensors","venue":null,"work_id":"c5c39f5b-a0dc-4013-9cc5-c7cdfadea46a","year":2013},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:641627b3fb162f7dd806b50916a75303897bef9bece88eef47db8f2e0cc17f5a","observation_id":"faf6b335-d3df-4f86-8a99-f13c4272f8c6","resolution":{"observed_at":"2026-05-24T10:26:08.578881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"An efficient domain-incremental learning approach to drive in all weather conditions","venue":null,"work_id":"fbf3339e-23e4-426e-9bc8-c802161f2d95","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:f20b5b4648e474313d0e9d9393b0f8cc49e4d1a3da20f660e73072ee24d48cc3","observation_id":"023ed05d-0d8c-4ca0-9e6e-667422bf6923","resolution":{"observed_at":"2026-05-24T10:26:08.485062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Linear mode connec- tivity in multitask and continual learning","venue":null,"work_id":"29ecaa13-6774-46d6-a58a-905a8c01296c","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:43cb09e974f7191309c1924cb705a80605a0f90f98e8ff1bd7b21d7d7c45271a","observation_id":"b466afd1-ad6b-4686-9d69-702ef63300f6","resolution":{"observed_at":"2026-05-24T10:26:08.502491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Olsson, C.L","venue":null,"work_id":"272984e4-dcf8-4bc2-8c88-3bce0680ce2c","year":2005},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:f7bf8510f0f037fba3106b0f376481bc695f38b9783f045eedd9e574ec2c4607","observation_id":"8901bfe9-112c-4156-8a77-3df588bb79f5","resolution":{"observed_at":"2026-05-24T10:26:08.496016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning to remember: A synaptic plasticity driven framework for continual learning","venue":null,"work_id":"f7348b51-79ee-4019-a1ea-497702783ad1","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:11bf17013cc63c7f4da0b31ae5e553589b09e3946102705d88886a580d9b111f","observation_id":"f70b0fc5-b0bd-4adf-b3fc-afcab7b0a5ad","resolution":{"observed_at":"2026-05-24T10:26:08.547927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Gdumb: A simple approach that questions our progress in continual learning","venue":null,"work_id":"3c0a5a3d-e009-4be2-92a2-890713a2464a","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:e14eb24c04579a62bc4d51d60e244d9ae7ac7cc1bfd6cf7516027c4ee4bd07ed","observation_id":"3da3494e-bd54-4346-b1d6-461f29248846","resolution":{"observed_at":"2026-05-24T10:26:08.492495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"047676a2-0ee3-4ea8-b312-dda7bea5ffc5","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:4f5d0d37a64c037ed624303c2a6d03c77a342f94623915ba1fce285dcdcccbd2","observation_id":"c03eebb6-e7be-41f7-88fb-4e11cc1649a0","resolution":{"observed_at":"2026-05-24T10:26:08.570154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Girshick, and Ali Farhadi","venue":null,"work_id":"265ef587-25dd-4034-9f55-8ea30cc9f397","year":2016},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:2412668d8bde1207b8e0e91f44805ada11461852ed6b09f01217625f6eff302c","observation_id":"7119cbef-0bd6-410e-9d48-ed6d5511c036","resolution":{"observed_at":"2026-05-24T10:26:08.523194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Gaussian mixture models","venue":null,"work_id":"28acb6f1-1317-415a-9d8b-da720f782465","year":2009},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:9da085d6aa8384c9d76daf005965e316572d2a145477980e98c68a36db21151f","observation_id":"63b6e1d8-ecaa-4be7-ad06-6311a1f6814e","resolution":{"observed_at":"2026-05-24T10:26:08.584916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Catastrophic forgetting, rehearsal and pseu- dorehearsal","venue":null,"work_id":"fe03e1a7-9f06-4efa-bfa5-b7bc46ef0a56","year":1995},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:5fe7212c8dc0d4aa3877438a5eb563beeffea845ef45a0f39dd835eb6cf35c82","observation_id":"469c65ac-be40-4f96-b03a-d8a5402a3950","resolution":{"observed_at":"2026-05-24T10:26:08.608086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Gradient projec- tion memory for continual learning","venue":null,"work_id":"704b3afe-daca-4b2f-888c-85528ddb9bd1","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:8193229ee6b34442ba7f687f6cffaa388ae93f69187ab53dca6eb1c7b66d2d25","observation_id":"eed7063c-ea31-4976-99bf-b8cda38a1976","resolution":{"observed_at":"2026-05-24T10:26:08.563040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Santambrogio","venue":null,"work_id":"5af641d1-468c-4fb0-9f2c-14851c5ca0ac","year":2015},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:04d8972370c7d31eb6cfb44fa2cb92f0546b1480b8977d521fe829dcdb0aae0a","observation_id":"51a3f9eb-5d41-42a1-9e99-366888a230b3","resolution":{"observed_at":"2026-05-24T10:26:08.533529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online class- incremental continual learning with adversarial shapley value","venue":null,"work_id":"0a8938ea-1a8f-4a13-b86e-e1b9d7695e69","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:ec41d24ddaa0028670f0c545b0caa890cf744728a9a786e672bcea8f75ca8de2","observation_id":"377ca993-3b6c-4044-96ef-4dfec696cf36","resolution":{"observed_at":"2026-05-24T10:26:08.529854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online class- incremental continual learning with adversarial shapley value","venue":null,"work_id":"02995428-cefe-4e77-a12d-1ea2b7940090","year":2021},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:7454589e4d209b3325ea11ae09f25bd54da2350a72f8249d80b0fd1b406b22f3","observation_id":"94f6e15c-2cf4-48db-b900-c9317eb17c2d","resolution":{"observed_at":"2026-05-24T10:26:08.576515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Continual learning with deep generative replay","venue":null,"work_id":"4dbff235-5d3a-43d5-af99-e3c3552c1edb","year":2017},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:e0b0aa67f72e75025badb8dd5ffd154d8fecf1be3361eba41fb3108ef98dd82d","observation_id":"80bef66b-a90a-4b10-b494-24a1c3268af6","resolution":{"observed_at":"2026-05-24T10:26:08.526027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.02099","last_updated":"2019-05-06T15:23:37Z","snapshot_observed_at":"2026-07-06T07:50:42.169285Z","submitted_at":"2019-05-06T15:23:37Z","title":"Improving and Understanding Variational Continual Learning","version":1},"cited_work":{"arxiv_id":"1905.02099","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.02099","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving and Understanding Variational Continual Learning","venue":"stat.ML","work_id":"344ce0a8-ed55-48f4-a9f9-63a26538e42f","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"cited_paper":"/paper/1905.02099","citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:dc495b9dd20d0ea1101f347737ef7fef27ec78b01c692069518a321d2472aedc","observation_id":"53d1763d-9497-4d5e-97b9-7f583a9a38b3","resolution":{"observed_at":"2026-05-24T10:26:08.026151Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A sur- vey on video streaming over multimedia networks using tcp","venue":null,"work_id":"50255efb-60a8-4cab-843e-0793e904ff50","year":2013},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:f87039c01b6471278ad7b3fd39bfa93d3d78a063c310945170b65fac4f2f6342","observation_id":"cbcda728-1ef8-4edf-a749-c7c7875142b7","resolution":{"observed_at":"2026-05-24T10:26:08.573236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Optimal transport: old and new, volume 338","venue":null,"work_id":"3a79e93c-76b3-4cde-8e98-82f72f48c01e","year":2009},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:41b5cfb83a6c0959e837ab23bf9e3fc1d4bbc4ee2e463d11793881615ecb6f40","observation_id":"ee193635-b957-4ff4-88f1-595e1242a51d","resolution":{"observed_at":"2026-05-24T10:26:08.599327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Random sampling with a reservoir","venue":null,"work_id":"4c866f63-7769-41e1-b553-5f0ab981eee8","year":1985},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:30aaada42785d933437fdcf2f10e838839ade8d7c5a007c684907261374d718d","observation_id":"a587bd3b-a537-436f-bf9c-95e326690cf0","resolution":{"observed_at":"2026-05-24T10:26:08.611039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00695","last_updated":"2022-04-11T14:58:15Z","snapshot_observed_at":"2026-07-06T07:57:26.611285Z","submitted_at":"2019-06-03T10:45:08Z","title":"Continual learning with hypernetworks","version":4},"cited_work":{"arxiv_id":"1906.00695","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.00695","snapshot_observed_at":"2026-07-10T19:57:33.992182Z","title":"Continual learning with hypernet- works","venue":"cs.LG","work_id":"d9c936f8-c861-48dd-b0d5-570fffd9bbc9","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"cited_paper":"/paper/1906.00695","citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:c41711eb0eaa888aac1766168d3b3f69c2fb8996019bc3e2b60a9faa1c1c487e","observation_id":"9c2511a1-79f2-4197-a439-795a7c553c88","resolution":{"observed_at":"2026-05-24T10:26:08.040789Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A study of live video streaming system for mobile devices","venue":null,"work_id":"c11b5a77-4968-47d9-92b3-0e8d1448bc7f","year":2016},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:1d8a768c1764061cb6e35673f3a23cd575000e90f9fc29f57f7169af9b563fb9","observation_id":"be40cd8d-7cad-4b35-8599-50a59e5317d6","resolution":{"observed_at":"2026-05-24T10:26:08.559642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Large scale in- cremental learning","venue":null,"work_id":"29926f97-6887-445a-9675-0f369d867d0e","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:8dded148ac76da1da9a6cc97fe071bf485e1a18fa13ef25ae40c6f24edfe9d5d","observation_id":"f923b990-79d9-4208-869a-53b25c0c2d8d","resolution":{"observed_at":"2026-05-24T10:26:08.472436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Lampert, Bernt Schiele, and Zeynep Akata","venue":null,"work_id":"530be5c5-eaea-4510-9ae1-fa53fb9e0e30","year":2019},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:4a1b5273058edf9f07d91f7e2a41f346778619bc277a83fcbc0bceb38b3ac634","observation_id":"a46025fd-7fc3-4ced-9d12-9d144603d79e","resolution":{"observed_at":"2026-05-24T10:26:08.475661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7fcb6ed5-d5f7-4efe-b4ff-2241ee05cbef","year":null},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:885d146c8e54577b9f9c49fb8187174e6a7321c946ed9ac905e364c0bd9d8b0d","observation_id":"a29e50ea-5c77-444e-b43f-f1be4d137950","resolution":{"observed_at":"2026-05-24T10:26:08.519472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"General in- cremental learning with domain-aware categorical represen- tations","venue":null,"work_id":"f5df1a67-8dd0-41f2-83cd-3906543d5863","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:68844719307a872950a88c2509fe02dd337507732936b1960a58e7983cd89ee2","observation_id":"329bfc88-5a5c-4e83-bc52-8d79c53447ed","resolution":{"observed_at":"2026-05-24T10:26:08.507801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Bhattacharyya","venue":null,"work_id":"49909d97-179b-48e4-8765-18a0ddf16bc7","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:5e7e3da0c264b9fbae5aec1e64797ff4fcd545101ec0cd1677d0cffbae02643b","observation_id":"6a611772-0d79-489f-8c49-40cee6e5f5ef","resolution":{"observed_at":"2026-05-24T10:26:08.529273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Sola: continual learning with second-order loss approximation","venue":null,"work_id":"09a74e05-45f2-4274-ad00-837e691e2031","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:bc5524bb7472956f8bdf82a0d79687f29eac486617d7430c2de8e489fb80ee43","observation_id":"e68472b6-fac2-4d63-8d21-dde8d613c012","resolution":{"observed_at":"2026-05-24T10:26:08.593141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online coreset selection for rehearsal-based con- tinual learning","venue":null,"work_id":"e540c6ec-2e09-40f6-b631-0c9b863761f0","year":2022},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:96f62c3c08ac05658bc7bf6c765ab1a4286bf33855792ef912fdc5a940b32ee0","observation_id":"8bb15226-a0c3-475a-8b02-fc545a85e12e","resolution":{"observed_at":"2026-05-24T10:26:08.590054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Contin- ual learning through synaptic intelligence","venue":null,"work_id":"bbe92926-91f5-4d1f-9f37-2f3bfbd038a7","year":null},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:0dfe372ac37d05cb47d4325f9a5081edbf2d843c9d74e9889d42920f1e759ade","observation_id":"d9c3b7a4-0af8-45a2-aa79-6e2574da2111","resolution":{"observed_at":"2026-05-24T10:26:08.583420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Maintaining discrimination and fairness in class incre- mental learning","venue":null,"work_id":"353c3c88-ac3b-4170-9210-a4549df3896b","year":2020},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:4cfc488da95227bb4481a8e4063dadc7b6dc8b1c7ccd33ce04def43fba68f994","observation_id":"d69de1cb-84da-4ae9-8dfd-ea61b09c582a","resolution":{"observed_at":"2026-05-24T10:26:08.514193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Implementation Detail We implement our proposed method and baselines on the same code base, based on the learner-evaluator framework proposed in [8]","venue":null,"work_id":"eb74e4a9-0d90-40e3-b3d1-16a23d7b0c2f","year":null},"citing_paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-24T10:25:24.418200Z"},"links":{"citing_paper":"/paper/2211.16780"},"observation_digest":"sha256:f7c7e3365ec259c042738404182ad55c2497889f5bee40a23841a2fdb95ec347","observation_id":"cbd01376-dbfb-411c-bbf7-17f21de754fe","resolution":{"observed_at":"2026-05-24T10:26:08.522782Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2211.16780","last_updated":"2026-04-16T02:20:57Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T12:50:55.716325Z","submitted_at":"2022-11-30T06:40:29Z","title":"An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":3,"verified_fuzzy":47},"total_outbound_references":53},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2211.16780."}