{"as_of":"2026-08-12T23:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45d323bd0ac39d49e0c5d6fb297eef70fdf42f9a371ba18d67546b70fcb576eb","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:31:00.166278Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T07:52:43.661204Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.01469","last_updated":"2019-11-04T19:57:38Z","snapshot_observed_at":"2026-08-03T12:52:18.612214Z","submitted_at":"2019-11-04T19:57:38Z","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","version":1},"cited_work":{"arxiv_id":"1911.01469","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.01469","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1911.01469 , year=","venue":null,"work_id":"f483d91e-32c9-47fc-bc8b-7cb23e677085","year":2019},"citing_paper":{"arxiv_id":"2412.07999","last_updated":"2026-04-21T19:59:26Z","snapshot_observed_at":"2026-07-06T20:05:01.312121Z","submitted_at":"2024-12-11T00:48:04Z","title":"Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression","version":3},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-05-23T07:50:43.348358Z"},"links":{"cited_paper":"/paper/1911.01469","citing_paper":"/paper/2412.07999"},"observation_digest":"sha256:53441e5a10c130a2c7c41f683751626fcc942a6c3958715f083d69f3f0745aac","observation_id":"679218c2-a295-4db1-ad4e-bf301e2ef3f5","resolution":{"observed_at":"2026-05-23T07:52:43.664936Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01469","last_updated":"2019-11-04T19:57:38Z","snapshot_observed_at":"2026-08-03T12:52:18.612214Z","submitted_at":"2019-11-04T19:57:38Z","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.01469","snapshot_observed_at":"2026-08-08T16:31:00.166278Z","title":"Proximal Langevin algorithm: Rapid convergence under isoperimetry","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2502.06200","last_updated":"2025-06-03T14:24:01Z","snapshot_observed_at":"2026-08-10T11:17:47.682098Z","submitted_at":"2025-02-10T06:54:16Z","title":"On the query complexity of sampling from non-log-concave distributions","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T16:31:00.166278Z"},"links":{"cited_paper":"/paper/1911.01469","citing_paper":"/paper/2502.06200"},"observation_digest":"sha256:5866f613004dd2500ea32e90bde1539d04dcd3a4353304c5f18a2d02c126dfd2","observation_id":"132f6fe9-86e2-488a-97b9-cb07c7e62d77","resolution":{"observed_at":"2026-08-08T16:31:00.166278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01469","last_updated":"2019-11-04T19:57:38Z","snapshot_observed_at":"2026-08-03T12:52:18.612214Z","submitted_at":"2019-11-04T19:57:38Z","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","version":1},"cited_work":{"arxiv_id":"1911.01469","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.01469","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1911.01469 , year=","venue":null,"work_id":"f483d91e-32c9-47fc-bc8b-7cb23e677085","year":2019},"citing_paper":{"arxiv_id":"2605.12461","last_updated":"2026-05-12T17:48:09Z","snapshot_observed_at":"2026-07-06T23:24:08.763444Z","submitted_at":"2026-05-12T17:48:09Z","title":"A proximal gradient algorithm for composite log-concave sampling","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-13T02:52:53.741989Z"},"links":{"cited_paper":"/paper/1911.01469","citing_paper":"/paper/2605.12461"},"observation_digest":"sha256:cf990c71c6d1e194e0e1bca7657478d3fc13b384c90975b3b2cc7c9664492517","observation_id":"982c4939-c5c4-4488-ba04-ddae3f8a3f65","resolution":{"observed_at":"2026-05-13T02:57:09.351005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1911.01469/citation-record","integrity":"/paper/1911.01469/integrity","json":"/paper/1911.01469/citation-record.json","paper":"/paper/1911.01469"},"outbound":[],"paper":{"arxiv_id":"1911.01469","last_updated":"2019-11-04T19:57:38Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-03T12:52:18.612214Z","submitted_at":"2019-11-04T19:57:38Z","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1911.01469."}