{"as_of":"2026-08-10T20:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:57a9064c1480cecb0ea5effb156a15f5e4bf38255ab8d35fec2e711b9d5747d4","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-09T20:45:51.326444Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T15:35:10.928301Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.01748","last_updated":"2021-02-02T20:47:35Z","snapshot_observed_at":"2026-08-10T10:43:48.754173Z","submitted_at":"2021-02-02T20:47:35Z","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","version":1},"cited_work":{"arxiv_id":"2102.01748","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.01748","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.01748 , year=","venue":null,"work_id":"cde28321-1b59-4e1d-b04e-d388812372b9","year":null},"citing_paper":{"arxiv_id":"2211.15657","last_updated":"2023-07-10T07:25:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-28T18:59:02Z","title":"Is Conditional Generative Modeling all you need for Decision-Making?","version":4},"reference_index":189,"source":"arxiv_source","source_observed_at":"2026-05-15T15:35:10.593969Z"},"links":{"cited_paper":"/paper/2102.01748","citing_paper":"/paper/2211.15657"},"observation_digest":"sha256:4f4039e7765b0ba4e40996030da7d18c33dd0a51475897b6eddac37e41e30638","observation_id":"2a23422e-609d-4ec7-bec4-5d4d0f7856da","resolution":{"observed_at":"2026-05-15T15:35:10.931672Z","resolver_source":"arxiv_id","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":"2102.01748","last_updated":"2021-02-02T20:47:35Z","snapshot_observed_at":"2026-08-10T10:43:48.754173Z","submitted_at":"2021-02-02T20:47:35Z","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.01748","snapshot_observed_at":"2026-08-09T20:45:51.326444Z","title":"org/CorpusID:182952558","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19300","last_updated":"2025-05-29T03:11:10Z","snapshot_observed_at":"2026-08-10T08:15:42.185401Z","submitted_at":"2025-01-31T16:56:18Z","title":"Offline Learning for Combinatorial Multi-armed Bandits","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T20:45:51.326444Z"},"links":{"cited_paper":"/paper/2102.01748","citing_paper":"/paper/2501.19300"},"observation_digest":"sha256:a3718c3967967f4960b4cb381de9da6032bfe842d739db767d4e1296902a2b8a","observation_id":"b3948507-b6c0-493c-84d1-f140e1c85c37","resolution":{"observed_at":"2026-08-09T20:45:51.326444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2102.01748/citation-record","integrity":"/paper/2102.01748/integrity","json":"/paper/2102.01748/citation-record.json","paper":"/paper/2102.01748"},"outbound":[],"paper":{"arxiv_id":"2102.01748","last_updated":"2021-02-02T20:47:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T10:43:48.754173Z","submitted_at":"2021-02-02T20:47:35Z","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.01748."}