{"as_of":"2026-08-23T10:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b725fa4267f744c980e139ae5628bb543bbd2abb979889d6d9243abc2a97879","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T03:08:01.989422Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.09423/citation-record","integrity":"/paper/2607.09423/integrity","json":"/paper/2607.09423/citation-record.json","paper":"/paper/2607.09423"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Mosek optimization toolbox for matlab","venue":null,"work_id":null,"year":2019},"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":1,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:8159459a5345a5852fc2ce7888da32b3eb9d83c8094f716275eaf073e3cbb463","observation_id":"50ee0b29-8b56-4f00-8c59-c122e70b6fad","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"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06379","last_updated":"2021-02-23T09:58:01Z","snapshot_observed_at":"2026-08-16T18:46:03.003699Z","submitted_at":"2021-02-12T07:53:22Z","title":"Central Limit Theorems for General Transportation Costs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06379","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2021},"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":2,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2102.06379","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:2f2e57f7545f86e2ad2b1fdbe6490b8ab2e5805ef3c32250c14bdd0200701a3f","observation_id":"69fabf8b-a0d8-445e-8d95-eae27a8b5616","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem","venue":null,"work_id":null,"year":2000},"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":3,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:a4e19b671f9cbaa00d40a143a789d16ac7c60fae849c21df8981e237a9161736","observation_id":"93eef5d2-b9b7-4730-88a9-92de6a985fc0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"On the Relation Between Optimal Transport and Schr¨ odinger Bridges: A Stochastic Control Viewpoint","venue":null,"work_id":null,"year":2016},"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":4,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:9efac2cb6ae0677d702feba11039658feea4e596d3b4749035d57b440f2ae1ba","observation_id":"9d7ea932-1f38-4549-8651-e8465874cb03","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Convex relaxation for Fokker–Planck equation","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":5,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:44988ae530813e553f5f3a74e17362c7d62ebba82824353dbc754264a344afa9","observation_id":"0e7ceebc-037f-4e27-bb13-09a73a9b59a1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Diffusion Schr¨ odinger Bridge with Applications to Score-Based Generative Modeling","venue":null,"work_id":null,"year":2021},"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":6,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:d600713e2f36d08d02065cd240818521374096c62e620643223499225043f34f","observation_id":"e424172c-abd7-4224-8851-ec2022ed8fc8","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Approximation and sampling of multivariate probability distributions in the tensor train decomposition","venue":null,"work_id":null,"year":2020},"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":7,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:fecd26fb9156bc01ed038b16cd2a07cc326c4bd118951b8125396735702c75ca","observation_id":"701a3b03-9f9d-4fa8-8449-bce5eb33ece6","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Dynamical optimal transport of nonlinear control-affine systems","venue":null,"work_id":null,"year":2023},"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":8,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:27645cc12c537bc44962f9d500ea03c1d0d17c62ec87ba119aceb9ebc67a15c7","observation_id":"76922de3-51a5-4ddd-b00c-de4280113649","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"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02798","last_updated":"2020-06-23T15:54:19Z","snapshot_observed_at":"2026-08-20T08:19:38.930803Z","submitted_at":"2020-02-07T14:15:02Z","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02798","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2020},"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":9,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2002.02798","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:0c00016c6262c18bf567601d957246101023521549f885c835b7aa7cdc126bd2","observation_id":"b5a1b70f-fedb-4519-b355-5ec4bfee4eca","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"On the rate of convergence in Wasserstein distance of the empirical measure","venue":null,"work_id":null,"year":2015},"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":10,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:f3ef47f498eb3878b42357ca1059ea18fe7981a954edd857e8b487af6d02ce4a","observation_id":"ee90bdea-afe5-4433-b370-13810642f511","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"On the translocation of masses","venue":null,"work_id":null,"year":1942},"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":11,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:9f40821717a3a3c31b333241ec5b9774ba1044e776c4f116414054110c551779","observation_id":"a4c85428-9fa9-407f-ab14-246961f9f923","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"}},{"citation":{"cited_paper":{"arxiv_id":"2511.13847","last_updated":"2026-06-29T22:01:02Z","snapshot_observed_at":"2026-08-18T07:27:27.219385Z","submitted_at":"2025-11-17T19:04:28Z","title":"Convex relaxation approaches for high-dimensional optimal transport","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.13847","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":12,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2511.13847","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:e0e96b081350f5d171962d62dc356aa1e8f81afc105435607ad17bd4d8a9a023","observation_id":"3a710045-75e5-4cb8-a12e-59ee8288acea","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01500","last_updated":"2025-02-28T08:55:22Z","snapshot_observed_at":"2026-08-20T09:56:09.177743Z","submitted_at":"2024-10-02T12:51:25Z","title":"Discrete Diffusion Schr\\\"odinger Bridge Matching for Graph Transformation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01500","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Discrete Diffusion Schr¨ odinger Bridge Matching for Graph Trans- formation","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":13,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2410.01500","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:d72f2d4bb8e78313f0d9bb2314c81372e6a7e6c5d9e529de8f8b9538cf10e6a7","observation_id":"365b34e1-f8c2-4f9a-8f55-3776b067fa85","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13117","last_updated":"2024-11-07T11:45:10Z","snapshot_observed_at":"2026-08-18T14:00:40.551674Z","submitted_at":"2024-03-19T19:44:54Z","title":"Optimal Flow Matching: Learning Straight Trajectories in Just One Step","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13117","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2024},"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":14,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2403.13117","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:61c9cd4d4943b6e7c3060598e0ccacba41cbf4da63eb1546e933c91e0915429f","observation_id":"1a042dd2-1594-4bda-b0ad-dda47528e6a6","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/05064504x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Convergent SDP-Relaxations in Polynomial Optimization with Sparsity","venue":"SIAM Journal on Optimization","work_id":"74158203-e3b0-4fe2-8583-88bd1307f907","year":2006},"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":15,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:e80ddf8a8fe65650ae11a09818d3e8430c59fe3b6e5820310a2f752ae8a3efe5","observation_id":"068b6563-897c-473f-8589-82d2b4bd7b82","resolution":{"observed_at":"2026-07-13T03:09:17.516773Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-20T20:22:50.646415+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T20:22:50.646415+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2009},"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":16,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:f60009f7ec757d02fc3b7e1d7ad656df7f1ef300341724fc4c8a4d4b18e28e52","observation_id":"72593403-58e0-4ef7-8015-1409e7e994c8","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"}},{"citation":{"cited_paper":{"arxiv_id":"1308.0215","last_updated":"2013-08-01T14:16:38Z","snapshot_observed_at":"2026-08-20T09:55:59.656275Z","submitted_at":"2013-08-01T14:16:38Z","title":"A survey of the Schr\\\"odinger problem and some of its connections with optimal transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.0215","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"A survey of the Schr¨ odinger problem and some of its connections with optimal transport","venue":null,"work_id":null,"year":2014},"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":17,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/1308.0215","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:bf431782df77124b0d1b18d853a88bbe08020512aa5d0a3747a549fb715e58b1","observation_id":"ba536316-a880-4f66-8f12-150f680e1ae1","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"}},{"citation":{"cited_paper":{"arxiv_id":"1807.00937","last_updated":"2018-09-11T17:15:49Z","snapshot_observed_at":"2026-08-19T16:29:50.049478Z","submitted_at":"2018-07-03T00:49:19Z","title":"Constrained dynamical optimal transport and its Lagrangian formulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.00937","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2018},"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":18,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/1807.00937","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:965f568acf2dfcdbc2280e1f78fd2e51c1e7ccce4cbd2b1595d1f69042ee1d90","observation_id":"7e258241-8cf3-4225-8771-b608ac35a7a0","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"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10742","last_updated":"2022-12-02T15:51:15Z","snapshot_observed_at":"2026-08-16T16:14:52.639286Z","submitted_at":"2022-11-19T16:42:58Z","title":"Moment-SoS Methods for Optimal Transport Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10742","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2022},"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":19,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2211.10742","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:6d381d6dffde3a685f6350e549d1cc5c82955e593eac9f65f2583f2718f065b5","observation_id":"455948d9-610c-45df-99f4-b576f6462ffd","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130920058.url:http://dx.doi.org/10.1137/130920058","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:09:17.485378Z","title":"Optimal Transport with Proximal Splitting","venue":null,"work_id":"cc8c4498-8903-45ee-91f4-92e21acee154","year":2014},"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":20,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:d8a9278dadb4beb8f4cac52630187ce90b381b16bd4ebd99a3117d5241f75bbc","observation_id":"ee71cd51-f60b-4e8a-bd97-be244bf06e3c","resolution":{"observed_at":"2026-07-13T03:09:17.487599Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-20T20:22:50.894822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T20:22:50.894822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Parrilo and Rekha R","venue":null,"work_id":null,"year":2020},"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":21,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:2197a11d103f91a9526046e0aa5895a8309b198cedd88c84962fc06f838c9e68","observation_id":"567ac5e5-1501-41b0-b3de-8d6c484c86cb","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":22,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:32c03949e01b53791ad3eabbfdec20421e2f65b4501d75bb6717b7686d837fd5","observation_id":"1401ec2e-2999-45f6-b774-4656777a1676","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2015},"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":23,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:f57426232eeda6ee9e1cc01789fcd8f3e80d357d66e1c8614df6a9cc38590fe9","observation_id":"a812edcd-b58a-4862-9f33-9e407a75432f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Diffusion Schr¨ odinger Bridge Matching","venue":null,"work_id":null,"year":2023},"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":24,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:4e5d19b2f3a89d29036aab89147ed457e2d480b0ac6f31367e7761e907e9a234","observation_id":"c44186bc-16b7-4579-9f91-8ce3b7763181","resolution":{"observed_at":"2026-07-13T03:08:01.989422Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00482","last_updated":"2024-03-11T14:27:48Z","snapshot_observed_at":"2026-08-17T02:46:52.486829Z","submitted_at":"2023-02-01T14:47:17Z","title":"Improving and generalizing flow-based generative models with minibatch optimal transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00482","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2024},"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":25,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2302.00482","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:bd892112c91934b33948a033078cd7eb434969a865443ffd6ee7723bed4f4944","observation_id":"813827f7-753a-4e5b-a8b6-a1e8fa45b418","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"}},{"citation":{"cited_paper":{"arxiv_id":"2002.04461","last_updated":"2020-07-26T13:42:19Z","snapshot_observed_at":"2026-08-19T16:59:19.530229Z","submitted_at":"2020-02-09T21:00:38Z","title":"TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.04461","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2020},"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":26,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2002.04461","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:27eb815b7f05db65686a78d84fa8e05a61384d90af1302c0b63554e707a4db7f","observation_id":"60604d86-c3c2-4326-ba64-276fd322b2b8","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2009},"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":27,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:848ea59e45ad509dee78fa42961ca9959fa4f3a8e86ef687c3b029b0fe749ba6","observation_id":"d32b27ae-9d1b-4187-ac1f-c5cdf00b52a0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050623802","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity","venue":"SIAM Journal on Optimization","work_id":"afa55769-ca4b-49f1-82af-013e9271fd05","year":2006},"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":28,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:67e2ee8477a557775b544e3d4032d70efea62e993634bbc6e9cfc11a44f3a938","observation_id":"4803502b-bcd2-428e-8dc0-d2f8d9f44196","resolution":{"observed_at":"2026-07-13T03:09:17.498125Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-20T20:22:51.388711+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T20:22:51.388711+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.07521","last_updated":"2022-05-16T08:56:05Z","snapshot_observed_at":"2026-08-18T10:35:59.825793Z","submitted_at":"2022-05-16T08:56:05Z","title":"A scalable deep learning approach for solving high-dimensional dynamic optimal transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.07521","snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":null,"venue":null,"work_id":null,"year":2022},"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":29,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"cited_paper":"/paper/2205.07521","citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:068159732f71e5597d266e7aeb70c8cafc8e620bab791f0358f08f5cb913d53d","observation_id":"10568479-29e2-4758-873b-3a718e1dcd0d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:08:01.989422Z","title":"Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance","venue":null,"work_id":null,"year":2019},"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":30,"source":"pdf_text","source_observed_at":"2026-07-13T03:08:01.989422Z"},"links":{"citing_paper":"/paper/2607.09423"},"observation_digest":"sha256:405ddb0af793992358ee715e5b1caa9b3bac2cda10f36413d7d51844321b4733","observation_id":"a2a425cf-03bd-4c5c-acbd-069e3ce49f3a","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"}},{"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"}}],"paper":{"arxiv_id":"2607.09423","last_updated":"2026-07-10T13:51:03Z","latest_version":1,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":31},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2607.09423."}