{"as_of":"2026-08-11T05:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13cf6ecb2e3df628f1731e83c668605977ac2308ca3dbc07869f50b42c1837a4","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:05:04.897056Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:05:04.834517Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T02:09:22.267543Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-08-09T21:05:04.834517Z","title":"Liu and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.834517Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:3729e4a1ab4ff49bf8cea8d2dd407b0403e2a3c0bb105aeaf85b367ea1d75bbd","observation_id":"eeb4d16a-1d31-4cb4-aec8-c3434d7438a1","resolution":{"observed_at":"2026-08-09T21:05:04.834517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":"2501.19214","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-07-04T02:09:22.267543Z","title":"A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","venue":null,"work_id":"83cd1559-a32f-4790-9354-cf14b9c47c4b","year":2025},"citing_paper":{"arxiv_id":"2605.15388","last_updated":"2026-05-14T20:17:10Z","snapshot_observed_at":"2026-07-06T23:26:41.848219Z","submitted_at":"2026-05-14T20:17:10Z","title":"Unified High-Probability Analysis of Stochastic Variance-Reduced Estimation","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-19T16:38:44.673974Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2605.15388"},"observation_digest":"sha256:f283d98432d93e351325c2fc72ab9e584a7fb268b1dc2ebcf28cadf809ea584e","observation_id":"de444165-25d0-4c2f-ab0e-7bba46ec7ae7","resolution":{"observed_at":"2026-05-19T16:42:39.862884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":"2501.19214","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-07-04T02:09:22.267543Z","title":"A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","venue":null,"work_id":"83cd1559-a32f-4790-9354-cf14b9c47c4b","year":2025},"citing_paper":{"arxiv_id":"2605.29635","last_updated":"2026-05-28T09:06:26Z","snapshot_observed_at":"2026-08-01T22:42:30.604982Z","submitted_at":"2026-05-28T09:06:26Z","title":"MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-29T06:02:50.948390Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2605.29635"},"observation_digest":"sha256:485981811f6114e5be052d9da8d4c102dab3968cc85a941bdc9d93edadd11c5b","observation_id":"25ed5e42-96f4-4605-b6b5-d44bcc9d25ae","resolution":{"observed_at":"2026-06-29T06:03:08.331999Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":"2501.19214","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-07-04T02:09:22.267543Z","title":"A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","venue":null,"work_id":"83cd1559-a32f-4790-9354-cf14b9c47c4b","year":2025},"citing_paper":{"arxiv_id":"2606.13343","last_updated":"2026-06-11T13:32:13Z","snapshot_observed_at":"2026-08-01T22:44:36.494917Z","submitted_at":"2026-06-11T13:32:13Z","title":"A smoothing extended sequential quadratic method for difference-of-convex optimization over a convex composite inequality constraint","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T05:59:50.361213Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2606.13343"},"observation_digest":"sha256:bfd287ebc01fe4b40c81f4552c082d56b5337ac13bdac2f54941a42381648941","observation_id":"0bff7fe8-0df0-4899-a99f-8fbe6d8524aa","resolution":{"observed_at":"2026-07-03T16:08:37.889692Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":"2501.19214","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-07-04T02:09:22.267543Z","title":"A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","venue":null,"work_id":"83cd1559-a32f-4790-9354-cf14b9c47c4b","year":2025},"citing_paper":{"arxiv_id":"2606.19050","last_updated":"2026-06-17T13:17:06Z","snapshot_observed_at":"2026-08-02T06:04:21.663026Z","submitted_at":"2026-06-17T13:17:06Z","title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-26T20:02:45.082477Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2606.19050"},"observation_digest":"sha256:205f892ee43f4a054958ebe50628bb9c771797826b6862231da63a69f76201eb","observation_id":"4e61214c-1232-48c0-a40b-bf4a5381ebdc","resolution":{"observed_at":"2026-07-04T02:09:22.269225Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.19214/citation-record","integrity":"/paper/2501.19214/integrity","json":"/paper/2501.19214/citation-record.json","paper":"/paper/2501.19214"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.538723Z","title":"Agarwal, A","venue":null,"work_id":"5bd3771b-f1dd-4b86-a964-eac988dd5325","year":2018},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.708792Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:5a3bc5c8f49fcafb4d179ae5dd6d9fb228264c467b74833c2c92c30c2b74673e","observation_id":"47ba0c6a-ba64-40cc-b24e-f091e98e6941","resolution":{"observed_at":"2026-08-09T21:05:05.541637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.530829Z","title":"Alacaoglu and S","venue":null,"work_id":"2dd33347-7d6b-4ae5-9740-9ce1f856a8b4","year":2024},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.712323Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:2c87af2efa9214795f0ff55c581020af064bb21071878766ad8d8f55c354f5fb","observation_id":"b10d782b-bc0e-429b-9492-33cedb150de7","resolution":{"observed_at":"2026-08-09T21:05:05.533999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.522741Z","title":"Andreani, G","venue":null,"work_id":"1a75d125-31bf-439f-a262-714237bd2e8d","year":2011},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.715301Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:d0086793f1642db20fddc060ab1ca7f385d7665f22e37f65ab18a5f948d9013f","observation_id":"a5e47d40-91cd-4eca-9efd-950e66dbcd5a","resolution":{"observed_at":"2026-08-09T21:05:05.525735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.514338Z","title":"Andreani, J","venue":null,"work_id":"03028fed-3a4b-4816-b7d8-35232ee55f7e","year":2018},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.718393Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:d21c06187de5b99af394095d4662488f3572727512658452428b6f0a6900c903","observation_id":"2ee45a6c-5332-4d5e-b76a-09464329e4c2","resolution":{"observed_at":"2026-08-09T21:05:05.517353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.505593Z","title":"Angwin, J","venue":null,"work_id":"cb391f00-6d1c-4025-9ed0-9e0d4d3a3196","year":2022},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.720977Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:2119c0f9839dee3af4a350eb1416c47dc2e517a6f24157901a24b6fe38e8af5e","observation_id":"e49050b6-ca1f-4b27-b1f9-3d19ad8c50d9","resolution":{"observed_at":"2026-08-09T21:05:05.508633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.497033Z","title":"Arjevani, Y","venue":null,"work_id":"970087e0-550c-4ace-b14f-a716b88ed1fb","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.723437Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:bb4ea6c6a446e4d3701c0cef605db7971908c10da6216d5131d183f9760e615a","observation_id":"55b656a4-4661-4a2f-9d5d-f12559bd9f19","resolution":{"observed_at":"2026-08-09T21:05:05.499879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.488269Z","title":null,"venue":null,"work_id":"4d7847e7-b159-4087-8933-6422e1324055","year":2011},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.726132Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:1abef165ffc4f40bbc3d1fbc5e7858cf40575c8db148632c1dfdc39a8e9e78ed","observation_id":"f0521ef2-4382-436d-89b0-ded9848d8aa8","resolution":{"observed_at":"2026-08-09T21:05:05.491223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.479583Z","title":"Bayandina, P","venue":null,"work_id":"9b04b7bb-f64d-4d2f-9bdc-ac2752eff050","year":2018},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.728296Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:2a36394f6dc5deadcee2213bb08c0326e41db8e553379da94ad18ae95a822c7d","observation_id":"50d6f155-c245-4c48-a880-9687600187d0","resolution":{"observed_at":"2026-08-09T21:05:05.482872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.470104Z","title":null,"venue":null,"work_id":"1ebcd3ff-357d-4090-a068-676ef8d95306","year":1997},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.730880Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:4b0b5cc3ee36e45b9c4c515661282b661cae0a54e2a35e84b4bc86417105c858","observation_id":"e56972c1-352b-458e-8bc7-977af4394a59","resolution":{"observed_at":"2026-08-09T21:05:05.473341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.461292Z","title":null,"venue":null,"work_id":"73674573-5f01-4e5f-9e93-aa77a48320d1","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.733603Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:1ac165e90e3b18a5dcbb09fcf0c429f361c5eac95fb0c61561643d40335b456b","observation_id":"ceb7d91d-d4ad-4280-8815-a6e9d9d7de1d","resolution":{"observed_at":"2026-08-09T21:05:05.464326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.451632Z","title":null,"venue":null,"work_id":"5f203dc1-9760-4c16-a0d7-44c205fadb6d","year":2013},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.736409Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:c5e9b7ecfde1e641d120bd638992c7169ac0fe6db230d999245b36d1c050675f","observation_id":"e2116834-fa3a-45b8-9264-468a18344e64","resolution":{"observed_at":"2026-08-09T21:05:05.454886Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.442418Z","title":null,"venue":null,"work_id":"1eea4da7-f858-4a54-b4cd-fa60279c206e","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.739275Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:2b49dabb1a7efb09d6f5e9037d5e46c8633956e7365bdfab968ac5eca5180fb6","observation_id":"5eb3b2d4-d71a-4ba2-b34d-4d4958c9d1e2","resolution":{"observed_at":"2026-08-09T21:05:05.445590Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.432528Z","title":"Cartis, N","venue":null,"work_id":"3066926c-9c14-49e0-9ba3-50e9ef79ed9f","year":2014},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.741926Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:ae2c49c5ed5a6225b52754032002ce2a7b9897b9e5f2adaaf5b30d13eb65a555","observation_id":"034139c7-9505-4f1c-8ab1-d101161d722f","resolution":{"observed_at":"2026-08-09T21:05:05.435978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.423790Z","title":"Chen and O","venue":null,"work_id":"b29aa60d-2543-4f23-b7ea-4d81c022aaa7","year":1996},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.744436Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:cbfb195c9875bee862c088184a1da711c21f993d271de1218743f594ec2df6a1","observation_id":"2d5b9e57-44ab-4cdf-95a1-bef0414c7087","resolution":{"observed_at":"2026-08-09T21:05:05.426797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.414383Z","title":"Chen , Smoothing methods for nonsmooth, nonconvex minimization , Mathematical pro- gramming, 134 (2012), pp","venue":null,"work_id":"7cff5d00-1c21-4a98-b66c-ec911a87aed7","year":2012},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.747862Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:077df30d0eabe6297f2acf62d9f7ec909d21b37bece63f0789cfadc6600c4a5f","observation_id":"199f81d9-7c74-4e9c-9548-2b6336cac9eb","resolution":{"observed_at":"2026-08-09T21:05:05.417640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.405034Z","title":null,"venue":null,"work_id":"bf558cd1-589a-405b-9722-0536f3917917","year":2016},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.750524Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:c7cdcad13ac86a0583bbe0d8c4df92756aa6873fda55db476ce9689cbefdd837","observation_id":"6cd57b08-2e15-40c0-ac00-97df0df30899","resolution":{"observed_at":"2026-08-09T21:05:05.408596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.395776Z","title":"Chouldechova, Fair prediction with disparate impact: A study of bias in recidivism pre- diction instruments , Big Data, 5 (2017), pp","venue":null,"work_id":"4db13e17-0558-4d75-9e21-f3735b12444e","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.753139Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:6b7664e3a19ca22cfed429bf92b1c07183246dc073597eeaa743bf96d14754af","observation_id":"c860d48b-88a5-4d26-88ba-fadc8b4db512","resolution":{"observed_at":"2026-08-09T21:05:05.399082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:04.755846Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.755846Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:3579bbf1c5421f5f3137e316a42b33df4263761f7db41dc61d8e6399bd4c3d32","observation_id":"f679d9f3-13b5-45fa-b12d-175dd2e4acec","resolution":{"observed_at":"2026-08-09T21:05:04.755846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.382208Z","title":null,"venue":null,"work_id":"83f2b033-45fd-4fa4-acda-2c16738f4cf7","year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.758446Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:59c22d0159db927c1ede7a45bd8880883d55c96d25c75926561a1ace214296a5","observation_id":"bd60318a-52b9-4259-928d-7e23c9cf3240","resolution":{"observed_at":"2026-08-09T21:05:05.385325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.373495Z","title":"Davis and D","venue":null,"work_id":"25f78dd2-b64e-4ce7-a7ea-3de2fedc352b","year":2019},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.761026Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:3251ea077ab59448413750bf3c5612b003320320930e64a037e99364352c1a4e","observation_id":"411bfe35-4bc8-45f5-b1f1-cca6b925b5db","resolution":{"observed_at":"2026-08-09T21:05:05.376503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.364722Z","title":"Drusvyatskiy and C","venue":null,"work_id":"6e11404b-719f-42af-adff-d231081a7044","year":2019},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.763744Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:4ab2d31812460852d0eefdce3d610f5518463503b5c26e8ee28a84f75a0fed76","observation_id":"392ed063-4a69-48d6-878d-28861d15bcfa","resolution":{"observed_at":"2026-08-09T21:05:05.367705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.355779Z","title":"F acchinei, V","venue":null,"work_id":"67781c4b-c27b-4562-b45e-ef376c01594b","year":2021},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.767045Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:79ddf5cc7a874f9998267a5aea38edfe241c389418688574ec5f33e19dc291b8","observation_id":"1af9a11a-2144-4fe9-9c3b-bc1f02d1ed5b","resolution":{"observed_at":"2026-08-09T21:05:05.358715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.347919Z","title":"F an and R","venue":null,"work_id":"f9664dcc-bcec-4ad7-a0fa-b6b8a1baa73d","year":2001},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.770040Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:27af4043a42767d94ec42bce6557d22c9f614ed5feac3aa218ecba4bc7efe76e","observation_id":"6ee0c94d-1f52-475f-bca7-063a34a11de5","resolution":{"observed_at":"2026-08-09T21:05:05.350917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.339476Z","title":"F ang, C","venue":null,"work_id":"185c790c-365b-4aa7-9632-e70a43f234e6","year":2018},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.772822Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:71b6b1ab3bdc6a44e62b09ac1c3399a07ebca8597f91c34dbfa1b8aee729199c","observation_id":"44cec56e-ff4c-4379-bfd3-6671f898e9cc","resolution":{"observed_at":"2026-08-09T21:05:05.342358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.331666Z","title":"Grimmer and Z","venue":null,"work_id":"536d1764-e78a-434a-8d44-fa447dc5af04","year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.776139Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:507498eb2694efd90146dd019fd11d3b097af3c48aec1832a28198d8346420aa","observation_id":"3a987730-787a-47f2-ba64-4d228f88db02","resolution":{"observed_at":"2026-08-09T21:05:05.334289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.324185Z","title":"Hardt, E","venue":null,"work_id":"ee1d3465-4365-4a57-a5e4-1fd66be649e3","year":2016},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.779002Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:01846d8846b92550606c7104afd27615678e34b6ca102b5cf9223b8934ea6838","observation_id":"7be09748-9d40-408b-8ae1-6fc0714c18d4","resolution":{"observed_at":"2026-08-09T21:05:05.326979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.315947Z","title":"Huang and Q","venue":null,"work_id":"18054190-26d0-4911-8cad-89d554677730","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.782195Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:222b5a5e90d013e48593ac2df85cef4295c205573b8e92061afd4919e3f2d69a","observation_id":"d6825348-08ac-456c-8dfc-148ab218dad5","resolution":{"observed_at":"2026-08-09T21:05:05.318957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.307487Z","title":"Jia and B","venue":null,"work_id":"5f2f7846-71e7-44e4-888f-ffd388966c1f","year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.786036Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:9ece8d0393347a339183cc086764c19b487d4ba0532c79c4a6f946e963a971a5","observation_id":"75eb306b-19a8-4a15-a7fd-d25eb7ac39ea","resolution":{"observed_at":"2026-08-09T21:05:05.310634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.298616Z","title":"Jordan, G","venue":null,"work_id":"3f865ff3-275a-4aa5-94e9-ef4ab1061f07","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.789322Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:984fd84ebae3cabb36ff92aad6d023d509f505dbd2cf86569bcaa2dabbaa13a9","observation_id":"77040874-d652-4876-b092-67334f2acac6","resolution":{"observed_at":"2026-08-09T21:05:05.301592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.289837Z","title":"Kohavi et al","venue":null,"work_id":"450cf19e-0b71-4446-aeaf-328206a152ee","year":1996},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.792283Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:25b4b53743678ec9d2aa9ec61850856b9e7819a6b39cd93d677245c2ffa6c134","observation_id":"b8e5a994-3768-4e7d-9197-4c24ef8b2e3a","resolution":{"observed_at":"2026-08-09T21:05:05.293358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.281554Z","title":"Lan and R","venue":null,"work_id":"2334b455-0e5f-4d15-b6a1-dbbe5e056e67","year":2013},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.795350Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:a0eecb5b05ec50005ad3509f5e45c466b6e1dbbf059a6d3127c7559358fb433f","observation_id":"c460f710-0337-4a72-a6f3-4c429bcd6f48","resolution":{"observed_at":"2026-08-09T21:05:05.284528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.272381Z","title":"Lan and R","venue":null,"work_id":"e8a29afe-9c65-4f5f-b682-d2522ebc308c","year":2016},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.798334Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:841d340cd521d3d563828da550cfa499fbb4ffeda196cc156aa46086a382f4e9","observation_id":"bc90e610-27cb-4ca9-b062-19ba60a6807f","resolution":{"observed_at":"2026-08-09T21:05:05.275710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.263920Z","title":"Lan and Z","venue":null,"work_id":"c84869da-60c0-4205-9b94-46159f856d7c","year":2020},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.801208Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:b4e0729a68c02b941b3f4d881bdf49810805f43619431ecd31d61a833ddc1188","observation_id":"c2a6e65c-a30d-48df-9a98-2932e61e3a9e","resolution":{"observed_at":"2026-08-09T21:05:05.267335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.255291Z","title":"LeCun, The MNIST database of handwritten digits , (1998)","venue":null,"work_id":"27dae9b4-5a1e-422a-8f18-0b77c40e2f4d","year":1998},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.804650Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:9c8656715a6f5a658b8479597c8b7f2a60dc82e3131697bbd8030e1eb667fbee","observation_id":"0fd56454-f91b-429d-bdd8-54fa36a7a6db","resolution":{"observed_at":"2026-08-09T21:05:05.258466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.246347Z","title":null,"venue":null,"work_id":"24147b1d-c6af-41bd-bd61-7e2415155b87","year":2024},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.807619Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:19a0641c9eb1f0ac39a6fe8c8dc796776c14d1ea94e1c70bd989aba66faa56d6","observation_id":"e589d4e8-d33a-40af-a5be-5deecbe7d4ca","resolution":{"observed_at":"2026-08-09T21:05:05.249321Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.237396Z","title":null,"venue":null,"work_id":"cd3f5a41-883a-4e19-aa57-b21d213895ab","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.810819Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:5b7de9b175effacc246292aff503b62cb1751b7dbeb71aa7bd724c97a6a970ee","observation_id":"77a9853a-024b-4446-8fe8-bc4de578e682","resolution":{"observed_at":"2026-08-09T21:05:05.240461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.228280Z","title":null,"venue":null,"work_id":"f6761c40-ef3d-4ef3-89e4-af465d782023","year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.813754Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:ecb4cae56d0457b971b93fcc25b15bf6c9d7e66da8b63df398aa7d6548908b2b","observation_id":"d9ef5682-1058-4f7d-9a9e-75a9d72822af","resolution":{"observed_at":"2026-08-09T21:05:05.231031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.220033Z","title":"Li, P.-Y","venue":null,"work_id":"e8d605a3-5d76-448d-804a-f95f8da100e0","year":2024},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.816818Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:c98d5bc2a1038d133bc1653fa704981610a8e5a2837cd4ec0b67cb4cb78174c6","observation_id":"5ac77fad-b44a-416b-8218-54648c264b7a","resolution":{"observed_at":"2026-08-09T21:05:05.223051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.209384Z","title":null,"venue":null,"work_id":"df81bd67-68cc-4e99-88b3-6d8f68a197c8","year":2022},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.819686Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:4b07566cfe8398b455a0aaa505977a6a08956e6e9dd5d1b61c9c40288810e8aa","observation_id":"94ad27f8-6d8b-44ee-8223-b1681d2fbade","resolution":{"observed_at":"2026-08-09T21:05:05.212222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.200583Z","title":null,"venue":null,"work_id":"3e7b73cf-cd4a-4515-99ec-7538a025a5fb","year":2018},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.822719Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:243bfbff97e56f6d0a54cd7255e492ced052a7f035d07bf7b2d89313c6877e2e","observation_id":"5ea51156-37c3-4725-a76f-00d23530595f","resolution":{"observed_at":"2026-08-09T21:05:05.203722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17602","last_updated":"2026-07-16T04:41:12Z","snapshot_observed_at":"2026-08-07T17:52:05.292039Z","submitted_at":"2025-02-24T19:36:47Z","title":"A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17602","snapshot_observed_at":"2026-08-09T21:05:04.825607Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.825607Z"},"links":{"cited_paper":"/paper/2502.17602","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:3ca548c8a628fdad0b84391a4b63dafd3163dc310ca240b822efd7973e9bb230","observation_id":"71f574bf-ad0b-4b29-a6df-0d3e3c34ecd2","resolution":{"observed_at":"2026-08-09T21:05:04.825607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.192049Z","title":null,"venue":null,"work_id":"366c8e84-5c97-4c43-b2b7-e1a23a4fd1bf","year":2022},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.829120Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:16b4f7147d458c08e1d6d47abc0f104fa5bb024d78372209a08e712d25fef90f","observation_id":"f7920371-a22e-4a44-ac7b-d6921ac3981d","resolution":{"observed_at":"2026-08-09T21:05:05.195137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.183321Z","title":null,"venue":null,"work_id":"4786afc6-bd25-40ef-adb9-3d495c19d2c8","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.831458Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:02321f760315658763c403db6ccf3b45a07aae5553f124a560eb6c78e0b92045","observation_id":"58d7b14b-674b-471c-a792-cd3239d154c1","resolution":{"observed_at":"2026-08-09T21:05:05.186529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19214","snapshot_observed_at":"2026-08-09T21:05:04.834517Z","title":"Liu and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.834517Z"},"links":{"cited_paper":"/paper/2501.19214","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:3729e4a1ab4ff49bf8cea8d2dd407b0403e2a3c0bb105aeaf85b367ea1d75bbd","observation_id":"eeb4d16a-1d31-4cb4-aec8-c3434d7438a1","resolution":{"observed_at":"2026-08-09T21:05:04.834517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.05738","last_updated":"2018-03-27T18:52:16Z","snapshot_observed_at":"2026-07-06T04:49:55.033388Z","submitted_at":"2016-03-18T00:55:31Z","title":"On the non-ergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming","version":3},"cited_work":{"arxiv_id":"1603.05738","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.05738","snapshot_observed_at":"2026-08-09T21:05:05.008393Z","title":"On the non-ergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming","venue":"math.OC","work_id":"53d070e2-d13c-4580-b1cf-560e53b23a5d","year":2016},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.837510Z"},"links":{"cited_paper":"/paper/1603.05738","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:04aa6fad051ff8c43a5287f25e9862c530bb2504f11c1a513b47ae8c800c2a1e","observation_id":"c0d4cd03-2280-45d3-8b7e-4e9b1df0674b","resolution":{"observed_at":"2026-08-09T21:05:05.011848Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.174234Z","title":null,"venue":null,"work_id":"7d13cb6f-18df-424e-80a2-40d2f66af46a","year":2020},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.840503Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:6b1c0c5658d91c7dadef34a6af1ceccde09f8180008e79a607e4ae75c0da84d3","observation_id":"32ff2a15-81ca-4862-b825-8a685b2e56dc","resolution":{"observed_at":"2026-08-09T21:05:05.177391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.164790Z","title":"Mart´ınez and B","venue":null,"work_id":"d6c3cea3-9de6-4d8a-a479-746a0ea0461d","year":2003},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.843180Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:15065fbc44e5d14f5d98c782e252943678e8dd6896d322fce2fe95fd5e2f4055","observation_id":"e3e83f87-8d6b-4a90-9609-b75f3dc26649","resolution":{"observed_at":"2026-08-09T21:05:05.167823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00874","last_updated":"2023-11-01T22:00:44Z","snapshot_observed_at":"2026-07-06T16:41:56.099361Z","submitted_at":"2023-11-01T22:00:44Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints","version":1},"cited_work":{"arxiv_id":"2311.00874","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.00874","snapshot_observed_at":"2026-08-09T21:05:04.992635Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints","venue":"math.OC","work_id":"13c767f1-4755-42d3-bef7-35d3a3a63583","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.845527Z"},"links":{"cited_paper":"/paper/2311.00874","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:1cdd8a3a73e0a734692416b29e742b7d1d76b7607b11dc89340da1c38d5b4962","observation_id":"2afc5e96-421a-4736-8f4e-431d143840b4","resolution":{"observed_at":"2026-08-09T21:05:04.998526Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.155388Z","title":null,"venue":null,"work_id":"78fa6a46-87ba-49cc-b8ac-92d2ccac71fc","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.848682Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:a0a9522e2376a84c7a66e62c2a1589e71a16da0f26a26555e7d5c66e9e7cd2fa","observation_id":"15d7001c-041e-47ac-a090-259898475070","resolution":{"observed_at":"2026-08-09T21:05:05.158636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:04.851783Z","title":"Nocedal and S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.851783Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:54a80dfb3abcf53621ff36b801c0621559f24cfc1d27a7138f03427aa8b6a12f","observation_id":"ee25e9f4-797b-488f-a7af-5a5f8b1446d5","resolution":{"observed_at":"2026-08-09T21:05:04.851783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.140837Z","title":null,"venue":null,"work_id":"5880d9c4-188c-431e-a4dd-508c6eb3d546","year":1989},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.854790Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:a003f6cdb5e03087ae0ab9bd41cf8dcf3fdece42ed663ed41e9894e247f13dc1","observation_id":"ebc35e75-a5e1-45db-93bf-27e0d157d821","resolution":{"observed_at":"2026-08-09T21:05:05.143964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.132593Z","title":"Polyak, A general method for solving extremum problems , Soviet Mathematics","venue":null,"work_id":"26129850-70ba-438d-93e1-492f9cc42b8d","year":1967},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.857861Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:cecb53be3932378e45726abbd5492b696633174a61bfce73a68e3b15fe5cf2ca","observation_id":"76d32367-e440-49b9-a1be-b0216df97a20","resolution":{"observed_at":"2026-08-09T21:05:05.135535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.124914Z","title":"Rigollet and X","venue":null,"work_id":"61a0ee0e-9838-4992-a743-f01e4e8d4f86","year":2011},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.860777Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:382c7aaf07e24a84b79b8876c4e4f9f8cba5885adb74fc7c7fe5730337a393c6","observation_id":"7ef0ceb6-0ce9-437c-82f8-04a64ff7911c","resolution":{"observed_at":"2026-08-09T21:05:05.127846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.116703Z","title":null,"venue":null,"work_id":"9bf52570-6811-418e-98d7-a9a8fa331bd1","year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.863540Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:cc98bb57cf0fc3ba8da87477f78785fa2b2cb5929229273b520dfaee7a4cf9cf","observation_id":"88a4fc50-a322-4204-aa0b-8084c45aeb62","resolution":{"observed_at":"2026-08-09T21:05:05.119709Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.107869Z","title":"Tatarenko and A","venue":null,"work_id":"2702ef02-4053-4573-b478-999d1703ca5b","year":2021},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.866727Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:478e97d2229914b87dffd06c6e83aacf34c32fa68545bb1ed5fdb80f8b36cfeb","observation_id":"0f9bb5bd-e082-4fd5-a85c-117861d74673","resolution":{"observed_at":"2026-08-09T21:05:05.110943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.098582Z","title":"Vogel, A","venue":null,"work_id":"7a9a0e6e-71fa-4a87-ac05-e13f5ff1bf55","year":2021},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.869998Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:46e2d3e786b0d2d502591c7264a3d7d15e8142df3efaa747f90d7505b77b7026","observation_id":"e2ce8614-be8c-455d-b2ed-21db24dfecfe","resolution":{"observed_at":"2026-08-09T21:05:05.101835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.089809Z","title":"W ang, S","venue":null,"work_id":"2a9bb7b6-0d62-47ec-9cc2-7b5b395477a0","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.873135Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:a2973037b7ad92e5d6574362dbce8cc2cec2d0f2b7cfa961307e89a5c626efd8","observation_id":"9cda3e83-ed26-4429-82cc-54ceb93f49eb","resolution":{"observed_at":"2026-08-09T21:05:05.093375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09438","last_updated":"2024-04-15T03:50:47Z","snapshot_observed_at":"2026-08-10T07:37:20.803941Z","submitted_at":"2024-04-15T03:50:47Z","title":"Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.09438","snapshot_observed_at":"2026-08-09T21:05:04.876118Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.876118Z"},"links":{"cited_paper":"/paper/2404.09438","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:775096a671dc578134b7b11f4b590b30a5e428bd4b8f44801e6cc25de2412137","observation_id":"0708bae1-510b-4758-84c8-f77a0c44da04","resolution":{"observed_at":"2026-08-09T21:05:04.876118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.079586Z","title":"Xu , Primal-dual stochastic gradient method for convex programs with many functional constraints, SIAM Journal on Optimization, 30 (2020), pp","venue":null,"work_id":"25314d48-9ce4-49c4-867f-77ec6a9df2df","year":2020},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.879635Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:76d9d65e83d082ea2e925e7ee9600559ffdf0c75888f5647d077c9b60815609a","observation_id":"e7b3ccbb-47ae-43e6-900b-7dea4790abdb","resolution":{"observed_at":"2026-08-09T21:05:05.083378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.069837Z","title":"Xu, First-order methods for constrained convex programming based on linearized augmented Lagrangian function, INFORMS Journal on Optimization, 3 (2021), pp","venue":null,"work_id":"de1ab461-479f-4a1b-895f-35660e857807","year":2021},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.882786Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:48adc121cf4fc667a7a585cbf9a26dbee438d7d124df38c040f46ac1c2d0b130","observation_id":"18e17ce6-4ee8-42f3-9d18-d1b4320b45e8","resolution":{"observed_at":"2026-08-09T21:05:05.073068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.061152Z","title":"Yan and Y","venue":null,"work_id":"5c23e714-e8b1-4e72-9dab-79af59056e89","year":2022},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.885741Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:f6a221055a0fbd13d1b0649e4c8e44dd1f8144030cc6dbf71d62914930bac4dc","observation_id":"b6f2477c-0e8a-438c-85ba-6d1de006a338","resolution":{"observed_at":"2026-08-09T21:05:05.064150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:04.888722Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.888722Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:1bf84a71c7d8381de6e68462f72a6e07802a2d0eafe57472d2edd99a02874b94","observation_id":"5549d7b7-b969-4018-8c37-fa74951ac1a1","resolution":{"observed_at":"2026-08-09T21:05:04.888722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.052115Z","title":null,"venue":null,"work_id":"14add060-bf19-4075-a819-1bf72761e886","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.891587Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:c6a80f20d2a1b0502be46905b8dce82b7a375fc4b1524c761d958fb475ec6afd","observation_id":"9c23c877-48cf-4f75-86fb-f28d5c10c8bf","resolution":{"observed_at":"2026-08-09T21:05:05.054874Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.042797Z","title":"Yu and M","venue":null,"work_id":"0423f589-afad-4396-b57e-cdabb8feb96b","year":2017},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.894271Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:f0e284bf377a39428beb572970343214d71b42c141520c8c9e42aeffeea50fdf","observation_id":"daed40f2-c19c-41ed-af50-5bf398398883","resolution":{"observed_at":"2026-08-09T21:05:05.046035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:05:05.033521Z","title":"Zhang and L","venue":null,"work_id":"ced8e13d-56f6-48dd-9c11-89b0b91bdf35","year":2022},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.897056Z"},"links":{"citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:2d21d8e20c131e20b29397c39b1b4af8cf4dd21c8b8aeb318ae6bcf8bb9ac21f","observation_id":"137e1487-a76d-448b-a9e4-083ca0ef276a","resolution":{"observed_at":"2026-08-09T21:05:05.036462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T01:11:55.196808Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":2,"verified_fuzzy":38},"total_outbound_references":65},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 5 inbound Pith citation observations for arXiv:2501.19214."}