{"as_of":"2026-08-07T21:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e9b8aa6d58f8d421327f50a75418a9200465ebc7e1fe8e8c5ab350396a43e3b","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T21:53:15.115078Z","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-05-21T21:54:22.866860Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.14425","last_updated":"2025-06-17T21:37:29Z","snapshot_observed_at":"2026-08-07T16:00:52.206750Z","submitted_at":"2025-04-19T23:40:54Z","title":"Optimal Scheduling of Dynamic Transport","version":2},"cited_work":{"arxiv_id":"2504.14425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14425","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal scheduling of dynamic trans- port","venue":null,"work_id":"2bcf0e92-5d67-4c32-9b55-a36ce894d867","year":2025},"citing_paper":{"arxiv_id":"2509.01629","last_updated":"2026-05-16T04:39:44Z","snapshot_observed_at":"2026-08-02T10:11:34.180683Z","submitted_at":"2025-09-01T17:16:34Z","title":"Lipschitz-Guided Design of Interpolation Schedules in Generative Models","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-21T21:53:15.115078Z"},"links":{"cited_paper":"/paper/2504.14425","citing_paper":"/paper/2509.01629"},"observation_digest":"sha256:5da8f66b2699a7c6f8dc5459075518b6b833447c6d9afa5a2dacbeff780a04f1","observation_id":"442897ad-ea06-4540-a507-0d2120915802","resolution":{"observed_at":"2026-05-21T21:54:22.869467Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14425","last_updated":"2025-06-17T21:37:29Z","snapshot_observed_at":"2026-08-07T16:00:52.206750Z","submitted_at":"2025-04-19T23:40:54Z","title":"Optimal Scheduling of Dynamic Transport","version":2},"cited_work":{"arxiv_id":"2504.14425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14425","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal scheduling of dynamic trans- port","venue":null,"work_id":"2bcf0e92-5d67-4c32-9b55-a36ce894d867","year":2025},"citing_paper":{"arxiv_id":"2602.08318","last_updated":"2026-05-07T12:57:02Z","snapshot_observed_at":"2026-08-03T06:39:47.142105Z","submitted_at":"2026-02-09T06:48:45Z","title":"Is Flow Matching Just Trajectory Replay for Sequential Data?","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-05-16T06:22:23.161815Z"},"links":{"cited_paper":"/paper/2504.14425","citing_paper":"/paper/2602.08318"},"observation_digest":"sha256:ecfa1c678e53f685bffdb6c60946422f0ac5f6d9cd94542b2333cf2e093cb5fc","observation_id":"cdb87bbd-0bc2-43f6-9866-99fe8a4b95f7","resolution":{"observed_at":"2026-05-16T06:22:27.511840Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14425","last_updated":"2025-06-17T21:37:29Z","snapshot_observed_at":"2026-08-07T16:00:52.206750Z","submitted_at":"2025-04-19T23:40:54Z","title":"Optimal Scheduling of Dynamic Transport","version":2},"cited_work":{"arxiv_id":"2504.14425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14425","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal scheduling of dynamic trans- port","venue":null,"work_id":"2bcf0e92-5d67-4c32-9b55-a36ce894d867","year":2025},"citing_paper":{"arxiv_id":"2605.16126","last_updated":"2026-05-15T16:11:10Z","snapshot_observed_at":"2026-07-06T23:27:20.429737Z","submitted_at":"2026-05-15T16:11:10Z","title":"Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schr\\\"odinger Samplers","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-20T19:46:36.955669Z"},"links":{"cited_paper":"/paper/2504.14425","citing_paper":"/paper/2605.16126"},"observation_digest":"sha256:4297b870bc7f6783b21125c591289d98eb532c51c262c0ab384df508fc7d40d0","observation_id":"de84dd4c-2705-4efd-b844-128f90571315","resolution":{"observed_at":"2026-05-20T19:48:57.459159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.14425/citation-record","integrity":"/paper/2504.14425/integrity","json":"/paper/2504.14425/citation-record.json","paper":"/paper/2504.14425"},"outbound":[],"paper":{"arxiv_id":"2504.14425","last_updated":"2025-06-17T21:37:29Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T16:00:52.206750Z","submitted_at":"2025-04-19T23:40:54Z","title":"Optimal Scheduling of Dynamic 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.14425."}