{"as_of":"2026-08-03T22:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f65d9efa14ffc8ad9d2c52318c08a0099c0e37eca584c91143b8e98c408d2c6b","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-23T04:48:12.293349Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2501.10598/citation-record","integrity":"/paper/2501.10598/integrity","json":"/paper/2501.10598/citation-record.json","paper":"/paper/2501.10598"},"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":"Bertsekas, Dynamic programming and optimal control: Volume I, vol","venue":null,"work_id":"944e7821-2080-4f5e-9d4c-e6ca9417c2ea","year":2012},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:3d42fa488784590a8c47aa50c0a192c23761f7c37e0475ccfd66ff090c6a3b31","observation_id":"7cbeb599-8817-4b86-af64-6529ed441302","resolution":{"observed_at":"2026-05-23T04:57:35.045096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"6f1f4783-6d94-4bcd-9278-57083231d5a5","year":2014},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:a9e28ef00c01f4084827f7e27cf319f19cc8975e988a1c9cee9a6d6bd77a8442","observation_id":"0fb24dd4-6017-4b72-8522-ded46f55c223","resolution":{"observed_at":"2026-05-23T04:57:35.035460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"1cfdbbb5-2543-405d-bebb-23f86ded275f","year":2018},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:f39ef9373f12086f4fdb0598cce4665332a47cbcec38ba814d2cf74eff06e5c2","observation_id":"0dd132fc-7f29-4289-b033-accd44ab5260","resolution":{"observed_at":"2026-05-23T04:57:35.038650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Bertsekas, Reinforcement learning and optimal control , vol","venue":null,"work_id":"9a171af4-f28e-4649-8a8e-cf0501360920","year":2019},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:cc05845661998071d6dd9965e8b98915d23807cbd05c426548e8b1fb999d10f1","observation_id":"7a475345-1eaa-4e9f-bb3a-545ff8740e0f","resolution":{"observed_at":"2026-05-23T04:57:35.041820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Mastering the game of Go with deep neural networks and tree search","venue":null,"work_id":"cf051af5-c8cb-4fe5-adb6-ec75f6ba980e","year":2016},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:7b9b88c60ed05bae03e5f82d3afb496b99b1b0d4d202a740e9d8ecce5f88b40e","observation_id":"40e1c720-7707-4cf0-9279-81c9fe9608fc","resolution":{"observed_at":"2026-05-23T04:57:35.048453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Mastering the game of Go without human knowledge","venue":null,"work_id":"8fb13470-88db-42ba-9ea3-bdd4f8e431b4","year":2017},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:da23ed8b3fb25d6c05d980a95ece976fd00386cb267de0f6c4fd007e867d4c6b","observation_id":"069e0972-09a3-4412-baa7-dd7bf726e88b","resolution":{"observed_at":"2026-05-23T04:57:35.051785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Language models are few-shot learners","venue":null,"work_id":"e27e55de-20a0-462c-ad6d-94b8d6d30591","year":1901},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:f8770b5c347a077abc6fe7a15711f67b7df69a55e0d7e011c33d091b19d469cc","observation_id":"2f3ddf9c-f026-4623-be23-58e0de8b63ec","resolution":{"observed_at":"2026-05-23T04:57:35.019476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Dynamic programming","venue":null,"work_id":"0c00a926-a74b-4133-a72c-cd7f5e524464","year":1966},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:a4908984cf8567d7f566eeaa75a154e1c171f19825c64e5b14e05c556f063679","observation_id":"81c87d76-1e39-488f-bbc6-836b2fe6a8dc","resolution":{"observed_at":"2026-05-23T04:57:35.012901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"da608348-3212-47b6-b1aa-2095a9987948","year":2003},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:8fb6aed3afdfcdddedb1e921969c47a5667d1b7943496b1437ffc6d63a1f37cc","observation_id":"52c74273-a77b-4edd-9324-d4bbc2e1f3dd","resolution":{"observed_at":"2026-05-23T04:57:35.015829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Bertsekas, Neuro-dynamic programming","venue":null,"work_id":"39d3fa23-388e-40e9-9a45-8780701915b0","year":1996},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:606ce11c3a5ee234fadb4b913d314b9b874bca281aacdb6f65b8adfaf4b3dc8a","observation_id":"fefa1180-1b72-48c8-a80c-e3a4e3dbe70f","resolution":{"observed_at":"2026-05-23T04:57:35.022449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Least-squares policy iteration","venue":null,"work_id":"803a00f6-55df-4df9-8b87-d705747c2e87","year":2003},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:7903f6681d625f11155a8d1f2fcaf37f3e0476b71295b36bc9bf4f3d4b890132","observation_id":"fcff6faf-2a6e-4bad-9f3f-3a114e01f9a6","resolution":{"observed_at":"2026-05-23T04:57:35.029019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Human-level control through deep reinforcement learning","venue":null,"work_id":"60fda314-f8b9-49fa-a7c8-4af82554c100","year":2015},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:aac8879445fca58eb62f287c3a202f7cc71def0c3fb6979557613549e07400d4","observation_id":"52d22c96-da06-46d3-b271-7e6610d71955","resolution":{"observed_at":"2026-05-23T04:57:35.025477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Multi- task reinforcement learning in reproducing kernel Hilbert spaces via cross- learning","venue":null,"work_id":"9e57daff-f85b-407d-a5d3-f633f3a70744","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:9d89212a90122803703e3c5254a06ca139b49502a262e2c57d2d3b8da7b1a7fa","observation_id":"368fba55-0117-4c07-846f-5ca4966a243d","resolution":{"observed_at":"2026-05-23T04:57:35.061617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor low-rank approximation of finite- horizon value functions","venue":null,"work_id":"85b9a9ec-dfd6-43d2-8782-13fc360fe74b","year":2024},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:16a3017f63f8ffd7dc5a64df2440432087933cca6cc8b3fde9716e7fc35dabd0","observation_id":"c8efdf84-7b3b-456f-91de-90b269275e97","resolution":{"observed_at":"2026-05-23T04:57:34.997045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Lazy approximation for solving continuous finite-horizon MDPs","venue":null,"work_id":"9ace46a4-75db-4bed-9512-3f750f62fe88","year":2005},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:54c39681b24c246ebab116ffd0dc280c0db1af04be9eb6aac8c5be4f050fad0e","observation_id":"117a4497-4add-4293-983d-94d2ea750ee6","resolution":{"observed_at":"2026-05-23T04:57:34.962675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Finite horizon risk sensitive MDP and linear programming","venue":null,"work_id":"4aee4f46-4659-4629-896f-439fb05f09b3","year":2015},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:ce9f82c00d432fb31431f172f749071ec76960f671501bd470b46e8898bd4e80","observation_id":"a4c66b62-9844-458d-85d7-3629ac9b26a8","resolution":{"observed_at":"2026-05-23T04:57:34.987335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 programming formulation for non-stationary, finite-horizon Markov decision process models","venue":null,"work_id":"9aa6cd52-9e82-456e-b865-f7ba66fb5bd7","year":2017},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:816d9d6e66133d3fe134ec52d4ab77edcc1b176e11610397ece152af43ab7179","observation_id":"db3b2ccb-d7d9-4dbf-b4b0-bade920361bd","resolution":{"observed_at":"2026-05-23T04:57:34.990615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 sample-efficient algorithm for episodic finite-horizon MDP with constraints","venue":null,"work_id":"ba7b97c2-961f-4515-a63a-78d92b05ac94","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:45cf969958b456abce6a1f6f0489963ecdd60222736d19576b4b4d85b949edf1","observation_id":"e1d42633-0cc0-4136-80be-a190226e8cc6","resolution":{"observed_at":"2026-05-23T04:57:34.993897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Algorithmic survey of parametric value function approximation","venue":null,"work_id":"3b72aa4a-8a34-42a5-bd45-4740a1f908b9","year":2013},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:4286a462d7cc2d25d861ac6aab36132d1e6c1ba45f1865f33069397383a38e0a","observation_id":"96204ca9-b290-4f0f-8743-ce5253f34b44","resolution":{"observed_at":"2026-05-23T04:57:35.000467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Neural network-based finite-horizon optimal control of uncertain affine nonlinear discrete-time systems","venue":null,"work_id":"aa5bf727-34d5-4802-a109-5e2f717594c0","year":2014},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:5cafb63c204d9befbf74aae8c2d973c37ee17557f77a827dc651a40bce3bceb6","observation_id":"1104cbff-8017-439a-8d9d-1bbc6e71abd8","resolution":{"observed_at":"2026-05-23T04:57:34.968376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Neural network-based finite horizon optimal adaptive consensus control of mobile robot formations","venue":null,"work_id":"eb748258-0bda-4116-8f13-379ed6939fa2","year":2016},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:3834ee4f593cf32e1baf3b7ea5d72f0ca51aed0abbc45bffadca0b5d8b3f30e1","observation_id":"4a09f725-867e-4d99-bdc0-df6348a02a1a","resolution":{"observed_at":"2026-05-23T04:57:34.971179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 neural networks algorithms for stochastic control problems on finite horizon: Convergence analysis","venue":null,"work_id":"fab5189c-82fc-4b8b-8c19-2d92bb5f2ea2","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:ca7e64b62b78c9eeed112a039475eb611de4d060e0f8dbc665e8f80a0397c0be","observation_id":"e99578b4-0cd2-487d-8627-9a1d6d05bc25","resolution":{"observed_at":"2026-05-23T04:57:34.965411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Sample complexity of episodic fixed-horizon reinforcement learning","venue":null,"work_id":"14a54486-412c-4d9d-acfb-30459453c7c8","year":2015},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:49df852653419daef050b7c26b29eef2129554ceff361bb0cdd2090b2678630e","observation_id":"3e104ebd-9b0c-4484-981e-2f299103fa14","resolution":{"observed_at":"2026-05-23T04:57:34.974033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Fixed-horizon temporal difference methods for stable reinforcement learning","venue":null,"work_id":"c8d58a5d-10da-4779-9f2b-08bab0ef9b63","year":2020},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:090932b4d79ff93225b024ddcde197c2c961dbe69928df4616313425eddd6dd3","observation_id":"a0658ebd-2d35-4d55-b662-a6ce3729dcd1","resolution":{"observed_at":"2026-05-23T04:57:34.980528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor decompositions and applications","venue":null,"work_id":"d641a75c-f44b-4c39-a10f-6716fcee5037","year":2009},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:8fba7d43aba10420c8616e1adfc93d7dacc51f7a2e087597dc0d2a64a87e767d","observation_id":"da89ee5c-aa84-4c53-8dc5-59aa2cbb787e","resolution":{"observed_at":"2026-05-23T04:57:34.977480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor completion and low-n-rank tensor recovery via convex optimization","venue":null,"work_id":"7af82507-ad92-40a4-9b0e-9e8d9bf8585a","year":2011},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:bc0f226cab010071a677803a7c7f453fd89609fa700565d14025c533daf06a3e","observation_id":"1f26dcbd-f2d5-4ebb-af93-ba3e3f7a0042","resolution":{"observed_at":"2026-05-23T04:57:35.003829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor decomposition for signal processing and machine learning","venue":null,"work_id":"9f535a3d-e379-46b0-8ce8-82234676e39a","year":2017},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:fd0846108283768914be3b3fd808b46cd360b3269fce3db3ddf8f633726530c2","observation_id":"489283b9-a70c-4ccd-b4ac-875669accda1","resolution":{"observed_at":"2026-05-23T04:57:35.055078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Low-rank tensor methods for communicating Markov processes","venue":null,"work_id":"eb04f5c9-3d36-4ac1-b527-abb495f4b673","year":2014},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:42ec56b73dc82d4ddccff12618b93632e71d7e2e5801f8f8cee2867c370c443f","observation_id":"7e7f7a78-3455-4aba-9bf9-976390dc4358","resolution":{"observed_at":"2026-05-23T04:57:34.947074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Low-rank tensor methods for Markov chains with applications to tumor progression models","venue":null,"work_id":"a0fd4e63-e07d-4f54-970a-7ce08c63b097","year":2023},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:2f85a63f90f3b6850bb76aa07d9e74e3d7db09ea13be94071d1d6027a4bfd1ad","observation_id":"3d4673a3-2f92-493f-873c-ffc78b872f55","resolution":{"observed_at":"2026-05-23T04:57:34.953181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02098","last_updated":"2024-11-04T14:06:49Z","snapshot_observed_at":"2026-07-06T19:44:51.287226Z","submitted_at":"2024-11-04T14:06:49Z","title":"Low-Rank Tensors for Multi-Dimensional Markov Models","version":1},"cited_work":{"arxiv_id":"2411.02098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.02098","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Low-rank tensors for multi-dimensional Markov models","venue":null,"work_id":"4a97ab97-208d-464e-843b-2056b1eca52a","year":2024},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"cited_paper":"/paper/2411.02098","citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:018d321d053fa361ec6313d60cba2755f50a6f2f0fb994d27b26edd81fe28c0a","observation_id":"6330d304-e903-454d-a7ef-6866261e8148","resolution":{"observed_at":"2026-05-23T04:52:34.291424Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03907","last_updated":"2018-06-19T20:14:54Z","snapshot_observed_at":"2026-07-06T05:18:19.763133Z","submitted_at":"2016-11-11T22:39:01Z","title":"Reinforcement Learning in Rich-Observation MDPs using Spectral Methods","version":4},"cited_work":{"arxiv_id":"1611.03907","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.03907","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement Learning in Rich-Observation MDPs using Spectral Methods","venue":"cs.AI","work_id":"8a7ae92a-e2dd-4c1a-aa26-492f330b66d1","year":2016},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"cited_paper":"/paper/1611.03907","citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:f2a03c2d3ec32ee191f895826199d41ac6ec98938453fb953982280bc80103f3","observation_id":"aa47f7d8-6988-4d75-b2de-28063e79d664","resolution":{"observed_at":"2026-05-23T04:52:34.286073Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Maximum likelihood tensor decomposition of Markov decision process","venue":null,"work_id":"34774c96-2781-451f-9f6d-5b0252b2d12c","year":2019},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:a0e2eddc6ad172c348fafa9889e2269a744be1fd50ba550510a20ac53354f8be","observation_id":"6443b709-92d4-4ff3-881a-33fcf2b4dd44","resolution":{"observed_at":"2026-05-23T04:57:34.943603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 good state and action representations via tensor decomposition","venue":null,"work_id":"c60eb108-f012-4b34-9576-f0b3f3e1b14c","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:35dcd55f8f4e0eee65b19e206deb3db33489bff4659103c54882c373bdc49db4","observation_id":"f4476171-de39-4878-88db-2d7445782a20","resolution":{"observed_at":"2026-05-23T04:57:34.940425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 good state and action representations for Markov decision process via tensor decomposition","venue":null,"work_id":"29b858fe-6327-49da-98dc-1615a3aa090d","year":2023},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:c5050d77db93c6b49f1e8851f26c63828102dc0501f4ac83ef8de182e7207871","observation_id":"c562e475-7a45-48c0-805d-271460b6233d","resolution":{"observed_at":"2026-05-23T04:57:34.950196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 high- dimensional stochastic optimal motion control using tensor-train decom- position","venue":null,"work_id":"abc01d17-d2f1-42fd-b3cb-2c4a109e497a","year":2015},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:12012df625af33d15e00a8105596831b41652857b9ab68aa06d696e48b1970c3","observation_id":"a0164be6-8583-47fd-a88a-5aa33370fa68","resolution":{"observed_at":"2026-05-23T04:57:34.959654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"High-dimensional stochas- tic optimal control using continuous tensor decompositions","venue":null,"work_id":"b9df3d20-aa65-47c9-bacb-dcbba8687ea0","year":2018},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:c8a5de5b773564bca359308a188d42b404380c11f085932e855ee26c1e64660f","observation_id":"c8b84b3d-210f-487f-b7a4-7771b7ba62ab","resolution":{"observed_at":"2026-05-23T04:57:34.956193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor decomposition meth- ods for high-dimensional Hamilton–Jacobi–Bellman equations","venue":null,"work_id":"ec8b6fef-558e-4850-852f-789c00e97b4b","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:75b048816cfad7f22eaa74df48d93fc01a1f25e2ea6d42641988cf0b36140269","observation_id":"1ab9fa7d-01b5-4757-924e-69f168ad2521","resolution":{"observed_at":"2026-05-23T04:57:34.922287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Approximating optimal feedback controllers of finite horizon control problems using hierarchical tensor formats","venue":null,"work_id":"f499adcc-58af-4772-be59-818ab660a8d8","year":2022},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:25dcd2cd101a2b256e4c5001b8685362af2e9688e4ccf37ad4f68062bac48baa","observation_id":"78fa3755-e738-4da7-92af-922115298ada","resolution":{"observed_at":"2026-05-23T04:57:34.925030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Harnessing structures for value-based planning and reinforcement learning","venue":null,"work_id":"dc982f96-d591-4db4-8d0c-a002f9892c23","year":2020},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:a87f0c2ca8b46d36c1bb8062d2ee46958057c20bcc599de5721c5620880cbf4b","observation_id":"c051b62c-36fd-409b-870a-2474f2247c52","resolution":{"observed_at":"2026-05-23T04:57:34.927848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Sample efficient reinforcement learning via low-rank matrix estimation","venue":null,"work_id":"84a5cc11-24a2-4108-a32d-edd6a76f0d23","year":2020},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:45dbed8b5f411f2d448bae8ee36995b6a00c9dfc9d05d067c23ae6adfbd3d3f0","observation_id":"02fdc7f4-8921-4c58-93c8-8f1f44a39ca6","resolution":{"observed_at":"2026-05-23T04:57:34.933837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Low-rank state-action value- function approximation","venue":null,"work_id":"810dc385-1646-4d82-a624-8deaf90de834","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:ce910f157aa6598c7ca51e104f403c88c2edc537459a6819f3aba9cb39fc2573","observation_id":"ec6c588b-cafd-4307-8ff1-d41a4707f4a9","resolution":{"observed_at":"2026-05-23T04:57:34.916455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor-based reinforcement learning for network routing","venue":null,"work_id":"bd0099b7-0a3c-4bae-a6f6-a37b71ba1d99","year":2021},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:0685f90df79c51b32e2e837de3c9da0e562d4e43797d536c787ac3c8fa138d17","observation_id":"f78c9a39-d2a5-4664-b8e8-c351935b35e2","resolution":{"observed_at":"2026-05-23T04:57:34.907148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Tensor and matrix low- rank value-function approximation in reinforcement learning","venue":null,"work_id":"aea0d378-a0aa-412d-9290-34d956b26156","year":2024},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:922502ce3e4d2386704fe0bccccc54fb4d3ba776e907e6b4f1af69595aa2275f","observation_id":"aff8e6f3-9aa9-4f82-9b4b-3dc63d80e122","resolution":{"observed_at":"2026-05-23T04:57:34.903851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"PARAFAC. tutorial and applications","venue":null,"work_id":"5ff009e1-9887-46bd-9549-c8791ebaac66","year":1997},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:be88e3167502eafa18f6dbe2e45b4c4d3418b045c9b0b500094092b1d8729129","observation_id":"114671b4-7bfd-48c8-82f7-999297a58be4","resolution":{"observed_at":"2026-05-23T04:57:34.910329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Bertsekas, Non-linear programming","venue":null,"work_id":"8bd12455-0bcc-473b-a9da-9652db34240f","year":1999},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:62f3ddb8de57b2f3b68681f3f5e116edc51a2750d0820f2b597f10c2e8d23331","observation_id":"902c932c-7fd3-4ea6-bca4-03b85cc74450","resolution":{"observed_at":"2026-05-23T04:57:34.913372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factor- ization and completion","venue":null,"work_id":"5f01d1df-2c4a-4617-8304-0ab369eb72b2","year":2013},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:38814d37688cef3aa13ab43a369b737f50df19e0546e396fe040e94013841cb0","observation_id":"f426b95a-be89-4284-939c-08cf8615ce66","resolution":{"observed_at":"2026-05-23T04:57:34.919420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Revisiting fundamentals of experience replay","venue":null,"work_id":"b6e90903-0bba-4f28-9edc-7499d2476fa9","year":2020},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:8538d9f6774ef264d3af57b027b7a298daf1a7a761dc4e613c8395d8a520e9cc","observation_id":"53ba4a59-f3f9-4097-a7a8-8357feb9ca9c","resolution":{"observed_at":"2026-05-23T04:57:35.032381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 finite time analysis of temporal difference learning with linear function approximation","venue":null,"work_id":"1ebf6442-4e18-4500-a934-300ed8119c86","year":2018},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:b6dbfb81a94eed147e4b08b89b9b9d79215dd0ca233c290b2f812f74496209b4","observation_id":"180e5f1e-830c-43ca-84b7-edb8991edd92","resolution":{"observed_at":"2026-05-23T04:57:34.930716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"TD conver- gence: An optimization perspective","venue":null,"work_id":"36c8df49-919a-4bc4-a0a7-b4054165e45a","year":2024},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:668c4c505caad33f8c4d2b7cdb53da1cd50d0db0688cf6918a9c249897b02ef4","observation_id":"2359ece8-a36b-4701-92e3-d630114642b5","resolution":{"observed_at":"2026-05-23T04:57:34.937056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Solving finite-horizon MDPs via tensor low-rank methods","venue":null,"work_id":"af075f46-a014-4f44-8350-39c1281df5fa","year":2024},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:74a6e9bbef74ed62f4c05d829335f046eefd223f69059b53964609fd312ae081","observation_id":"a4162db3-6a86-4e06-9fc0-6a47599f5647","resolution":{"observed_at":"2026-05-23T04:57:35.058333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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 tutorial on linear function approximators for dynamic programming and reinforcement learning","venue":null,"work_id":"fc812d13-282d-4987-8953-64eabd4369f7","year":2013},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:61e89686cc2474533e354fa7cdc6455604d4217d86869cdbd0b1011b99ff05db","observation_id":"6e8f7713-c812-46d8-8385-6246c68f24a0","resolution":{"observed_at":"2026-05-23T04:57:35.010104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Almost-sure iden- tifiability of multidimensional harmonic retrieval","venue":null,"work_id":"86bcd36d-a7c9-4522-bd3c-1e6842e1287f","year":2001},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:8d77340a7fe765a1daeae0b372fa1e28ab9bcab3667762a636529da11a131fa3","observation_id":"c0388454-65c6-4cd8-85a5-3b541eb4880f","resolution":{"observed_at":"2026-05-23T04:57:35.007200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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":"Block stochastic gradient iteration for convex and nonconvex optimization","venue":null,"work_id":"0d36a708-aa0f-4b44-851a-8b63a5a7649a","year":2015},"citing_paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-23T04:48:12.293349Z"},"links":{"citing_paper":"/paper/2501.10598"},"observation_digest":"sha256:7546486a168daa9eefa1e4a4ec492807f3e8924195072bb99eb3ba384eb6c402","observation_id":"4f03a075-edec-4f39-a0c6-1fc4ae74a0d6","resolution":{"observed_at":"2026-05-23T04:57:34.984054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.10598","last_updated":"2026-05-13T13:08:50Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:22:45.422714Z","submitted_at":"2025-01-17T23:10:50Z","title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":48},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 3 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2501.10598."}