{"as_of":"2026-08-10T15:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d02edfb8294eb518388156ebf27a817c2cd66c97813400658591b3bc9bb6163b","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:19:43.446729Z","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-03T00:17:29.408953Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-08-09T20:19:43.446729Z","title":"Aleksandrs Slivkins","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.00108","last_updated":"2025-01-31T19:00:21Z","snapshot_observed_at":"2026-08-10T02:45:32.041216Z","submitted_at":"2025-01-31T19:00:21Z","title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T20:19:43.446729Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2502.00108"},"observation_digest":"sha256:6d97f0eeb86fb15556636fab8801f19a8f1f320ca6d59fdaec4a03045b692f30","observation_id":"70053b03-de96-4281-b1fc-9a97ff6addb1","resolution":{"observed_at":"2026-08-09T20:19:43.446729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-08-07T15:42:29.912514Z","title":"36 Bernhard Schölkopf and Alexander J Smola.Learning with kernels: support vector machines, regularization, optimization, and beyond","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.14102","last_updated":"2025-05-20T09:10:39Z","snapshot_observed_at":"2026-08-09T19:31:45.762318Z","submitted_at":"2025-05-20T09:10:39Z","title":"High-dimensional Nonparametric Contextual Bandit Problem","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:29.912514Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2505.14102"},"observation_digest":"sha256:7107fec0d26477cace8e0ec6fd72b2bb58e7ad76141b0ac19ce9af3a8c482a25","observation_id":"7babeca4-7dcf-44ff-bd60-5649767236fa","resolution":{"observed_at":"2026-08-07T15:42:29.912514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":"2003.10113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-07-03T00:17:29.408953Z","title":"arXiv preprint arXiv:2003.10113 , year=","venue":null,"work_id":"e8e2ebf5-40a5-4e82-9417-147c93c71f93","year":2003},"citing_paper":{"arxiv_id":"2604.16684","last_updated":"2026-05-11T18:31:11Z","snapshot_observed_at":"2026-07-06T23:03:57.199731Z","submitted_at":"2026-04-17T20:41:43Z","title":"DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T08:26:03.736064Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2604.16684"},"observation_digest":"sha256:934a88ca78e96890599d58713d0279d71f64490240c1e193fec46f5cda27c7bc","observation_id":"c905f641-0ec6-4784-a8ce-d1519a8a4e8c","resolution":{"observed_at":"2026-05-10T08:27:51.718511Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":"2003.10113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-07-03T00:17:29.408953Z","title":"arXiv preprint arXiv:2003.10113 , year=","venue":null,"work_id":"e8e2ebf5-40a5-4e82-9417-147c93c71f93","year":2003},"citing_paper":{"arxiv_id":"2604.16684","last_updated":"2026-05-11T18:31:11Z","snapshot_observed_at":"2026-07-06T23:03:57.199731Z","submitted_at":"2026-04-17T20:41:43Z","title":"DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T07:39:27.745629Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2604.16684"},"observation_digest":"sha256:6ec95b88ae26b8c5417d1ffa2dce688141f5816873e5d694053df09120e9c16e","observation_id":"63065121-dc85-4efb-a12e-7e51c6277715","resolution":{"observed_at":"2026-05-13T07:42:30.704419Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":"2003.10113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-07-03T00:17:29.408953Z","title":"arXiv preprint arXiv:2003.10113 , year=","venue":null,"work_id":"e8e2ebf5-40a5-4e82-9417-147c93c71f93","year":2003},"citing_paper":{"arxiv_id":"2605.14193","last_updated":"2026-05-13T23:19:05Z","snapshot_observed_at":"2026-07-06T23:25:39.415637Z","submitted_at":"2026-05-13T23:19:05Z","title":"Equilibrium and Pricing in Consumer Networks with Nonlinear Utilities: An Online Shape-Constrained Learning Approach","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-15T01:44:55.089973Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2605.14193"},"observation_digest":"sha256:25564b964da6594fba0bf74b35d37e3224aef3e3863adb99f3c52e5d35f42fca","observation_id":"73a011ef-2b80-4172-99bd-f3035bfdcc90","resolution":{"observed_at":"2026-05-15T01:48:28.756392Z","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":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":"2003.10113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-07-03T00:17:29.408953Z","title":"arXiv preprint arXiv:2003.10113 , year=","venue":null,"work_id":"e8e2ebf5-40a5-4e82-9417-147c93c71f93","year":2003},"citing_paper":{"arxiv_id":"2605.25590","last_updated":"2026-05-25T08:40:32Z","snapshot_observed_at":"2026-08-06T11:33:56.948017Z","submitted_at":"2026-05-25T08:40:32Z","title":"Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T20:39:18.166914Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2605.25590"},"observation_digest":"sha256:ba8e0e1c04b34a091140ca18cf37e0403b4b3104a0907e79d6a50f4ad1eee990","observation_id":"a29c33fd-cfd0-4abb-8a40-94879b326e2d","resolution":{"observed_at":"2026-06-29T22:44:02.240931Z","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":"2003.10113","last_updated":"2020-03-23T07:44:59Z","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits","version":1},"cited_work":{"arxiv_id":"2003.10113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.10113","snapshot_observed_at":"2026-07-03T00:17:29.408953Z","title":"arXiv preprint arXiv:2003.10113 , year=","venue":null,"work_id":"e8e2ebf5-40a5-4e82-9417-147c93c71f93","year":2003},"citing_paper":{"arxiv_id":"2606.09802","last_updated":"2026-06-08T17:53:29Z","snapshot_observed_at":"2026-07-06T23:49:08.412079Z","submitted_at":"2026-06-08T17:53:29Z","title":"Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T17:19:08.870514Z"},"links":{"cited_paper":"/paper/2003.10113","citing_paper":"/paper/2606.09802"},"observation_digest":"sha256:42a9d3603f64b2ad7fb554d684856ff3534bb043c0a6b07434c0d2b302da8fcf","observation_id":"f0015d20-9d24-4f93-a210-bfb163d6e15e","resolution":{"observed_at":"2026-07-03T00:17:29.410697Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2003.10113/citation-record","integrity":"/paper/2003.10113/integrity","json":"/paper/2003.10113/citation-record.json","paper":"/paper/2003.10113"},"outbound":[],"paper":{"arxiv_id":"2003.10113","last_updated":"2020-03-23T07:44:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T14:20:27.118090Z","submitted_at":"2020-03-23T07:44:59Z","title":"Algorithms for Non-Stationary Generalized Linear Bandits"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2003.10113."}