{"as_of":"2026-08-08T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0078a76d683cf654bd0b4d738c9e952a85e9793657764ff9ae047b44cdcb1b3","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-08T06:32:00.761636+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-06T20:53:53.706900Z","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-06T19:57:41.498928Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.10796","last_updated":"2024-06-13T17:00:41Z","snapshot_observed_at":"2026-07-06T14:54:11.599283Z","submitted_at":"2023-02-21T16:23:11Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10796","snapshot_observed_at":"2026-08-06T20:53:53.706900Z","title":", Hu , J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01691","last_updated":"2025-07-02T13:17:51Z","snapshot_observed_at":"2026-08-07T02:42:16.807049Z","submitted_at":"2025-07-02T13:17:51Z","title":"Quantum reinforcement learning in dynamic environments","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T20:53:53.706900Z"},"links":{"cited_paper":"/paper/2302.10796","citing_paper":"/paper/2507.01691"},"observation_digest":"sha256:720e257f61ded97dbbf7f6326eac5f5ee113315946dd8ee6fd90186f821162e7","observation_id":"ababe30b-1db1-4bb3-947b-19622a51b47c","resolution":{"observed_at":"2026-08-06T20:53:53.706900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10796","last_updated":"2024-06-13T17:00:41Z","snapshot_observed_at":"2026-07-06T14:54:11.599283Z","submitted_at":"2023-02-21T16:23:11Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","version":2},"cited_work":{"arxiv_id":"2302.10796","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.10796","snapshot_observed_at":"2026-08-06T19:57:41.498928Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","venue":"quant-ph","work_id":"7e3f3c2f-6dc1-4b46-897a-52f96e1120cb","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-08T06:34:29.018789Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.501641Z"},"links":{"cited_paper":"/paper/2302.10796","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:7f5ba3842de306575dcc35eb128233f1b1e6f6dad2661b063538b9b052053861","observation_id":"d52ee81a-1db6-4ab8-a5ef-eff87edfff8f","resolution":{"observed_at":"2026-08-06T19:57:41.560901Z","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/2302.10796/citation-record","integrity":"/paper/2302.10796/integrity","json":"/paper/2302.10796/citation-record.json","paper":"/paper/2302.10796"},"outbound":[],"paper":{"arxiv_id":"2302.10796","last_updated":"2024-06-13T17:00:41Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T14:54:11.599283Z","submitted_at":"2023-02-21T16:23:11Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret"},"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 2 inbound Pith citation observations for arXiv:2302.10796."}