{"as_of":"2026-08-15T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c4eb55463f8158c8f0a6bb6dd0e51f35c09dc6535d461ed2b44c61baca2036d","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-15T06:32:42.880941+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-11T23:49:45.254987Z","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-07T11:40:59.706089Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.13180","last_updated":"2023-11-24T18:31:21Z","snapshot_observed_at":"2026-08-13T05:19:55.167694Z","submitted_at":"2023-11-22T06:06:54Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13180","snapshot_observed_at":"2026-08-11T23:49:45.254987Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.254987Z"},"links":{"cited_paper":"/paper/2311.13180","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8cf2fd4ad7b1a2323d534a546ff8ea23eb7ce22dfcb8d01d40f2743d7fdd1ac7","observation_id":"aaa3fac3-8f7a-452c-a3a7-10f0d67660de","resolution":{"observed_at":"2026-08-11T23:49:45.254987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13180","last_updated":"2023-11-24T18:31:21Z","snapshot_observed_at":"2026-08-13T05:19:55.167694Z","submitted_at":"2023-11-22T06:06:54Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","version":2},"cited_work":{"arxiv_id":"2311.13180","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.13180","snapshot_observed_at":"2026-08-07T11:40:59.706089Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","venue":"stat.ML","work_id":"c5e4d322-480d-4cf5-afaf-aec2567760b3","year":2023},"citing_paper":{"arxiv_id":"2506.01919","last_updated":"2025-06-02T17:39:31Z","snapshot_observed_at":"2026-08-08T16:13:33.864148Z","submitted_at":"2025-06-02T17:39:31Z","title":"Transformers as Multi-task Learners: Decoupling Features in Hidden Markov Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T11:40:36.102914Z"},"links":{"cited_paper":"/paper/2311.13180","citing_paper":"/paper/2506.01919"},"observation_digest":"sha256:5808c798cbad4fc185284a12ae1843089e515fa414a30e7787e440d5c064e213","observation_id":"85af8bd4-a4d9-4667-8b5c-42a18f74b032","resolution":{"observed_at":"2026-08-07T11:40:59.778041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.13180/citation-record","integrity":"/paper/2311.13180/integrity","json":"/paper/2311.13180/citation-record.json","paper":"/paper/2311.13180"},"outbound":[],"paper":{"arxiv_id":"2311.13180","last_updated":"2023-11-24T18:31:21Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-13T05:19:55.167694Z","submitted_at":"2023-11-22T06:06:54Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.13180."}