{"as_of":"2026-08-17T07:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47cc36a757c9a9abfd6ee04ca6cfd71e75018d73410feb6b82213ad1bbc7c89e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:58:10.539292Z","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-08-14T12:58:10.967068Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.05929","last_updated":"2018-04-16T20:44:28Z","snapshot_observed_at":"2026-08-14T19:25:22.374742Z","submitted_at":"2018-04-16T20:44:28Z","title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits","version":1},"cited_work":{"arxiv_id":"1804.05929","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.05929","snapshot_observed_at":"2026-08-14T12:58:10.967068Z","title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits","venue":"cs.LG","work_id":"d5f28320-2b7f-4e7c-89b2-755ed47041a6","year":2018},"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":52,"source":"pdf_text","source_observed_at":"2026-08-14T12:58:10.539292Z"},"links":{"cited_paper":"/paper/1804.05929","citing_paper":"/paper/1908.06158"},"observation_digest":"sha256:f125eafd9e7901d31bb5f286086c27e9499b24f3f53025d13bbe7267aa15e568","observation_id":"b216a22f-065e-4b03-ae6c-5bcbc11bc3a6","resolution":{"observed_at":"2026-08-14T12:58:10.971843Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.05929/citation-record","integrity":"/paper/1804.05929/integrity","json":"/paper/1804.05929/citation-record.json","paper":"/paper/1804.05929"},"outbound":[],"paper":{"arxiv_id":"1804.05929","last_updated":"2018-04-16T20:44:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T19:25:22.374742Z","submitted_at":"2018-04-16T20:44:28Z","title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1804.05929."}