{"as_of":"2026-08-15T15:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94b5a595206022e50987fd658bcd72854b4a10b9be5813fc49196f8d1118fbde","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-15T06:32:42.880941+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-14T10:47:31.789247Z","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-14T10:47:32.124840Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1801.02309","last_updated":"2019-12-11T01:26:44Z","snapshot_observed_at":"2026-08-14T19:57:14.162320Z","submitted_at":"2018-01-08T05:39:14Z","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","version":4},"cited_work":{"arxiv_id":"1801.02309","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.02309","snapshot_observed_at":"2026-08-14T10:47:32.124840Z","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","venue":"stat.ML","work_id":"60f1a86a-a96f-43b6-8b2d-54a8a273abe9","year":2018},"citing_paper":{"arxiv_id":"1908.10859","last_updated":"2020-05-26T15:10:59Z","snapshot_observed_at":"2026-08-15T01:27:40.769813Z","submitted_at":"2019-08-28T17:59:29Z","title":"High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:47:31.789247Z"},"links":{"cited_paper":"/paper/1801.02309","citing_paper":"/paper/1908.10859"},"observation_digest":"sha256:aeb6ba4c5ceb79840832a81a0a761ae6fa5f1a467c9e6f1e0de1b115d37b1a8a","observation_id":"64d34df3-984b-44e8-9b27-804b41388135","resolution":{"observed_at":"2026-08-14T10:47:32.130255Z","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/1801.02309/citation-record","integrity":"/paper/1801.02309/integrity","json":"/paper/1801.02309/citation-record.json","paper":"/paper/1801.02309"},"outbound":[],"paper":{"arxiv_id":"1801.02309","last_updated":"2019-12-11T01:26:44Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T19:57:14.162320Z","submitted_at":"2018-01-08T05:39:14Z","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast"},"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 1 inbound Pith citation observation for arXiv:1801.02309."}