{"as_of":"2026-08-21T10:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4aa678a034ebaf2c6d866c1d5b2bb3a149af99c52da27dd94f815c4b11b5fbff","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-21T06:32:19.484+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-14T12:46:34.583421Z","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-14T12:46:35.465303Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.04613","last_updated":"2022-01-10T23:43:47Z","snapshot_observed_at":"2026-07-06T08:20:36.664549Z","submitted_at":"2019-09-10T16:43:35Z","title":"Faster quantum and classical SDP approximations for quadratic binary optimization","version":3},"cited_work":{"arxiv_id":"1909.04613","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.04613","snapshot_observed_at":"2026-08-14T12:46:35.465303Z","title":"Faster quantum and classical SDP approximations for quadratic binary optimization","venue":"cs.DS","work_id":"8898f85a-4a6c-46cd-9377-a6ecd17d222c","year":2019},"citing_paper":{"arxiv_id":"1908.06720","last_updated":"2021-04-05T17:33:22Z","snapshot_observed_at":"2026-08-19T19:35:14.203181Z","submitted_at":"2019-08-19T12:02:13Z","title":"Quantum algorithms for Second-Order Cone Programming and Support Vector Machines","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:34.583421Z"},"links":{"cited_paper":"/paper/1909.04613","citing_paper":"/paper/1908.06720"},"observation_digest":"sha256:cc580d49c35f225ebea0de702fbe8798255cba9eb01e88432a1c27e7fb5792a2","observation_id":"5768b245-8fc4-4ffe-b128-864faa851062","resolution":{"observed_at":"2026-08-14T12:46:35.469920Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.04613/citation-record","integrity":"/paper/1909.04613/integrity","json":"/paper/1909.04613/citation-record.json","paper":"/paper/1909.04613"},"outbound":[],"paper":{"arxiv_id":"1909.04613","last_updated":"2022-01-10T23:43:47Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T08:20:36.664549Z","submitted_at":"2019-09-10T16:43:35Z","title":"Faster quantum and classical SDP approximations for quadratic binary 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1909.04613."}