{"as_of":"2026-08-09T20:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e40caa979a354edb0113d19f7d6b5ec3538185a33355db4e98c2a068edb225e4","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:43:11.520892Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T08:05:55.418491Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T08:06:47.657564Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"cited_work":{"arxiv_id":"2505.18005","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18005","snapshot_observed_at":"2026-07-02T08:06:47.657564Z","title":"arXiv preprint arXiv:2505.18005 , year=","venue":null,"work_id":"408813e5-f89a-4685-926b-47fb4ce8a337","year":null},"citing_paper":{"arxiv_id":"2606.28973","last_updated":"2026-06-27T15:25:34Z","snapshot_observed_at":"2026-07-07T00:02:57.622708Z","submitted_at":"2026-06-27T15:25:34Z","title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2505.18005","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:a1cd216c59ee8da5a2c4883ec70856bb9230be07bd6e9aa54669991829720e5e","observation_id":"0b983095-ce24-463e-a4d1-6194ecf64cfc","resolution":{"observed_at":"2026-06-30T08:44:27.713865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"cited_work":{"arxiv_id":"2505.18005","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18005","snapshot_observed_at":"2026-07-02T08:06:47.657564Z","title":"arXiv preprint arXiv:2505.18005 , year=","venue":null,"work_id":"408813e5-f89a-4685-926b-47fb4ce8a337","year":null},"citing_paper":{"arxiv_id":"2607.00665","last_updated":"2026-07-01T09:13:24Z","snapshot_observed_at":"2026-08-03T18:18:39.283181Z","submitted_at":"2026-07-01T09:13:24Z","title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2505.18005","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:55c6c42819141c0eae58b3b9328b91b814859911104d2d919676ffdb701e9553","observation_id":"d6e56aa1-edba-44d9-87ce-f839372e988d","resolution":{"observed_at":"2026-07-02T08:06:47.658855Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.18005/citation-record","integrity":"/paper/2505.18005/integrity","json":"/paper/2505.18005/citation-record.json","paper":"/paper/2505.18005"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:17.972723Z","title":"Near-linear time approximation algorithms for optimal transport via S inkhorn iteration","venue":null,"work_id":"84ad7b9d-6e3c-4765-b080-950d1adc5919","year":2017},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.188558Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:44e4a856041ef4b5537aa761096d5da150ec567345553418cdba5aa70ab38287","observation_id":"e72f758d-64b1-4110-ba69-b3f8506d90c2","resolution":{"observed_at":"2026-08-07T14:43:18.066721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:17.742755Z","title":"Wasserstein generative adversarial networks","venue":null,"work_id":"cadcfd69-3895-4fbd-95bb-74a1e3053a48","year":2017},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.248264Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:a894186e777dbc44683713b31134b0ab0f0606c6f19f3f06818e5be206d3b777","observation_id":"feabed67-1f25-40a2-b946-1cadf2a11e90","resolution":{"observed_at":"2026-08-07T14:43:17.863773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:17.532407Z","title":"Causal transport in discrete time and applications","venue":null,"work_id":"80994386-7af7-48d9-86e7-1d890cf382bd","year":2017},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.333401Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:147f7b00e195200b8249c23410dcf2b97af662c72ba5dc366bbfdcf9de6c85b1","observation_id":"8b0c0abb-d21f-49a7-9ab4-65e0c383cbe1","resolution":{"observed_at":"2026-08-07T14:43:17.619256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:17.310618Z","title":"Stochastic optimization for regularized wasserstein estimators","venue":null,"work_id":"3e45236a-3784-4a24-b0fd-de49dfe33989","year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.397164Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:e059eec314f86c575ea8914161ce895d32ba29dd0d4993e655b742dff6bb6b1c","observation_id":"281aee69-4e33-4248-987c-cd6f1ddd53c7","resolution":{"observed_at":"2026-08-07T14:43:17.437615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:17.122023Z","title":"Distances for M arkov chains, and their differentiation","venue":null,"work_id":"6cd61f04-b1a9-4c3e-b593-b9aaf66c1380","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.472841Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:6e6bb0ba77bfc78c9b6c9a97e158dffd6f6f12d46e2517a25c0a453c0d6b6e30","observation_id":"dd68743e-25ae-46da-a264-aa7d3c845b7a","resolution":{"observed_at":"2026-08-07T14:43:17.196710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:16.877913Z","title":"Bisimulation metrics are optimal transport distances, and can be computed efficiently","venue":null,"work_id":"4f8182aa-a391-4abc-ad27-68e5861173a8","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.553519Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:24a8a6138a6777dc0827100c4c6f3b3776f9212958533c52ee9fea738f610817","observation_id":"3b7617cd-d613-4547-a766-5407be4a5d3b","resolution":{"observed_at":"2026-08-07T14:43:16.997601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:16.662114Z","title":"Scalable methods for computing state similarity in deterministic M arkov decision processes","venue":null,"work_id":"1e88f575-0085-4cc1-85ee-ff17c86acc8d","year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.626075Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:6efb5f93b28af2ec5fbf6360826693f0eaaa304dffa1aba7f47c3f20d02433f7","observation_id":"ff4e611f-aa39-4b87-985e-fbe45774505e","resolution":{"observed_at":"2026-08-07T14:43:16.762703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:08.699935Z","title":"Prediction, Learning, and Games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.699935Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:f2e701e370bdcb2240b8857c55ac5ff565d42ecf355c68cf650f735e3641b2f5","observation_id":"e84900c1-40c5-4715-bc9a-685195344550","resolution":{"observed_at":"2026-08-07T14:43:08.699935Z","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-07T14:43:16.428251Z","title":"On the complexity of computing probabilistic bisimilarity","venue":null,"work_id":"6e22a7e2-1fa6-47bd-a9be-6cf2a38d1389","year":2012},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.770975Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:4d9bbfe18ed5bcb9c17d889865e69350d037700055f39bc5e3816eab347918c8","observation_id":"53db93b7-d64e-40e8-8148-f758f5b3a27f","resolution":{"observed_at":"2026-08-07T14:43:16.538394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:16.219579Z","title":"Learning Representations via a Robust Behavioral Metric for Deep Reinforcement Learning","venue":null,"work_id":"af229bf0-e1f8-4552-a550-fc7e8f04d1a3","year":2022},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.823244Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:6c733933a9e7d28a6eb4f8d1901a7782e69248dd30d42551abc8cb863791f0ba","observation_id":"a257cb3e-9ac4-4380-9c94-08032629252a","resolution":{"observed_at":"2026-08-07T14:43:16.322517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:16.083544Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":"83622f6e-5fc7-449e-8220-d23cd5cef158","year":2013},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.906861Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:eff15ceab854ab4c58148b61acd556d1934fa945ac7005a69c8032c3ebe14e00","observation_id":"fe68e7f0-0dfb-4270-9d41-313ba2e73ffb","resolution":{"observed_at":"2026-08-07T14:43:16.150695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:15.938583Z","title":"Metrics for labeled Markov systems","venue":null,"work_id":"ecc63979-238c-4797-865f-a58755cd5e2e","year":1999},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:08.988861Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:fbdd73ddfd2dc40bb78cd3e6ba77c51120c0d9be7fb7020f1acedd400406db94","observation_id":"ad1c96fa-5c98-4f8b-8931-a7617b75dd8a","resolution":{"observed_at":"2026-08-07T14:43:16.016027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:15.774358Z","title":"The metric analogue of weak bisimulation for probabilistic processes","venue":null,"work_id":"e384b9c5-e869-469e-ad59-c0762940dd00","year":2002},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.025199Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:eeba7670473a09d9d49acaebcf6137baca84ecf8c4a1acb9f0f3b8b503702cc0","observation_id":"37a391f6-3a6a-4286-9bf6-033fa0ea0535","resolution":{"observed_at":"2026-08-07T14:43:15.855104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:15.572399Z","title":"Provably Efficient RL with Rich Observations via Latent State Decoding","venue":null,"work_id":"6c7c901f-3475-4381-b361-e08e5144c9fb","year":2019},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.114004Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:8ace9f33ebf6b739329cc30752d1fedc4d580fdcff4c8a516fa97ba686c29a4d","observation_id":"2eb6f4ac-9844-43c7-9b7c-9a4ff8b8bc19","resolution":{"observed_at":"2026-08-07T14:43:15.676806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:15.370241Z","title":"Computational methods for adapted optimal transport","venue":null,"work_id":"aafef8da-8fb1-4440-ba8c-f7c7d6e02a7c","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.182751Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:912e586ca0f00667cb3acb27e9c82bb82bb4bd9526fbf7d6e4c3fbd740b34955","observation_id":"43480cf4-7c7c-4929-8b9e-649b4553a066","resolution":{"observed_at":"2026-08-07T14:43:15.471191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:15.146478Z","title":"Learning with minibatch W asserstein: asymptotic and gradient properties","venue":null,"work_id":"8f9de420-64e8-40ee-a4d1-03f51a88e321","year":2019},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.255656Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:e86a39f8b398cf28c6639136824a89cadf7200160b0c300e34703588ec769766","observation_id":"55e0b47a-971c-4db6-b75a-90e13dc70b0b","resolution":{"observed_at":"2026-08-07T14:43:15.260801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01792","last_updated":"2021-01-05T21:29:31Z","snapshot_observed_at":"2026-07-06T10:30:17.535368Z","submitted_at":"2021-01-05T21:29:31Z","title":"Minibatch optimal transport distances; analysis and applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.01792","snapshot_observed_at":"2026-08-07T14:43:09.317303Z","title":"Minibatch optimal transport distances; analysis and applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.317303Z"},"links":{"cited_paper":"/paper/2101.01792","citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:e8fbd9fb16169615f2f5260d829aa50877868e0efc913bce05f2437e41b72be0","observation_id":"8d9481bd-83e4-4c52-a489-b67a4d27371f","resolution":{"observed_at":"2026-08-07T14:43:09.317303Z","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-07T14:43:14.964778Z","title":"Metrics for finite Markov decision processes","venue":null,"work_id":"b4052c13-bfaf-4eae-b592-37cac6ecade9","year":2004},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.408682Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:3f728d11740dcec123c56112219f5e7f1188eaca32b6b910910e6e1b978b1734","observation_id":"406a8d50-1458-4150-af8b-7a65d039b073","resolution":{"observed_at":"2026-08-07T14:43:15.047131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:14.827083Z","title":"Stochastic Optimization for Large-scale Optimal Transport","venue":null,"work_id":"2f7e8323-d1cb-4347-9fe3-aeac5ba39519","year":2016},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.495055Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:d60ab052fa485a8449ea27d6355468612ed015dc0f67e5c9242cda947be3b77c","observation_id":"f0ebf776-b0dd-47cf-8c18-c4af3cdc3e2f","resolution":{"observed_at":"2026-08-07T14:43:14.902388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:14.660850Z","title":"Learning generative models with S inkhorn divergences","venue":null,"work_id":"736b5000-aac7-4f5a-a6e1-315c3b03e3cb","year":2018},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.576320Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:8ce934a58f45f07336dca7daab54116b48938e32024c728af22667f0d9024366","observation_id":"42b16013-a2d2-4ef4-9cf0-e6baf5e24fee","resolution":{"observed_at":"2026-08-07T14:43:14.756101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:14.499735Z","title":"Equivalence notions and model minimization in Markov decision processes","venue":null,"work_id":"86c54240-8632-40ff-8cb0-db4dc6e1995d","year":2003},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.649986Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:afaa43e22020270fcf279c423b8548ca6b8d6d8eb52ece600643a7b8e8af5378","observation_id":"67f30d23-b620-4b44-a114-8d427d372df5","resolution":{"observed_at":"2026-08-07T14:43:14.602994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09946","last_updated":"2024-04-15T17:15:18Z","snapshot_observed_at":"2026-07-06T18:00:30.424554Z","submitted_at":"2024-04-15T17:15:18Z","title":"A Note on Loss Functions and Error Compounding in Model-based Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2404.09946","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.09946","snapshot_observed_at":"2026-08-07T14:43:11.630902Z","title":"A Note on Loss Functions and Error Compounding in Model-based Reinforcement Learning","venue":"cs.LG","work_id":"f7ac525f-ce30-4c91-bbe4-53725c8dcc72","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.711826Z"},"links":{"cited_paper":"/paper/2404.09946","citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:55b71c8bfd1a3058759cf15b6a4e08bf6b93a8f3dbc91f706303c05dd1e4178b","observation_id":"6c9729fb-0d19-44ba-b573-c0b3f9f05102","resolution":{"observed_at":"2026-08-07T14:43:11.669702Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:14.321510Z","title":"Approximate policy iteration with bisimulation metrics","venue":null,"work_id":"c6144501-fa62-4992-b5cf-5886dbd10731","year":2022},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.805005Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:0d24c51de32e32811f14c16daef9a63e8f14b490c3f75eb95e49847227de9a03","observation_id":"65099c39-ecb1-4bc5-96cf-8ab909b1ed19","resolution":{"observed_at":"2026-08-07T14:43:14.414863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:14.107901Z","title":"Empirical regularized optimal transport: Statistical theory and applications","venue":null,"work_id":"bf7e80e9-dece-4eb7-a3b4-aaef75d40c88","year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.873090Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:aaeeb8581c09627bd5df2348563735940a05df4e0cf77c35ae4b4fd361141d82","observation_id":"fa8d0665-c73c-417f-a6b8-4b23069c9502","resolution":{"observed_at":"2026-08-07T14:43:14.233885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:13.909153Z","title":"Causal Transport Plans and Their Monge–Kantorovich Problems","venue":null,"work_id":"0199b254-7dbb-4777-b823-8c77204bfcee","year":2018},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:09.944654Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:e681f1c63e2fc2f3c98e0ec3f1f61276edd680535f99d9b51928b1d842eda754","observation_id":"b01a1bca-dbbf-4df1-9a9c-0186479c8b3c","resolution":{"observed_at":"2026-08-07T14:43:14.010378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.02971","last_updated":"2019-07-05T10:47:27Z","snapshot_observed_at":"2026-07-06T04:29:24.362640Z","submitted_at":"2015-09-09T23:01:36Z","title":"Continuous control with deep reinforcement learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.02971","snapshot_observed_at":"2026-08-07T14:43:10.014025Z","title":"Lillicrap, Jonathan J","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.014025Z"},"links":{"cited_paper":"/paper/1509.02971","citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:9b5d07bb3413f4f380d2ccfda5aa5d9effcf4a43ce2beba233d49e76a13c5369","observation_id":"11af05b8-20d5-4a27-8dc0-fcd9f445b134","resolution":{"observed_at":"2026-08-07T14:43:10.014025Z","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-07T14:43:13.770892Z","title":"Online sinkhorn: Optimal transport distances from sample streams","venue":null,"work_id":"faff4e15-cd8f-47f2-bea8-21b036543eda","year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.089695Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:39249cd0e08937d861aa204f06ea786a098cc08477f761d89988c52540f4df85","observation_id":"edd86c4b-e55c-4d88-bb49-881cf5a98e3b","resolution":{"observed_at":"2026-08-07T14:43:13.853299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:13.603865Z","title":"Communication and Concurrency","venue":null,"work_id":"e340f8e7-4d93-4125-b6a3-0d575d388aa1","year":1989},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.168344Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:ed5fb992025cc1fd41bf8a25e4f927604149c811c49874beb7c9cfb88f32904a","observation_id":"3ce0b8e8-89e0-41d9-806a-dd4ee897a878","resolution":{"observed_at":"2026-08-07T14:43:13.679505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:13.480040Z","title":"Bicausal optimal transport for M arkov chains via dynamic programming","venue":null,"work_id":"88e8204c-a192-490b-ac07-fbb9747957d8","year":2021},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.227786Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:db7fc78302b61da5a2d82965b98b372996bbd02ba164483620f917610f56d877","observation_id":"459cb7ca-290c-4292-9638-e16b4602fb00","resolution":{"observed_at":"2026-08-07T14:43:13.538995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:13.335276Z","title":"Nemirovski, A","venue":null,"work_id":"e444cebb-9d0c-4e80-9a93-2852809aeaaa","year":2009},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.295079Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:81fcee7ccb87d2520693b3ac04c47d8b9a3a86a44f1b9a79cc2b95fc8ae3272c","observation_id":"466f974c-7315-414e-8400-ecdf58f350a8","resolution":{"observed_at":"2026-08-07T14:43:13.410443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:13.142217Z","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","venue":null,"work_id":"1d916fb3-a999-418f-b8a5-2806002111b6","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.358913Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:70b9c339d199ff2a9c6a7b2f045e387f8f56f37aada93c665187df440a0ee348","observation_id":"60805593-1513-4802-a3c8-a281a7f76a95","resolution":{"observed_at":"2026-08-07T14:43:13.248063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:12.928527Z","title":"Optimal transport for stationary Markov chains via policy iteration","venue":null,"work_id":"c1a1e3cc-1419-49ac-bd60-7f1fd9e71193","year":2022},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.427442Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:490997d800546f23c9cefe59942658c481dff9cf2b06be2eb45bd983b5908e17","observation_id":"f93e72af-2394-43e1-bb2a-3b428faf8143","resolution":{"observed_at":"2026-08-07T14:43:13.040000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-07T14:43:10.495407Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.495407Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:2ffa82d1a78b0bda32270793331e59ef02e4bc416a3fdedcdbfd4ec4fb3f0888","observation_id":"4130639c-e7f9-4634-91d8-d66f8ce48594","resolution":{"observed_at":"2026-08-07T14:43:10.495407Z","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-07T14:43:12.800201Z","title":null,"venue":null,"work_id":"e9e7df17-cfad-4f2d-9bf7-5ed8e9c1a470","year":1981},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.533668Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:3bab06429c18a443fe19156cfcf3ec9569c71fa2d874ea46dd8ec041be476c1d","observation_id":"259949c7-cec5-4336-af95-11d1c8352aa4","resolution":{"observed_at":"2026-08-07T14:43:12.864948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:10.617890Z","title":"Computational optimal transport","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.617890Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:dd99acecc44704b4014df97f9264d919ec76a9020eefc97507b6c219fb579adf","observation_id":"f1855690-bcef-4773-9eb0-61491d2b174a","resolution":{"observed_at":"2026-08-07T14:43:10.617890Z","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-07T14:43:12.630454Z","title":"Pflug and Alois Pichler","venue":null,"work_id":"dc8243f0-b07e-4270-aa48-042ade8c8daa","year":2012},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.699503Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:252fec9174c2c7f727c5f42bcc15f6c43866422d1e30c1007f74906f36c1b5a1","observation_id":"6f5a33c5-dd25-499e-b542-488abeca9a2c","resolution":{"observed_at":"2026-08-07T14:43:12.718458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:12.487007Z","title":"Puterman","venue":null,"work_id":"158017bb-8bcc-49a6-8b22-21233d0a5b76","year":1994},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.772668Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:ec3514489e8f113b371c846fb27adbd60a49ec269034647f84a5e7c0290e388f","observation_id":"a55cc13b-a6db-44ef-8846-3bd33af7e70e","resolution":{"observed_at":"2026-08-07T14:43:12.543507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:10.849403Z","title":"On equivalence of martingale tail bounds and deterministic regret inequalities","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.849403Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:3df1890da9f41e362c6721dd6aa28dbe159c3cf548213505c796d7fce22e1890","observation_id":"5092b065-ad0b-4366-8f97-e609299a26ef","resolution":{"observed_at":"2026-08-07T14:43:10.849403Z","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-07T14:43:10.919172Z","title":"Mastering atari, go, chess and shogi by planning with a learned model","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.919172Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:0fbf9425f3e9316b145ea117218b688eccb1361eb1f396967a9267bc9c7be27c","observation_id":"adcefea9-0976-44bb-ae9f-82e86569ce28","resolution":{"observed_at":"2026-08-07T14:43:10.919172Z","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-07T14:43:12.379253Z","title":"Large-scale optimal transport and mapping estimation","venue":null,"work_id":"c9a49d29-5327-4b53-bd88-b41a3ab0052e","year":2018},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:10.966445Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:41901bc763612dd86faf777db85494d29269e8aa15d179e03046ed49c7ebe95f","observation_id":"a0aee30d-3a2e-4d0c-84c8-20684f45ce50","resolution":{"observed_at":"2026-08-07T14:43:12.429078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:12.253086Z","title":"High rank path development: an approach to learning the filtration of stochastic processes","venue":null,"work_id":"5e129f72-88dc-4331-85fd-06ccebcf3582","year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.020452Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:725901a84ca4b82cf51aca8b07950df693f3e827d0f966cdcf4c8c672e4c0b96","observation_id":"876bc801-2718-42e7-bd2a-a5afa8047804","resolution":{"observed_at":"2026-08-07T14:43:12.303887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:12.179196Z","title":"Optimal Transport for structured data with application on graphs","venue":null,"work_id":"f7899cb8-e7c0-418a-9b66-4167d20425cb","year":2019},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.093694Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:98bdbce8e39fdb8e084d143a8dddcaa5d502f166b17af7ec7b194ec02bfd525f","observation_id":"420b38b7-7cc5-43ab-8087-d3888ca45278","resolution":{"observed_at":"2026-08-07T14:43:12.220627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17032","last_updated":"2025-11-02T13:42:19Z","snapshot_observed_at":"2026-07-06T18:51:06.750136Z","submitted_at":"2024-07-24T06:35:05Z","title":"Gymnasium: A Standard Interface for Reinforcement Learning Environments","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17032","snapshot_observed_at":"2026-08-07T14:43:11.202344Z","title":"Gymnasium: A standard interface for reinforcement learning environments","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.202344Z"},"links":{"cited_paper":"/paper/2407.17032","citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:c10db591e47f094ed9c2f4cbed11f30f1170b08a0f833259f2dbd0dfd5009529","observation_id":"1436d66d-37e5-4121-88b0-29a91229db9a","resolution":{"observed_at":"2026-08-07T14:43:11.202344Z","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-07T14:43:12.052813Z","title":"An algorithm for quantitative verification of probabilistic transition systems","venue":null,"work_id":"0a60067f-007c-4e7b-b815-ec72eb705842","year":2001},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.263758Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:381438474595a7988e5cde9381db3edaed693256c171e94b77f3830073dbffdf","observation_id":"b9883963-f169-4682-a1df-aa5142583a4a","resolution":{"observed_at":"2026-08-07T14:43:12.116659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:11.352997Z","title":"Optimal transport: old and new, volume 338","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.352997Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:dfee2fd42a5b388cb41a6644ca472e322d4d7fb8d463b94694e2f3d0be0c5912","observation_id":"dc67b53b-4434-4222-b52f-792fba428993","resolution":{"observed_at":"2026-08-07T14:43:11.352997Z","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-07T14:43:11.881327Z","title":"COT-GAN : Generating sequential data via causal optimal transport","venue":null,"work_id":"b3c24949-0caa-4d9e-948b-28443a4dee08","year":2020},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.441571Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:97108e8a357dca442c3d0169d3f51a26e8ba2e21d2e4f9e7b76d3967b1a8d1c5","observation_id":"bab85e01-38ce-4b00-8197-7fa4c4d2edeb","resolution":{"observed_at":"2026-08-07T14:43:11.976840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T14:43:11.716417Z","title":"Learning Invariant Representations for Reinforcement Learning without Reconstruction","venue":null,"work_id":"1ae608b7-4e27-47c4-8f80-952815caf1ff","year":2021},"citing_paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T14:43:11.520892Z"},"links":{"citing_paper":"/paper/2505.18005"},"observation_digest":"sha256:48f9c115cc83edeebe4016051669d9313b50246ba89d03ab37795f91b7158193","observation_id":"687545e6-3214-4194-9321-152ed624df63","resolution":{"observed_at":"2026-08-07T14:43:11.806941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18005","last_updated":"2025-05-23T15:09:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T14:34:40.371550Z","submitted_at":"2025-05-23T15:09:04Z","title":"Distances for Markov chains from sample streams"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":36},"total_outbound_references":47},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2505.18005."}