{"as_of":"2026-08-08T16:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8cbc0e24a96b9209a7f25c1067201239019fc31df4de9c71c67b566fbeafc0ff","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:53:58.714608Z","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-07T14:54:00.101316Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11015","last_updated":"2024-09-30T00:21:39Z","snapshot_observed_at":"2026-07-06T16:34:19.351760Z","submitted_at":"2023-10-17T06:04:00Z","title":"Pure Exploration in Asynchronous Federated Bandits","version":2},"cited_work":{"arxiv_id":"2310.11015","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.11015","snapshot_observed_at":"2026-08-07T14:54:00.101316Z","title":"Pure Exploration in Asynchronous Federated Bandits","venue":"cs.LG","work_id":"3efe9006-0e42-4f01-b489-0e34173b260d","year":2023},"citing_paper":{"arxiv_id":"2505.17379","last_updated":"2025-05-23T01:30:37Z","snapshot_observed_at":"2026-08-08T15:12:13.808346Z","submitted_at":"2025-05-23T01:30:37Z","title":"Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:58.714608Z"},"links":{"cited_paper":"/paper/2310.11015","citing_paper":"/paper/2505.17379"},"observation_digest":"sha256:0f493a5865f4c2ad3b08a0c0bacf8f70ef1eaf197a1d63deea94963869988c45","observation_id":"47c227d6-f8bc-42ec-bc71-24ca4380a6b5","resolution":{"observed_at":"2026-08-07T14:54:00.176526Z","resolver_source":"local_arxiv","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/2310.11015/citation-record","integrity":"/paper/2310.11015/integrity","json":"/paper/2310.11015/citation-record.json","paper":"/paper/2310.11015"},"outbound":[],"paper":{"arxiv_id":"2310.11015","last_updated":"2024-09-30T00:21:39Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:34:19.351760Z","submitted_at":"2023-10-17T06:04:00Z","title":"Pure Exploration in Asynchronous Federated 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 1 inbound Pith citation observation for arXiv:2310.11015."}