{"as_of":"2026-08-15T18:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a45bd9e8a46b553d0cc34f2cb1798106a2d082109944889d846c017c25ee2ca3","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:14:41.637002Z","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-06T19:57:43.706804Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.01731","last_updated":"2019-12-18T06:07:23Z","snapshot_observed_at":"2026-08-14T18:33:16.258186Z","submitted_at":"2018-09-04T14:05:38Z","title":"Quantum algorithms and lower bounds for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.01731","snapshot_observed_at":"2026-08-14T14:14:41.637002Z","title":"Childs, Tongyang Li, and Xiaodi Wu,Quantum algorithms and lower bounds for convex optimization , 2018, arXiv:1809.01731","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03903","last_updated":"2021-11-01T15:27:03Z","snapshot_observed_at":"2026-08-15T16:01:44.877472Z","submitted_at":"2019-08-11T13:13:47Z","title":"Quantum algorithm for estimating volumes of convex bodies","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:41.637002Z"},"links":{"cited_paper":"/paper/1809.01731","citing_paper":"/paper/1908.03903"},"observation_digest":"sha256:009c6219bb2b371c1883cf297d617cdc48c0e1a53102449dde3457323f6bb23a","observation_id":"b30ab5c1-597a-4009-ba5c-9cbae35e8525","resolution":{"observed_at":"2026-08-14T14:14:41.637002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.01731","last_updated":"2019-12-18T06:07:23Z","snapshot_observed_at":"2026-08-14T18:33:16.258186Z","submitted_at":"2018-09-04T14:05:38Z","title":"Quantum algorithms and lower bounds for convex optimization","version":3},"cited_work":{"arxiv_id":"1809.01731","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.01731","snapshot_observed_at":"2026-08-06T19:57:43.706804Z","title":"Quantum algorithms and lower bounds for convex optimization","venue":"quant-ph","work_id":"11bf1787-dd67-4179-b26c-9b6417228ff2","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-08T09:52:26.625560Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.959201Z"},"links":{"cited_paper":"/paper/1809.01731","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:4d3030ade670f8afd71fcda8dc3d202b7eca6bc00044e7c7705a98efe803f6a9","observation_id":"8324d44d-4eae-452a-9e92-a0aa89568a9c","resolution":{"observed_at":"2026-08-06T19:57:43.739225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1809.01731/citation-record","integrity":"/paper/1809.01731/integrity","json":"/paper/1809.01731/citation-record.json","paper":"/paper/1809.01731"},"outbound":[],"paper":{"arxiv_id":"1809.01731","last_updated":"2019-12-18T06:07:23Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T18:33:16.258186Z","submitted_at":"2018-09-04T14:05:38Z","title":"Quantum algorithms and lower bounds for convex 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1809.01731."}