{"as_of":"2026-08-19T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22afced514058c6dd33fdfbcfc33186b4ec987a68955388e71e2c538826bf468","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-15T21:19:21.255147Z","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-11T23:21:18.692358Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.06663","last_updated":"2023-05-22T14:07:04Z","snapshot_observed_at":"2026-08-18T16:27:07.552894Z","submitted_at":"2022-12-13T15:42:10Z","title":"Quantum Policy Gradient Algorithm with Optimized Action Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.06663","snapshot_observed_at":"2026-08-10T20:53:52.520195Z","title":"Meyer, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.07085","last_updated":"2025-01-13T06:40:40Z","snapshot_observed_at":"2026-08-18T04:49:59.516839Z","submitted_at":"2025-01-13T06:40:40Z","title":"PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T20:53:52.520195Z"},"links":{"cited_paper":"/paper/2212.06663","citing_paper":"/paper/2501.07085"},"observation_digest":"sha256:fd6b8367343b45f9ce56392eb1d43219b05693db59d40a7150802fa46e0ad327","observation_id":"9c5e63f5-a8c0-46fd-8d96-4e71bf29c46b","resolution":{"observed_at":"2026-08-10T20:53:52.520195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.06663","last_updated":"2023-05-22T14:07:04Z","snapshot_observed_at":"2026-08-18T16:27:07.552894Z","submitted_at":"2022-12-13T15:42:10Z","title":"Quantum Policy Gradient Algorithm with Optimized Action Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.06663","snapshot_observed_at":"2026-08-15T21:19:21.255147Z","title":"Meyer, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.10167","last_updated":"2025-06-12T09:36:53Z","snapshot_observed_at":"2026-08-17T16:59:41.792497Z","submitted_at":"2025-05-15T10:51:34Z","title":"QuXAI: Explainers for Hybrid Quantum Machine Learning Models","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:21.255147Z"},"links":{"cited_paper":"/paper/2212.06663","citing_paper":"/paper/2505.10167"},"observation_digest":"sha256:a4d763fff8895227f6f54b452d4d4ede1bc842c7a958ebb15dbd3dab5037ec9f","observation_id":"1b77b04d-d2b8-43ae-81e2-df289058a774","resolution":{"observed_at":"2026-08-15T21:19:21.255147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.06663","last_updated":"2023-05-22T14:07:04Z","snapshot_observed_at":"2026-08-18T16:27:07.552894Z","submitted_at":"2022-12-13T15:42:10Z","title":"Quantum Policy Gradient Algorithm with Optimized Action Decoding","version":2},"cited_work":{"arxiv_id":"2212.06663","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.06663","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum policy gradient algorithm with optimized action decoding","venue":null,"work_id":"de666360-4bd7-482b-90b9-dfcc1d652d15","year":2022},"citing_paper":{"arxiv_id":"2604.25962","last_updated":"2026-04-28T00:46:37Z","snapshot_observed_at":"2026-08-13T09:23:28.602846Z","submitted_at":"2026-04-28T00:46:37Z","title":"Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-07T17:18:55.364016Z"},"links":{"cited_paper":"/paper/2212.06663","citing_paper":"/paper/2604.25962"},"observation_digest":"sha256:0825521c5f027824c92cad5dfd24efac90c24cd7c837e3c2140a08013247932a","observation_id":"794dc6fd-79f3-4789-9c99-cf5051ed73cd","resolution":{"observed_at":"2026-05-11T23:21:18.742700Z","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.06663/citation-record","integrity":"/paper/2212.06663/integrity","json":"/paper/2212.06663/citation-record.json","paper":"/paper/2212.06663"},"outbound":[],"paper":{"arxiv_id":"2212.06663","last_updated":"2023-05-22T14:07:04Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T16:27:07.552894Z","submitted_at":"2022-12-13T15:42:10Z","title":"Quantum Policy Gradient Algorithm with Optimized Action Decoding"},"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.06663."}