{"as_of":"2026-08-19T12:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e6675fd2fbb4b97b02641a9e4bac716d8fe32468b5453f7d176de846b00857e","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-19T06:32:44.657259+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-06T19:57:38.427280Z","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:42.906211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.02548","last_updated":"2022-12-05T19:10:32Z","snapshot_observed_at":"2026-08-19T02:45:42.266239Z","submitted_at":"2022-12-05T19:10:32Z","title":"Robustness of Quantum Algorithms for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2212.02548","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.02548","snapshot_observed_at":"2026-08-06T19:57:42.906211Z","title":"Robustness of Quantum Algorithms for Nonconvex Optimization","venue":"quant-ph","work_id":"045f4220-aec6-439c-9616-f2f14f2cf365","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":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.427280Z"},"links":{"cited_paper":"/paper/2212.02548","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:e49922cfd01de63e275e35c572d6ba62266d9db0ccafe948ba9d0507d8f69841","observation_id":"4b35a058-4115-4652-8f88-f9028a9b4af4","resolution":{"observed_at":"2026-08-06T19:57:42.957849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.02548/citation-record","integrity":"/paper/2212.02548/integrity","json":"/paper/2212.02548/citation-record.json","paper":"/paper/2212.02548"},"outbound":[],"paper":{"arxiv_id":"2212.02548","last_updated":"2022-12-05T19:10:32Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T02:45:42.266239Z","submitted_at":"2022-12-05T19:10:32Z","title":"Robustness of Quantum Algorithms for Nonconvex Optimization"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:2212.02548."}