{"as_of":"2026-08-18T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47750718409e83149284df3482aafd6835c612ea5feaceb973924e734dddb92e","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:32:45.401517Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-08-11T12:21:10.189574Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T18:16:15.004306Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"cited_work":{"arxiv_id":"1908.10962","doi":"10.48550/arxiv.1908.10962","metadata_source":"pith","pith_arxiv_id":"1908.10962","snapshot_observed_at":"2026-08-11T18:16:15.004306Z","title":"Optimal transport mapping via input convex neural networks","venue":"cs.LG","work_id":"ef7ce4b8-7813-46c5-9e41-ddd03db39dea","year":2019},"citing_paper":{"arxiv_id":"2608.09707","last_updated":"2026-08-10T15:11:22Z","snapshot_observed_at":"2026-08-15T15:28:28.927255Z","submitted_at":"2026-08-10T15:11:22Z","title":"Input convex neural networks as surrogates in mathematical optimisation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T12:21:10.189574Z"},"links":{"cited_paper":"/paper/1908.10962","citing_paper":"/paper/2608.09707"},"observation_digest":"sha256:b405d62f67fa4ba26400d067cba545440ad75b6a937ba37dfa43263ad038a93f","observation_id":"8f206673-9a31-48e2-a16a-68cc28545f43","resolution":{"observed_at":"2026-08-11T12:21:10.348849Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.10962/citation-record","integrity":"/paper/1908.10962/integrity","json":"/paper/1908.10962/citation-record.json","paper":"/paper/1908.10962"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.07152","last_updated":"2017-06-14T17:59:12Z","snapshot_observed_at":"2026-08-14T21:38:34.304198Z","submitted_at":"2016-09-22T20:10:57Z","title":"Input Convex Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07152","snapshot_observed_at":"2026-08-14T10:32:45.293544Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.293544Z"},"links":{"cited_paper":"/paper/1609.07152","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:191f503d587d73b72b9851e457a31fb58bb11fdd796359acb7969f8e907017ca","observation_id":"8b43a36e-a9ee-4445-a751-642f3b9a657a","resolution":{"observed_at":"2026-08-14T10:32:45.293544Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:32:45.762665Z","title":"Architecture details","venue":null,"work_id":"b5288245-876d-40e4-8696-9aacc55b6525","year":2019},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.392154Z"},"links":{"citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:112b27c668a5eb95cbe2a43d2921ab8d9578ad33155297205baceb5974253e5e","observation_id":"2d264769-7836-4eb2-9c8b-3bde74b02695","resolution":{"observed_at":"2026-08-14T10:32:45.766889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-14T10:32:45.333062Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.333062Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:386826d9e239e7068e88cd2bb34c8e072d057982a07e499a0606312b568cf17c","observation_id":"712fb5e0-c052-4e2b-9a38-5ff902df7a77","resolution":{"observed_at":"2026-08-14T10:32:45.333062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.09691","last_updated":"2019-06-24T02:12:26Z","snapshot_observed_at":"2026-08-15T01:51:18.157764Z","submitted_at":"2019-06-24T02:12:26Z","title":"Adversarial Computation of Optimal Transport Maps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.09691","snapshot_observed_at":"2026-08-14T10:32:45.347638Z","title":"Adversarial computation of optimal trans- port maps","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.347638Z"},"links":{"cited_paper":"/paper/1906.09691","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:fb8f91a09d7ddaaf8ba0f4b5588e206aae211a5593c876b8ccaa55edf071ae5b","observation_id":"d2e20840-53ee-4d2b-a57f-de997517a323","resolution":{"observed_at":"2026-08-14T10:32:45.347638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.08894","last_updated":"2026-05-29T09:28:36Z","snapshot_observed_at":"2026-08-14T20:29:40.260367Z","submitted_at":"2017-09-26T08:53:41Z","title":"On the regularization of Wasserstein GANs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.08894","snapshot_observed_at":"2026-08-14T10:32:45.358061Z","title":"On the regularization of wasserstein gans","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.358061Z"},"links":{"cited_paper":"/paper/1709.08894","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:1f93a13aa0afb7dd61acb9538e9ad082a7f28f057a649685c5bf57a96a774624","observation_id":"0996fc12-2031-43c8-ab25-ae04a6b60f7a","resolution":{"observed_at":"2026-08-14T10:32:45.358061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.10648","last_updated":"2019-03-24T11:29:07Z","snapshot_observed_at":"2026-08-15T19:01:58.971722Z","submitted_at":"2018-06-27T19:10:56Z","title":"Uncoupled isotonic regression via minimum Wasserstein deconvolution","version":2},"cited_work":{"arxiv_id":"1806.10648","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.10648","snapshot_observed_at":"2026-08-14T10:32:45.525611Z","title":"Uncoupled isotonic regression via minimum Wasserstein deconvolution","venue":"math.ST","work_id":"c6f140df-fa03-486b-91d7-49397140b955","year":2018},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.362984Z"},"links":{"cited_paper":"/paper/1806.10648","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:13d8eb0c98b9fbde9e61f387d5a9c412ca57975066bab6fb1face4071dcbb9c6","observation_id":"472e9515-b3da-4dbc-913f-8ca626406ca0","resolution":{"observed_at":"2026-08-14T10:32:45.530594Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.02283","last_updated":"2018-02-26T01:25:22Z","snapshot_observed_at":"2026-08-14T20:16:17.295019Z","submitted_at":"2017-11-07T04:53:07Z","title":"Large-Scale Optimal Transport and Mapping Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.02283","snapshot_observed_at":"2026-08-14T10:32:45.368311Z","title":"B., Flamary, R., Courty, N., Rolet, A., and Blondel, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.368311Z"},"links":{"cited_paper":"/paper/1711.02283","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:a720912511873fbf7e477983c7470b8349605348b16aa3c2a5e6e78482be5c3f","observation_id":"14fe2372-a324-4ea1-a607-fa06438ad0ca","resolution":{"observed_at":"2026-08-14T10:32:45.368311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00158","last_updated":"2019-06-24T19:22:14Z","snapshot_observed_at":"2026-08-15T15:28:33.784628Z","submitted_at":"2019-05-01T01:32:52Z","title":"On Scalable and Efficient Computation of Large Scale Optimal Transport","version":3},"cited_work":{"arxiv_id":"1905.00158","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.00158","snapshot_observed_at":"2026-08-14T10:32:45.458879Z","title":"On Scalable and Efficient Computation of Large Scale Optimal Transport","venue":"cs.LG","work_id":"8ea4eff3-f435-4f32-a32e-8bc82fd9ad7e","year":2019},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.382584Z"},"links":{"cited_paper":"/paper/1905.00158","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:a5f69ed1c02a0e03d1fe4356ef82224372642ae8e4f05db2886689e092f0dc4f","observation_id":"40593698-c1ef-4a8f-9f56-8db927400e56","resolution":{"observed_at":"2026-08-14T10:32:45.463849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.11462","last_updated":"2019-08-29T22:00:49Z","snapshot_observed_at":"2026-08-17T23:15:25.306587Z","submitted_at":"2019-08-29T22:00:49Z","title":"Potential Flow Generator with $L_2$ Optimal Transport Regularity for Generative Models","version":1},"cited_work":{"arxiv_id":"1908.11462","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.11462","snapshot_observed_at":"2026-08-14T10:32:45.436515Z","title":"Potential Flow Generator with $L_2$ Optimal Transport Regularity for Generative Models","venue":"cs.LG","work_id":"e5e5e862-0c24-45f2-8c4e-a2cf20989dd6","year":2019},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.387057Z"},"links":{"cited_paper":"/paper/1908.11462","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:e2990e965907b98460d93295cf2d60543267d94cb8447e47e0371d69fa8eb69f","observation_id":"bc911147-f659-4cc7-88b0-571654711d21","resolution":{"observed_at":"2026-08-14T10:32:45.443355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:32:45.734889Z","title":null,"venue":null,"work_id":"6fb696f7-d450-4808-b4fa-8a9d3fba56c7","year":2019},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.401517Z"},"links":{"citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:3ece483fec4196d89f0a25f2c23f9f438a23645169ad66aff1629758585ccff1","observation_id":"69f4bd63-3abf-4e5f-8188-6c4cefcf7cc2","resolution":{"observed_at":"2026-08-14T10:32:45.739518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:32:45.749101Z","title":null,"venue":null,"work_id":"8f276ef3-fb8e-4765-b225-4bb7c17fcdf3","year":2009},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.397198Z"},"links":{"citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:a597292a9b80e3a6d9e9a8e6ddaa7bc690a82eca7237c34646dd540c7a1ef1f8","observation_id":"876eb1a2-1a4c-43e6-a39e-c854b62832ae","resolution":{"observed_at":"2026-08-14T10:32:45.753343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10099","last_updated":"2019-10-29T02:14:14Z","snapshot_observed_at":"2026-08-15T18:39:17.784799Z","submitted_at":"2019-05-24T09:07:43Z","title":"Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections","version":4},"cited_work":{"arxiv_id":"1905.10099","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.10099","snapshot_observed_at":"2026-08-14T10:32:45.561368Z","title":"Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections","venue":"cs.LG","work_id":"12afbd3a-4267-4a8e-8179-d9b005cc24ef","year":2019},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":1781,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.352892Z"},"links":{"cited_paper":"/paper/1905.10099","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:445c554b8b018a147d4572685a30fc70ec7220b4c840dd1d71985e72d9f914d0","observation_id":"2ca00956-fdc2-4a39-9899-b215e315a73b","resolution":{"observed_at":"2026-08-14T10:32:45.566980Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05488","last_updated":"2017-12-19T04:28:31Z","snapshot_observed_at":"2026-08-18T06:49:42.178700Z","submitted_at":"2017-10-16T03:30:09Z","title":"A Geometric View of Optimal Transportation and Generative Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.05488","snapshot_observed_at":"2026-08-14T10:32:45.343124Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.343124Z"},"links":{"cited_paper":"/paper/1710.05488","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:b910da11c78bc27de6c78e2e966fb3df52645942d1032c7c2e5206392978b028","observation_id":"721aa39e-63af-488e-bed7-14134e6f4f46","resolution":{"observed_at":"2026-08-14T10:32:45.343124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.06276","last_updated":"2018-02-20T05:51:02Z","snapshot_observed_at":"2026-08-18T10:24:38.099443Z","submitted_at":"2017-10-17T13:42:37Z","title":"Smooth and Sparse Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.06276","snapshot_observed_at":"2026-08-14T10:32:45.303648Z","title":"Smooth and sparse op- timal transport","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.303648Z"},"links":{"cited_paper":"/paper/1710.06276","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:310af971d4196111beb82de92b0ff3debc560007d3aac5dfb9c15346c485fbb2","observation_id":"f324ddc1-fd72-4cb0-8717-1a9ed204b130","resolution":{"observed_at":"2026-08-14T10:32:45.303648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.01541","last_updated":"2018-03-05T08:00:39Z","snapshot_observed_at":"2026-08-16T14:10:30.113734Z","submitted_at":"2018-03-05T08:00:39Z","title":"Improving the Improved Training of Wasserstein GANs: A Consistency Term and Its Dual Effect","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.01541","snapshot_observed_at":"2026-08-14T10:32:45.377840Z","title":"Improving the improved training of wasserstein gans: A consistency term and its dual effect","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.377840Z"},"links":{"cited_paper":"/paper/1803.01541","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:8697c69579929fba69d7914db6ab183b67333699ea85c8ccd64b031f5b2d6323","observation_id":"9c195d41-afee-41df-80e3-ef7c5a532e9d","resolution":{"observed_at":"2026-08-14T10:32:45.377840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.11835","last_updated":"2019-02-26T19:58:06Z","snapshot_observed_at":"2026-08-15T15:26:56.423800Z","submitted_at":"2018-05-30T07:23:47Z","title":"Optimal Control Via Neural Networks: A Convex Approach","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.11835","snapshot_observed_at":"2026-08-14T10:32:45.308704Z","title":"Optimal control via neural networks: A convex approach","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.308704Z"},"links":{"cited_paper":"/paper/1805.11835","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:9c0ac32a4b7a747641cdb03a95c25a4df98de504da1aa9dc3e6fa8daea720778","observation_id":"22ae25c4-fc54-42a6-8953-76663df57b43","resolution":{"observed_at":"2026-08-14T10:32:45.308704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.13082","last_updated":"2020-12-10T10:53:46Z","snapshot_observed_at":"2026-08-09T11:13:52.803054Z","submitted_at":"2019-09-28T12:42:12Z","title":"Wasserstein-2 Generative Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.13082","snapshot_observed_at":"2026-08-14T10:32:45.338233Z","title":"Wasserstein-2 generative networks","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.338233Z"},"links":{"cited_paper":"/paper/1909.13082","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:09bde8a23affcd7cbce61639eb3dcd331683c27b6597fd6818e193103540eea9","observation_id":"fc1db4c5-e275-4f47-8249-b695c7af2d77","resolution":{"observed_at":"2026-08-14T10:32:45.338233Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:32:45.775854Z","title":"Domain adaptation for object recognition: An unsupervised approach","venue":null,"work_id":"bc059d0d-bb26-4526-b6c7-028f318ec650","year":2011},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.313864Z"},"links":{"citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:b126fc4eadbf42cdd2db7cca23075c5f4536a6a696afaaad94fa50acee48ba64","observation_id":"99d2a250-f3a6-45c2-a0fb-6ee433d579dd","resolution":{"observed_at":"2026-08-14T10:32:45.780272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07197","last_updated":"2019-02-19T18:49:22Z","snapshot_observed_at":"2026-08-14T17:14:14.591231Z","submitted_at":"2019-02-19T18:49:22Z","title":"2-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07197","snapshot_observed_at":"2026-08-14T10:32:45.373085Z","title":"and Jalali, A","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.373085Z"},"links":{"cited_paper":"/paper/1902.07197","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:f27db0eb5d37e0a0cbc8cec87d8a2f73e980eb951161ed8e7d176d6e375b23de","observation_id":"007f1f1b-46dc-413e-af09-6925795fbc5c","resolution":{"observed_at":"2026-08-14T10:32:45.373085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1701.07875","last_updated":"2017-12-06T20:01:54Z","snapshot_observed_at":"2026-08-17T13:47:14.071303Z","submitted_at":"2017-01-26T21:10:29Z","title":"Wasserstein GAN","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.07875","snapshot_observed_at":"2026-08-14T10:32:45.298740Z","title":"Wasserstein gan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.298740Z"},"links":{"cited_paper":"/paper/1701.07875","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:43e7c4cc2621129e8e19f14b201e06016e3eb2c32ae394bda9a1d2b53ca257c6","observation_id":"ac8f829b-3293-47d5-9584-af26d14a570c","resolution":{"observed_at":"2026-08-14T10:32:45.298740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.02934","last_updated":"2019-02-08T04:30:38Z","snapshot_observed_at":"2026-08-17T02:17:35.032778Z","submitted_at":"2019-02-08T04:30:38Z","title":"Mode Collapse and Regularity of Optimal Transportation Maps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.02934","snapshot_observed_at":"2026-08-14T10:32:45.318627Z","title":"Mode collapse and regularity of optimal transportation maps","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.318627Z"},"links":{"cited_paper":"/paper/1902.02934","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:1b0df5b309894744b079ec1fcf23f6922c28ecad5e45cce771631693da5000d9","observation_id":"9b8ac227-c842-4470-8650-49bd794b442f","resolution":{"observed_at":"2026-08-14T10:32:45.318627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T10:32:45.328472Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.328472Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:5526a124328f71a755b9c0e1e59009b790865ae48bb2a1f4fd8663c97dd6f930","observation_id":"225f3ec7-77dc-4a73-81d2-51b589cc3000","resolution":{"observed_at":"2026-08-14T10:32:45.328472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05828","last_updated":"2020-06-29T23:24:09Z","snapshot_observed_at":"2026-08-14T16:32:17.375237Z","submitted_at":"2019-05-14T20:24:31Z","title":"Minimax estimation of smooth optimal transport maps","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.05828","snapshot_observed_at":"2026-08-14T10:32:45.323768Z","title":"and Rigollet, P","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T10:32:45.323768Z"},"links":{"cited_paper":"/paper/1905.05828","citing_paper":"/paper/1908.10962"},"observation_digest":"sha256:45946d9f638c813fcc8bfdc44e2cc164b5950d1eb9280d424ae5ff0680f8961a","observation_id":"ea155ea0-0734-478e-8911-bab67c808823","resolution":{"observed_at":"2026-08-14T10:32:45.323768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.10962","last_updated":"2020-06-17T19:44:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T08:44:07.177512Z","submitted_at":"2019-08-28T21:59:58Z","title":"Optimal transport mapping via input convex neural networks"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":4,"verified_fuzzy":2},"total_outbound_references":23},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:1908.10962."}