{"as_of":"2026-08-13T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:615af49f10d8e92fe195bbe845d8064db9e8a9b384c55635a1133100723bfb3d","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-13T06:32:02.005865+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-12T00:56:56.966075Z","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-09T16:52:19.501174Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.07903","last_updated":"2023-06-13T16:54:13Z","snapshot_observed_at":"2026-08-12T19:55:02.292392Z","submitted_at":"2023-06-13T16:54:13Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","version":1},"cited_work":{"arxiv_id":"2306.07903","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.07903","snapshot_observed_at":"2026-08-09T16:52:19.501174Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","venue":"cs.LG","work_id":"4fc21a68-ae98-41b8-8316-5a914d176473","year":2023},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.420446Z"},"links":{"cited_paper":"/paper/2306.07903","citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:cc9bf01b3c53506544fa551d602261068ca154897c7b5f1b479ccd9b09c36196","observation_id":"c5fd3d84-9721-4ed1-b3ba-31cd2fa9cc04","resolution":{"observed_at":"2026-08-09T16:52:19.507520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07903","last_updated":"2023-06-13T16:54:13Z","snapshot_observed_at":"2026-08-12T19:55:02.292392Z","submitted_at":"2023-06-13T16:54:13Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.07903","snapshot_observed_at":"2026-08-12T00:56:56.966075Z","title":"arXiv preprint arXiv:2306.07903 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07922","last_updated":"2026-08-08T04:57:24Z","snapshot_observed_at":"2026-08-13T10:11:37.314743Z","submitted_at":"2026-08-08T04:57:24Z","title":"Information Routing across Batch Boundaries: Memory--Batch Tradeoffs in Lipschitz Bandits","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T00:56:56.966075Z"},"links":{"cited_paper":"/paper/2306.07903","citing_paper":"/paper/2608.07922"},"observation_digest":"sha256:185aae3b70f8931367408b5f829c02cc2bbd482744ead0c35f5358a4206f1230","observation_id":"e0a9b048-6756-41dc-a7c8-09db33713fff","resolution":{"observed_at":"2026-08-12T00:56:56.966075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.07903/citation-record","integrity":"/paper/2306.07903/integrity","json":"/paper/2306.07903/citation-record.json","paper":"/paper/2306.07903"},"outbound":[],"paper":{"arxiv_id":"2306.07903","last_updated":"2023-06-13T16:54:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T19:55:02.292392Z","submitted_at":"2023-06-13T16:54:13Z","title":"Tight Memory-Regret Lower Bounds for Streaming 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.07903."}