{"as_of":"2026-08-06T08:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9953852f114a7e590ad496cbf2ac0f4cfdfc57074f6fa9459140ce4524d3ba85","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T20:27:02.916543Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T16:49:57.171090Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":"1402.6028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-07-04T16:49:57.171090Z","title":"Algorithms for multi-armed bandit problems","venue":"cs.AI","work_id":"a980fe93-ee0f-4b19-9600-f80d85e6e306","year":2014},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-07-06T20:35:11.864261Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:81d971586fb2e06efa4c76204214f0d293c482f6e1bfb63f3b121ede5f4aa28c","observation_id":"5ddf42b8-a476-4735-81af-7454ff96c086","resolution":{"observed_at":"2026-05-23T03:32:28.735921Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-05T20:27:02.916543Z","title":"Algorithms for multi-armed bandit problems.arXiv preprint arXiv:1402.6028, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.10804","last_updated":"2025-08-14T16:26:00Z","snapshot_observed_at":"2026-08-05T20:27:01.102736Z","submitted_at":"2025-08-14T16:26:00Z","title":"Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T20:27:02.916543Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2508.10804"},"observation_digest":"sha256:b9058ebcbb9f9621a50f77427563eece480c6233f7d4d2415ffab95e6e2881fd","observation_id":"579c20fe-caee-4318-9d21-6dc70c8324f4","resolution":{"observed_at":"2026-08-05T20:27:02.916543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-05T19:08:08.825311Z","title":"Kuleshov and D","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.13473","last_updated":"2026-07-16T21:34:21Z","snapshot_observed_at":"2026-08-05T19:07:46.043552Z","submitted_at":"2025-08-19T03:08:29Z","title":"Reactive Users vs. Social Recommender Systems: Managing Opinion Drifts with Adaptive Policies","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T19:08:08.825311Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2508.13473"},"observation_digest":"sha256:04d94ff11613f3f6db63efd8b2d858790d9c753c70f65cc8dd2c1348960160af","observation_id":"30598111-6267-4410-9e26-258d074eb01b","resolution":{"observed_at":"2026-08-05T19:08:08.825311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-05T15:20:19.349019Z","title":"Kuleshov, D","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.20056","last_updated":"2025-08-27T17:13:18Z","snapshot_observed_at":"2026-08-05T15:20:17.814002Z","submitted_at":"2025-08-27T17:13:18Z","title":"Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T15:20:19.349019Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2508.20056"},"observation_digest":"sha256:1e6a7e0ee8f8f7fb668ecb64d0713d52adf773416b8811f2cdc1d1028dc427b6","observation_id":"27ab0d30-5d67-4fbb-ad96-55ca94b04a32","resolution":{"observed_at":"2026-08-05T15:20:19.349019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-03T05:41:50.386634Z","title":"Algorithms for multi-armed bandit problems.arXiv preprint arXiv:1402.6028,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01658","last_updated":"2026-06-03T07:50:03Z","snapshot_observed_at":"2026-08-05T06:35:54.077710Z","submitted_at":"2026-02-02T05:24:31Z","title":"Efficient Adversarial Attacks on High-dimensional Offline Bandits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T05:41:50.386634Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2602.01658"},"observation_digest":"sha256:69460fc07233dd95f131f39ae3d6f5d27a2766cc46bf3faf6255877eb03aa261","observation_id":"58aa93e8-dceb-4c1e-916c-67c75ea8089b","resolution":{"observed_at":"2026-08-03T05:41:50.386634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":"1402.6028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-07-04T16:49:57.171090Z","title":"Algorithms for multi-armed bandit problems","venue":"cs.AI","work_id":"a980fe93-ee0f-4b19-9600-f80d85e6e306","year":2014},"citing_paper":{"arxiv_id":"2604.06296","last_updated":"2026-04-15T22:45:43Z","snapshot_observed_at":"2026-07-06T22:54:48.916799Z","submitted_at":"2026-04-07T17:13:47Z","title":"AgentOpt v0.1 Technical Report: Client-Side Optimization for LLM-Based Agent","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T19:51:39.564680Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2604.06296"},"observation_digest":"sha256:8df480ce881097c519f3d739704516cdd1600d26b819a308cc18a62522e72307","observation_id":"5c5d1542-5b93-439c-af9b-2fd7c064cd17","resolution":{"observed_at":"2026-05-10T22:25:52.553025Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":"1402.6028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-07-04T16:49:57.171090Z","title":"Algorithms for multi-armed bandit problems","venue":"cs.AI","work_id":"a980fe93-ee0f-4b19-9600-f80d85e6e306","year":2014},"citing_paper":{"arxiv_id":"2606.18575","last_updated":"2026-06-17T00:55:39Z","snapshot_observed_at":"2026-08-03T08:15:15.178329Z","submitted_at":"2026-06-17T00:55:39Z","title":"Adaptive COVID-19 Trajectory Forecasting Using MAB-Inspired Ensemble Weighting","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-26T18:44:50.105494Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2606.18575"},"observation_digest":"sha256:9865010dba6bb633d973c3de9d9654f558c1ea488b3e8739a1e09694db7450fa","observation_id":"0a160bb4-da1c-4d11-bdaf-8636c612f0c9","resolution":{"observed_at":"2026-07-04T02:59:25.371881Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":"1402.6028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-07-04T16:49:57.171090Z","title":"Algorithms for multi-armed bandit problems","venue":"cs.AI","work_id":"a980fe93-ee0f-4b19-9600-f80d85e6e306","year":2014},"citing_paper":{"arxiv_id":"2606.24160","last_updated":"2026-06-23T05:28:33Z","snapshot_observed_at":"2026-08-02T08:41:14.568871Z","submitted_at":"2026-06-23T05:28:33Z","title":"An Introduction to Causal Reinforcement Learning","version":1},"reference_index":249,"source":"arxiv_source","source_observed_at":"2026-06-26T00:17:57.091481Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2606.24160"},"observation_digest":"sha256:7c5518ad69a22b81f2fd3277a0049b6f796e83f23b45181bf68ee07831ba64bb","observation_id":"74d9820c-53cc-4f44-aae5-68854aa866c6","resolution":{"observed_at":"2026-07-04T16:49:57.172575Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-03T08:22:35.193964Z","title":"arXiv preprint arXiv:1402.6028 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29375","last_updated":"2026-07-31T12:59:06Z","snapshot_observed_at":"2026-08-05T23:15:09.728306Z","submitted_at":"2026-07-31T12:59:06Z","title":"The Greedy Advantage in Finite-Horizon Bandits","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T08:22:35.193964Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2607.29375"},"observation_digest":"sha256:14b5eff98c7a2698013875595385c9fb7ed632f51947552730b84b2a931230c6","observation_id":"c68306f6-4f3c-4722-89e2-2caa7e277d8f","resolution":{"observed_at":"2026-08-03T08:22:35.193964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1402.6028/citation-record","integrity":"/paper/1402.6028/integrity","json":"/paper/1402.6028/citation-record.json","paper":"/paper/1402.6028"},"outbound":[],"paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:1402.6028."}