{"as_of":"2026-08-23T00:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be79be15267cf8b70a051aae5692a633f9972e83082f98d55043b8c85d2965ca","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-22T06:32:14.747728+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-14T05:35:45.819462Z","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-14T05:35:45.931937Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.01157","last_updated":"2018-03-01T14:35:43Z","snapshot_observed_at":"2026-08-16T23:11:12.891395Z","submitted_at":"2018-02-04T16:35:41Z","title":"Quantum Approximate Optimization with Parallelizable Gates","version":2},"cited_work":{"arxiv_id":"1802.01157","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.01157","snapshot_observed_at":"2026-08-14T05:35:45.931937Z","title":"Quantum Approximate Optimization with Parallelizable Gates","venue":"quant-ph","work_id":"60989211-ff74-4ff0-9c48-d87ad7dd6ac0","year":2018},"citing_paper":{"arxiv_id":"1909.01044","last_updated":"2019-09-03T10:26:07Z","snapshot_observed_at":"2026-08-22T10:29:29.695609Z","submitted_at":"2019-09-03T10:26:07Z","title":"State Stabilization for Gate-Model Quantum Computers","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T05:35:45.819462Z"},"links":{"cited_paper":"/paper/1802.01157","citing_paper":"/paper/1909.01044"},"observation_digest":"sha256:70d484b969b5f829afed8b5d3227d8a7cc9777b1122e3184c511caa2a96ccbaf","observation_id":"01d55292-a127-4a12-9b22-0edb4b2df70b","resolution":{"observed_at":"2026-08-14T05:35:45.937625Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1802.01157/citation-record","integrity":"/paper/1802.01157/integrity","json":"/paper/1802.01157/citation-record.json","paper":"/paper/1802.01157"},"outbound":[],"paper":{"arxiv_id":"1802.01157","last_updated":"2018-03-01T14:35:43Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T23:11:12.891395Z","submitted_at":"2018-02-04T16:35:41Z","title":"Quantum Approximate Optimization with Parallelizable Gates"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1802.01157."}