{"as_of":"2026-08-07T03:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a63216b2c4f5d5e81baf187a9056d3878f834ebae02423e3da35a092e57f4d2","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-06T06:34:29.942622+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-03T13:47:40.856362Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.15442","last_updated":"2025-06-11T16:18:44Z","snapshot_observed_at":"2026-07-06T16:11:55.182509Z","submitted_at":"2023-08-29T17:10:20Z","title":"Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15442","snapshot_observed_at":"2026-08-03T13:47:40.856362Z","title":"Benchasattabuse, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.23026","last_updated":"2026-06-03T10:51:34Z","snapshot_observed_at":"2026-08-04T02:07:59.757559Z","submitted_at":"2025-12-28T18:01:20Z","title":"Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T13:47:40.856362Z"},"links":{"cited_paper":"/paper/2308.15442","citing_paper":"/paper/2512.23026"},"observation_digest":"sha256:ca98dc0a2b549d97e4eedce16e1001422c95ee0e0f24c5d13427ecefff7118f8","observation_id":"2383a98e-fb04-4bf4-a72d-8840417d242e","resolution":{"observed_at":"2026-08-03T13:47:40.856362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.15442/citation-record","integrity":"/paper/2308.15442/integrity","json":"/paper/2308.15442/citation-record.json","paper":"/paper/2308.15442"},"outbound":[],"paper":{"arxiv_id":"2308.15442","last_updated":"2025-06-11T16:18:44Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T16:11:55.182509Z","submitted_at":"2023-08-29T17:10:20Z","title":"Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2308.15442."}