{"as_of":"2026-08-19T19:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:185aaa4ea1e5dd191ad30c139ad759f1219506b1a950d93d0c9a1e1b27de7aff","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-07-13T03:08:01.989422Z","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":"2305.11857","last_updated":"2025-03-10T22:23:51Z","snapshot_observed_at":"2026-08-18T19:53:03.504909Z","submitted_at":"2023-05-19T17:48:21Z","title":"Computing high-dimensional optimal transport by flow neural networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11857","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09423","last_updated":"2026-07-10T13:51:03Z","snapshot_observed_at":"2026-08-17T02:47:32.398473Z","submitted_at":"2026-07-10T13:51:03Z","title":"Convex Relaxations for the Optimization of Markov Processes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2305.11857","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:b3960fd1d05e6fd32e4f3043d2c15b713eb595fe73fad65d10d2532277aa53ea","observation_id":"6500f23c-31fd-42b1-8624-e3f0de716dc5","resolution":{"observed_at":"2026-07-13T03:08:01.989422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.11857/citation-record","integrity":"/paper/2305.11857/integrity","json":"/paper/2305.11857/citation-record.json","paper":"/paper/2305.11857"},"outbound":[],"paper":{"arxiv_id":"2305.11857","last_updated":"2025-03-10T22:23:51Z","latest_version":5,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-18T19:53:03.504909Z","submitted_at":"2023-05-19T17:48:21Z","title":"Computing high-dimensional optimal transport by flow neural networks"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.11857."}