{"as_of":"2026-08-08T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ecbbcf4cc35387a090e7f5524ad092ddc1acb8f774fad8e1212decf5bac7933","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:28:12.194823Z","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-07-11T01:57:49.885121Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2202.00512","last_updated":"2022-06-07T09:17:35Z","snapshot_observed_at":"2026-07-06T12:33:23.843893Z","submitted_at":"2022-02-01T16:07:25Z","title":"Progressive Distillation for Fast Sampling of Diffusion Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-11T09:37:44.394785Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2202.00512"},"observation_digest":"sha256:c0870ad4fa687c4222c39ec7dae5df4bfef28080bec139ec4a13849e6aefb30c","observation_id":"2ec2d784-06d1-4333-b18a-71e7dea62f3a","resolution":{"observed_at":"2026-05-11T09:37:44.749148Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2206.00364","last_updated":"2022-10-11T13:20:30Z","snapshot_observed_at":"2026-07-06T13:16:16.926712Z","submitted_at":"2022-06-01T10:03:24Z","title":"Elucidating the Design Space of Diffusion-Based Generative Models","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-14T17:46:53.253930Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2206.00364"},"observation_digest":"sha256:bee838f051db91e2409bd23cba76f134cb942673610b053018fb11ffd9427ffd","observation_id":"f94db6c1-36df-4034-a7b4-958cf050cd17","resolution":{"observed_at":"2026-05-14T17:46:53.309256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2310.04378","last_updated":"2023-10-06T17:11:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-06T17:11:58Z","title":"Latent Consistency Models: Synthesizing High-Resolution Images with Few-Step Inference","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-13T04:15:54.681913Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2310.04378"},"observation_digest":"sha256:77abded1430c6935f6ee4e0e3fca5323ccaebf81ff9d5faf3ab989f6387f8a15","observation_id":"664e8fa2-cc32-4fdc-9e39-5aaaecd892b8","resolution":{"observed_at":"2026-05-13T04:15:54.852702Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2506.05398","last_updated":"2026-03-28T00:58:33Z","snapshot_observed_at":"2026-08-03T02:46:22.545898Z","submitted_at":"2025-06-03T20:04:53Z","title":"2ndMatch: Finetuning Pruned Diffusion Models via Second-Order Jacobian Matching","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-19T12:07:24.908459Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2506.05398"},"observation_digest":"sha256:cc67c7155f1cef6777c0dc3b800516a05714d87004bbdd463f7831d27b90a322","observation_id":"694c90a5-d2a9-45af-81b2-942b202680a9","resolution":{"observed_at":"2026-05-19T12:12:16.966851Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-08-06T23:28:12.194823Z","title":"Learning to efficiently sample from diffusion probabilistic models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18251","last_updated":"2025-06-25T03:25:37Z","snapshot_observed_at":"2026-08-08T12:18:26.444560Z","submitted_at":"2025-06-23T02:43:21Z","title":"Morse: Dual-Sampling for Lossless Acceleration of Diffusion Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:28:12.194823Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2506.18251"},"observation_digest":"sha256:eab38f531ebdef34d0a7b6194f5d50b6e57d5d7ff239474689907a332e8362a5","observation_id":"e1f55283-9aa7-4c1d-8032-e62b8ba90c1f","resolution":{"observed_at":"2026-08-06T23:28:12.194823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2511.11688","last_updated":"2026-05-19T12:12:53Z","snapshot_observed_at":"2026-08-03T13:14:48.692209Z","submitted_at":"2025-11-12T08:57:46Z","title":"Hierarchical Schedule Optimization for Fast and Robust Diffusion Model Sampling","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T19:58:09.423802Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2511.11688"},"observation_digest":"sha256:b5d9134fbc41bf02551f007e9cd47ca4be35fcf05bb9b52ffefbf68c53c44b96","observation_id":"ecb5126d-e333-42ad-aef4-bc20beabf4e3","resolution":{"observed_at":"2026-05-21T20:00:33.913517Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2605.11547","last_updated":"2026-05-12T05:22:54Z","snapshot_observed_at":"2026-08-06T20:43:23.037758Z","submitted_at":"2026-05-12T05:22:54Z","title":"Sharpen Your Flow: Sharpness-Aware Sampling for Flow Matching","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-13T02:20:05.185298Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2605.11547"},"observation_digest":"sha256:7b63a44023ae8dca501a32a233280996b20e1d2d5b44688936a657d088ecf47b","observation_id":"23eae98a-1563-4e12-a5d9-5fe370545f15","resolution":{"observed_at":"2026-05-13T02:22:06.344023Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2106.03802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03802","snapshot_observed_at":"2026-07-11T01:57:49.885121Z","title":"InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2478–2488","venue":"cs.LG","work_id":"d5abf771-99ad-4915-b7a9-8af30ec13b43","year":2021},"citing_paper":{"arxiv_id":"2607.06609","last_updated":"2026-07-07T06:05:42Z","snapshot_observed_at":"2026-08-03T12:39:06.462309Z","submitted_at":"2026-07-07T06:05:42Z","title":"D2PO: Optimizing Diffusion Samplers via Dynamic Preference","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-11T01:57:11.149703Z"},"links":{"cited_paper":"/paper/2106.03802","citing_paper":"/paper/2607.06609"},"observation_digest":"sha256:e32815c084fa2ebffd87816a0aad0c393d303d9a1275acac951fd95506db2a3d","observation_id":"c9f2130c-3235-429f-8b82-d6b7b0250740","resolution":{"observed_at":"2026-07-11T01:57:49.916384Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.03802/citation-record","integrity":"/paper/2106.03802/integrity","json":"/paper/2106.03802/citation-record.json","paper":"/paper/2106.03802"},"outbound":[],"paper":{"arxiv_id":"2106.03802","last_updated":"2021-06-07T17:15:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:16:49.764856Z","submitted_at":"2021-06-07T17:15:07Z","title":"Learning to Efficiently Sample from Diffusion Probabilistic Models"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2106.03802."}