{"as_of":"2026-08-15T13:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:372373b132cf7fe6477f77b80b1aeb1b22d123c50ce89cd36532bc80df74bcd7","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-08-11T16:21:30.199461Z","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-15T06:32:42.880941+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-05-13T04:58:54.441083Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T05:12:18.185618Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"cited_work":{"arxiv_id":"2412.10185","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.10185","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Solving robust markov decision processes: Generic, reliable, efficient.CoRR, abs/2412.10185","venue":null,"work_id":"4fafcbdd-aa32-421c-917a-927f1a39b3a3","year":null},"citing_paper":{"arxiv_id":"2605.12262","last_updated":"2026-05-12T15:28:34Z","snapshot_observed_at":"2026-08-15T03:45:51.965950Z","submitted_at":"2026-05-12T15:28:34Z","title":"Missingness-MDPs: Bridging the Theory of Missing Data and POMDPs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T04:58:54.441083Z"},"links":{"cited_paper":"/paper/2412.10185","citing_paper":"/paper/2605.12262"},"observation_digest":"sha256:aafe7c58d7b73d780e1e79ba20df3503d719f65abca4844102e591254d8f46dd","observation_id":"e5c40f41-4989-40aa-b590-0aabf561ceb3","resolution":{"observed_at":"2026-05-13T05:12:18.187256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.10185/citation-record","integrity":"/paper/2412.10185/integrity","json":"/paper/2412.10185/citation-record.json","paper":"/paper/2412.10185"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.008453Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.008453Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:22f158818e539f98961e6d349fbe254f6ce7e6ee1dac0d6600ed2ecb7ddd1270","observation_id":"a0bce61c-7b38-4720-8718-d3caf181fdf9","resolution":{"observed_at":"2026-08-11T16:21:30.008453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.013105Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.013105Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:c7652a3d3e9ca67f84d0d0d8d29294134f6287133ce0c11b6ab4a0700228a4b1","observation_id":"5a9f512d-751e-4678-acab-81e165f5537e","resolution":{"observed_at":"2026-08-11T16:21:30.013105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.771569Z","title":null,"venue":null,"work_id":"ec034829-3569-4cf4-9f0c-e1f28b26ca60","year":2017},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.017155Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:85eebbfeeea1b5d1a539973036a91ceb756847d0c5dde7222f3f34f4d791efba","observation_id":"764df972-99ae-4c72-9ea0-40ea7d860f40","resolution":{"observed_at":"2026-08-11T16:21:30.775466Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.760571Z","title":null,"venue":null,"work_id":"bc0f9463-f7f5-4bf0-bea8-5e702a59a87b","year":2019},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.021256Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:313a8cbf888d6d07e63436806c930c2d2bb91bc6fbd4e19717505be86cb2f407","observation_id":"c447ac21-d23f-4ed9-b80b-0370ad8c7244","resolution":{"observed_at":"2026-08-11T16:21:30.764185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.749719Z","title":null,"venue":null,"work_id":"75919919-3111-4165-b34e-5796136a225e","year":2022},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.025044Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:e30a0f944f461196e84787d9d95259a40d01081f6d712436696118479722f671","observation_id":"d6525ec1-23c4-478a-b06b-ecfca10caae7","resolution":{"observed_at":"2026-08-11T16:21:30.753329Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.738481Z","title":"S.; Sim \\ a o, T","venue":null,"work_id":"3465634e-3e3c-43da-a454-2674488e23f2","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.028906Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:e4448a46d9632d7b963e889976bc3400de7c56e430f20b715dc1fd51a51dfa66","observation_id":"7c5603ef-363a-4dad-ab82-b78144a9482f","resolution":{"observed_at":"2026-08-11T16:21:30.742154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.032878Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.032878Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:3005fa6ab1cb03b053b91b5ff227fcd31e138919783cfdc283ef8b09295aae61","observation_id":"545a57b0-8f77-4e40-a189-321ba6f238da","resolution":{"observed_at":"2026-08-11T16:21:30.032878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.721122Z","title":null,"venue":null,"work_id":"d7db5271-51ba-4708-ad79-2f1a0d6475fb","year":2017},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.035874Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0b0f27e9d47b198a9ac270448d0024a06bb6d591d15167795231de6673ecb4e3","observation_id":"dec00876-dba5-4e35-afbb-07fe3ea0cbfb","resolution":{"observed_at":"2026-08-11T16:21:30.724768Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.709804Z","title":null,"venue":null,"work_id":"6dde3194-f129-42f9-8243-bc9ee7d9570d","year":2018},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.040043Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:e7f274131ce09d4a6c665ca9b781b8c91b6cc1a8f49a2dc81c21638cab15d6b1","observation_id":"d2046376-edea-438a-88e0-7686ff75030d","resolution":{"observed_at":"2026-08-11T16:21:30.713570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.698725Z","title":null,"venue":null,"work_id":"d2b22e5e-ab2f-43e4-a5d5-cc6e2d2b122a","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.042956Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:16c30e92891aa35702fa3c2164458c39f619acdf0f34dd22e3709fb087e8f000","observation_id":"1425edfa-94dc-49fa-88aa-aab1059ec90c","resolution":{"observed_at":"2026-08-11T16:21:30.702452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.687441Z","title":"P.; and Tsitsiklis, J","venue":null,"work_id":"3c324212-1cef-47af-94d6-9777ab43cdb9","year":1991},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.046851Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:85c9a47ee82c6772e3335ef788e35b2508303ce67b4cbbaeb818d5078dc28ee1","observation_id":"6a75aa4b-c200-4a14-96ed-8585b2927243","resolution":{"observed_at":"2026-08-11T16:21:30.691425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.676567Z","title":"Z.; Parker, D.; and Ujma, M","venue":null,"work_id":"f7b7b562-0c3c-4c3f-907a-81ec0ceb75d5","year":2014},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.050330Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:2ed2ca16835727b298bfab43ae3cf7e9584ca751759c3c735e505e30c8c98be7","observation_id":"9dd07b05-3740-4419-b72a-0c9b4438d7cd","resolution":{"observed_at":"2026-08-11T16:21:30.679961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.666291Z","title":null,"venue":null,"work_id":"5e601524-cb21-4ca6-84a6-9dd60ac0ea9e","year":2005},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.053942Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:a7b4fc4c5d812f81824f91469baef788c5123a9bad5b3269b0e3c65209c1424d","observation_id":"b00de0b7-5908-491c-b732-11221f23d7e5","resolution":{"observed_at":"2026-08-11T16:21:30.669525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13912","last_updated":"2024-04-30T17:05:38Z","snapshot_observed_at":"2026-08-13T04:56:05.363051Z","submitted_at":"2023-12-21T15:00:06Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games","version":2},"cited_work":{"arxiv_id":"2312.13912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.13912","snapshot_observed_at":"2026-08-11T16:21:30.285956Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games","venue":"cs.AI","work_id":"40c61a5d-5d0d-4009-b812-1335c39bf2dd","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.057802Z"},"links":{"cited_paper":"/paper/2312.13912","citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:142b7f2c65c7416d880240f55839c9ad6154baea1e670c5b0b2dd979061dc5bd","observation_id":"36c9a7c1-b2b7-4025-85c5-9fa8ded2994c","resolution":{"observed_at":"2026-08-11T16:21:30.289758Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.656791Z","title":"K.; Karrabi, M.; Novotn \\' y , P.; and Zikelic, D","venue":null,"work_id":"2c946bc4-d354-4415-8d99-5709435923d8","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.061865Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0522ee5484aab02202a29e9f468016ed374fdb064a0ae2f09faf274f88ac0c7d","observation_id":"e5da26c0-30d2-4a38-854e-2fd519e2b867","resolution":{"observed_at":"2026-08-11T16:21:30.659692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.647831Z","title":null,"venue":null,"work_id":"ad542242-086f-440c-b713-ed009b795c2a","year":2008},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.065313Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:fe6908653d2cddb22de1473a80b968c13409094a3372ed2b1258344dd6cd78eb","observation_id":"a14d39fd-9374-4801-b14f-a3a4871476af","resolution":{"observed_at":"2026-08-11T16:21:30.650866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.637406Z","title":"Z.; Parker, D.; and Simaitis, A","venue":null,"work_id":"c9321925-9480-41a4-97a1-9eb30aefe98a","year":2013},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.069326Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:773ab5f20b6bc94494ca0d678513dbf4c429651d1a27faa3f1e023ed5c290c6a","observation_id":"80e820e6-493b-4b5b-83ad-073dca375f82","resolution":{"observed_at":"2026-08-11T16:21:30.641375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.627142Z","title":null,"venue":null,"work_id":"a58300e4-d901-4ae1-9c57-cd55003ac572","year":1992},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.072845Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:058cec4ffec2aeb9e8f677a0e41c9fa8fad72e552203e1a80d510bccc044b1fd","observation_id":"78cdbd79-237b-4cf0-a689-1e14fe4b2689","resolution":{"observed_at":"2026-08-11T16:21:30.630579Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.616380Z","title":"A.; Kret \\' nsk \\' y , J.; and Petrov, T","venue":null,"work_id":"cc74803c-d587-4d6d-ace5-14ff41cba7a4","year":2017},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.076356Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:b6164b7578703d8279aa9553c0fc7e8a6ced63e5622c3742a28fb16ed6ac63fa","observation_id":"e66b2fcf-f6e0-404c-95be-1852edac51c5","resolution":{"observed_at":"2026-08-11T16:21:30.620054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.605731Z","title":null,"venue":null,"work_id":"be8b562d-ce47-42d2-aa43-2195e51992c7","year":1997},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.080269Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:f8082a85664f9fc815914c1735a58bbf775ea5d3b77e29760c1951fee94b83c3","observation_id":"2c3e25d9-097d-4615-920c-4341cc5ccb37","resolution":{"observed_at":"2026-08-11T16:21:30.609353Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.594233Z","title":null,"venue":null,"work_id":"705cc307-b3a3-435d-a113-c3763b05aeb2","year":2000},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.083956Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:494375530544a652da1664149acbc9b4040dd8a8c536f9b41d7d05a96607f04b","observation_id":"35a3ebab-6818-49e9-b39e-c52a375105d7","resolution":{"observed_at":"2026-08-11T16:21:30.597935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.583483Z","title":null,"venue":null,"work_id":"496db0d4-83eb-45cc-8b07-4c6d352cbad9","year":2022},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.087773Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:a6f5859483bbc75427417d1a572be22537fa8c260a887befad1707acc85a6996","observation_id":"70d0c8b7-d6a0-4555-99a2-1533bc7f59c7","resolution":{"observed_at":"2026-08-11T16:21:30.587180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.572133Z","title":null,"venue":null,"work_id":"40225a99-36b3-4afa-a561-0f5321c03754","year":2000},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.091353Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0f6408ec76e74ce56fa85a0b1dece91a4cd5cbbf18665728b1c016c0dd355261","observation_id":"39f645f1-784b-48f7-a823-8234e8177e30","resolution":{"observed_at":"2026-08-11T16:21:30.575997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03618","last_updated":"2025-01-14T15:24:52Z","snapshot_observed_at":"2026-08-13T05:08:35.725615Z","submitted_at":"2023-12-06T17:04:08Z","title":"Beyond discounted returns: Robust Markov decision processes with average and Blackwell optimality","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03618","snapshot_observed_at":"2026-08-11T16:21:30.094925Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.094925Z"},"links":{"cited_paper":"/paper/2312.03618","citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:d2063354dc06a6f7ec0d18da02542acd206d9ffdd81a587bfdbcedcb6207af38","observation_id":"2aef803b-deac-4dc4-954f-674a1fa53716","resolution":{"observed_at":"2026-08-11T16:21:30.094925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.560653Z","title":null,"venue":null,"work_id":"0f9d0e39-804d-4ccd-b43e-c3b4b8c9c2bd","year":2003},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.098821Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:f8052b12b0058d27b3bfc989ef23494753ed95b9f028059f8180c738d14d7919","observation_id":"ea2e8f5b-b22d-4c0a-9e50-5ce034fb35ac","resolution":{"observed_at":"2026-08-11T16:21:30.564391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.549736Z","title":null,"venue":null,"work_id":"f6b98dd6-6eaf-45d4-b0db-91f7902a47d1","year":2018},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.102392Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:a289f7c26eef2577167a2789aebdb6d8f6dbfb0b9857afb2c5ffd17e0cde988d","observation_id":"27a29c25-a75a-4148-b4c5-d206d341b132","resolution":{"observed_at":"2026-08-11T16:21:30.553508Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.538609Z","title":null,"venue":null,"work_id":"2d94fb78-ff27-4992-8360-0fe4a87c597a","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.105916Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:f5f98edfa755e9b5425ebf40fe0fd6abdf6def5f7246984164de9e2cf6e2bf17","observation_id":"737fa128-4e4f-4478-a68e-f9dcd6e8b046","resolution":{"observed_at":"2026-08-11T16:21:30.542554Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.528065Z","title":null,"venue":null,"work_id":"164472ee-3b9f-4dbf-8cff-6379234819a8","year":2020},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.109770Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:d8695e8054bbfdd172b8f79600e848700bf51c541b74d6a1877da02544e93880","observation_id":"68e0df69-33d9-4d55-bd41-f4153694e79f","resolution":{"observed_at":"2026-08-11T16:21:30.531273Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.517505Z","title":null,"venue":null,"work_id":"556862a5-75c9-4674-b2d9-d8c280513698","year":2019},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.113365Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0f46ecbb42c9f73e1d0a14eb35b36890a9ee973d152670ea57763ddb460a7f80","observation_id":"73837273-6a8d-4f10-9fad-acabc7484821","resolution":{"observed_at":"2026-08-11T16:21:30.521078Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.116872Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.116872Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:14ec5c9422f839f4ce94bad964a4969b4e5955e68f2a9372c8a6cc76fea767a9","observation_id":"1346711b-fbd6-46fb-87fd-d21eed053e35","resolution":{"observed_at":"2026-08-11T16:21:30.116872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.501681Z","title":"P.; Petrik, M.; and Wiesemann, W","venue":null,"work_id":"9b184dce-a867-4757-8820-20fb8adf3c5f","year":2018},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.120230Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:4d501c05885cd063f52a2f65539b6b70f05192ae915b64aa6ec21aa461256e9b","observation_id":"d401b37d-9f36-412f-b01d-6704ab701436","resolution":{"observed_at":"2026-08-11T16:21:30.504671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.492467Z","title":null,"venue":null,"work_id":"b87ec974-31e2-414d-8cb5-7799924a1741","year":null},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.123546Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:dbc26904eed0deef2fced405e3ea30899f83233c099583d0ad80966e47f49480","observation_id":"0a458575-560d-48b2-a991-d353bf39c4b8","resolution":{"observed_at":"2026-08-11T16:21:30.495376Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.482600Z","title":null,"venue":null,"work_id":"55d016a9-90b0-4fa9-8a2f-a6619b482fbb","year":2005},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.126697Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:ae83e4b1eae5c72fe04d36cd01327fad97c71bc0845ca0237e423a6103f84cad","observation_id":"221f4cf8-581f-44f9-8f6c-9f170a261424","resolution":{"observed_at":"2026-08-11T16:21:30.485915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.472026Z","title":null,"venue":null,"work_id":"f09686a8-4e16-4323-9691-6c4334a5c2e1","year":2022},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.129710Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0db9a13c34efbfd9dae19b90114e046d01107ad21e7fd8b2beccf137534ac73b","observation_id":"28e79b5a-2e4d-4138-bc54-c9e275183a31","resolution":{"observed_at":"2026-08-11T16:21:30.475535Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.461694Z","title":null,"venue":null,"work_id":"9e070bea-12a1-40f3-b30c-1e91cca10d22","year":1984},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.133026Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:785ee6a5cc367dead81b34a061c4d24a61d1cbc2832477ecd668a7547e266457","observation_id":"0ac4708c-92bf-4111-9582-27849e83519b","resolution":{"observed_at":"2026-08-11T16:21:30.465156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.451667Z","title":null,"venue":null,"work_id":"cba5d51f-1280-46a3-ab81-a9ca53fe233d","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.136311Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:4313661e90233064afeebda800dd3f18c767129c8f597efa3f202bf01082bd74","observation_id":"984461d2-ae30-405a-955d-8b444e56319f","resolution":{"observed_at":"2026-08-11T16:21:30.454980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09930","last_updated":"2023-04-19T19:09:55Z","snapshot_observed_at":"2026-08-13T11:59:11.263403Z","submitted_at":"2023-04-19T19:09:55Z","title":"Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives","version":1},"cited_work":{"arxiv_id":"2304.09930","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.09930","snapshot_observed_at":"2026-08-11T16:21:30.258687Z","title":"Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives","venue":"cs.AI","work_id":"8033df95-7bd7-4e5e-be84-70455cf575d6","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.140007Z"},"links":{"cited_paper":"/paper/2304.09930","citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:9e27a448e5831db4d2c64936beac58fdd1d8bd52497d8bde563134a2c618b824","observation_id":"a8a54ced-884b-4703-aa6d-a9a62fe20d06","resolution":{"observed_at":"2026-08-11T16:21:30.263028Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.441178Z","title":null,"venue":null,"work_id":"6ba071b3-7985-4572-9201-8d8457c94cbd","year":2011},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.144039Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:f572ae69a1c2e186fb48385ff06a5ca9e96c094ef0770f728562b9d5fcc4d99e","observation_id":"ecf99a8f-2a5f-42d0-81f6-39579a23e170","resolution":{"observed_at":"2026-08-11T16:21:30.445086Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.429624Z","title":"B.; and Belta, C","venue":null,"work_id":"8f1b3443-fae9-42af-be60-991c27fd9bcb","year":2015},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.147931Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:d6eed584980e97a44a93596bbbd7da7b5d4991dc6457db3cf5680b932f837af0","observation_id":"50c72489-239f-479b-8dc7-d7ded9081995","resolution":{"observed_at":"2026-08-11T16:21:30.433765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.418070Z","title":"B.; Lahijanian, M.; and Laurenti, L","venue":null,"work_id":"de7c22dd-6f22-4fc7-b71a-33dbd7d5864a","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.151643Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:3255a9d6d05cbae791930ec42f47a6a5a04024cce58473c8372fe218b5adfb7f","observation_id":"3c95a20d-2949-4665-9d15-5b61b8edcbb0","resolution":{"observed_at":"2026-08-11T16:21:30.421750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14385450","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.226305Z","title":null,"venue":null,"work_id":"f51399b7-4519-487e-8e66-1bd3e6c2d48f","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.155249Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:6216fee1822027b6a5456df8d242a88c95f40b1f0c92c5b28d2d63a06184e7e9","observation_id":"73466c88-5928-4b5c-9c52-9cca9686deb7","resolution":{"observed_at":"2026-08-11T16:21:30.231171Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.405984Z","title":null,"venue":null,"work_id":"ef64b605-43e3-4770-b95e-0af69a280bc5","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.159143Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:18b66bec1173d07f475cf47c8028946f86f915c362a4bbb8e7c201211ed61325","observation_id":"dcd8cee0-3631-45cc-836b-e8e4beba112d","resolution":{"observed_at":"2026-08-11T16:21:30.410049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03885","last_updated":"2024-05-13T07:41:41Z","snapshot_observed_at":"2026-08-13T00:13:34.607463Z","submitted_at":"2024-05-06T22:07:26Z","title":"Playing Games with your PET: Extending the Partial Exploration Tool to Stochastic Games","version":2},"cited_work":{"arxiv_id":"2405.03885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03885","snapshot_observed_at":"2026-08-11T16:21:30.242655Z","title":"Playing Games with your PET: Extending the Partial Exploration Tool to Stochastic Games","venue":"eess.SY","work_id":"f3968b70-fc84-4ee2-a954-9e5a75deae4f","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.162953Z"},"links":{"cited_paper":"/paper/2405.03885","citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:8b461a580e3d5ae969edaa7a6913fc5b151e128680560d32ddff986e70d9920f","observation_id":"11afad3b-679a-4af8-ad9a-f22afa037efd","resolution":{"observed_at":"2026-08-11T16:21:30.247600Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.395265Z","title":null,"venue":null,"work_id":"dbb47e25-2898-43b2-9b81-8afbe62d9959","year":2005},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.167318Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:58959929fb094e5db33077e15e75c2a01df4d43cc7b7f9d59dd0b419b16d9e40","observation_id":"d8989ee5-4308-4cba-b8a3-56c15eb51c2a","resolution":{"observed_at":"2026-08-11T16:21:30.398812Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.386222Z","title":null,"venue":null,"work_id":"82b51315-ac51-44aa-be32-ebf57cc5cc2a","year":1994},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.170779Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:8d57b54ff1c4e09def975987a4f275e17c0bfe3e0013e70fd29986cb25f23131","observation_id":"a5165bbc-b7f4-4c68-9c18-fda29ad7d22c","resolution":{"observed_at":"2026-08-11T16:21:30.389233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.375333Z","title":null,"venue":null,"work_id":"a203271c-679b-407a-9084-ba7f92052d7a","year":2006},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.174246Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:b9570109559a6ec977f804e0cad69c506cfe41c9ee2e4fbd33d1fe614df3ca99","observation_id":"fa46bd2f-34d5-42f0-8c4c-6512a328880b","resolution":{"observed_at":"2026-08-11T16:21:30.379207Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.365038Z","title":"L.; and Littman, M","venue":null,"work_id":"110fe591-fb5e-4279-90df-84fa15c3dd2e","year":2004},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.177888Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:cfba3655627630400691d8ea7b18f50188e125e7f69849ab9ae0daeaf62dd2d9","observation_id":"2e479e17-5f1f-47d1-af93-7b022691906e","resolution":{"observed_at":"2026-08-11T16:21:30.368539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.353644Z","title":null,"venue":null,"work_id":"e4759f1c-20d5-452d-935b-a66e75d77bbb","year":2007},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.181364Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:afed0fd6cfa788b46f8a2f042cc10c72b3712f54dc001da596d8603d8841b199","observation_id":"7f319031-5f26-4a40-86ff-2d5ccf2644af","resolution":{"observed_at":"2026-08-11T16:21:30.357293Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.342588Z","title":"K.; Prater - Bennette, A.; and Zou, S","venue":null,"work_id":"d026cf71-fc01-46a9-a5b0-6ecbc4169a74","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.184780Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:68220a3fba59758df70b94e66403812e9be37a29ccbaaac835eab55c50751afc","observation_id":"e0628565-0bb0-4619-b8f8-9efdc10d9b19","resolution":{"observed_at":"2026-08-11T16:21:30.346421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.331495Z","title":"K.; Prater - Bennette, A.; and Zou, S","venue":null,"work_id":"fd09a33c-cb32-427b-84f6-8cbcffe66c82","year":2024},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.188238Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:00dbf17262e7fe539ef8cab87359873c9dc5c0db131b0a41cc722e1d4f29272a","observation_id":"5f8dbfda-29b7-451a-bc89-34acd363af4b","resolution":{"observed_at":"2026-08-11T16:21:30.335306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.319152Z","title":null,"venue":null,"work_id":"91cc9386-1f8a-45ca-94f3-41ef5a2cf94a","year":2008},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.191862Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:1bcac4f9613efe3e2c3c434125851c1a78fbe03325337787cb2fc55943d8f923","observation_id":"12f05584-72d2-4539-b547-9ac9b7b2e8f8","resolution":{"observed_at":"2026-08-11T16:21:30.322869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.307873Z","title":null,"venue":null,"work_id":"f80d4943-f1a3-4567-a8e8-e8f8c53027a6","year":2017},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.195844Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:b8009613adf72d5a9985b251055ae3e5a2b7c7b04a245237156a81296256f429","observation_id":"37cfe780-33a3-416e-a0a2-fdd112655a7e","resolution":{"observed_at":"2026-08-11T16:21:30.311581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:21:30.296997Z","title":null,"venue":null,"work_id":"67279f33-2db8-4631-8e77-005442ee96b6","year":2017},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.199461Z"},"links":{"citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:0339ccfd6c4c3f39f3a9578acca6df0c097d9a00629bd8f2e2c52674ca20fe5d","observation_id":"39fb2783-40c0-46a3-941d-1a8ccff88427","resolution":{"observed_at":"2026-08-11T16:21:30.300670Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":37,"verified_exact":3,"verified_fuzzy":12},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2412.10185."}