{"as_of":"2026-08-09T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f580f567587ae954cd8b9e7a7c122a5e7b3e80f1d02bfe8ebc75ebe73e1b452","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-09T06:31:02.800959+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-08T05:40:23.188087Z","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":49,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","snapshot_observed_at":"2026-07-06T07:53:37.491380Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms","version":2},"cited_work":{"arxiv_id":"1905.07047","doi":"10.48550/arxiv.1905.07047","metadata_source":"arxiv_reference","pith_arxiv_id":"1905.07047","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Classical and quantum bounded depth approximation algorithms","venue":"arXiv (Cornell University)","work_id":"3a6fc6dc-c613-4137-803e-f0d5a69a2865","year":2019},"citing_paper":{"arxiv_id":"2507.10908","last_updated":"2026-04-09T05:35:15Z","snapshot_observed_at":"2026-07-06T21:57:16.855518Z","submitted_at":"2025-07-15T01:54:11Z","title":"Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-19T04:23:44.246089Z"},"links":{"cited_paper":"/paper/1905.07047","citing_paper":"/paper/2507.10908"},"observation_digest":"sha256:b37daacc31c1c31de5bd5790ad0d0389875af17b33321d95a38764b71d44234d","observation_id":"61b57656-1249-4f86-912a-e76d0916dec1","resolution":{"observed_at":"2026-05-19T04:27:03.774303Z","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-05-25T14:53:24.420673+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T14:53:24.420673+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","snapshot_observed_at":"2026-07-06T07:53:37.491380Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms","version":2},"cited_work":{"arxiv_id":"1905.07047","doi":"10.48550/arxiv.1905.07047","metadata_source":"arxiv_reference","pith_arxiv_id":"1905.07047","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Classical and quantum bounded depth approximation algorithms","venue":"arXiv (Cornell University)","work_id":"3a6fc6dc-c613-4137-803e-f0d5a69a2865","year":2019},"citing_paper":{"arxiv_id":"2605.23138","last_updated":"2026-05-22T01:24:54Z","snapshot_observed_at":"2026-07-06T23:33:24.215365Z","submitted_at":"2026-05-22T01:24:54Z","title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-25T05:00:50.557828Z"},"links":{"cited_paper":"/paper/1905.07047","citing_paper":"/paper/2605.23138"},"observation_digest":"sha256:b03e5cd371dfc747384484d9d1936a6e4e7fc9988798b58611159bd33abf1bf4","observation_id":"cab44bf1-a2d4-49aa-86c5-f8cd8a9e28df","resolution":{"observed_at":"2026-05-25T05:05:21.841672Z","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-05-25T14:53:24.420673+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T14:53:24.420673+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","snapshot_observed_at":"2026-07-06T07:53:37.491380Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07047","snapshot_observed_at":"2026-08-08T05:40:23.188087Z","title":"arXiv:1905.07047","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2608.05610","last_updated":"2026-08-06T05:10:54Z","snapshot_observed_at":"2026-08-09T23:11:11.511900Z","submitted_at":"2026-08-06T05:10:54Z","title":"LC-Implicit-QAOA: Active-Workspace-Capped Exact Objective-and-Gradient Evaluation for Training over Bounded QUBO Light Cones","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T05:40:23.188087Z"},"links":{"cited_paper":"/paper/1905.07047","citing_paper":"/paper/2608.05610"},"observation_digest":"sha256:e58e0364c06a958a91f1fe07730578aa19665bdba5d008039f4cd5080f225358","observation_id":"9aa8e89e-f0da-4ba7-a6bd-2d895c411ea2","resolution":{"observed_at":"2026-08-08T05:40:23.188087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.07047/citation-record","integrity":"/paper/1905.07047/integrity","json":"/paper/1905.07047/citation-record.json","paper":"/paper/1905.07047"},"outbound":[],"paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T07:53:37.491380Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1905.07047."}