{"as_of":"2026-08-08T04:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0426e81cc9e329698bdeed9abeb44d9e40c59bc6b7e55cfaff9118938134ac01","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-07T06:34:17.273281+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-03T08:58:35.437650Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.08413","last_updated":"2019-08-22T21:50:10Z","snapshot_observed_at":"2026-07-06T07:16:05.293591Z","submitted_at":"2018-11-20T18:41:29Z","title":"Sampling Can Be Faster Than Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.08413","snapshot_observed_at":"2026-08-03T08:58:35.437650Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15523","last_updated":"2026-06-18T18:16:10Z","snapshot_observed_at":"2026-08-07T22:21:13.552614Z","submitted_at":"2026-01-21T23:20:46Z","title":"Provable Quantum Speedups for Reaction-Rate Estimation in High-Dimensional Fokker-Planck Dynamics","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T08:58:35.437650Z"},"links":{"cited_paper":"/paper/1811.08413","citing_paper":"/paper/2601.15523"},"observation_digest":"sha256:e1533a50a40032c912288d3b5535d1f15f1ef46e7615c7055349f45d4a9ef74e","observation_id":"c1a4b1f4-0811-4c86-89d0-3b0deee03894","resolution":{"observed_at":"2026-08-03T08:58:35.437650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1811.08413/citation-record","integrity":"/paper/1811.08413/integrity","json":"/paper/1811.08413/citation-record.json","paper":"/paper/1811.08413"},"outbound":[],"paper":{"arxiv_id":"1811.08413","last_updated":"2019-08-22T21:50:10Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T07:16:05.293591Z","submitted_at":"2018-11-20T18:41:29Z","title":"Sampling Can Be Faster Than 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1811.08413."}