{"as_of":"2026-08-19T03:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb6433b765e25e0bbad116847619bd952f7801dc997f319c811d6d89c6571ec2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:33:27.499736Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":37,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.03265","last_updated":"2018-05-08T20:17:16Z","snapshot_observed_at":"2026-08-18T17:07:11.550332Z","submitted_at":"2018-05-08T20:17:16Z","title":"Quantum Algorithms for Scientific Computing and Approximate Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.03265","snapshot_observed_at":"2026-08-16T04:33:27.499736Z","title":"The computational complexity of these methods has been extensively analyzed in the literature; see, for example, (Punnen et al","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.01214","last_updated":"2025-06-05T08:38:30Z","snapshot_observed_at":"2026-08-17T22:18:10.951449Z","submitted_at":"2025-05-02T12:04:46Z","title":"A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-16T04:33:27.499736Z"},"links":{"cited_paper":"/paper/1805.03265","citing_paper":"/paper/2505.01214"},"observation_digest":"sha256:67e83c44b8e67f6a414c3af851ade222de0cd089d42b9cc169087035c91a1c24","observation_id":"b78bb112-fb1e-4ba2-8553-4e0acce1d612","resolution":{"observed_at":"2026-08-16T04:33:27.499736Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.03265","last_updated":"2018-05-08T20:17:16Z","snapshot_observed_at":"2026-08-18T17:07:11.550332Z","submitted_at":"2018-05-08T20:17:16Z","title":"Quantum Algorithms for Scientific Computing and Approximate Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.03265","snapshot_observed_at":"2026-08-15T18:33:15.487165Z","title":"Quantum Algorithms for Scientific Computing and Approximate Optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19959","last_updated":"2026-06-19T18:23:50Z","snapshot_observed_at":"2026-08-18T21:42:44.049195Z","submitted_at":"2025-06-24T19:11:52Z","title":"A Spectral Quantum Algorithm for Numerical Differentiation and Integration","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:15.487165Z"},"links":{"cited_paper":"/paper/1805.03265","citing_paper":"/paper/2506.19959"},"observation_digest":"sha256:39c12ba9248163e98a78573ca1054fafaf3e160010e6844b54e53e03a2d3de8a","observation_id":"fc8921e9-5598-4b24-9a71-c151aea00f96","resolution":{"observed_at":"2026-08-15T18:33:15.487165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.03265","last_updated":"2018-05-08T20:17:16Z","snapshot_observed_at":"2026-08-18T17:07:11.550332Z","submitted_at":"2018-05-08T20:17:16Z","title":"Quantum Algorithms for Scientific Computing and Approximate Optimization","version":1},"cited_work":{"arxiv_id":"1805.03265","doi":"10.48550/arxiv.1805.03265","metadata_source":"arxiv_reference","pith_arxiv_id":"1805.03265","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Columb ia University, New York, NY (2018)","venue":"arXiv (Cornell University)","work_id":"08ba70a8-a790-43d6-9b02-99f397d5aedc","year":2018},"citing_paper":{"arxiv_id":"2604.08367","last_updated":"2026-04-24T14:15:34Z","snapshot_observed_at":"2026-08-13T23:30:27.764756Z","submitted_at":"2026-04-09T15:33:37Z","title":"Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T18:07:41.848436Z"},"links":{"cited_paper":"/paper/1805.03265","citing_paper":"/paper/2604.08367"},"observation_digest":"sha256:b4a8364a87a137ade9d876d79dc5cde0103ea6df6f81cd5f566ac29e47f2e781","observation_id":"1a971217-7de2-4297-97a8-ea204c04e0a5","resolution":{"observed_at":"2026-07-04T22:45:31.025482Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.03265/citation-record","integrity":"/paper/1805.03265/integrity","json":"/paper/1805.03265/citation-record.json","paper":"/paper/1805.03265"},"outbound":[],"paper":{"arxiv_id":"1805.03265","last_updated":"2018-05-08T20:17:16Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T17:07:11.550332Z","submitted_at":"2018-05-08T20:17:16Z","title":"Quantum Algorithms for Scientific Computing and Approximate 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1805.03265."}