{"as_of":"2026-08-11T11:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d4b62b6e886b2599d893b6209ac91698ac33bba242ee7e277fe5e1fbaa3b4c5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T16:44:30.884461Z","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-08T10:58:56.450131Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1603.05359","last_updated":"2016-06-30T17:07:26Z","snapshot_observed_at":"2026-07-06T04:49:47.347242Z","submitted_at":"2016-03-17T05:37:12Z","title":"Cascading Bandits for Large-Scale Recommendation Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.05359","snapshot_observed_at":"2026-08-09T16:44:30.884461Z","title":"Cas- cading bandits for large-scale recommendation problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-09T16:35:06.475281Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.884461Z"},"links":{"cited_paper":"/paper/1603.05359","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:00dbbc5e0112e51e87eaf36b8ef981f4e512f1216c611e9b94cb16bed5c34b24","observation_id":"3d3a56b7-f7c2-4f83-8005-655014e5e597","resolution":{"observed_at":"2026-08-09T16:44:30.884461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.05359","last_updated":"2016-06-30T17:07:26Z","snapshot_observed_at":"2026-07-06T04:49:47.347242Z","submitted_at":"2016-03-17T05:37:12Z","title":"Cascading Bandits for Large-Scale Recommendation Problems","version":2},"cited_work":{"arxiv_id":"1603.05359","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.05359","snapshot_observed_at":"2026-08-08T10:58:56.450131Z","title":"Cascading Bandits for Large-Scale Recommendation Problems","venue":"cs.LG","work_id":"ef27e2b2-3c76-4849-b2d8-da51d099cb36","year":2016},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-08T10:29:58.186761Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.257891Z"},"links":{"cited_paper":"/paper/1603.05359","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:3192172c23dc683b60d4f273ae7e1136e69e3f885e968b18177018ebcb2403f2","observation_id":"43a76b9a-3682-4bf0-ac21-92102c70b454","resolution":{"observed_at":"2026-08-08T10:58:56.455961Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1603.05359/citation-record","integrity":"/paper/1603.05359/integrity","json":"/paper/1603.05359/citation-record.json","paper":"/paper/1603.05359"},"outbound":[],"paper":{"arxiv_id":"1603.05359","last_updated":"2016-06-30T17:07:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T04:49:47.347242Z","submitted_at":"2016-03-17T05:37:12Z","title":"Cascading Bandits for Large-Scale Recommendation 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1603.05359."}