{"as_of":"2026-08-21T05:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e945add0665ba26e28d60dc561406d7f0f850dd3bd142882f3e983be452ffb20","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:12:24.024563Z","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-04T12:49:52.665716Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":"2202.07477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-07-04T12:49:52.665716Z","title":"Khrulkov, G","venue":null,"work_id":"639f0c07-01fc-4962-9473-8f85ff4f5b99","year":2022},"citing_paper":{"arxiv_id":"2209.03003","last_updated":"2022-09-07T08:59:55Z","snapshot_observed_at":"2026-07-06T13:49:40.974495Z","submitted_at":"2022-09-07T08:59:55Z","title":"Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T13:17:51.511535Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2209.03003"},"observation_digest":"sha256:461193b5eecc275f95362ca973c16f6e6f39ab5d2c214adf2e31c805b75eb54e","observation_id":"372fb6d2-3d98-4bec-957d-c93f996005c2","resolution":{"observed_at":"2026-05-10T13:17:51.585378Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":"2202.07477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-07-04T12:49:52.665716Z","title":"Khrulkov, G","venue":null,"work_id":"639f0c07-01fc-4962-9473-8f85ff4f5b99","year":2022},"citing_paper":{"arxiv_id":"2209.14577","last_updated":"2022-09-29T06:37:26Z","snapshot_observed_at":"2026-08-14T20:34:51.960761Z","submitted_at":"2022-09-29T06:37:26Z","title":"Rectified Flow: A Marginal Preserving Approach to Optimal Transport","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-18T03:03:13.822582Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2209.14577"},"observation_digest":"sha256:67e3eb1a7221d7247146ce68c9fb848033449be873815a22444fc8ceaeb796d0","observation_id":"f006354a-413c-40a8-ba4a-02457e0e8760","resolution":{"observed_at":"2026-05-18T03:03:13.942712Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":"2202.07477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-07-04T12:49:52.665716Z","title":"Khrulkov, G","venue":null,"work_id":"639f0c07-01fc-4962-9473-8f85ff4f5b99","year":2022},"citing_paper":{"arxiv_id":"2305.14703","last_updated":"2026-04-17T20:21:10Z","snapshot_observed_at":"2026-08-13T08:46:51.338633Z","submitted_at":"2023-05-24T04:15:34Z","title":"Generative diffusion learning for parametric partial differential equations","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T09:06:10.327568Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2305.14703"},"observation_digest":"sha256:8e964013c7b6cb2d45ece070ab37e9baea16ecbbde27e2aed41c96c2dc1c0805","observation_id":"3a81cf9e-0228-4e11-a08b-c6eb446730e2","resolution":{"observed_at":"2026-05-24T09:09:15.706058Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-08-11T21:12:24.024563Z","title":"Understanding ddpm latent codes through optimal transport","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04917","last_updated":"2024-12-06T10:16:04Z","snapshot_observed_at":"2026-08-15T20:01:57.260149Z","submitted_at":"2024-12-06T10:16:04Z","title":"Continuous Speech Tokens Makes LLMs Robust Multi-Modality Learners","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T21:12:24.024563Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2412.04917"},"observation_digest":"sha256:36274c9cd4d5750d8b89835c3276315f6164671df5948df18bae5d19936f3ce0","observation_id":"0ec7112d-9787-477e-8730-7f7185ce16b4","resolution":{"observed_at":"2026-08-11T21:12:24.024563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-08-09T23:02:18.824693Z","title":"Understanding ddpm latent codes through optimal transport","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18674","last_updated":"2025-01-30T18:53:28Z","snapshot_observed_at":"2026-08-12T03:40:17.885398Z","submitted_at":"2025-01-30T18:53:28Z","title":"Unpaired Translation of Point Clouds for Modeling Detector Response","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T23:02:18.824693Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2501.18674"},"observation_digest":"sha256:c7be5912d85ffe102b47d62b03d2af6f96b2003eff104fcfcb32644a068882b3","observation_id":"06c5f645-dabe-42d8-9cc4-8679eb01b6a2","resolution":{"observed_at":"2026-08-09T23:02:18.824693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-08-06T11:22:26.402690Z","title":"Understanding ddpm latent codes through optimal transport","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22746","last_updated":"2025-08-01T03:37:42Z","snapshot_observed_at":"2026-08-13T00:50:03.515504Z","submitted_at":"2025-07-30T15:03:36Z","title":"Next Tokens Denoising for Speech Synthesis","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:26.402690Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2507.22746"},"observation_digest":"sha256:ffb599fb23e78240c3ee082cc210b04c8cdb6c0b2b9eaf77e7e38a05ca44a020","observation_id":"16933749-f487-4e28-8067-c097a54726a6","resolution":{"observed_at":"2026-08-06T11:22:26.402690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport","version":2},"cited_work":{"arxiv_id":"2202.07477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07477","snapshot_observed_at":"2026-07-04T12:49:52.665716Z","title":"Khrulkov, G","venue":null,"work_id":"639f0c07-01fc-4962-9473-8f85ff4f5b99","year":2022},"citing_paper":{"arxiv_id":"2606.23489","last_updated":"2026-06-22T15:35:30Z","snapshot_observed_at":"2026-08-20T20:20:41.729148Z","submitted_at":"2026-06-22T15:35:30Z","title":"MeshFlow: Mesh Generation with Equivariant Flow Matching","version":1},"reference_index":117,"source":"arxiv_source","source_observed_at":"2026-06-26T05:52:47.536542Z"},"links":{"cited_paper":"/paper/2202.07477","citing_paper":"/paper/2606.23489"},"observation_digest":"sha256:cde1ee04c0d2bf61f4aaf9a4cf7f1814a8716bfcc8be30f58287c05b5b10d197","observation_id":"3315ba87-6086-488d-a7ed-6e3e11cc7300","resolution":{"observed_at":"2026-07-04T12:49:52.667118Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.07477/citation-record","integrity":"/paper/2202.07477/integrity","json":"/paper/2202.07477/citation-record.json","paper":"/paper/2202.07477"},"outbound":[],"paper":{"arxiv_id":"2202.07477","last_updated":"2022-12-05T09:15:28Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T17:21:23.476901Z","submitted_at":"2022-02-14T18:59:47Z","title":"Understanding DDPM Latent Codes Through Optimal Transport"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2202.07477."}