{"as_of":"2026-08-08T22:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c8d678db91b6d16488f69ab830a72592b859a62b30370fb113902f935827602","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-08T06:32:00.761636+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-07T13:44:56.606840Z","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-07-04T05:39:40.439473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-08-07T13:44:56.606840Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21395","last_updated":"2025-05-27T16:23:24Z","snapshot_observed_at":"2026-08-07T13:26:21.678395Z","submitted_at":"2025-05-27T16:23:24Z","title":"Square$\\chi$PO: Differentially Private and Robust $\\chi^2$-Preference Optimization in Offline Direct Alignment","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T13:44:56.606840Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:6885626f53cf1d7c738bd3a3b5309d682934afd466b63f8976d9df28ea0b0c42","observation_id":"264da0f3-a7cb-455b-94c4-2314d2555433","resolution":{"observed_at":"2026-08-07T13:44:56.606840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2202.05567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-07-04T05:39:40.439473Z","title":"arXiv preprint arXiv:2202.05567 , year=","venue":null,"work_id":"bab33d60-1c52-4514-99a6-f39fbe134fd4","year":2022},"citing_paper":{"arxiv_id":"2510.21060","last_updated":"2026-05-13T01:55:58Z","snapshot_observed_at":"2026-08-08T09:53:07.021031Z","submitted_at":"2025-10-24T00:21:38Z","title":"On the Sample Complexity of Differentially Private Policy Optimization","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-18T04:43:58.646419Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2510.21060"},"observation_digest":"sha256:06ddb24a061e3d4763715cb8bb98f3f202163c71a3257e6731a10e0124534135","observation_id":"1315a0f6-4bcb-4a79-8a23-ec7a4bec0b47","resolution":{"observed_at":"2026-05-18T04:45:54.872873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2202.05567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-07-04T05:39:40.439473Z","title":"arXiv preprint arXiv:2202.05567 , year=","venue":null,"work_id":"bab33d60-1c52-4514-99a6-f39fbe134fd4","year":2022},"citing_paper":{"arxiv_id":"2605.07049","last_updated":"2026-05-07T23:58:28Z","snapshot_observed_at":"2026-08-06T16:02:24.383533Z","submitted_at":"2026-05-07T23:58:28Z","title":"Towards Differentially Private Reinforcement Learning with General Function Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:59.533563Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2605.07049"},"observation_digest":"sha256:d79726a62abd051e0a645a008c031c794ae2a9a3eea80cb00ad0241fe7274bcc","observation_id":"6c50898a-4e7b-4476-b969-11d075858f3f","resolution":{"observed_at":"2026-05-11T04:31:00.532016Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2202.05567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-07-04T05:39:40.439473Z","title":"arXiv preprint arXiv:2202.05567 , year=","venue":null,"work_id":"bab33d60-1c52-4514-99a6-f39fbe134fd4","year":2022},"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":98,"source":"arxiv_source","source_observed_at":"2026-05-25T05:04:26.921107Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2605.23131"},"observation_digest":"sha256:80ac170654703713f970595bd5284988e433e56fccb5bad4dbfa3fd88ae67cd7","observation_id":"474d670e-7594-4e43-8a63-34b880c95561","resolution":{"observed_at":"2026-05-25T05:05:22.667833Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2202.05567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-07-04T05:39:40.439473Z","title":"arXiv preprint arXiv:2202.05567 , year=","venue":null,"work_id":"bab33d60-1c52-4514-99a6-f39fbe134fd4","year":2022},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e84a7a263af8927a4ae016c05828609a33c027a295a9e4bc2644df1e2e80b3b5","observation_id":"d3e0de97-9e6e-47bf-8ece-f813432a88c7","resolution":{"observed_at":"2026-07-04T05:39:40.441210Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.05567/citation-record","integrity":"/paper/2202.05567/integrity","json":"/paper/2202.05567/citation-record.json","paper":"/paper/2202.05567"},"outbound":[],"paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2202.05567."}