{"as_of":"2026-08-17T17:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25c219717b751ee4bb2e69e04c0bb7a40b449520df079f7fe5973fd70efe73a4","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-17T06:30:58.91139+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-16T05:12:52.265308Z","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-15T18:54:06.027485Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.11762","last_updated":"2022-05-24T03:49:10Z","snapshot_observed_at":"2026-08-17T16:13:30.408238Z","submitted_at":"2022-05-24T03:49:10Z","title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11762","snapshot_observed_at":"2026-08-16T05:12:52.265308Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.21335","last_updated":"2025-04-30T05:45:15Z","snapshot_observed_at":"2026-08-17T11:48:34.405183Z","submitted_at":"2025-04-30T05:45:15Z","title":"Efficient hybrid variational quantum algorithm for solving graph coloring problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:52.265308Z"},"links":{"cited_paper":"/paper/2205.11762","citing_paper":"/paper/2504.21335"},"observation_digest":"sha256:ea403f8c47a3b2745b03c29dcaca9f00b61f8e8c3941cb9254cbb351f30d51bc","observation_id":"7e867c09-860f-4e2a-9823-3e973b104cfc","resolution":{"observed_at":"2026-08-16T05:12:52.265308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11762","last_updated":"2022-05-24T03:49:10Z","snapshot_observed_at":"2026-08-17T16:13:30.408238Z","submitted_at":"2022-05-24T03:49:10Z","title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines","version":1},"cited_work":{"arxiv_id":"2205.11762","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.11762","snapshot_observed_at":"2026-08-15T18:54:06.027485Z","title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines","venue":"quant-ph","work_id":"a91e1636-d868-43d3-9193-846ef3777d31","year":2022},"citing_paper":{"arxiv_id":"2506.18594","last_updated":"2025-06-23T12:54:06Z","snapshot_observed_at":"2026-08-16T18:56:56.158441Z","submitted_at":"2025-06-23T12:54:06Z","title":"Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:05.236451Z"},"links":{"cited_paper":"/paper/2205.11762","citing_paper":"/paper/2506.18594"},"observation_digest":"sha256:b3fd2a8f6609824ce7105b1f07ede11326e8c5984a100685a1319af49c0c7966","observation_id":"6cd365af-8c6c-4834-b932-dd0823725154","resolution":{"observed_at":"2026-08-15T18:54:06.032647Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.11762/citation-record","integrity":"/paper/2205.11762/integrity","json":"/paper/2205.11762/citation-record.json","paper":"/paper/2205.11762"},"outbound":[],"paper":{"arxiv_id":"2205.11762","last_updated":"2022-05-24T03:49:10Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T16:13:30.408238Z","submitted_at":"2022-05-24T03:49:10Z","title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.11762."}