{"as_of":"2026-08-17T04:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe275a6d0313d6cd5112859112c78ef0700694f472dab27268a046366b1e7998","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:16:04.124835Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":48,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-14T12:58:10.602490Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06158","last_updated":"2019-08-16T20:44:01Z","snapshot_observed_at":"2026-08-16T21:59:54.358005Z","submitted_at":"2019-08-16T20:44:01Z","title":"Accelerated learning from recommender systems using multi-armed bandit","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T12:58:10.602490Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/1908.06158"},"observation_digest":"sha256:766ce2a639d0bc9f1336998f7098b70986c3014c305d075e14f7491fcac4280d","observation_id":"b8838379-4146-4767-992b-a3435347156a","resolution":{"observed_at":"2026-08-14T12:58:10.602490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-16T11:16:04.124835Z","title":"and Kalyani, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16415","last_updated":"2025-04-23T04:37:26Z","snapshot_observed_at":"2026-08-16T11:02:00.582076Z","submitted_at":"2025-04-23T04:37:26Z","title":"Natural Policy Gradient for Average Reward Non-Stationary RL","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:16:04.124835Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/2504.16415"},"observation_digest":"sha256:553b2651fe7667c777cd07590a155fca945422e1d82deb411de2e265924f62a3","observation_id":"12bbe108-bada-4cc1-be69-f1a3ae9ba9e0","resolution":{"observed_at":"2026-08-16T11:16:04.124835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-15T20:49:58.345529Z","title":"Raj and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.12092","last_updated":"2025-05-20T15:08:08Z","snapshot_observed_at":"2026-08-16T12:50:38.215860Z","submitted_at":"2025-05-17T17:19:07Z","title":"Thompson Sampling-like Algorithms for Stochastic Rising Bandits","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:58.345529Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/2505.12092"},"observation_digest":"sha256:031c719144fb4d8e51a58301ad0e143df5f9d1c3fe08f6e87a022afc47d91357","observation_id":"ae0ce631-df8a-4457-ba0c-80615683bde7","resolution":{"observed_at":"2026-08-15T20:49:58.345529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-15T17:57:15.591249Z","title":"Raj and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.19898","last_updated":"2025-08-21T08:23:12Z","snapshot_observed_at":"2026-08-15T17:49:10.911649Z","submitted_at":"2025-07-26T09:58:26Z","title":"TS-Insight: Visualizing Thompson Sampling for Verification and XAI","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T17:57:15.591249Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/2507.19898"},"observation_digest":"sha256:0a94453e90cca22ba1c09d9fa7b8f01d9d04ff40e0e27068726bbdbab68fdb37","observation_id":"e8d906a2-0d47-45e3-a110-fbb83f69a67e","resolution":{"observed_at":"2026-08-15T17:57:15.591249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":"1707.09727","doi":"10.48550/arxiv.1707.09727","metadata_source":"pith","pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","venue":"stat.ML","work_id":"aa5d8c6d-9fff-41fa-b47f-6eae04839270","year":2017},"citing_paper":{"arxiv_id":"2606.23933","last_updated":"2026-06-22T20:52:19Z","snapshot_observed_at":"2026-08-15T10:13:59.655047Z","submitted_at":"2026-06-22T20:52:19Z","title":"Flow-Corrected Thompson Sampling for Non-Stationary Contextual Bandits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/2606.23933"},"observation_digest":"sha256:81e08b789a72e546d86b87441a78e70a81688df4392bb58a444fa11aead8ce13","observation_id":"1a6ad96c-9a3b-48a5-82ea-e35837cbf174","resolution":{"observed_at":"2026-06-26T22:10:09.325236Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","version":1},"cited_work":{"arxiv_id":"1707.09727","doi":"10.48550/arxiv.1707.09727","metadata_source":"pith","pith_arxiv_id":"1707.09727","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Taming Non-stationary Bandits: A Bayesian Approach","venue":"stat.ML","work_id":"aa5d8c6d-9fff-41fa-b47f-6eae04839270","year":2017},"citing_paper":{"arxiv_id":"2606.23933","last_updated":"2026-06-22T20:52:19Z","snapshot_observed_at":"2026-08-15T10:13:59.655047Z","submitted_at":"2026-06-22T20:52:19Z","title":"Flow-Corrected Thompson Sampling for Non-Stationary Contextual Bandits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T06:41:46.958385Z"},"links":{"cited_paper":"/paper/1707.09727","citing_paper":"/paper/2606.23933"},"observation_digest":"sha256:e97797cab4688b58a951fb671659521f5b73f0981d3b04565c0c98d0bdc47512","observation_id":"a3656b3f-c467-4d88-a2b6-84ab6753e3cc","resolution":{"observed_at":"2026-06-26T22:10:09.312446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1707.09727/citation-record","integrity":"/paper/1707.09727/integrity","json":"/paper/1707.09727/citation-record.json","paper":"/paper/1707.09727"},"outbound":[],"paper":{"arxiv_id":"1707.09727","last_updated":"2017-07-31T05:46:39Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T20:44:19.342054Z","submitted_at":"2017-07-31T05:46:39Z","title":"Taming Non-stationary Bandits: A Bayesian Approach"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1707.09727."}