{"as_of":"2026-08-09T14:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1868b8a04217b6b31d364b5b4bce4685f70f53f65f2061234f1d4a6b51f4506","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:52:09.666760Z","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-03T04:37:36.875734Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.20879","last_updated":"2024-10-10T22:43:10Z","snapshot_observed_at":"2026-07-06T18:23:19.450809Z","submitted_at":"2024-05-31T14:54:51Z","title":"Flow matching achieves almost minimax optimal convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20879","snapshot_observed_at":"2026-08-06T19:54:28.606444Z","title":"Flow matching achieves almost minimax optimal convergence.arXiv preprint arXiv:2405.20879,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04794","last_updated":"2025-07-07T09:13:09Z","snapshot_observed_at":"2026-08-06T19:36:59.699475Z","submitted_at":"2025-07-07T09:13:09Z","title":"Generalization bounds for score-based generative models: a synthetic proof","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:28.606444Z"},"links":{"cited_paper":"/paper/2405.20879","citing_paper":"/paper/2507.04794"},"observation_digest":"sha256:b5d3b27870ec19b65f712ce41b7705be7e41a3d66cc928be85ba4d26e613d093","observation_id":"24c70396-8689-48e7-86bf-fcc3eae8737d","resolution":{"observed_at":"2026-08-06T19:54:28.606444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20879","last_updated":"2024-10-10T22:43:10Z","snapshot_observed_at":"2026-07-06T18:23:19.450809Z","submitted_at":"2024-05-31T14:54:51Z","title":"Flow matching achieves almost minimax optimal convergence","version":2},"cited_work":{"arxiv_id":"2405.20879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20879","snapshot_observed_at":"2026-07-03T04:37:36.875734Z","title":"Fukumizu, T","venue":null,"work_id":"84c1de93-0fea-456d-8ff0-af896f9851ef","year":2024},"citing_paper":{"arxiv_id":"2606.11138","last_updated":"2026-06-09T17:29:05Z","snapshot_observed_at":"2026-07-06T23:50:16.299969Z","submitted_at":"2026-06-09T17:29:05Z","title":"First-Order Trajectory Matching: Fast Ensemble Predictions of Chaotic, Turbulent, Stochastic Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T13:48:17.113751Z"},"links":{"cited_paper":"/paper/2405.20879","citing_paper":"/paper/2606.11138"},"observation_digest":"sha256:b92b043d8fd35ee3d62b2565d794e57382f46d1c275ded50c649b83afd5acc5d","observation_id":"0eee3734-c189-4d9a-8164-d414bb78b8e8","resolution":{"observed_at":"2026-07-03T04:37:36.877508Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20879","last_updated":"2024-10-10T22:43:10Z","snapshot_observed_at":"2026-07-06T18:23:19.450809Z","submitted_at":"2024-05-31T14:54:51Z","title":"Flow matching achieves almost minimax optimal convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20879","snapshot_observed_at":"2026-07-31T23:45:31.752710Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23348","last_updated":"2026-07-25T19:55:04Z","snapshot_observed_at":"2026-08-04T05:01:53.786185Z","submitted_at":"2026-07-25T19:55:04Z","title":"Logit-Coordinate Generative Models for Mixed Continuous-Categorical Tabular Data","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:31.752710Z"},"links":{"cited_paper":"/paper/2405.20879","citing_paper":"/paper/2607.23348"},"observation_digest":"sha256:c20c6d14d0575bfec830b87b73c66b18031cc99a8c7bc0f2472b42b86ddeb706","observation_id":"0d0033c3-1855-42e1-8c48-63870bad6c85","resolution":{"observed_at":"2026-07-31T23:45:31.752710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20879","last_updated":"2024-10-10T22:43:10Z","snapshot_observed_at":"2026-07-06T18:23:19.450809Z","submitted_at":"2024-05-31T14:54:51Z","title":"Flow matching achieves almost minimax optimal convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20879","snapshot_observed_at":"2026-08-06T22:52:09.666760Z","title":"Flow matching achieves almost minimax optimal convergence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04531","last_updated":"2026-08-05T07:05:47Z","snapshot_observed_at":"2026-08-08T23:11:51.587503Z","submitted_at":"2026-08-05T07:05:47Z","title":"Discretization and Statistical Consistency of Functional Flow Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:52:09.666760Z"},"links":{"cited_paper":"/paper/2405.20879","citing_paper":"/paper/2608.04531"},"observation_digest":"sha256:64a4576556da49e7740eca8c95c2b67f696e1975825f689cf9d5c0c20973665c","observation_id":"590e69a9-7420-45f8-9e13-2867ba8e70ac","resolution":{"observed_at":"2026-08-06T22:52:09.666760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.20879/citation-record","integrity":"/paper/2405.20879/integrity","json":"/paper/2405.20879/citation-record.json","paper":"/paper/2405.20879"},"outbound":[],"paper":{"arxiv_id":"2405.20879","last_updated":"2024-10-10T22:43:10Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:23:19.450809Z","submitted_at":"2024-05-31T14:54:51Z","title":"Flow matching achieves almost minimax optimal convergence"},"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-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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2405.20879."}