{"as_of":"2026-08-11T01:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4122853d12822990292245730dad8948a5d5fd7c33245467486be1d965fb5a28","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-10T06:31:04.303077+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-08T18:51:12.712455Z","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-08T18:51:12.935725Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.12253","last_updated":"2018-10-23T04:34:30Z","snapshot_observed_at":"2026-07-06T07:17:58.362513Z","submitted_at":"2018-10-23T04:34:30Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack","version":1},"cited_work":{"arxiv_id":"1811.12253","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.12253","snapshot_observed_at":"2026-08-08T18:51:12.935725Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack","venue":"cs.LG","work_id":"722dc173-6067-481e-96d2-6b68411656dc","year":2018},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.712455Z"},"links":{"cited_paper":"/paper/1811.12253","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:5c78990c748bc66087be1237464ac2af4f8478160b25c73adcd00f588b6a501f","observation_id":"04090198-1968-4de2-81d8-69bf8e9a522b","resolution":{"observed_at":"2026-08-08T18:51:12.940175Z","resolver_source":"local_arxiv","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":"1811.12253","last_updated":"2018-10-23T04:34:30Z","snapshot_observed_at":"2026-07-06T07:17:58.362513Z","submitted_at":"2018-10-23T04:34:30Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.12253","snapshot_observed_at":"2026-08-02T04:59:33.204091Z","title":"Unifying the stochastic and the adversarial bandits with knapsack,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.13546","last_updated":"2026-07-15T07:51:14Z","snapshot_observed_at":"2026-08-09T16:18:21.809014Z","submitted_at":"2026-07-15T07:51:14Z","title":"From Novice to Expert: Cost-Aware Bandits for Evolving Worker Performance in Crowdsensing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T04:59:33.204091Z"},"links":{"cited_paper":"/paper/1811.12253","citing_paper":"/paper/2607.13546"},"observation_digest":"sha256:ee6f29df4353a7f2ccadec66986126c1e7ff2defe4bd0ae2907ead15a07fbbed","observation_id":"c13d5b0a-f4a5-45ad-ad69-681995c44a53","resolution":{"observed_at":"2026-08-02T04:59:33.204091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1811.12253/citation-record","integrity":"/paper/1811.12253/integrity","json":"/paper/1811.12253/citation-record.json","paper":"/paper/1811.12253"},"outbound":[],"paper":{"arxiv_id":"1811.12253","last_updated":"2018-10-23T04:34:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:17:58.362513Z","submitted_at":"2018-10-23T04:34:30Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1811.12253."}