{"as_of":"2026-08-19T02:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c02e798f5c9a8e2388275044927e7f7731e8628a0e6f20c822dd7b66c14cb7c2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:15:42.943921Z","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-05-11T05:20:58.957370Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.09328","last_updated":"2022-12-19T09:45:58Z","snapshot_observed_at":"2026-08-18T08:00:02.639393Z","submitted_at":"2022-12-19T09:45:58Z","title":"Quantum policy gradient algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.09328","snapshot_observed_at":"2026-08-06T19:57:38.497310Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.497310Z"},"links":{"cited_paper":"/paper/2212.09328","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:91c5b7cbfba76c886fecac86c391b220be4e01e2b48439b4e996a9c55855c996","observation_id":"90eaa6b8-db85-4660-a19e-3afd0727b252","resolution":{"observed_at":"2026-08-06T19:57:38.497310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09328","last_updated":"2022-12-19T09:45:58Z","snapshot_observed_at":"2026-08-18T08:00:02.639393Z","submitted_at":"2022-12-19T09:45:58Z","title":"Quantum policy gradient algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.09328","snapshot_observed_at":"2026-08-15T18:15:42.943921Z","title":"Jerbi, S., Cornelissen, A., Ozols, M., & Dunjko, V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.18606","last_updated":"2026-06-29T22:06:43Z","snapshot_observed_at":"2026-08-17T08:56:02.337731Z","submitted_at":"2025-07-24T17:42:30Z","title":"Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:15:42.943921Z"},"links":{"cited_paper":"/paper/2212.09328","citing_paper":"/paper/2507.18606"},"observation_digest":"sha256:d54ddbf681e998d4e1997d296f7c6d9f83d355d9780b965f23691a475e895970","observation_id":"ff263e5f-a4a3-4f3d-9d4d-e6f24d224427","resolution":{"observed_at":"2026-08-15T18:15:42.943921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09328","last_updated":"2022-12-19T09:45:58Z","snapshot_observed_at":"2026-08-18T08:00:02.639393Z","submitted_at":"2022-12-19T09:45:58Z","title":"Quantum policy gradient algorithms","version":1},"cited_work":{"arxiv_id":"2212.09328","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.09328","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum policy gradient algorithms","venue":null,"work_id":"6f1c45cc-e54a-4f8c-b277-0c1a1ece0d69","year":2022},"citing_paper":{"arxiv_id":"2604.07909","last_updated":"2026-04-09T07:25:46Z","snapshot_observed_at":"2026-08-16T02:45:01.167206Z","submitted_at":"2026-04-09T07:25:46Z","title":"A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing","version":1},"reference_index":280,"source":"pdf_text","source_observed_at":"2026-05-10T18:12:22.525869Z"},"links":{"cited_paper":"/paper/2212.09328","citing_paper":"/paper/2604.07909"},"observation_digest":"sha256:ba78f5d7665668540a8aee069797cafcd5ef1a57960c1596c9d46026526154fb","observation_id":"3b3a0efe-fe50-41d0-8f16-0bfae7f024cd","resolution":{"observed_at":"2026-05-11T05:20:58.964027Z","resolver_source":"arxiv_id","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/2212.09328/citation-record","integrity":"/paper/2212.09328/integrity","json":"/paper/2212.09328/citation-record.json","paper":"/paper/2212.09328"},"outbound":[],"paper":{"arxiv_id":"2212.09328","last_updated":"2022-12-19T09:45:58Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T08:00:02.639393Z","submitted_at":"2022-12-19T09:45:58Z","title":"Quantum policy gradient algorithms"},"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 3 inbound Pith citation observations for arXiv:2212.09328."}