{"as_of":"2026-08-14T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0998932faf695da4188ebaafb7b5747c0722f62f1450038c8cd6bbab784b57b2","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-14T06:32:32.682623+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-10T16:25:16.733916Z","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-05T21:34:31.588762Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.14128","last_updated":"2022-05-27T17:40:32Z","snapshot_observed_at":"2026-08-13T15:35:10.273290Z","submitted_at":"2022-05-27T17:40:32Z","title":"Meta-Learning Adversarial Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14128","snapshot_observed_at":"2026-08-10T16:25:16.733916Z","title":"Meta-learning adversarial bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.733916Z"},"links":{"cited_paper":"/paper/2205.14128","citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:7aff8622bd1b423197143189c9adde46fc6342a7656426fa4fcf5dd0b0b65817","observation_id":"fa62291c-3e61-400b-a381-6330b51fbfcf","resolution":{"observed_at":"2026-08-10T16:25:16.733916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14128","last_updated":"2022-05-27T17:40:32Z","snapshot_observed_at":"2026-08-13T15:35:10.273290Z","submitted_at":"2022-05-27T17:40:32Z","title":"Meta-Learning Adversarial Bandits","version":1},"cited_work":{"arxiv_id":"2205.14128","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.14128","snapshot_observed_at":"2026-08-05T21:34:31.588762Z","title":"Meta-Learning Adversarial Bandits","venue":"cs.LG","work_id":"e5f579b3-2a70-4aed-81d5-12a36e6c120d","year":2022},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-14T03:00:25.950083Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.497123Z"},"links":{"cited_paper":"/paper/2205.14128","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:3a75f41b487fe5aa8ac4a76c27b5f3a4e2763a744e5a4361d038428d7b555a5e","observation_id":"740e932a-1f0b-4b67-9824-4e70b049ec78","resolution":{"observed_at":"2026-08-05T21:34:31.670509Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.14128/citation-record","integrity":"/paper/2205.14128/integrity","json":"/paper/2205.14128/citation-record.json","paper":"/paper/2205.14128"},"outbound":[],"paper":{"arxiv_id":"2205.14128","last_updated":"2022-05-27T17:40:32Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T15:35:10.273290Z","submitted_at":"2022-05-27T17:40:32Z","title":"Meta-Learning Adversarial 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.14128."}