{"as_of":"2026-08-23T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36439b3ea1393bd24a1db24ebf02cab59f206840beee6942d2c5bf0132473121","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:29:41.835736Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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/2510.25956/citation-record","integrity":"/paper/2510.25956/integrity","json":"/paper/2510.25956/citation-record.json","paper":"/paper/2510.25956"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:28:19.592983Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T07:28:19.592983Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:a1b16a9d97f732a369b9091a5efd5cd8843f0acc4d86263da66c0259560aaf9f","observation_id":"46d5e89b-c989-40fa-8b95-d658416f173b","resolution":{"observed_at":"2026-08-04T07:28:19.592983Z","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-08-04T07:28:19.652024Z","title":"A., Ghassemi, M., Sun, S., Suzuki, T., Wu, D., and Zhang, T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T07:28:19.652024Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:ac7e36ebbe8614a7fd4fd829d2136174c30e436ec7cf22d753017f2453515b56","observation_id":"2c84773a-40dd-4a64-9bc0-5464728354b7","resolution":{"observed_at":"2026-08-04T07:28:19.652024Z","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-08-04T07:28:19.736250Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T07:28:19.736250Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:39e4f2404763ab0494067d9289f304a134ea06667093dda1d07ba221068bc808","observation_id":"2bb1fa5b-9d52-4960-a1d6-d08ba994acb5","resolution":{"observed_at":"2026-08-04T07:28:19.736250Z","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-08-04T07:28:19.947189Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T07:28:19.947189Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:91888f6eaa46e7936a0740af9c45e9fd301654df0053ce20ae5fe2851ade387f","observation_id":"35d83e86-9771-4264-af39-20974fea8d18","resolution":{"observed_at":"2026-08-04T07:28:19.947189Z","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-08-04T07:28:20.308656Z","title":"A., Chen, Y., Huang, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T07:28:20.308656Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:7275fc99831efeef4d0bb46b72e8aba3f82777f97a3827a734d02e7e515c08eb","observation_id":"281202b1-a5c3-4e41-806c-dc348396d8d6","resolution":{"observed_at":"2026-08-04T07:28:20.308656Z","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-08-04T07:29:18.794329Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:18.794329Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:32060ec9e19fb127eaa0a888e58b435bdcf36d3ea557af1f35d46a2a5d4a47a3","observation_id":"9992fdd5-73bb-455a-8eab-0ccf5b079adf","resolution":{"observed_at":"2026-08-04T07:29:18.794329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03597","last_updated":"2024-03-09T15:35:46Z","snapshot_observed_at":"2026-08-17T07:39:01.920198Z","submitted_at":"2023-10-05T15:20:35Z","title":"Sampling via Gradient Flows in the Space of Probability Measures","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03597","snapshot_observed_at":"2026-08-04T07:29:19.355902Z","title":"Z., Huang, J., Reich, S., and Stuart, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.355902Z"},"links":{"cited_paper":"/paper/2310.03597","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:0dea0965fb4ed446796c35f826afa4e7bce66c33617e62e941eccdda9b42032d","observation_id":"6455560c-d5fb-4ac7-8931-31dd02642134","resolution":{"observed_at":"2026-08-04T07:29:19.355902Z","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-08-04T07:29:19.368220Z","title":"R., Lu, C., Le Gouic, T., and Rigollet, P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.368220Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:b8c8a9eb18ad0ac24052d50597eee42711bdca6a23754069f00132f774b2de2a","observation_id":"5d7173f7-2f9a-4bb3-b4b2-4e8769244660","resolution":{"observed_at":"2026-08-04T07:29:19.368220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18163","last_updated":"2024-11-07T16:31:48Z","snapshot_observed_at":"2026-08-19T15:33:45.857864Z","submitted_at":"2024-07-25T16:25:10Z","title":"Statistical optimal transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18163","snapshot_observed_at":"2026-08-04T07:29:19.392029Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.392029Z"},"links":{"cited_paper":"/paper/2407.18163","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:5b55bd4d79526fe5a5eb4220146f004bb2593ee71b8e90b03a26e7462f19450a","observation_id":"939ebadd-1804-4c6a-80e2-51201b523854","resolution":{"observed_at":"2026-08-04T07:29:19.392029Z","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-08-04T07:29:19.410355Z","title":"E., Hoffman, F., Mazumdar, E., and Ratliff, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.410355Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:c0fab065a1195171b0b8c535324254f884e3c55e50d0c88e036c5c32ad063ae0","observation_id":"e0b751d0-26ff-4930-ad36-f361cd624890","resolution":{"observed_at":"2026-08-04T07:29:19.410355Z","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-08-04T07:29:19.420796Z","title":"and Ye, Y","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.420796Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:5a0121a8c1806e45775ba70f3f9f522898366b44deb23e04052e8c4db6cc6eb6","observation_id":"0fe14ebe-6393-4720-9078-98f2ce7c19ec","resolution":{"observed_at":"2026-08-04T07:29:19.420796Z","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-08-04T07:29:19.432367Z","title":"and Lebret, H","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.432367Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:c15aa3bfe4384d236f0091389c1adec2689d016b584f0a63d9da739ac205562f","observation_id":"da9887f2-fea6-491f-a237-ca9e9d404d13","resolution":{"observed_at":"2026-08-04T07:29:19.432367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.02199","last_updated":"2022-04-30T22:39:35Z","snapshot_observed_at":"2026-08-14T22:02:34.957553Z","submitted_at":"2016-04-08T00:11:05Z","title":"Distributionally Robust Stochastic Optimization with Wasserstein Distance","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.02199","snapshot_observed_at":"2026-08-04T07:29:19.441907Z","title":"and Kleywegt, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.441907Z"},"links":{"cited_paper":"/paper/1604.02199","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:b3103de69dea9d1fc6df08229372d6ab47f9b739f8ab25567522eeddc3f85b7d","observation_id":"393132e3-f13a-4eca-b079-b2abc550d714","resolution":{"observed_at":"2026-08-04T07:29:19.441907Z","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-08-04T07:29:19.452514Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.452514Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:1a1ed38be914c6e044e8956a6d033aefe9d68878cfc1ef5798952036666f54c3","observation_id":"749b8c46-80eb-4f34-b845-9a9a89eeed37","resolution":{"observed_at":"2026-08-04T07:29:19.452514Z","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-08-04T07:29:19.475548Z","title":"and Sanz-Alonso, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.475548Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:5f2fbd4dd64014024a5485a0e152be77ddec5f396cf853f427f265624ccaaf22","observation_id":"7878312d-3cb1-460f-aa88-6857ba3cb43f","resolution":{"observed_at":"2026-08-04T07:29:19.475548Z","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-08-04T07:29:19.492456Z","title":"and Lan, G","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.492456Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:341e4ef61b37ef0fff1c27077838e41ff6b9d2cff8310958648fc4841672524e","observation_id":"34d75c25-acc9-4e49-a734-fdd53dd09558","resolution":{"observed_at":"2026-08-04T07:29:19.492456Z","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-08-04T07:29:19.503406Z","title":"and Hong, L","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.503406Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:96e78484474cd7308986a939a197b9ae6a9095fa16e64d117f372788e2157a7e","observation_id":"b4385db0-9c53-4999-8fa1-05a46124835c","resolution":{"observed_at":"2026-08-04T07:29:19.503406Z","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-08-04T07:29:19.512493Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.512493Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:0d451f489ce14b08fccba53dacb44ec0be045b6aef54a929236aa5cb0c015866","observation_id":"04f7e723-7a3f-48e4-91e2-e7e3c22dda1b","resolution":{"observed_at":"2026-08-04T07:29:19.512493Z","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-08-04T07:29:19.528023Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.528023Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:251cbdb36efcddade73259418331f72996f9052dd4c5b14d285fa65b2dd0bd7b","observation_id":"f198fb82-bb65-419b-9089-53e8917c4595","resolution":{"observed_at":"2026-08-04T07:29:19.528023Z","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-08-04T07:29:19.537769Z","title":"T., Shen, R., and Tian, K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.537769Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:27f120b49625bb7d7fec9bf34a3854ce8459ffa7b1e960938b83543a803ef2a1","observation_id":"82cf13f4-ed6b-4a45-97db-eb8aaa0aa0cc","resolution":{"observed_at":"2026-08-04T07:29:19.537769Z","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-08-04T07:29:19.581234Z","title":"C., and Sidford, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.581234Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:1d3719e76b0d1fd792c98d72f442ab4aac78135d3572dec496f4bef1cc129c88","observation_id":"10295e83-70f0-4311-a593-7567d60a7a24","resolution":{"observed_at":"2026-08-04T07:29:19.581234Z","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-08-04T07:29:19.598140Z","title":"and Wang, D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.598140Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:4926b0f4c1c5feb36f41973eee74345dd53f4481a2a9ef3a4f505f8955bf01a0","observation_id":"12ca8b98-c524-4d0d-b87d-6d5ac306182a","resolution":{"observed_at":"2026-08-04T07:29:19.598140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09863","last_updated":"2019-05-23T18:39:26Z","snapshot_observed_at":"2026-08-14T16:27:35.510574Z","submitted_at":"2019-05-23T18:39:26Z","title":"Accelerating Langevin Sampling with Birth-death","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.09863","snapshot_observed_at":"2026-08-04T07:29:19.641301Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.641301Z"},"links":{"cited_paper":"/paper/1905.09863","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:5cabc185499f39cbbfe9a93b712e3f7e81e33f0f4d2c8e16d5b928fad5919961","observation_id":"df676b56-5d26-4714-a543-e7b3b21cf0e5","resolution":{"observed_at":"2026-08-04T07:29:19.641301Z","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-08-04T07:29:19.653301Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.653301Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:edbed3247235868794393d3ad16ebbccde7cec0927cec1b45fae2f851d321153","observation_id":"e246da47-6a6f-4008-ba8b-1c3b96c3b866","resolution":{"observed_at":"2026-08-04T07:29:19.653301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05026","last_updated":"2023-06-08T08:25:13Z","snapshot_observed_at":"2026-08-21T15:40:35.568386Z","submitted_at":"2023-06-08T08:25:13Z","title":"An introduction to the analysis of gradients systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05026","snapshot_observed_at":"2026-08-04T07:29:19.714349Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.714349Z"},"links":{"cited_paper":"/paper/2306.05026","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:2d828d1150f283bf975802a5358add8def3370e831fc4774135665aa0d2e9d23","observation_id":"3f6896c0-75d1-4713-a375-34d35a50ed67","resolution":{"observed_at":"2026-08-04T07:29:19.714349Z","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-08-04T07:29:19.727463Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.727463Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:415de850956c7838fa246216ed4c3835b74db7b741d74199fa7777a1a23dae40","observation_id":"5cc7fb22-4870-4b8f-b7e0-c834632c599e","resolution":{"observed_at":"2026-08-04T07:29:19.727463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17049","last_updated":"2025-01-28T16:17:09Z","snapshot_observed_at":"2026-08-16T12:58:35.063351Z","submitted_at":"2025-01-28T16:17:09Z","title":"Hellinger-Kantorovich Gradient Flows: Global Exponential Decay of Entropy Functionals","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17049","snapshot_observed_at":"2026-08-04T07:29:19.757164Z","title":"and Zhu, J.-J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.757164Z"},"links":{"cited_paper":"/paper/2501.17049","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:71aed69c173504a2fc86f507577540e01a1fb422fb11154e0f530652dbf6022c","observation_id":"a4b2b34e-379d-4820-b842-3596e0aaf6ea","resolution":{"observed_at":"2026-08-04T07:29:19.757164Z","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-08-04T07:29:19.789190Z","title":"and Kuhn, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:19.789190Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:451e1bab00b03fa8cece5800e3df2e737f1da4fa7517332bd2a392e37162d668","observation_id":"cc4f9efa-4599-4200-b60e-1fabc080ff79","resolution":{"observed_at":"2026-08-04T07:29:19.789190Z","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-08-04T07:29:39.857209Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:39.857209Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:4ec6f7eca916b78eed1284150802d395a2774ba375de37447d1d2b183a15206f","observation_id":"e5748de5-baf2-4664-863e-6966ad0028cd","resolution":{"observed_at":"2026-08-04T07:29:39.857209Z","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-08-04T07:29:40.768248Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:40.768248Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:795cf1a190899cc92626b331e0ec73698f31c35d0bc4f56d8378179b380ebaf1","observation_id":"d7e7d9f3-db37-4718-902e-6ef25edbcaf4","resolution":{"observed_at":"2026-08-04T07:29:40.768248Z","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-08-04T07:29:40.864617Z","title":"and Mackey, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:40.864617Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:f8619d68f7056d2c036952cabdf2fc5ecd2f236b53d5460e607a85cd525d253b","observation_id":"09357e35-342c-4e8e-ac9a-58f49c1b1400","resolution":{"observed_at":"2026-08-04T07:29:40.864617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10571","last_updated":"2020-05-01T07:29:34Z","snapshot_observed_at":"2026-08-20T04:15:35.155856Z","submitted_at":"2017-10-29T07:27:57Z","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10571","snapshot_observed_at":"2026-08-04T07:29:40.934064Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:40.934064Z"},"links":{"cited_paper":"/paper/1710.10571","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:4f96ff18113ecd1a9c625ba472c8a282af65a58e2151e31e7782d2862976a332","observation_id":"238f0d35-122d-4d9d-8393-7d993427be90","resolution":{"observed_at":"2026-08-04T07:29:40.934064Z","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-08-04T07:29:40.981716Z","title":"and Wibisono, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:40.981716Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:304b34e033cf6b04591ab9de134f4db71fecc79f7a9ac21acfa12025c6fd1f2a","observation_id":"45d03362-f1ca-44e6-9906-6ec18eab958c","resolution":{"observed_at":"2026-08-04T07:29:40.981716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01280","last_updated":"2025-09-03T09:27:10Z","snapshot_observed_at":"2026-08-16T16:19:06.063642Z","submitted_at":"2022-11-02T17:03:40Z","title":"An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01280","snapshot_observed_at":"2026-08-04T07:29:41.053216Z","title":"and Chizat, L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.053216Z"},"links":{"cited_paper":"/paper/2211.01280","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:4d357473d423f087b517acd0a790dd1277140dbf1bd2f09239bd8081af92c25f","observation_id":"474b6bd1-f5ad-4baa-8852-528e5fc936af","resolution":{"observed_at":"2026-08-04T07:29:41.053216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.11926","last_updated":"2025-03-26T16:30:42Z","snapshot_observed_at":"2026-08-19T21:33:20.094757Z","submitted_at":"2021-09-24T12:40:48Z","title":"Sinkhorn Distributionally Robust Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.11926","snapshot_observed_at":"2026-08-04T07:29:41.100569Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.100569Z"},"links":{"cited_paper":"/paper/2109.11926","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:cb36f512edb4038f53e5cbc591dbdfdb31cd7f848c54251ffee769341cbddfaf","observation_id":"eb5a77fa-94a1-452d-ae0b-75894ecd1478","resolution":{"observed_at":"2026-08-04T07:29:41.100569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05623","last_updated":"2025-06-28T00:24:10Z","snapshot_observed_at":"2026-08-21T15:39:22.967306Z","submitted_at":"2025-02-08T16:07:12Z","title":"Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05623","snapshot_observed_at":"2026-08-04T07:29:41.243746Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.243746Z"},"links":{"cited_paper":"/paper/2502.05623","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:17733e4eb01f4adda167e5f0640b9cb1ffb4f1c5aa8d31b5535a5c4148f787f9","observation_id":"b7c0b7b5-4adb-43e8-97bd-9a5fba18ee61","resolution":{"observed_at":"2026-08-04T07:29:41.243746Z","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-08-04T07:29:41.336865Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.336865Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:39ad6b1e30a1e5fc3d849b5d8c53f3bff66929fbc25f97f4bb9db6167af96dcb","observation_id":"cc33b921-9730-4be1-a6f0-84f8fa8dfa6d","resolution":{"observed_at":"2026-08-04T07:29:41.336865Z","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-08-04T07:29:41.454116Z","title":"V., and Jordan, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.454116Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:35b9769105aafc27b598b174fffcb4ff3d30df8791dfa82ddabe9a30e573b7bb","observation_id":"8bfbf84a-b37d-4441-970e-043ca9787cdc","resolution":{"observed_at":"2026-08-04T07:29:41.454116Z","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-08-04T07:29:41.611796Z","title":"and Guan, Y","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.611796Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:503e6da0f1547bbfae60035e3810126581e64e00d6de94257a3a85f63a6829e5","observation_id":"fe6594dd-de1b-4ea2-b87e-2740b1e79228","resolution":{"observed_at":"2026-08-04T07:29:41.611796Z","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-08-04T07:29:41.717031Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.717031Z"},"links":{"citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:98be5c92aabf7bad892e66be01ece8e5cbad326b21eb122e87262871be7a9d83","observation_id":"f2e16d02-917c-4acc-8ae9-96b822203271","resolution":{"observed_at":"2026-08-04T07:29:41.717031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20556","last_updated":"2026-07-15T21:51:08Z","snapshot_observed_at":"2026-08-11T06:06:08.236600Z","submitted_at":"2024-12-29T19:31:23Z","title":"Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20556","snapshot_observed_at":"2026-08-04T07:29:41.835736Z","title":"and Xie, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T07:29:41.835736Z"},"links":{"cited_paper":"/paper/2412.20556","citing_paper":"/paper/2510.25956"},"observation_digest":"sha256:cd8c45cb5d1bd043d2d2d534febe6252f968c72bf5d594b1f03f3dd19330104b","observation_id":"93ddbed5-5b3f-4e7e-a9c2-156beb47160f","resolution":{"observed_at":"2026-08-04T07:29:41.835736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.25956","last_updated":"2026-05-25T19:59:22Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T03:39:50.843757Z","submitted_at":"2025-10-29T20:53:44Z","title":"Gradient Flow Sampler-based Distributionally Robust Optimization"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2510.25956."}