{"as_of":"2026-08-13T23:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09a12c31ea1c64790e883a3531528f7f8e2cb85932f0240cc031eed57cde2e30","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-11T22:21:11.676321Z","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-25T05:05:22.657721Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.03106","last_updated":"2022-07-07T06:16:19Z","snapshot_observed_at":"2026-08-13T15:09:08.520567Z","submitted_at":"2022-07-07T06:16:19Z","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.03106","snapshot_observed_at":"2026-08-11T22:21:11.676321Z","title":"A simple and provably efficient algorithm for asynchronous federated contextual linear bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.03727","last_updated":"2025-02-10T05:18:01Z","snapshot_observed_at":"2026-08-13T07:22:20.097749Z","submitted_at":"2024-12-04T21:45:35Z","title":"Online Experimental Design With Estimation-Regret Trade-off Under Network Interference","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T22:21:11.676321Z"},"links":{"cited_paper":"/paper/2207.03106","citing_paper":"/paper/2412.03727"},"observation_digest":"sha256:870e3be05192b172c2262fee66ee637b00211557fa6916e7fb12e7f64f31d428","observation_id":"978b9cc3-8fed-4b77-952c-0e0b0de38dc9","resolution":{"observed_at":"2026-08-11T22:21:11.676321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.03106","last_updated":"2022-07-07T06:16:19Z","snapshot_observed_at":"2026-08-13T15:09:08.520567Z","submitted_at":"2022-07-07T06:16:19Z","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","version":1},"cited_work":{"arxiv_id":"2207.03106","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.03106","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2207.03106 , year=","venue":null,"work_id":"db3b5117-db88-4393-a4c4-7fa1a93342a6","year":null},"citing_paper":{"arxiv_id":"2605.23131","last_updated":"2026-05-22T01:09:14Z","snapshot_observed_at":"2026-07-06T23:33:24.215365Z","submitted_at":"2026-05-22T01:09:14Z","title":"When Determinants Are Not Enough: Private Rare Switching","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-25T05:04:26.921107Z"},"links":{"cited_paper":"/paper/2207.03106","citing_paper":"/paper/2605.23131"},"observation_digest":"sha256:337d950917c58ecd2f5189426184ab79afacd3139ee930f11ab6e7cefa054ca9","observation_id":"16f7dc3e-437f-46b2-9d6b-5c788b415ce7","resolution":{"observed_at":"2026-05-25T05:05:22.661203Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2207.03106/citation-record","integrity":"/paper/2207.03106/integrity","json":"/paper/2207.03106/citation-record.json","paper":"/paper/2207.03106"},"outbound":[],"paper":{"arxiv_id":"2207.03106","last_updated":"2022-07-07T06:16:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T15:09:08.520567Z","submitted_at":"2022-07-07T06:16:19Z","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear 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:2207.03106."}