{"as_of":"2026-08-08T23:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a815daff914dc7557241c5bb45007d367d4bcf5c37aba04fe262a588b05deeae","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-08T06:32:00.761636+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-07T04:29:12.196535Z","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-07T04:29:12.643932Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.06201","last_updated":"2025-04-08T16:43:24Z","snapshot_observed_at":"2026-08-07T16:07:27.674301Z","submitted_at":"2025-04-08T16:43:24Z","title":"Quantum Annealing for Combinatorial Optimization: A Benchmarking Study","version":1},"cited_work":{"arxiv_id":"2504.06201","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.06201","snapshot_observed_at":"2026-08-07T04:29:12.643932Z","title":"Quantum Annealing for Combinatorial Optimization: A Benchmarking Study","venue":"quant-ph","work_id":"9352daa3-2c45-4da0-a1f5-44154330c1b3","year":2025},"citing_paper":{"arxiv_id":"2506.10531","last_updated":"2025-06-12T09:55:19Z","snapshot_observed_at":"2026-08-07T04:21:25.925004Z","submitted_at":"2025-06-12T09:55:19Z","title":"GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:12.196535Z"},"links":{"cited_paper":"/paper/2504.06201","citing_paper":"/paper/2506.10531"},"observation_digest":"sha256:dfcb2facb36a053657d579b58ebe47bc7b13941a0378b7caa0f02703c225186c","observation_id":"8bc74364-8230-40e1-bf5e-876da5697305","resolution":{"observed_at":"2026-08-07T04:29:12.716187Z","resolver_source":"local_arxiv","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/2504.06201/citation-record","integrity":"/paper/2504.06201/integrity","json":"/paper/2504.06201/citation-record.json","paper":"/paper/2504.06201"},"outbound":[],"paper":{"arxiv_id":"2504.06201","last_updated":"2025-04-08T16:43:24Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:07:27.674301Z","submitted_at":"2025-04-08T16:43:24Z","title":"Quantum Annealing for Combinatorial Optimization: A Benchmarking Study"},"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 1 inbound Pith citation observation for arXiv:2504.06201."}