{"as_of":"2026-08-09T21:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0597cbc0f987b90a4859dfb80c376cde9be0719e45135deb726bfef144c95a4","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T13:36:16.126930Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2512.24152/citation-record","integrity":"/paper/2512.24152/integrity","json":"/paper/2512.24152/citation-record.json","paper":"/paper/2512.24152"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08797","last_updated":"2025-10-09T00:43:44Z","snapshot_observed_at":"2026-07-06T15:03:52.079498Z","submitted_at":"2023-03-15T17:43:42Z","title":"Stochastic Interpolants: A Unifying Framework for Flows and Diffusions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08797","snapshot_observed_at":"2026-08-03T13:36:13.354749Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:13.354749Z"},"links":{"cited_paper":"/paper/2303.08797","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:fd6086f70f6bf2fb44211ea79bf7c6249366d31baa192a499528561a6d85e8f0","observation_id":"0be1ba26-b6ff-4a6f-9c8c-be1b23ccffd3","resolution":{"observed_at":"2026-08-03T13:36:13.354749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18804","last_updated":"2025-04-23T19:38:36Z","snapshot_observed_at":"2026-08-09T19:34:44.516958Z","submitted_at":"2024-09-27T14:57:18Z","title":"Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18804","snapshot_observed_at":"2026-08-03T13:36:13.734744Z","title":"[ADR24] I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:13.734744Z"},"links":{"cited_paper":"/paper/2409.18804","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:3ac8bd134908f535f86eb94d047f86757617eced3f5774a785a1d746ad44d3b5","observation_id":"5ac679d9-b798-4618-b7af-24080ac65c1e","resolution":{"observed_at":"2026-08-03T13:36:13.734744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12240","last_updated":"2024-09-12T14:22:00Z","snapshot_observed_at":"2026-07-06T16:09:35.920101Z","submitted_at":"2023-08-23T16:31:08Z","title":"KL Convergence Guarantees for Score diffusion models under minimal data assumptions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12240","snapshot_observed_at":"2026-08-03T13:36:14.425771Z","title":"Conforti, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:14.425771Z"},"links":{"cited_paper":"/paper/2308.12240","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:5f142160244eca2e51857c4689abfd2e86f5c1aa991cefac6188d7ff2d89e10f","observation_id":"aa58cfdf-d999-487c-9cc8-a6a178219a7b","resolution":{"observed_at":"2026-08-03T13:36:14.425771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07194","last_updated":"2023-02-14T17:02:35Z","snapshot_observed_at":"2026-07-06T14:51:48.920020Z","submitted_at":"2023-02-14T17:02:35Z","title":"Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.07194","snapshot_observed_at":"2026-08-03T13:36:14.957638Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:14.957638Z"},"links":{"cited_paper":"/paper/2302.07194","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:9a437512be8d38df40b42844a861fec712f3a99222acff2c3017d34715b09294","observation_id":"03964175-1ba8-4dcb-80f3-e66077e73a53","resolution":{"observed_at":"2026-08-03T13:36:14.957638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09583","last_updated":"2025-03-12T17:51:29Z","snapshot_observed_at":"2026-08-08T14:59:37.841872Z","submitted_at":"2025-03-12T17:51:29Z","title":"Minimax Optimality of the Probability Flow ODE for Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09583","snapshot_observed_at":"2026-08-03T13:36:15.126645Z","title":"Cai and G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.126645Z"},"links":{"cited_paper":"/paper/2503.09583","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:8d7b73da54734d5eadc50948e5d2489570e108f7a12b877bdda66fc1608de73b","observation_id":"2981070c-1bd3-408f-b740-73ce07777a08","resolution":{"observed_at":"2026-08-03T13:36:15.126645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07771","last_updated":"2024-04-11T14:07:25Z","snapshot_observed_at":"2026-08-04T18:50:47.375801Z","submitted_at":"2024-04-11T14:07:25Z","title":"An Overview of Diffusion Models: Applications, Guided Generation, Statistical Rates and Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07771","snapshot_observed_at":"2026-08-03T13:36:15.364750Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.364750Z"},"links":{"cited_paper":"/paper/2404.07771","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:9b511d63dcc33815f495a528ce03c1a326bc168083bcc56f60a63a0c85b18193","observation_id":"44d51322-70f3-4c8b-addb-1d02cb84072b","resolution":{"observed_at":"2026-08-03T13:36:15.364750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02599","last_updated":"2023-10-30T03:01:43Z","snapshot_observed_at":"2026-08-04T16:55:46.976813Z","submitted_at":"2023-04-05T17:10:53Z","title":"Query lower bounds for log-concave sampling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.02599","snapshot_observed_at":"2026-08-03T13:36:15.474745Z","title":"[Dal16] A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.474745Z"},"links":{"cited_paper":"/paper/2304.02599","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:11b65c4a6bc129c0281d2b88c33e36c098619d15eb4389e6e96aaf0721eee8e6","observation_id":"0f2bed86-b491-4d96-a098-7cf3e88167c5","resolution":{"observed_at":"2026-08-03T13:36:15.474745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09251","last_updated":"2024-03-07T03:30:57Z","snapshot_observed_at":"2026-08-05T07:21:49.382331Z","submitted_at":"2023-06-15T16:30:08Z","title":"Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.09251","snapshot_observed_at":"2026-08-03T13:36:15.764744Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.764744Z"},"links":{"cited_paper":"/paper/2306.09251","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:ff28d5f55b5ad685d2f589d6d236bee4076a90d4cbed946326ef8317b6addac9","observation_id":"192c4f91-df63-4185-85bc-b92d9702b9da","resolution":{"observed_at":"2026-08-03T13:36:15.764744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04095","last_updated":"2023-06-08T16:31:07Z","snapshot_observed_at":"2026-08-09T14:14:31.688468Z","submitted_at":"2023-04-08T20:17:29Z","title":"A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04095","snapshot_observed_at":"2026-08-03T13:36:15.876867Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.876867Z"},"links":{"cited_paper":"/paper/2304.04095","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:b1af75a0c7e92c429034ae8b738aa6e3aa8b1a664125e8914ffd0d3780db0a6f","observation_id":"5ab5795b-ca8f-4c7d-b51d-846d6ae57f51","resolution":{"observed_at":"2026-08-03T13:36:15.876867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T13:36:13.961658Z","title":"Benton, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:13.961658Z"},"links":{"citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:71d8734cf22722ffa3bc1d9b636b8f26bf0377933ceeb48890b03d58f05fdfb6","observation_id":"7d3aa0ed-2a30-4142-9f42-be1fe78e390b","resolution":{"observed_at":"2026-08-03T13:36:13.961658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T13:36:15.664743Z","title":"Huang, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.664743Z"},"links":{"citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:da84cb21fdf85091447a97079b7dc2916d462870766b707cca33a9c6259a1a04","observation_id":"3298b6aa-ae42-40f7-a709-2a1dcb00bbaa","resolution":{"observed_at":"2026-08-03T13:36:15.664743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08568","last_updated":"2022-03-02T20:00:53Z","snapshot_observed_at":"2026-08-08T13:15:11.792752Z","submitted_at":"2019-03-20T15:49:10Z","title":"Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.08568","snapshot_observed_at":"2026-08-03T13:36:16.014744Z","title":null,"venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:16.014744Z"},"links":{"cited_paper":"/paper/1903.08568","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:cddbaa1873206bd2299018f4755ea05d11c980ec2ffbd05d93ecb0930bb3c953","observation_id":"6d13157d-5106-4f4b-b98c-1a7282e25106","resolution":{"observed_at":"2026-08-03T13:36:16.014744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T13:36:15.574746Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.574746Z"},"links":{"citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:b8fd01087407e43c3d0df52f2f0e687f6fdd76f730894df053fd5fee284150aa","observation_id":"f031b6d8-b75b-495c-b10d-e288edc2acf6","resolution":{"observed_at":"2026-08-03T13:36:15.574746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11798","last_updated":"2023-05-19T16:33:05Z","snapshot_observed_at":"2026-08-07T23:57:42.929746Z","submitted_at":"2023-05-19T16:33:05Z","title":"The probability flow ODE is provably fast","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11798","snapshot_observed_at":"2026-08-03T13:36:14.304744Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:14.304744Z"},"links":{"cited_paper":"/paper/2305.11798","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:3626c85d2b1e4aa008f19d423feac7eac449d43e652a663c908a74d0682b1804","observation_id":"95c5cc39-89ce-43de-a73d-6e6544c29a14","resolution":{"observed_at":"2026-08-03T13:36:14.304744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09046","last_updated":"2025-04-23T18:53:37Z","snapshot_observed_at":"2026-08-06T01:28:18.025859Z","submitted_at":"2024-10-11T17:58:30Z","title":"Linear Convergence of Diffusion Models Under the Manifold Hypothesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09046","snapshot_observed_at":"2026-08-03T13:36:15.947608Z","title":"Potaptchik, I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:15.947608Z"},"links":{"cited_paper":"/paper/2410.09046","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:68a1ea6ec89431130bbb231c7f579eb525f9ad7170f764cba431a1ebde6247e9","observation_id":"970c2baa-9697-4eb7-bcd0-d25477c225ab","resolution":{"observed_at":"2026-08-03T13:36:15.947608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10249","last_updated":"2023-02-20T19:27:21Z","snapshot_observed_at":"2026-07-06T14:53:53.017634Z","submitted_at":"2023-02-20T19:27:21Z","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10249","snapshot_observed_at":"2026-08-03T13:36:13.565126Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:13.565126Z"},"links":{"cited_paper":"/paper/2302.10249","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:94986d3a588658f9c8660cc0d1960d7060c837e4cd0bbe8af1a0d34a7892f88c","observation_id":"5038599c-4058-4f31-865d-8fb2a2f67ffe","resolution":{"observed_at":"2026-08-03T13:36:13.565126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16860","last_updated":"2024-02-11T22:44:44Z","snapshot_observed_at":"2026-07-06T15:33:53.981539Z","submitted_at":"2023-05-26T12:13:53Z","title":"Error Bounds for Flow Matching Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16860","snapshot_observed_at":"2026-08-03T13:36:14.124739Z","title":"Benton, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:14.124739Z"},"links":{"cited_paper":"/paper/2305.16860","citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:83597b69ae00f39f1325e991d097cc16955b4b1b5062ae9654b8af970e3baf9f","observation_id":"c05dc99e-1b7c-48d3-9991-3b084fbe7508","resolution":{"observed_at":"2026-08-03T13:36:14.124739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T13:36:16.126930Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T13:36:16.126930Z"},"links":{"citing_paper":"/paper/2512.24152"},"observation_digest":"sha256:7e42ed5ed8e2a0373339539c69e3a648569abf5ef1f89a5b1c74df774257ae38","observation_id":"f08175fa-36d2-4fa9-8a69-2c22e97e7d4d","resolution":{"observed_at":"2026-08-03T13:36:16.126930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.24152","last_updated":"2026-07-01T16:25:14Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-07T23:58:10.311833Z","submitted_at":"2025-12-30T11:34:59Z","title":"Fast Score-Based Sampling via Log-Concave Reductions"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":18},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2512.24152."}