{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15fd930ab2b6377334768ccde05e2287a91f62e32be49d6f38c492bb727c46a1","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-06T12:07:50.639287Z","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-11T03:55:56.705644Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12519","last_updated":"2023-06-16T07:47:31Z","snapshot_observed_at":"2026-07-06T14:21:53.002239Z","submitted_at":"2022-11-22T19:00:01Z","title":"Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12519","snapshot_observed_at":"2026-08-06T12:07:50.639287Z","title":"34:1–34:24, arXiv:2211.12519 [quant-ph]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22117","last_updated":"2025-07-29T18:00:01Z","snapshot_observed_at":"2026-08-08T12:49:39.716813Z","submitted_at":"2025-07-29T18:00:01Z","title":"A comprehensive benchmark of an Ising machine on the Max-Cut problem","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T12:07:50.639287Z"},"links":{"cited_paper":"/paper/2211.12519","citing_paper":"/paper/2507.22117"},"observation_digest":"sha256:8c085fa05e38b1247c68dd6f9f123743bb42321e27d5b79ac299e41855c2b50d","observation_id":"7fefb97d-0f64-4c2d-a242-cafb2c561e9a","resolution":{"observed_at":"2026-08-06T12:07:50.639287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12519","last_updated":"2023-06-16T07:47:31Z","snapshot_observed_at":"2026-07-06T14:21:53.002239Z","submitted_at":"2022-11-22T19:00:01Z","title":"Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate","version":2},"cited_work":{"arxiv_id":"2211.12519","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12519","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bittel, S","venue":null,"work_id":"aa1ecc47-f446-4f44-a00c-76345d1ca5d7","year":2022},"citing_paper":{"arxiv_id":"2605.07627","last_updated":"2026-05-08T11:56:12Z","snapshot_observed_at":"2026-07-06T23:20:01.856093Z","submitted_at":"2026-05-08T11:56:12Z","title":"A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-11T02:07:20.457348Z"},"links":{"cited_paper":"/paper/2211.12519","citing_paper":"/paper/2605.07627"},"observation_digest":"sha256:ce41ef90a8f4802fd0f38e88d9b151b41a8f9fdcdf4bef9b847de677c460773f","observation_id":"28cf4fab-13f1-4818-820c-1dc0fe4f9cca","resolution":{"observed_at":"2026-05-11T03:55:56.707287Z","resolver_source":"arxiv_id","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/2211.12519/citation-record","integrity":"/paper/2211.12519/integrity","json":"/paper/2211.12519/citation-record.json","paper":"/paper/2211.12519"},"outbound":[],"paper":{"arxiv_id":"2211.12519","last_updated":"2023-06-16T07:47:31Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T14:21:53.002239Z","submitted_at":"2022-11-22T19:00:01Z","title":"Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate"},"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:2211.12519."}