{"as_of":"2026-08-09T01:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61d9c9572f9eddfdd4bd857be7230d1d625e5e3d8f9d921fc74de017bbcea4af","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T19:58:09.423802Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-03T09:36:59.076062Z","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":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.11688","snapshot_observed_at":"2026-08-03T09:36:59.076062Z","title":"Hierarchical schedule optimization for fast and robust diffusion model sampling,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.13602","last_updated":"2026-06-26T15:06:18Z","snapshot_observed_at":"2026-08-08T09:29:04.880756Z","submitted_at":"2026-01-20T05:06:26Z","title":"A Gaussian Perspective for Distributional Discrepancy in Generative Diffusion Models","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:59.076062Z"},"links":{"cited_paper":"/paper/2511.11688","citing_paper":"/paper/2601.13602"},"observation_digest":"sha256:9e137dc920b82e73d8361b54f1986f5fd894bb24d4492e77a2b1b9e1f4ff1dd9","observation_id":"ad0221a6-61d5-404a-939e-96b5260695d4","resolution":{"observed_at":"2026-08-03T09:36:59.076062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2511.11688/citation-record","integrity":"/paper/2511.11688/integrity","json":"/paper/2511.11688/citation-record.json","paper":"/paper/2511.11688"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.13447","last_updated":"2025-05-19T17:59:42Z","snapshot_observed_at":"2026-08-08T15:21:52.984681Z","submitted_at":"2025-05-19T17:59:42Z","title":"Mean Flows for One-step Generative Modeling","version":1},"cited_work":{"arxiv_id":"2505.13447","doi":"10.48550/arxiv.2505.13447","metadata_source":"pith","pith_arxiv_id":"2505.13447","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mean Flows for One-step Generative Modeling","venue":"cs.LG","work_id":"07a52ad5-0f82-4095-9a66-559b09fea1ae","year":2025},"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":1,"source":"pdf_text","source_observed_at":"2026-05-21T19:58:09.423802Z"},"links":{"cited_paper":"/paper/2505.13447","citing_paper":"/paper/2511.11688"},"observation_digest":"sha256:7e24a10a020551a57145caae929fb3cd3fddf312d5be1b723456136d7d27792a","observation_id":"465118fd-4c86-4b85-88a3-d7124c7a3b26","resolution":{"observed_at":"2026-05-21T20:00:33.909251Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14548","last_updated":"2024-10-10T21:59:49Z","snapshot_observed_at":"2026-08-05T03:20:53.668810Z","submitted_at":"2024-06-20T17:56:02Z","title":"Consistency Models Made Easy","version":2},"cited_work":{"arxiv_id":"2406.14548","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14548","snapshot_observed_at":"2026-07-02T16:07:08.224804Z","title":"Gonzalez, M.; Fernandez Pinto, N.; Tran, T.; Hajri, H.; Mas- moudi, N.; et al","venue":null,"work_id":"8a18f8f0-423e-4b12-8c96-c574c60954cf","year":2024},"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":2,"source":"pdf_text","source_observed_at":"2026-05-21T19:58:09.423802Z"},"links":{"cited_paper":"/paper/2406.14548","citing_paper":"/paper/2511.11688"},"observation_digest":"sha256:044e9eb233cf9884c135d1603b5b06aba35561a97213a4a12eee1eec0858980d","observation_id":"5f4cce54-dc59-4e12-8892-2dc99459453e","resolution":{"observed_at":"2026-05-21T20:00:33.904898Z","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":"2010.02502","last_updated":"2022-10-05T20:19:21Z","snapshot_observed_at":"2026-07-06T10:01:50.133383Z","submitted_at":"2020-10-06T06:15:51Z","title":"Denoising Diffusion Implicit Models","version":4},"cited_work":{"arxiv_id":"2010.02502","doi":"10.48550/arxiv.2010.02502","metadata_source":"pith","pith_arxiv_id":"2010.02502","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Denoising Diffusion Implicit Models","venue":"cs.LG","work_id":"8fa2128b-d18c-405c-ac92-0e669cf89ac0","year":2020},"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":3,"source":"pdf_text","source_observed_at":"2026-05-21T19:58:09.423802Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2511.11688"},"observation_digest":"sha256:f6b94e096b40979c026d533a400c131bbad7969e59a74220c32ed5907a546f1a","observation_id":"8b247342-e8fb-40f7-ac04-4ec659496bb7","resolution":{"observed_at":"2026-05-21T20:00:33.900134Z","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-07-12T13:49:41.147667+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T13:49:41.147667+00:00","source":"openalex_status_cache"},{"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":"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"InForty-first International Conference on Machine Learn- ing","venue":null,"work_id":"477d841c-94b4-4131-96f5-b00370dba20c","year":2024},"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":5,"source":"pdf_text","source_observed_at":"2026-05-21T19:58:09.423802Z"},"links":{"citing_paper":"/paper/2511.11688"},"observation_digest":"sha256:01da06c0342bb459e63ebc8f303b1c6fa98c0e65e180237aa9e18c1c22f92c7c","observation_id":"7e6f393d-7e7f-4b34-baca-b86b1bf46fbc","resolution":{"observed_at":"2026-05-21T20:00:34.309267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2511.11688","last_updated":"2026-05-19T12:12:53Z","latest_version":3,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":5},"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 9 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 1 inbound Pith citation observation for arXiv:2511.11688."}