{"as_of":"2026-08-09T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a3fddf443b4aac11042aac2a1c32ff65d63d68c59401ab0fab9d60b7948f464","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:54:41.794403Z","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-19T08:52:13.692524Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-08-07T14:54:41.794403Z","title":"Banerjee, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.17283","last_updated":"2025-05-22T21:00:19Z","snapshot_observed_at":"2026-08-07T14:47:14.914633Z","submitted_at":"2025-05-22T21:00:19Z","title":"Deconfounded Warm-Start Thompson Sampling with Applications to Precision Medicine","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:54:41.794403Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2505.17283"},"observation_digest":"sha256:3d9754867bcc86a318f3590b87d474b94c69e604c4c9078a45b5ae78b94e2284","observation_id":"0002b0d7-8d8c-49ca-bcd2-f4c7455798bb","resolution":{"observed_at":"2026-08-07T14:54:41.794403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":"2210.00025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Artificial replay: a meta-algorithm for harnessing historical data in bandits","venue":null,"work_id":"02978486-359e-4118-a469-3894e7f559e2","year":2022},"citing_paper":{"arxiv_id":"2506.16658","last_updated":"2026-04-21T21:21:37Z","snapshot_observed_at":"2026-07-06T21:45:02.192166Z","submitted_at":"2025-06-20T00:09:39Z","title":"Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T08:50:13.396492Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2506.16658"},"observation_digest":"sha256:f01dd1dd7fd798dca965e6118930478c7f3ee2f6ca6691ed8edc0729f20c15bf","observation_id":"d843cd2e-ef49-49df-acd6-68500a9ae0c3","resolution":{"observed_at":"2026-05-19T08:52:13.696055Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-08-05T21:34:28.800001Z","title":"Artificial replay: a meta-algorithm for harnessing historical data in bandits.arXiv preprint arXiv:2210.00025,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T00:13:03.206488Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.800001Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:43ed64edfee4c882870ef3a5188f9a8a49f076ec73de82132053dd34ff34395e","observation_id":"14dc6f08-35d7-4a9c-b466-d592d75e5a64","resolution":{"observed_at":"2026-08-05T21:34:28.800001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":"2210.00025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Artificial replay: a meta-algorithm for harnessing historical data in bandits","venue":null,"work_id":"02978486-359e-4118-a469-3894e7f559e2","year":2022},"citing_paper":{"arxiv_id":"2605.10289","last_updated":"2026-05-14T09:25:47Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:58Z","title":"Sample-Mean Anchored Thompson Sampling for Offline-to-Online Learning with Distribution Shift","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-12T04:41:20.147645Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2605.10289"},"observation_digest":"sha256:9cc93221c186999489fbb746c8bb03bbaa0a44a7d3b2223ab1a7eea66fccf8fc","observation_id":"2b4bb7cf-3301-4357-bafe-04f87cf2fc95","resolution":{"observed_at":"2026-05-12T06:01:24.966341Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":"2210.00025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Artificial replay: a meta-algorithm for harnessing historical data in bandits","venue":null,"work_id":"02978486-359e-4118-a469-3894e7f559e2","year":2022},"citing_paper":{"arxiv_id":"2605.10289","last_updated":"2026-05-14T09:25:47Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:58Z","title":"Sample-Mean Anchored Thompson Sampling for Offline-to-Online Learning with Distribution Shift","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-15T05:07:34.344964Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2605.10289"},"observation_digest":"sha256:1b8e9de4d06b4591be90ee6b54ef07c95516ec1f156381bd0b1a6a387a87b91a","observation_id":"ecf818a8-36a6-45a4-9f1c-8a309e0485fd","resolution":{"observed_at":"2026-05-15T05:09:45.502114Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.00025/citation-record","integrity":"/paper/2210.00025/integrity","json":"/paper/2210.00025/citation-record.json","paper":"/paper/2210.00025"},"outbound":[],"paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2210.00025."}