{"as_of":"2026-08-19T00:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:279cced3176255d2bfb4ec0de14fd7e248353611de9d70ccdef7af7ba8e45f76","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-18T06:34:40.430872+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-05T22:46:27.461151Z","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-05T22:46:27.700953Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.05622","last_updated":"2022-08-11T03:44:55Z","snapshot_observed_at":"2026-08-18T22:46:00.660345Z","submitted_at":"2022-08-11T03:44:55Z","title":"Regret Analysis for Hierarchical Experts Bandit Problem","version":1},"cited_work":{"arxiv_id":"2208.05622","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.05622","snapshot_observed_at":"2026-08-05T22:46:27.700953Z","title":"Regret Analysis for Hierarchical Experts Bandit Problem","venue":"cs.LG","work_id":"c2749f1b-1247-4849-95ef-1a8f52a3b89b","year":2022},"citing_paper":{"arxiv_id":"2508.06432","last_updated":"2025-08-08T16:20:24Z","snapshot_observed_at":"2026-08-17T23:31:10.175294Z","submitted_at":"2025-08-08T16:20:24Z","title":"Hierarchical Placement Learning for Network Slice Provisioning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:46:27.461151Z"},"links":{"cited_paper":"/paper/2208.05622","citing_paper":"/paper/2508.06432"},"observation_digest":"sha256:0fc9eafc84623129cb6d22fc7fab92d282daa37c78602ebe303232fa28bc1b8a","observation_id":"5204879c-5858-4ce4-a791-7bb960e3687c","resolution":{"observed_at":"2026-08-05T22:46:27.705822Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.05622/citation-record","integrity":"/paper/2208.05622/integrity","json":"/paper/2208.05622/citation-record.json","paper":"/paper/2208.05622"},"outbound":[],"paper":{"arxiv_id":"2208.05622","last_updated":"2022-08-11T03:44:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T22:46:00.660345Z","submitted_at":"2022-08-11T03:44:55Z","title":"Regret Analysis for Hierarchical Experts Bandit Problem"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2208.05622."}