{"as_of":"2026-08-08T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:243f3a6f300e0b9d011cddf1d16b786807b4630ad55e0e3a8292917aca90e27e","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-08T06:32:00.761636+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-08T08:23:55.823859Z","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:7ad57730fbbde0eaa7e26fa7095bdc0647953b108b7fd1aa8151fcb369ad0fee","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-08T08:23:55.823859Z","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:2fc0278ffcf2169c5cbb435f6b0ba956f3562d904a0629f4d3e883adf9991069","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-08T08:23:55.823859Z","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:f222fa2ba1870945151e09967f6c7d5206fe3f10bbb3f3d5cc733db0e76b6567","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-08T08:23:55.823859Z","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:46ad7bc2eeda9ec2b10c36bac330d4eb1d30f33fb45d8ebb9dc433dc02bf1581","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-08T08:23:55.823859Z","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:704759133377f6a3ff90a04a0b97ca97ed573bc3a5b5e10d58d1124129a3fe7a","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-08T08:23:55.823859Z","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:ee642485ada0bd7971eaf72a1ddfdb7d70bde5623dfac3308a881effaf5c00ae","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-07-06T16:28:18.257251Z","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-08T08:23:55.823859Z","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:98b841dca9093da421dd7ca079f1c89989ac1bb981cb63feaf3d18366db0fba4","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-08T08:23:55.823859Z","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:0cf650f72ff375893482ffc5b535ac87079439637dc8f4f2cbca188980c0487f","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-07T23:20:50.265483Z","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-08T08:23:55.823859Z","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:996949cb54c47004b9ac867d1886fd8e879c5176d4c7356ee4eb187ed8e0fe8d","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-08T08:23:55.823859Z","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:f70a0c1586f955cf746c4d48b53459bbee464295a563f77f175d1569cded9486","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-08T08:23:55.823859Z","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:58f8f9121a1bb5522d92aea490833827083d0404fa35a38e762d5c227a843046","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-08T08:23:55.823859Z","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:9dea710726c74c6cc42019d64ddfb4c1f6f1c484567d41eb7241e294173d6f42","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-07-06T04:52:09.602955Z","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-08T08:23:55.823859Z","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:bcd2a38763e14f122bb6764bc684ff2a9fa90cbe9779d9ba664b16f68509be89","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-08T08:23:55.823859Z","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:0bc5072fc84391e90e3f29904311e890b58949ba6437021dd246dc632ac81373","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-08T08:23:55.823859Z","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:4cb60604f426c60c46946e574d6ea87b6fa3142ef336401b11d03c157e0fe300","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-08T08:23:55.823859Z","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:4178a6eca0b1fb234c17f3b53905181f82097016b22d77e9f4b3ee108deb68d5","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-08T08:23:55.823859Z","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:8f7714480845306ddc54e521cd83c99c3abea0296dfaf7d28b164fe02d0886d0","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-08T08:23:55.823859Z","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:5bcf2e8d7919b6f9daa714676b1dfc10fe4bc2a692b53a18058264e910c6150b","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-08T08:23:55.823859Z","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:269a949a221d6a3f65475d9f984649e41ffb5846a4d08c6cf485f397cd7c4460","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-08T08:23:55.823859Z","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:abf5615800ec4e95bf86d0f7a9104884e3cd79f1f27eb03dd62e4041bc11ecae","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-08T08:23:55.823859Z","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:97fae88f80ba325d28b27e9272bfe8a66e52469b76362bdb9343dcb1670e2e2d","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-08T08:23:55.823859Z","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:7ae9cef384f418ac7098b64a345d5dcf6cf03266852181824a2f6ecde4a65c93","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-07-06T07:55:05.948249Z","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-08T08:23:55.823859Z","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:e021a767245fc10fd836c26dd8c14d7b7b5666158344e046c485cf337ec78d34","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-08T08:23:55.823859Z","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:64472c87f55787d6c658be6c435a8b860cd8d71597a5c1ee8aa43fe768a7653a","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-07-31T03:33:01.325380Z","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-08T08:23:55.823859Z","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:1e2d1670e6412bec0962723c0f4e979674a4680374c95434cb415ab7952ca58d","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-08T08:23:55.823859Z","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:fb30cad06cad9248dbcd09424063731d0e72000f3e712d58816a88377d220295","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-07-06T20:27:28.212857Z","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-08T08:23:55.823859Z","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:ddf6d25628a48cb3b43c87592caf3ddea35e89872bc7a6bc1733c20a1a80d1bf","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-08T08:23:55.823859Z","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:a8dffa75edef9f9cdccaa161b4a01fa01214920631f01ddc487e6d4deb4ce86b","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-08T08:23:55.823859Z","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:81694bcd0843dbb8b52165763822798afe82157990a257f264e4ad2cad3a4e50","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-08T08:23:55.823859Z","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:02e4f4ae198fc4c7c73b44932dbee76ac2dce13d5478a8fbb05a0570d7127c9d","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-08T08:23:55.823859Z","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:8be6625d019863eb4b53c9808c0ba501bd152e9c6f09c2c928e0ab0889c72776","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-07T21:20:40.257232Z","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-08T08:23:55.823859Z","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:fcfdd772d0e1d5ab15ffa3297e921d1c610913ce9f6cd51b2c8ccb31d9fce778","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-08T08:23:55.823859Z","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:602bdf2675b2079219741cabd4452fb224e4d3bb613fb2fb548452dc484e16c2","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-08T16:03:42.103138Z","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-08T08:23:55.823859Z","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:591713c1b3927909ff989a00036bf5535d89816c2eedc378167e2d5d6ffd9fa5","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-02T11:14:43.562416Z","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-08T08:23:55.823859Z","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:34d771266bffe9210265cd8cc5fef52304a865aedb4f87d14d1f17681884fd25","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-08T18:33:35.259822Z","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-08T08:23:55.823859Z","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:0ed6685dab627f87b2cd7f43b2969baa79e37a63943bbe1a8e3746a7eec24ed8","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-08T08:23:55.823859Z","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:5ac3722ccf12fe4c8fac543514cda54f4a804f6569470fdf9fe1b00c07e896f8","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-08T08:23:55.823859Z","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:8baf34f50639148aeb7266e0132b7c4944526d3c70492832f567da170485794e","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-08T08:23:55.823859Z","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:2fc0e619af95c2006da7d634d0fe9dda9e84e5da78c183cee49874c59bd88827","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-08T08:23:55.823859Z","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:cc60f1d02fa489942fafff943875cfaab954260584bdaaa7f97f0647d622b677","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-02T02:56:05.028687Z","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-08T08:23:55.823859Z","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:f67b6fa3f8e2faefd449ba979dbed342071d644e32c7b48a99647a03909e4b8e","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-08T08:23:55.823859Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2510.25956."}