{"as_of":"2026-08-11T01:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73353856b22d51bf6fd3eba7c19cafb0fad07acc0898048833c2f5547bd38d28","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T01:20:21.181843Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.27448/citation-record","integrity":"/paper/2606.27448/integrity","json":"/paper/2606.27448/citation-record.json","paper":"/paper/2606.27448"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T01:20:21.181843Z","title":"neurips.cc/paper_files/paper/2019/file/88fee0421317424e4469f33a48f50cb0-Paper.pdf","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:297ab7f91d548ba429cc67ef32165e9921ceb5bb124bbccf878116a3537d7cb8","observation_id":"07e44a8e-f684-4c2a-8b50-4baeb1cbc319","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13013","last_updated":"2025-01-22T16:56:42Z","snapshot_observed_at":"2026-08-10T20:03:07.762781Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes","version":1},"cited_work":{"arxiv_id":"2501.13013","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13013","snapshot_observed_at":"2026-07-01T18:55:59.134962Z","title":"Hippolyte Bourel, Odalric Maillard, and Mohammad Sadegh Talebi","venue":null,"work_id":"05d796a4-89a6-4eb6-99f5-fb667d006dd5","year":null},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"cited_paper":"/paper/2501.13013","citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:23b57e59db7b27c86c4022cc12cc32141aa73ad4ef9cbd487500ebcb41b6a280","observation_id":"0270dfa6-9c1c-4e49-8df8-678260715a3c","resolution":{"observed_at":"2026-07-01T18:55:59.136652Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.05654","last_updated":"2019-10-12T22:30:24Z","snapshot_observed_at":"2026-08-02T20:03:42.135513Z","submitted_at":"2019-10-12T22:30:24Z","title":"Thompson Sampling in Non-Episodic Restless Bandits","version":1},"cited_work":{"arxiv_id":"1910.05654","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.05654","snapshot_observed_at":"2026-07-01T18:55:59.137731Z","title":"Thompson sampling in non-episodic restless bandits","venue":null,"work_id":"90cd5695-d93c-4509-9883-6a81b5aab82c","year":1910},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"cited_paper":"/paper/1910.05654","citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:f7808b6f3a119999d295b60e18078b63ebcdd6c91f4a9b776c4ee459a7780371","observation_id":"767d66c0-aad8-4698-a560-33ac382859f2","resolution":{"observed_at":"2026-07-01T18:55:59.139261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T01:20:21.181843Z","title":"Logarithmic weak regret of non-bayesian restless multi-armed bandit","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:e87ba47e957eda12545587f98c5fe38b5e82be4f361d80d81b0b4089cf4cf18c","observation_id":"82796a65-172f-4a47-b398-e61fd1541736","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":"Learning in a changing world: Restless multiarmed bandit with unknown dynamics.IEEE Transactions on Information Theory, 59(3):1902–1916,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:ddde619994dcc72c724825c678db5ba643bfe8b0d6cebb7920b32898d5cea172","observation_id":"0644c29f-677f-4677-a41f-3abe3660a766","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":"2212.00603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-07-01T18:55:59.140544Z","title":"Near sample-optimal reduction-based policy learning for average reward mdp.Preprint","venue":null,"work_id":"9cb51a59-8e27-4a05-be37-6ba2620bd6d9","year":2022},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:392c962b5ca5295b40fa5af79183494a96d2c186ec6104647ff9c8990cbd6e51","observation_id":"74e3f11d-0540-4342-bec9-7f8b67a8098c","resolution":{"observed_at":"2026-07-01T18:55:59.142261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T01:20:21.181843Z","title":"As a direct consequence of Lemma A.1, the regret can be approximated by ∑T−1 t=1 (g∗−R(t)), where g∗= maxa∈Aga","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:6602e48f6242f6d96651e5f7285d962ace4303c5a33cee2f8a4b9fffabb41b75","observation_id":"a7a8a8ea-be33-49cf-90fe-5610276eef58","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":"Using a change of measure (Appendix C.1, see Theorems C.1 and C.2), we can bind the behavior of the learning algorithm inM1 to its behavior onM2","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:f8be541abc8fa892a84ca9eed9e2de137f9a1fc9514aaea1750aa65b7de99caf","observation_id":"0c3aa586-26cf-464e-b470-16fd06458b68","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":"31 Initial, trueMa Ma Possible alternativeMε a Mε a s∞ ε R= 1 Figure 6: An illustration of the transformationMε a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:945d5d975b58422359fd7c0cb2b7b1e478e0671e6b2107c5c58ee2b84289745d","observation_id":"9f299c58-78d3-45a8-becd-32efe5e06374","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:828248b681906a31058931f575be14a4f0a8c338db66be0d6e8336abc2229dfd","observation_id":"10f814b7-1563-4d38-bc34-51b131b4e9c5","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":"The dominant termC0 b √ |A|Tlog(T)scales exclusively with the span bound","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:b2d883ac77b35f49c48808ac295074393da1f02d2c68c69877e6d64e75d5a9a5","observation_id":"338e0e30-e0fc-47be-86b7-9481704e84a1","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","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-06-29T01:20:21.181843Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:140030ef219d24f0d65d13d0cf9f95bc23cd7b7734686ce275e3294693a4d89f","observation_id":"1a5851e5-a193-4011-b2c7-7a4270cbdbe0","resolution":{"observed_at":"2026-06-29T01:20:21.181843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":12},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2606.27448."}