{"as_of":"2026-08-09T06:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd9c096d29e7de2a048876e4c12c3d0dd36dc5a686cea92130b2f9ed0a2ae84f","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-09T05:02:37.513007Z","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:19348b7af1f2816b4b8261e7ecf7adb781ef5e77f8769488cca01719edede458","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-09T05:02:37.513007Z","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:a801af2fb2194caf60fdb58c429f8a9774cee0a4d92300d49be92d81796cab73","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-09T05:02:37.513007Z","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:c5c3253cf12fcae3c3bbb45f71d5cb992a316003275d0865001798916f38b6a6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:f08f824a64bfef56cf6e81e3979a2a853d119adb0d85802ca2a30e6d39f465f0","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:1b2112bb92a3afd46b196937a98ddc00ad7250c5125b64ed0b71e35be1515f78","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:b15bfb81bec58ae24876db2760a609328bdbccc525ca37aa17602cb533febf1b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:22e0e7b6a3742aafb0447a8797ac8e21f4ccd46527f0ab64137cad01dd9641c5","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:c754140e5b82fae81bbc717ac0ecb6c2f37eafe2d5a81b4386717cbd3a19db21","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:3795f932b9871175af5cf8cf73f80c9982826f1d4c88a1df3f53170b8d760696","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:94063e4e265b29803964c1989642524310f65414a9a9a883ea8007c9d3b7a1f8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:3feb067ff3dbcb635bad716ea9a09efbe098d1b15fee34c517dcfc711ef7862e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:932a6cbe6875934dcf973c281e29c353f502be1ff782bba7dfe8fc53ba648e72","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:370d09147a8c116cd256cae0c96927eb7485332af39218ae574aba9aa487d564","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:43e6e62aca4a1ae72ecdad35ee17c0ea0a2a28154a16eb7081053f0454c10ae6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:33d5b3a0781e90f811a35d015accb12191910ed9b4f499b24de4b41d7f78f7ae","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-07-06T19:07:24.816549Z","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-09T05:02:37.513007Z","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:afb77906b7aacda379e5e7a880aa9f38902193ef53671c7a995ce99035e571e3","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-07-06T15:21:15.939061Z","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-09T05:02:37.513007Z","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:7bfc2e90dbc86cfec295ad45ea6fe253090afee413e50ac8e4cbde23ee24f603","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:5a61f1d19bf84c1962a011f6fdef35153bc5879d57856964df5ebe81ab0bf0dd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:d2fc985cafba6d5f9185cb0b8a90faa46665b7c0e5fddec54e88976cf7e1a63b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03512","last_updated":"2021-07-07T22:47:54Z","snapshot_observed_at":"2026-08-07T23:11:48.075442Z","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-09T05:02:37.513007Z","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:de28b1117432da1a36799231e88328afed95a6788937abd76cadd55b0587133a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:f62d0dcf6efe792f0c6f7f15fa9082e29a35360dd106f3ae0ef8bd81f3f6b5f7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:109449a4a1b42bed09cb202528aa47099546456b1d19a031418272b79a323cf4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:a74c12a28121722429e3e5da35db4ae486cd7645cb3ddc476dc7959afe3224f4","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-09T05:02:37.513007Z","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:d16e47e2e6b80ae06f5158320dba29baa2b477b2d8b4d44a758033d5d383024e","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-09T05:02:37.513007Z","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:d850d300290213836838e2807185ed9939843b810df7e117cd84c7a9e998336b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:7480d336d0390cd97c2b381133ea75e6156ef34b1ba16532ee546ec5d771e0bf","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:7f0c3a3b9fd2591cf7b3eacb37b8090afc14da54674eae7cfd32857fa09e9fcb","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-09T05:02:37.513007Z","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:7b30fe25aebf1c1e73e738623eff3cca5bddadacaf88f77fc80dfe03fb7882b6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:a4289849ec6e92d4ffcc812dfa58fd75ae88bfd92559a48af945099f0e7e05ea","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-09T05:02:37.513007Z","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:6d8aa642a9a23da989a54e17658aa59588cf76c8a56209a39a1530731d98f07a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:87a6f951daa2e2512de96885e819c3ef06c689f3fdcbaaa5dccc81fd9e64d19e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:0b6c51a28db734306af2eb9831defaec4b5b030a954604624d7a11c5239005f9","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-09T05:02:37.513007Z","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:30267dfef65bf24773914428c1b183b0be232462c60684d7f52d904e587a20f8","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-09T05:02:37.513007Z","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:c5e6ea6dfd7c4af61be015d96f109fdaa3b3aa785b11cac1361040ff8de4f038","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:4620932af09412f0a6e68e303bf9c6b25a2236bcea8a82352be2c34348a7cecd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:b898ae272b4bf972beb7177894b624ac38f32754931963bab57616548d1f5825","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-09T05:02:37.513007Z","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:17d99323257e01035ccf0e55315713e280f644f8225ce77236e656143ebad75b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:9ab00f9c9316821905cbb7f810d5c3e4f994d39e175f635e6d6ff139fc698e5a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:a680eca95a3505f76cea075e07f3a879bcb4abdf5c1fbdfd22ba1d16953c8911","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:17868d444676bbaf2f69f8ed632efb21ae349b1d2d7f931fce452d6d0b761c0a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:88d66aa60fa9a18ba6a0ef9fe6eff51da06e2510ac4053fff310ee8d172c874e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:bb09a578145a9162b9783111e58cc3c7e9fe979006597152d2d57f7f65ba8e77","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07268","last_updated":"2024-08-14T03:27:48Z","snapshot_observed_at":"2026-08-06T04:58:32.625477Z","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-09T05:02:37.513007Z","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:0fbf81cc4e7cb1747cfab0d4f5debf391893386bfb6885399d5485584b95eb8b","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-09T05:02:37.513007Z","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:1969a74aaa7cdbb018efe79faadd7b7e35749ccd2d8c2c9fe3fb5262b195ee8f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:814de9bf30bb3c4145b04043b78d19310549e1cd4b18e9d6cd9bdd5fc9351948","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-09T05:02:37.513007Z","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:32514650e49dbd437bdf1cc0f3c70f3d9feaa7dd018d6090c7e4b5a2206d00c8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:8cc352b79406b6415ea2c10d7ce416ab72238f26d86d7a9834e9be8254263058","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:7af453bc75eb1fd175f9fab56afd270628cc32f6193793017e0b4fa355f0f107","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:3b30929192406987d7340335e05834648c990581f0ef90321859d5b610204c2e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:1fc864a8615ec8246aadaa1c68271cfe66886b5581814ebb1f26051433d480d5","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:0a48a952df7706782c42042c61d6c6bd6322def84ad3db480b9b196a8e79cbd1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:6397e87fb763101148d4108303da91c586d78dae03d18495a80e418a85126377","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:0fcc4240f61d4bc9324ba4d99776610a0236cf25e0a2c880fdbaf00d2e950312","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07947","last_updated":"2024-10-04T04:03:10Z","snapshot_observed_at":"2026-08-04T14:10:20.784741Z","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-09T05:02:37.513007Z","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:dafe14ca96bd752d2acc2395cf530cb52d39b87688fede9264a6e7a657f7a60f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:f1a92f307197e8619fe9521fa267f43fa928d609a2f59ea04949c588ad04bcda","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:7a9b13dfdfa65d6f50a00fbb6941ee8d2a381ea7746d0945bbf4137dc2ac6521","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:1316fc1e070082a213e21252e1503ea8fc1a3cf355d1a6a199a55e8451ecdba1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:689c8dc76fafc0dcea6bc0b069da2a2b22e1baf99c67ef38ce4f36d0dc07c039","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:c06177ab3c12fb81f6fc8f38f654ad97ac0f04b46079cebc97d15d5e0a946586","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:d740505e1321c70847e05c3c358cb858e64d81bf30ddfe06b4a8f388950c01df","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:d226785cd59f960aa4310ef65c5ebb6ae6ba87fb55008227ef192f30c22047bd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:8e1d50ff338c1588de59991e22a05fd7b243d264ac884611c62bece556525a87","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:a2c5ccdad9f863586c38bf88e564950b060b4c19ad77875bbc911564aca25703","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:6be5d7fb56e135f5fe39a55b986bc222fae50e46305e8188ad9ed89dd8e7163a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:40710aa42ab48771e7cc0fcc35f6adf0778f262097e9ed82eea13408eae56f6a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:aa944b9acf75a2875578602ef78531adb0b760899b5060e53c530e1267c44e7f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:2b684e58f052298154e976780e68bf3071e280598c7ef273fb1c1fba1f0b9058","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:b3784ca73fb10174c7d59acdfda6b48dd0952474d80ba651e0d0e8c2544a36ff","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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:5f4c6dd33ef43ca3e12723d1e1e84566c113d7dccc6684f1c96d9472402b7805","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-09T05:02:37.513007Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2505.19382."}