{"as_of":"2026-08-10T04:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7efad8bbbc98abc5c7aaeb1e647d0075e3de8f4a976b72a8246fda035467d3e2","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:05:28.078038Z","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-24T00:25:53.957163Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.16135","last_updated":"2024-10-22T15:56:19Z","snapshot_observed_at":"2026-07-31T09:14:19.001048Z","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial optimization","version":2},"cited_work":{"arxiv_id":"2404.16135","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.16135","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Performant near-term quantum combinatorial opti- mization","venue":null,"work_id":"d1cc6db8-0708-420b-a32f-e13ba0e22c08","year":2024},"citing_paper":{"arxiv_id":"2406.14330","last_updated":"2026-07-30T16:35:55Z","snapshot_observed_at":"2026-08-02T23:49:48.241305Z","submitted_at":"2024-06-20T14:00:09Z","title":"Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T00:24:37.314961Z"},"links":{"cited_paper":"/paper/2404.16135","citing_paper":"/paper/2406.14330"},"observation_digest":"sha256:20d3eff0f821eda39b50784ba75a43a99b97b251786590c6be11b36e541fa8bc","observation_id":"e26314e3-f270-4411-9756-a9a3bf35d2ed","resolution":{"observed_at":"2026-05-24T00:25:53.960036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16135","last_updated":"2024-10-22T15:56:19Z","snapshot_observed_at":"2026-07-31T09:14:19.001048Z","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16135","snapshot_observed_at":"2026-08-07T13:05:28.078038Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22924","last_updated":"2025-06-18T16:10:05Z","snapshot_observed_at":"2026-08-07T23:01:57.486243Z","submitted_at":"2025-05-28T22:56:57Z","title":"Optimizing QUBO on a quantum computer by mimicking imaginary time evolution","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:05:28.078038Z"},"links":{"cited_paper":"/paper/2404.16135","citing_paper":"/paper/2505.22924"},"observation_digest":"sha256:17ceb526e3dd6a7c2713a0f51905bec1594b836aeb5af315dea1150e2b5cecbf","observation_id":"598d77ef-fc50-4193-be84-00a4e887c1bf","resolution":{"observed_at":"2026-08-07T13:05:28.078038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16135","last_updated":"2024-10-22T15:56:19Z","snapshot_observed_at":"2026-07-31T09:14:19.001048Z","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial optimization","version":2},"cited_work":{"arxiv_id":"2404.16135","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.16135","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Performant near-term quantum combinatorial opti- mization","venue":null,"work_id":"d1cc6db8-0708-420b-a32f-e13ba0e22c08","year":2024},"citing_paper":{"arxiv_id":"2508.11765","last_updated":"2026-01-27T20:25:46Z","snapshot_observed_at":"2026-08-02T18:46:25.302981Z","submitted_at":"2025-08-15T18:31:37Z","title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","version":2},"reference_index":266,"source":"pdf_text","source_observed_at":"2026-05-18T22:19:39.677935Z"},"links":{"cited_paper":"/paper/2404.16135","citing_paper":"/paper/2508.11765"},"observation_digest":"sha256:a16111e876e0771e0447de2d1f9c8671d06075b870e81956da9b9d3e14693bde","observation_id":"d3f6c41b-a9d9-4517-aba4-f361b86653e3","resolution":{"observed_at":"2026-05-18T22:21:52.906910Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16135","last_updated":"2024-10-22T15:56:19Z","snapshot_observed_at":"2026-07-31T09:14:19.001048Z","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial optimization","version":2},"cited_work":{"arxiv_id":"2404.16135","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.16135","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Performant near-term quantum combinatorial opti- mization","venue":null,"work_id":"d1cc6db8-0708-420b-a32f-e13ba0e22c08","year":2024},"citing_paper":{"arxiv_id":"2604.26047","last_updated":"2026-04-28T18:32:11Z","snapshot_observed_at":"2026-07-06T23:11:48.524898Z","submitted_at":"2026-04-28T18:32:11Z","title":"Iterative warm-start optimization with quantum imaginary time evolution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T16:20:51.972892Z"},"links":{"cited_paper":"/paper/2404.16135","citing_paper":"/paper/2604.26047"},"observation_digest":"sha256:20756d6b171d928948e4777286d3f468f7c01c855de2948762e2101f21a315ce","observation_id":"6944d204-88ce-440f-afc9-d6491dd2d105","resolution":{"observed_at":"2026-05-11T23:46:36.886541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.16135/citation-record","integrity":"/paper/2404.16135/integrity","json":"/paper/2404.16135/citation-record.json","paper":"/paper/2404.16135"},"outbound":[],"paper":{"arxiv_id":"2404.16135","last_updated":"2024-10-22T15:56:19Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-31T09:14:19.001048Z","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2404.16135."}