{"as_of":"2026-08-12T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e642875b93f25b479464fceacff45f418a27b69a5f90295bb84716f1d2fe2acf","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T10:22:55.716618Z","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-07-03T13:58:21.820647Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.08448","last_updated":"2022-10-31T16:57:18Z","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","version":2},"cited_work":{"arxiv_id":"2210.08448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.08448","snapshot_observed_at":"2026-07-03T13:58:21.820647Z","title":"Altschuler and Kunal Talwar","venue":null,"work_id":"f86c8b72-f900-46a6-9f28-00a6605ed38c","year":2022},"citing_paper":{"arxiv_id":"2303.03237","last_updated":"2026-04-23T09:32:23Z","snapshot_observed_at":"2026-07-06T14:59:14.951471Z","submitted_at":"2023-03-06T15:53:44Z","title":"Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T09:50:07.343966Z"},"links":{"cited_paper":"/paper/2210.08448","citing_paper":"/paper/2303.03237"},"observation_digest":"sha256:04c2835e738640ced789d3dec379b5436d3161e8ad95eefe7b567bba84a6a438","observation_id":"0dd6cc6b-d3a8-4066-8e90-9925e605a708","resolution":{"observed_at":"2026-05-24T09:54:18.375666Z","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":"2210.08448","last_updated":"2022-10-31T16:57:18Z","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","version":2},"cited_work":{"arxiv_id":"2210.08448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.08448","snapshot_observed_at":"2026-07-03T13:58:21.820647Z","title":"Altschuler and Kunal Talwar","venue":null,"work_id":"f86c8b72-f900-46a6-9f28-00a6605ed38c","year":2022},"citing_paper":{"arxiv_id":"2605.11170","last_updated":"2026-06-02T13:57:02Z","snapshot_observed_at":"2026-08-02T02:13:17.912919Z","submitted_at":"2026-05-11T19:28:33Z","title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","version":1},"reference_index":231,"source":"arxiv_source","source_observed_at":"2026-05-13T05:56:38.042978Z"},"links":{"cited_paper":"/paper/2210.08448","citing_paper":"/paper/2605.11170"},"observation_digest":"sha256:30e401d16940ee5a1a2d9c01d264796804f26fc6d2643e15ec17cc5cc9b2ff49","observation_id":"72d54a83-3e71-4d69-98dd-924717de9cbd","resolution":{"observed_at":"2026-05-13T05:57:22.445591Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2210.08448","last_updated":"2022-10-31T16:57:18Z","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","version":2},"cited_work":{"arxiv_id":"2210.08448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.08448","snapshot_observed_at":"2026-07-03T13:58:21.820647Z","title":"Altschuler and Kunal Talwar","venue":null,"work_id":"f86c8b72-f900-46a6-9f28-00a6605ed38c","year":2022},"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":27,"source":"arxiv_source","source_observed_at":"2026-05-13T02:52:53.741989Z"},"links":{"cited_paper":"/paper/2210.08448","citing_paper":"/paper/2605.12461"},"observation_digest":"sha256:ba0a5b037b137ca48be2a4d378e53cbbaad9a9a3121905b7adc5108c2b802b65","observation_id":"16712c30-9853-4937-be31-66462eef0374","resolution":{"observed_at":"2026-05-13T02:57:09.357151Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2210.08448","last_updated":"2022-10-31T16:57:18Z","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","version":2},"cited_work":{"arxiv_id":"2210.08448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.08448","snapshot_observed_at":"2026-07-03T13:58:21.820647Z","title":"Altschuler and Kunal Talwar","venue":null,"work_id":"f86c8b72-f900-46a6-9f28-00a6605ed38c","year":2022},"citing_paper":{"arxiv_id":"2606.13576","last_updated":"2026-06-11T17:02:24Z","snapshot_observed_at":"2026-08-08T21:43:36.320150Z","submitted_at":"2026-06-11T17:02:24Z","title":"Learning with Simulators: No Regret in a Computationally Bounded World","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T07:22:21.729255Z"},"links":{"cited_paper":"/paper/2210.08448","citing_paper":"/paper/2606.13576"},"observation_digest":"sha256:9f6250d0a877a842438dd8308870001ad39c42022a8e28c066f0280567fa8ddc","observation_id":"8c9e079a-068f-4c74-80c4-9361c925a0db","resolution":{"observed_at":"2026-07-03T13:58:21.825098Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2210.08448","last_updated":"2022-10-31T16:57:18Z","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.08448","snapshot_observed_at":"2026-08-10T10:22:55.716618Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.07329","last_updated":"2026-08-07T15:27:20Z","snapshot_observed_at":"2026-08-12T11:12:58.307497Z","submitted_at":"2026-08-07T15:27:20Z","title":"Sampling and Optimization meet Enhanced Flows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T10:22:55.716618Z"},"links":{"cited_paper":"/paper/2210.08448","citing_paper":"/paper/2608.07329"},"observation_digest":"sha256:9dd97d248bb59c49b141ff35ef0322b87587077f04025a9a1f55ac926926a47e","observation_id":"d5ffed6f-91eb-4376-84f6-61ab5db6b80f","resolution":{"observed_at":"2026-08-10T10:22:55.716618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2210.08448/citation-record","integrity":"/paper/2210.08448/integrity","json":"/paper/2210.08448/citation-record.json","paper":"/paper/2210.08448"},"outbound":[],"paper":{"arxiv_id":"2210.08448","last_updated":"2022-10-31T16:57:18Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-12T03:12:03.594291Z","submitted_at":"2022-10-16T05:11:16Z","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling"},"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 5 inbound Pith citation observations for arXiv:2210.08448."}