{"as_of":"2026-08-10T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4d25c0ebd2e93c6ddfbb71e47295a621ed8ed5b180ca89e3d2966b22c5f3c8f","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:22:50.456707Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.19382/citation-record","integrity":"/paper/2505.19382/integrity","json":"/paper/2505.19382/citation-record.json","paper":"/paper/2505.19382"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.00712","last_updated":"2023-03-21T23:49:49Z","snapshot_observed_at":"2026-07-06T13:16:32.021229Z","submitted_at":"2022-06-01T18:49:50Z","title":"An Adaptive Sampling Sequential Quadratic Programming Method for Equality Constrained Stochastic Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00712","snapshot_observed_at":"2026-08-07T14:22:48.779034Z","title":"An adaptive sampling sequen- tial quadratic programming method for equality constrained stochastic optimization.arXiv preprint arXiv:2206.00712, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:48.779034Z"},"links":{"cited_paper":"/paper/2206.00712","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:39098bb844eb8915caeace0e0446cb62693a4d9394d38ade0d51a70635c26627","observation_id":"c2f169b0-94b4-4b8d-91e5-2f8b325db40a","resolution":{"observed_at":"2026-08-07T14:22:48.779034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:22:48.889585Z","title":"Sequential quadratic optimization for nonlinear equality constrained stochastic optimization.SIAM Journal on Optimization, 31(2):1352–1379, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:48.889585Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ab5bdc9a63e075d8eb1a83ac086e2bd25b23fc2e58a74cdd0203b6cc642ef811","observation_id":"b57bc0e7-97d3-40a5-a0fa-3e9743663cdb","resolution":{"observed_at":"2026-08-07T14:22:48.889585Z","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-07T14:22:52.162291Z","title":null,"venue":null,"work_id":"76de7237-51ea-492b-9ad0-08d8a1eaf5df","year":2025},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:48.974000Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:8f3cb05b9e3580c7433241484644d0ca5053334289bb3127347446c2c994395a","observation_id":"955b5747-ba4d-480d-bcf5-5f99b4fbc7ff","resolution":{"observed_at":"2026-08-07T14:22:52.169791Z","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-07T14:22:52.134570Z","title":"Athena Scientific, Belmont, Mas- sachusetts, 2009","venue":null,"work_id":"d8b93a25-60a1-4186-891c-4437c700ca07","year":2009},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.116162Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:0940af30486bb55a4e99dc9b3dea1c6ff7fda62fea73c24b1014d73e75b73f1f","observation_id":"2b7047a4-7d12-4333-8408-b0b054efdab8","resolution":{"observed_at":"2026-08-07T14:22:52.142882Z","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-07T14:22:52.102720Z","title":"Adaptive sampling strategies for stochastic optimization.SIAM Journal on Optimization, 28(4):3312–3343, 2018","venue":null,"work_id":"156b6203-8545-472b-9978-783e168eba4f","year":2018},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.291908Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:d76f0ef534c4cda34ac37f85f1e36a05949d063fb7145069c9fbd0b564719792","observation_id":"80ebdc64-4956-4b06-a7f4-74c2dc6d70b9","resolution":{"observed_at":"2026-08-07T14:22:52.115202Z","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-07T14:22:52.076742Z","title":"A robust sequential quadratic programming method","venue":null,"work_id":"a3186786-9257-42b7-9cf4-5bc518c6cef1","year":1989},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.406755Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:fa2ccdb19a7f39582d3375fda2ac2a12b147ca25834540a7a704434a1adcdddc","observation_id":"2b8641fc-9b58-49af-8d57-42389fbc4482","resolution":{"observed_at":"2026-08-07T14:22:52.087174Z","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-07T14:22:52.053826Z","title":"Sample size selection in optimization methods for machine learning.Mathematical programming, 134(1):127–155, 2012","venue":null,"work_id":"c5008ddf-9972-41c4-9269-31098db5e474","year":2012},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.525694Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:9ed8e477251c6112e45d1f9bc5b20e8bbd92d4fce1294cf6315f83d5bb8fa20e","observation_id":"75ed7f40-cf7e-42bb-8f30-1214d98da453","resolution":{"observed_at":"2026-08-07T14:22:52.061491Z","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-07T14:22:52.026828Z","title":"An inexact sqp method for equality constrained optimization.SIAM Journal on Optimization, 19(1):351–369, 2008","venue":null,"work_id":"b38dce46-fcd4-4399-a2ba-ec8419951075","year":2008},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.604567Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:b5326430ef564aed0c5712459ffac48c17106ab292ccf1d15163bad1b80ab4a8","observation_id":"a065c8e4-fbad-4a61-b8be-2c9c628aa949","resolution":{"observed_at":"2026-08-07T14:22:52.037504Z","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-07T14:22:51.999002Z","title":"An inexact newton method for nonconvex equality constrained optimization.Mathematical programming, 122(2):273–299, 2010","venue":null,"work_id":"400545c1-ac93-4027-b5f7-ba9b6779c112","year":2010},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.681444Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:2fbc3ac5a0117efeacb73d2650472c8d0118ff2e78b97f8b0beb13d1d73d9ec8","observation_id":"dae239cf-c8cf-4ceb-a28d-651794562055","resolution":{"observed_at":"2026-08-07T14:22:52.010663Z","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-07T14:22:51.974633Z","title":"On the global convergence of trust region algorithms using inexact gradient information.SIAM Journal on Numerical Analysis, 28(1):251–265, 1991","venue":null,"work_id":"c5877d35-bd3a-4500-8726-8182c1b4dcfd","year":1991},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.780439Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ecd2a52ed3e8c1f40a2b23fa7621a0856732bdc325db1e4de2ec58efa5fd9b05","observation_id":"02b1f323-0389-4437-9e4e-b387e6be2ea7","resolution":{"observed_at":"2026-08-07T14:22:51.982416Z","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-07T14:22:51.954669Z","title":"LIBSVM: A library for support vector machines.ACM Transactions on Intelligent Systems and Technology, 2:27:1–27:27, 2011","venue":null,"work_id":"eccc29bf-d319-4e92-b011-8cf3babfb9bd","year":2011},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.897731Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:107895604761e786cf2f5525ca9a03faa4ab84241c63681cd1995101f73fca18","observation_id":"db3ef752-635d-426f-af62-ce7bef19992d","resolution":{"observed_at":"2026-08-07T14:22:51.961356Z","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-07T14:22:51.938564Z","title":"Constraint-aware deep neural network compression","venue":null,"work_id":"d093cfd8-0f71-47dc-847b-052a733a4794","year":2018},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:49.946890Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:807cb3a67f7137a13077b8c0a98d32de168bb9c5f77c2fa52f500fcfce124356","observation_id":"b72dc28e-b2fd-4ed9-881b-959d9e3078b2","resolution":{"observed_at":"2026-08-07T14:22:51.943820Z","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-07T14:22:51.915954Z","title":"Retrospective approximation algorithms for stochastic root finding","venue":null,"work_id":"a377b5d9-b341-4cad-b11b-1dd2e00ce2af","year":1994},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.031858Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:e55b0d115121fe8f8fb83070300abf4ae4a58657f43d8512112c8d8003b262aa","observation_id":"7ede0d10-ff2e-44c5-be21-59e1a97c3428","resolution":{"observed_at":"2026-08-07T14:22:51.924989Z","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-07T14:22:51.893279Z","title":"Stochastic root finding via retrospective approximation","venue":null,"work_id":"44e0e55c-f59d-4dc1-ba04-51135d515b33","year":2001},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.052242Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:6e087581c63c5d216a9aa5e2fa3ac9386d93d5f9f28563768c94103fb4a46bb3","observation_id":"eea2951c-38eb-4e12-b7ad-6b01eae39a90","resolution":{"observed_at":"2026-08-07T14:22:51.899489Z","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":"2502.11302","last_updated":"2025-02-16T23:02:37Z","snapshot_observed_at":"2026-08-07T18:14:11.086408Z","submitted_at":"2025-02-16T23:02:37Z","title":"An Interior-Point Algorithm for Continuous Nonlinearly Constrained Optimization with Noisy Function and Derivative Evaluations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11302","snapshot_observed_at":"2026-08-07T14:22:50.065483Z","title":"An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.065483Z"},"links":{"cited_paper":"/paper/2502.11302","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:b0773f997a86f06f0314f6e12faa6a3822699347f1fdf89b85c15e7133728aa7","observation_id":"44590deb-0cc0-46af-b6e2-4dba4f2a681a","resolution":{"observed_at":"2026-08-07T14:22:50.065483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.16186","last_updated":"2024-08-29T00:50:35Z","snapshot_observed_at":"2026-08-10T11:33:44.720282Z","submitted_at":"2024-08-29T00:50:35Z","title":"Single-Loop Deterministic and Stochastic Interior-Point Algorithms for Nonlinearly Constrained Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.16186","snapshot_observed_at":"2026-08-07T14:22:50.074692Z","title":"Single-loop deterministic and stochastic interior- point algorithms for nonlinearly constrained optimization.arXiv preprint arXiv:2408.16186, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.074692Z"},"links":{"cited_paper":"/paper/2408.16186","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:0ec527848405f8be28b3b331e738b45964a12de865d39a82a275c0a0a782e6c8","observation_id":"a9310e9d-60b3-4a52-81f8-cca477b5de05","resolution":{"observed_at":"2026-08-07T14:22:50.074692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14907","last_updated":"2024-03-13T18:34:31Z","snapshot_observed_at":"2026-08-09T21:02:37.059307Z","submitted_at":"2023-04-28T15:30:43Z","title":"A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems","version":3},"cited_work":{"arxiv_id":"2304.14907","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.14907","snapshot_observed_at":"2026-08-07T14:22:50.751778Z","title":"A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems","venue":"math.OC","work_id":"418f0c12-e422-4611-8fe4-7ae4cfe7fb21","year":2023},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.082353Z"},"links":{"cited_paper":"/paper/2304.14907","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:b00137195eb973a79c20280fa7ddb517d7973b6f5c5d5fd31c48855de69ba0bc","observation_id":"89896f87-fff2-4bca-b8e2-3d58e140ef0f","resolution":{"observed_at":"2026-08-07T14:22:50.759413Z","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-07T14:22:51.873494Z","title":"A matrix-free algorithm for equality constrained optimization problems with rank-deficient jacobians.SIAM Journal on Optimiza- tion, 20(3):1224–1249, 2010","venue":null,"work_id":"42213e6e-8090-4048-b3f7-3e3d808d7f33","year":2010},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.092989Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:46964d2ebd88871d1b6290748f339d14327ff09649ba352ac4e1483eb3207b24","observation_id":"c681b517-7407-4103-81b5-6bfe50f14b09","resolution":{"observed_at":"2026-08-07T14:22:51.879537Z","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-07T14:22:51.851876Z","title":"Worst-case complexity of an sqp method for nonlinear equality constrained stochastic optimization.Mathematical Programming, 205(1):431–483, 2024","venue":null,"work_id":"449891e9-6250-4bed-a254-b29bb30c20aa","year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.100258Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:394207ac366d1d73821110c14cf0c1a73dc520821630de8648cccf8beb7ad8ad","observation_id":"81699343-a910-4a87-a6f4-1f295051f021","resolution":{"observed_at":"2026-08-07T14:22:51.859083Z","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":"2107.03512","last_updated":"2021-07-07T22:47:54Z","snapshot_observed_at":"2026-08-10T01:40:29.497698Z","submitted_at":"2021-07-07T22:47:54Z","title":"Inexact Sequential Quadratic Optimization for Minimizing a Stochastic Objective Function Subject to Deterministic Nonlinear Equality Constraints","version":1},"cited_work":{"arxiv_id":"2107.03512","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.03512","snapshot_observed_at":"2026-08-07T14:22:50.719890Z","title":"Inexact Sequential Quadratic Optimization for Minimizing a Stochastic Objective Function Subject to Deterministic Nonlinear Equality Constraints","venue":"math.OC","work_id":"f1234377-439f-4f61-a322-be8c5b4f2c4f","year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.107838Z"},"links":{"cited_paper":"/paper/2107.03512","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:597df36e7e063d2cfa1073a1187a337ddd7340bb74569a18f06d2a2a5b45b0b1","observation_id":"42ae1c29-fb9e-477b-af0c-17d707ee1cf9","resolution":{"observed_at":"2026-08-07T14:22:50.727289Z","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-07T14:22:51.834389Z","title":"Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints.SIAM Journal on Optimization, 34(4):3592–3622, 2024","venue":null,"work_id":"7fd6eb0d-c1a2-49b7-a72c-0be7d395cad6","year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.115053Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:112db9463433658b4b332a29a6e9a9cfae203e42c47e3691eec988f84083dce0","observation_id":"21cd4d43-6783-4ac7-be18-2cd2773ef090","resolution":{"observed_at":"2026-08-07T14:22:51.840369Z","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-07T14:22:51.803918Z","title":"Variable-number sample-path optimization.Mathematical Programming, 117(1-2):81–109, 2009","venue":null,"work_id":"fc13ba9d-635f-4a12-87ce-66b1cc65954d","year":2009},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.121683Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:43380a0cc41b94cd2fdb19c0f9adf7bcd62d2d6ea1ca9f2f6d5ce0a5bdc1e69a","observation_id":"1b59b7dd-422b-4d5c-846d-c59e8038110e","resolution":{"observed_at":"2026-08-07T14:22:51.810498Z","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":"2405.11400","last_updated":"2024-05-18T21:58:40Z","snapshot_observed_at":"2026-07-06T18:16:15.861891Z","submitted_at":"2024-05-18T21:58:40Z","title":"On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11400","snapshot_observed_at":"2026-08-07T14:22:50.128296Z","title":"On the convergence of interior-point meth- ods for bound-constrained nonlinear optimization problems with noise.arXiv preprint arXiv:2405.11400, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.128296Z"},"links":{"cited_paper":"/paper/2405.11400","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:1c51ae0470ddee31b55e44ecb89f7b5869621d4c4c149d4a0fe240aaaefbab73","observation_id":"91573312-2f6a-4915-b5f1-a255585d08cb","resolution":{"observed_at":"2026-08-07T14:22:50.128296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:22:50.135214Z","title":"Benchmarking optimization software with performance profiles.Mathematical programming, 91:201–213, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.135214Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:5b13df093363000c59f01afd2477115e5687dfae4ac9cfbede29ac580d56f498","observation_id":"d2c9fa68-3f8f-4831-b9e6-f5e6aa17ab7c","resolution":{"observed_at":"2026-08-07T14:22:50.135214Z","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-07T14:22:51.757778Z","title":"Fully stochastic trust-region sequential quadratic programming for equality-constrained optimization problems.SIAM Jour- nal on Optimization, 34(2):2007–2037, 2024","venue":null,"work_id":"6be5d7b3-f5cc-4cf0-9124-36eb34235f76","year":2007},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.141792Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:079787e40d227884ae7bc7744e493eca3101949e04a1e8c8c3940a03cbb45748","observation_id":"73a2ca97-25e4-4adc-be72-c066e1e29de6","resolution":{"observed_at":"2026-08-07T14:22:51.771328Z","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-07T14:22:51.734643Z","title":"Hybrid deterministic-stochastic methods for data fitting.SIAM Journal on Scientific Computing, 34(3):A1380–A1405, 2012","venue":null,"work_id":"0eec23c7-12bf-449c-8b37-b9a4c4a1537b","year":2012},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.146901Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:5010996d77c4618a7e123e4cc8ef5759b9f2e38f103f7574bc09eefeb0240b7e","observation_id":"30a77844-2a11-41c0-b94e-4d7b9cbfd64e","resolution":{"observed_at":"2026-08-07T14:22:51.740994Z","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-07T14:22:50.152021Z","title":"Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization.Mathematical Programming, 155(1- 2):267–305, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.152021Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:e4a5241ae474f6fecbab2e12f63c682456202ea906e0a44904ff0aad15060356","observation_id":"c5cf4aa1-bc2f-48ed-856f-da6ce9aefd78","resolution":{"observed_at":"2026-08-07T14:22:50.152021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07812","last_updated":"2024-07-10T16:32:21Z","snapshot_observed_at":"2026-07-06T18:44:20.262496Z","submitted_at":"2024-07-10T16:32:21Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","version":1},"cited_work":{"arxiv_id":"2407.07812","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.07812","snapshot_observed_at":"2026-08-07T14:22:50.647068Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","venue":"math.OC","work_id":"08d6325f-4221-40b2-9dab-366803be82f7","year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.157210Z"},"links":{"cited_paper":"/paper/2407.07812","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:03f1dfcffa19b1d7a156b4342c7aa77b998563d1c3d04bccf8073aa66bf4d4cb","observation_id":"ea9fbf47-64d6-46dd-a0cc-8099008cae6d","resolution":{"observed_at":"2026-08-07T14:22:50.655890Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:22:50.162871Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.162871Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ef2e1a745ea3d185cc40fae67f436e87dddb21ad4ca3ad2a17c730dadf9ffd67","observation_id":"ddc9671f-0d8d-4d0c-950b-faab03e76678","resolution":{"observed_at":"2026-08-07T14:22:50.162871Z","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-07T14:22:51.682223Z","title":"A globally convergent method for nonlinear programming.Journal of opti- mization theory and applications, 22(3):297–309, 1977","venue":null,"work_id":"2f74e109-ab2e-481b-87d5-6b84c629d204","year":1977},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.170023Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:91427a1fce28566b177edfe908d6ae9dc7ff849b4bcec8015f3f4dea78f25e6f","observation_id":"b63f6c63-b0c2-4985-9deb-832ad5229cd1","resolution":{"observed_at":"2026-08-07T14:22:51.689766Z","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-07T14:22:51.661347Z","title":"eg-vssa: An extragradient variable sample-size stochastic approximation scheme: Error analysis and complexity trade-offs","venue":null,"work_id":"199ff799-642d-49c9-be48-1a06eabce413","year":2016},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.180876Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:904f2475131b930ed18dc72eb6af4c1c7152d910c788f9f9ae09f030be727134","observation_id":"68c7337d-9cb0-4a04-99ba-cb08dc75b0cc","resolution":{"observed_at":"2026-08-07T14:22:51.668163Z","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":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-07T14:22:50.186814Z","title":"End-to-end constrained optimization learning: A survey.arXiv preprint arXiv:2103.16378, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.186814Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ba0dacb901665b3c0d411523df958cec4bc87ada9d62f62f0edeb437e39b699f","observation_id":"894072b8-6bd7-449d-b58b-d6c69986da44","resolution":{"observed_at":"2026-08-07T14:22:50.186814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:22:50.193166Z","title":"An optimal method for stochastic composite optimization.Mathematical Programming, 133(1-2):365–397, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.193166Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:6d66a76b86723f742c7399f2050d15e483cf6b5a27df191990e411a1acbbdb9e","observation_id":"b8e8ee99-e0e8-4b7b-9de8-f949f9a7274c","resolution":{"observed_at":"2026-08-07T14:22:50.193166Z","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-07T14:22:51.621649Z","title":"Springer, Atlanta, USA, 2020","venue":null,"work_id":"f0be5324-2ef7-4a98-ad71-0844bf05e0da","year":2020},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.198836Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:c956bc69c2c866a37f7a3b778ac2b10e8b620e93f3cec4077abc024687aaea96","observation_id":"ed336d09-f787-4358-b142-1db9fb282282","resolution":{"observed_at":"2026-08-07T14:22:51.628679Z","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-07T14:22:51.593228Z","title":"A survey on datasets for fairness-aware machine learning.Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 12(3):e1452, 2022","venue":null,"work_id":"b67ac0f9-d979-4247-acb2-d35f09467cb3","year":2022},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.207842Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:f5a92afda33a7318b1788e49f2173046262fd81f83b23c8a00b3306f42b48c3b","observation_id":"7d167401-3194-4d8d-a259-8b1032b6185d","resolution":{"observed_at":"2026-08-07T14:22:51.603297Z","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-07T14:22:50.214432Z","title":"A survey on bias and fairness in machine learning.ACM computing surveys (CSUR), 54(6):1–35, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.214432Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:2423ea69d5f2751c4fd77f7592666e7cd83e9154072d11da7527e9d2857e7259","observation_id":"9e7403f6-09f8-453f-bfdb-fb56ad7d68c3","resolution":{"observed_at":"2026-08-07T14:22:50.214432Z","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-07T14:22:51.538034Z","title":"An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians.Mathematical Programming, 199(1-2):721–791, 2023","venue":null,"work_id":"6c114c36-d9c5-4a32-8677-34f72b4fdc9a","year":2023},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.220146Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:3ed8963ef6fb59e7c3f6b086d56bb015236119dcafba6cf03cc206e6a60df1b9","observation_id":"b59302b7-4c11-425c-a722-2b41ef64ccc8","resolution":{"observed_at":"2026-08-07T14:22:51.547785Z","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-07T14:22:51.511514Z","title":"Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming.Mathematical Programming, 202(1):279–353, 2023","venue":null,"work_id":"bc3a3142-b604-4bf2-b96b-f4acc5efeff4","year":2023},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.225118Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:636e6c9b11bf0562bbae01f6db868a9b9e220452fae64ff828f2ae3746468d91","observation_id":"4c027621-911a-41d5-8b67-178fd016fcd8","resolution":{"observed_at":"2026-08-07T14:22:51.518663Z","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-07T14:22:51.489701Z","title":"A primal dual formulation for deep learning with constraints.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"85465016-e69e-4ee7-b46a-bef65a148c31","year":2019},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.232209Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:23e0698c93ae30ce4386ef19912b7233a7ca9992b7e062b5897ea5a38c90ece7","observation_id":"313e5f50-2b28-4b86-9232-45c0f842d787","resolution":{"observed_at":"2026-08-07T14:22:51.497494Z","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-07T14:22:51.468365Z","title":"PhD thesis, Purdue University, 2023","venue":null,"work_id":"5ff7aaa1-9d36-4279-81e4-ea8edb3bbf07","year":2023},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.238322Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:3b32ed85de2538ae385195c7592961a433f4dc50a7d63a34ee7f87d39b0ebeec","observation_id":"939d27d1-3bb4-455d-a676-945df496202a","resolution":{"observed_at":"2026-08-07T14:22:51.476206Z","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-07T14:22:51.444532Z","title":"A retrospec- tive approximation approach for smooth stochastic optimization.Mathematics of Operations Research, 2024","venue":null,"work_id":"c7b355dc-26b2-4b51-a5de-b5cdee29b1a3","year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.245716Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:43ba921d097814ef1cde96ef2ca1b9bf8955f9a83328fa2a6f0dd529cc3fba92","observation_id":"24dd7632-ec68-47c4-b962-805e22c517ec","resolution":{"observed_at":"2026-08-07T14:22:51.452663Z","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-07T14:22:51.418395Z","title":"Numerical optimization 2nd edition springer.New York, 2006","venue":null,"work_id":"8bbfe537-40cf-4f2a-898c-bb19b6ca7c1c","year":2006},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.250805Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:f947bfa8d02ce0b12d926953707050449e6a6129078d3c71e988c567792f9dca","observation_id":"1ac36cd9-0601-40bb-bb6e-27bbafced438","resolution":{"observed_at":"2026-08-07T14:22:51.425622Z","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":"2408.07268","last_updated":"2024-08-14T03:27:48Z","snapshot_observed_at":"2026-08-10T12:41:28.502415Z","submitted_at":"2024-08-14T03:27:48Z","title":"Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07268","snapshot_observed_at":"2026-08-07T14:22:50.255739Z","title":"Fast unconstrained optimization via hessian averaging and adaptive gradient sampling methods.arXiv preprint arXiv:2408.07268, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.255739Z"},"links":{"cited_paper":"/paper/2408.07268","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:1624f5811f901a1a79ff6314ff11815177ac54e3ec095e75f1075b56617d8e55","observation_id":"cfab3a37-0266-43dc-9eba-2d15a5fafc51","resolution":{"observed_at":"2026-08-07T14:22:50.255739Z","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-07T14:22:51.390583Z","title":"PhD thesis, Ph","venue":null,"work_id":"2daaa09e-c2a3-4efb-b764-ba53962678b0","year":1989},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.261778Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:fbac0629d4e2274be6464db79672e59f265e4d23809f2daa3165fca8dd16151f","observation_id":"66754f8c-bfad-48a7-8f15-999121c9484f","resolution":{"observed_at":"2026-08-07T14:22:51.398017Z","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":"2408.16656","last_updated":"2026-05-30T17:53:16Z","snapshot_observed_at":"2026-08-02T03:29:35.710621Z","submitted_at":"2024-08-29T16:00:48Z","title":"A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.16656","snapshot_observed_at":"2026-08-07T14:22:50.267134Z","title":"A two stepsize sqp method for nonlinear equality constrained stochastic optimization.arXiv preprint arXiv:2408.16656, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.267134Z"},"links":{"cited_paper":"/paper/2408.16656","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:c6d69c7c0ef0dd772da15fdc91b167ae7ea4f4432eef8786c149fde266f927f0","observation_id":"a6904e3d-1d50-4efc-8296-3c223b6db872","resolution":{"observed_at":"2026-08-07T14:22:50.267134Z","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-07T14:22:51.368696Z","title":"On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization.Operations Research, 58(4-part-1):889– 901, 2010","venue":null,"work_id":"e6fc300d-7052-41e2-b499-35fc0a6eaf37","year":2010},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.272430Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:182ba323a1581cd34b6ae7a2e7c1c1607ff5210e3ebc398c6d7688080475d59b","observation_id":"5260c917-baea-4f85-9a61-a2d5cdffc231","resolution":{"observed_at":"2026-08-07T14:22:51.375185Z","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-07T14:22:51.349480Z","title":"An introspective on the retrospective-approximation paradigm","venue":null,"work_id":"61189295-ff7a-41bb-8c71-1b62fd7bfd55","year":2011},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.279973Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:28bafed5fbf0219a4dbc4f8080ff6acea0b02510e596a28c1a29d65be0d34d5e","observation_id":"44e61132-ff0d-4693-a6b8-25721ec29234","resolution":{"observed_at":"2026-08-07T14:22:51.354665Z","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-07T14:22:51.323678Z","title":"Adaptive sequential sample average approximation for solving two-stage stochastic linear programs.SIAM Journal on Optimization, 31(1):1017–1048, 2021","venue":null,"work_id":"3bdf2a37-0774-4786-b3fa-06ccb2f553d1","year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.286615Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:389fc0a55541c80eb6be9df1feaa447b615eceb79ef3c2521f2117a2f463e0d5","observation_id":"8a84d6aa-b957-44d5-9994-4f2c4c6d399b","resolution":{"observed_at":"2026-08-07T14:22:51.330120Z","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-07T14:22:51.294456Z","title":"Large-scale portfolio optimization.Management science, 30(10):1143–1160, 1984","venue":null,"work_id":"d8155894-e58a-4019-98e8-91531562f549","year":1984},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.292253Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:01ddab72ba86e61f2de4b556b53a67aefb6fe0620a4b416c5f6e04fdbf92ba80","observation_id":"23de84b9-095f-4274-bf0b-955073fa5443","resolution":{"observed_at":"2026-08-07T14:22:51.308971Z","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-07T14:22:51.271897Z","title":"Optimal control of uncertain systems using sample average approximations.SIAM Journal on Control and Optimization, 54(1):1–29, 2016","venue":null,"work_id":"5c23d6de-712a-400a-95f0-2749a60b23a6","year":2016},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.297077Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:a8fdeeac9772800bb868dabcb851c4ba87c75843b7f66835aa6ffdc424ff1bfe","observation_id":"ebb82a51-464a-4a29-a537-0900fb1b49c1","resolution":{"observed_at":"2026-08-07T14:22:51.279505Z","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-07T14:22:51.252579Z","title":"Efficient sample sizes in stochastic nonlinear programming.Journal of Computational and Applied Mathematics, 217(2):301–310, 2008","venue":null,"work_id":"d5ae269c-de39-4026-8d0c-5c09a45f1fbf","year":2008},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.302627Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:b2ffffa58109582d395a64a1537be36d6f8319cbe178c4fd64f7fed35349f83b","observation_id":"71791e93-5170-4703-8b21-f77dc0b7bc78","resolution":{"observed_at":"2026-08-07T14:22:51.260129Z","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-07T14:22:51.229706Z","title":"A fast algorithm for nonlinearly constrained optimization calculations","venue":null,"work_id":"f0bb100a-8492-466e-bf5c-4a4ba6f7c13f","year":1977},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.309141Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:32733fc2d6e0b60043daa781a4b513d023f60b3d25f41f52306f1ff2f6662caf","observation_id":"3fce529c-eaec-4c09-be8c-14f2168a448f","resolution":{"observed_at":"2026-08-07T14:22:51.237942Z","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-07T14:22:51.201402Z","title":"A recursive quadratic programming algorithm that uses differentiable exact penalty functions.Mathematical programming, 35:265–278, 1986","venue":null,"work_id":"df883eeb-0cf9-496d-b358-dd7823332b85","year":1986},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.314471Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:ac6a88c8f0dd101628642c2f2a657034d403241d1e51407c711116ecd4af3d7f","observation_id":"6d9b852d-38a4-42f9-aacc-b4ba4a751d6b","resolution":{"observed_at":"2026-08-07T14:22:51.210207Z","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":"2302.07947","last_updated":"2024-10-04T04:03:10Z","snapshot_observed_at":"2026-08-09T23:17:06.400516Z","submitted_at":"2023-02-15T21:00:01Z","title":"A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems","version":2},"cited_work":{"arxiv_id":"2302.07947","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.07947","snapshot_observed_at":"2026-08-07T14:22:50.516331Z","title":"A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems","venue":"math.OC","work_id":"3f187672-8bd1-48a1-bcf3-20eb8dd14e84","year":2023},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.320603Z"},"links":{"cited_paper":"/paper/2302.07947","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:36c832cd147f48d84020801b1bd0e8ab6528e5057660c6092a26fc7d8f96e827","observation_id":"b979d275-6955-4722-984e-bb397e645472","resolution":{"observed_at":"2026-08-07T14:22:50.527473Z","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-07T14:22:51.179887Z","title":"Explicitly imposing constraints in deep networks via conditional gradients gives improved generalization and faster convergence","venue":null,"work_id":"dec340ca-f374-4b57-936f-23e87a615403","year":2019},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.342101Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:4f90b7dd0e27dfa1717de072bc02965b671b45a22a9f084aa154aef1486134a7","observation_id":"0cab14b5-40f2-431d-aaf4-ca68e9c375f6","resolution":{"observed_at":"2026-08-07T14:22:51.187480Z","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-07T14:22:51.158831Z","title":"Geometry aware con- strained optimization techniques for deep learning","venue":null,"work_id":"681c494a-14f6-4105-bba1-a15eb1790118","year":2018},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.350748Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:d02c0775b4412a941f246456c61933243837e4f2e645dd29f7f7a166dfb9d76d","observation_id":"386815f6-25e3-4b2b-a408-55ebcc81739c","resolution":{"observed_at":"2026-08-07T14:22:51.164277Z","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-07T14:22:51.139092Z","title":"Optimal design with proba- bilistic objective and constraints.Journal of Engineering Mechanics, 132(1):107–118, 2006","venue":null,"work_id":"3cfd9e63-02ea-4670-9c13-76b70ed7d703","year":2006},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.357729Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:bfbda3de134cf8dbfc8aad1b80dbaf5a7091c9de33d30c585979ed221afaa1ee","observation_id":"b7b31620-5b0f-48a5-8493-3065c81430df","resolution":{"observed_at":"2026-08-07T14:22:51.144991Z","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-07T14:22:51.116744Z","title":"SIAM, Philadelphia, PA, 2021","venue":null,"work_id":"4ca11421-803c-4deb-ba2c-64ac1fa59fc0","year":2021},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.362693Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:4bab198cc2d5e98682429a7f3852ee34ff06dcb53445bf3f73f71fa7ef0c9bef","observation_id":"975b403a-46e3-4469-bb67-af9f6981a060","resolution":{"observed_at":"2026-08-07T14:22:51.123590Z","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-07T14:22:51.095676Z","title":"Stochastic optimal power flow based on conditional value at risk and distributional robustness.International Journal of Electrical Power & Energy Systems, 72:116–125, 2015","venue":null,"work_id":"a84f38b4-d7a7-4071-b483-0e7985d3e20d","year":2015},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.368284Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:7bdf3789471c249659e3d05cc5f5e68e070e2714491f1248eb6a5e3b9b18c4d0","observation_id":"12391e49-d060-4401-b49a-353ae87c98b7","resolution":{"observed_at":"2026-08-07T14:22:51.102701Z","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-07T14:22:51.073367Z","title":"Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, St´ efan J","venue":null,"work_id":"e065192f-5981-4afc-943d-6f0867648bc8","year":2020},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.374803Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:f46c900ac93bedc79df7dee3e541de576a7eba2b4cb8473a4104ce35b996cacd","observation_id":"a8d39b58-dc5b-49fa-a7f1-0bc0b80038ad","resolution":{"observed_at":"2026-08-07T14:22:51.080291Z","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-07T14:22:51.055766Z","title":"PhD thesis, Naval Postgraduate School, 2009","venue":null,"work_id":"c56c91a6-8c16-4c5e-885a-0b32b909afe1","year":2009},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.383793Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:f32dda7e0aed7d56d2d35b2122655b175e0ecddb04d56bbcbbbf991b3147ae0f","observation_id":"3d4a447d-8b92-4db9-9d1f-4c1c1eb4be85","resolution":{"observed_at":"2026-08-07T14:22:51.062567Z","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-07T14:22:51.027662Z","title":"Penalty methods with stochastic approximation for stochastic nonlinear programming.Mathematics of computation, 86(306):1793–1820, 2017","venue":null,"work_id":"ab435647-a442-48a1-9951-0fa7e0aebc4e","year":2017},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.393042Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:7aa573534e15d394998354375c11547e76d37e43225b60f110d4d4e9b9c167e4","observation_id":"7ea1bfa6-590b-4a8d-a75d-4c8b2977f5e0","resolution":{"observed_at":"2026-08-07T14:22:51.036693Z","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-07T14:22:51.004180Z","title":"Physics-constrained machine learning of evapotran- spiration.Geophysical Research Letters, 46(24):14496–14507, 2019","venue":null,"work_id":"217b7e03-2b4c-4171-84cc-888b7ddc4990","year":2019},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.400716Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:596df8d73f02355c0b571400bf2eb8e2b6314312a60077218de8bf8d9159ce79","observation_id":"c8e34ffb-87cb-4b3a-a4ae-8cf14c30a729","resolution":{"observed_at":"2026-08-07T14:22:51.011693Z","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-07T14:22:50.979455Z","title":null,"venue":null,"work_id":"c7faa687-a825-4e63-a2a4-39f6472084dd","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.408312Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:0bae470319bc550a680c2b1507e2a0b2fbbb26714d035933d9cbd1184d686885","observation_id":"f1bbc9b4-7f29-4990-abbb-9b971535ab04","resolution":{"observed_at":"2026-08-07T14:22:50.986903Z","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-07T14:22:50.953342Z","title":"60 Proof.The proof follows a similar procedure to Theorem 2.5","venue":null,"work_id":"ce779890-cbbc-40c1-a2b1-4e85e7011d12","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.416892Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:a88980bb653f924056207dd6d1f4fc9e728ed89362b342802c351a2739ffda39","observation_id":"66cc26b2-e357-474b-9918-4f6445cecadb","resolution":{"observed_at":"2026-08-07T14:22:50.958839Z","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-07T14:22:50.934972Z","title":null,"venue":null,"work_id":"cee2a237-559b-438d-a42a-b4efac0a97de","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.435377Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:6da88857dc0a555cd6b5b503bd8d38bf1e3f8b23d2753883f46ca427c88e5a75","observation_id":"51750600-e8f7-4bfe-9060-4a955ee91148","resolution":{"observed_at":"2026-08-07T14:22:50.941050Z","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-07T14:22:50.909214Z","title":"Proof.The proof follows from the same procedure as Theorem 2.6","venue":null,"work_id":"7b9b7a7d-a296-4783-a43a-53f3d2d41277","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.441571Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:753ff3114e52317ad6014d53c95929a8636fcf17a14597a564f9fbc6f673f2dc","observation_id":"446781f2-31bd-4461-8b51-29de3c8b9f40","resolution":{"observed_at":"2026-08-07T14:22:50.918563Z","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-07T14:22:50.882695Z","title":null,"venue":null,"work_id":"f30d393b-1f3a-4baf-a803-39a3eddf41b5","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.450138Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:3ebe212845c006c6fcdf6bd2dc784f5048fac11c2f9bf75e6e15a9ad0823393b","observation_id":"95f524a2-df61-4180-a77c-52706e56115d","resolution":{"observed_at":"2026-08-07T14:22:50.893148Z","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-07T14:22:50.856748Z","title":null,"venue":null,"work_id":"df8d2525-69a3-4cd4-ac39-583881bcfb6e","year":null},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.456707Z"},"links":{"citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:4a593d96645e2f3f4fbf1c9772ae86fb648d813bc10e19b31cc63cdcda2952a2","observation_id":"d788921e-75db-4880-8025-ac30f7c53604","resolution":{"observed_at":"2026-08-07T14:22:50.864883Z","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"}}],"paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T20:09:41.109986Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":4,"verified_fuzzy":47},"total_outbound_references":69},"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 10 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2505.19382."}