{"as_of":"2026-08-15T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c6fd41aaefe3c13efd39ffb44aa78293a60270d1392114fcdc8a86b578ea910","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:29:53.991954Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2511.20178/citation-record","integrity":"/paper/2511.20178/integrity","json":"/paper/2511.20178/citation-record.json","paper":"/paper/2511.20178"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:29:47.141660Z","title":"Stoc hastic approx- imation beyond gradient for signal processing and machine l earning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.141660Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:211fb0ed539a0fc92a34524d6245dd08b0acc18b2a9ff28215038467f80c91b6","observation_id":"c5496a2b-ff72-4036-a0c5-90565becb7c0","resolution":{"observed_at":"2026-08-03T20:29:47.141660Z","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-03T20:29:47.199954Z","title":"V ariance-reduced decentr alized stochastic optimization with accelerated convergence,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.199954Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:27861cf5902d289296710e25fea851ce57802779457f8a1d04eb7ae78a74f036","observation_id":"d0c39a80-53c0-42be-90e1-1fdf7a8e3b74","resolution":{"observed_at":"2026-08-03T20:29:47.199954Z","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-03T20:29:47.282517Z","title":"Path plann ing in uncertain ocean currents using ensemble forecasts,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.282517Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:9013dd206e3b13f7c50008dbc3c0d2f68a1d3b3716dc45ebcc3224ce494d7ee7","observation_id":"a197afa8-bfa5-4ac9-ad47-4a62585af44d","resolution":{"observed_at":"2026-08-03T20:29:47.282517Z","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-03T20:29:47.382270Z","title":"Se t-membership filtering and a set-membership normalized lms algorithm wit h an adap- tive step size,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.382270Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:183ea997648c453904cc562ef80cb11366a73dbb018d51fc9437ca69177c40e4","observation_id":"e8e11739-e2f6-43c0-8e3a-3719b388ac84","resolution":{"observed_at":"2026-08-03T20:29:47.382270Z","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-03T20:29:47.494389Z","title":"Robust set-membership a ffine- projection adaptive-filtering algorithm,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.494389Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:7e6b543e5055ff6e529a048b73b89b9c5ac7635dca31e1db5e5783dfdf484c7c","observation_id":"f6fea3da-3c1d-427b-9429-b4ba1e80413f","resolution":{"observed_at":"2026-08-03T20:29:47.494389Z","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-03T20:29:47.568238Z","title":"Set-membership adaptive k ernel nlms algorithms: Design and analysis,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.568238Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:a982a039c6c7231ad7aaa24a4e9ba7f1a5b186715076e66f75bc6f180c2405d5","observation_id":"c56ae3d1-50c0-4c80-9673-cc4bd3b8dc75","resolution":{"observed_at":"2026-08-03T20:29:47.568238Z","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-03T20:29:47.634542Z","title":"Stochastic subgradient for c omposite convex optimization with functional constraints,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.634542Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:f75c7dc830fe4f5d3d0ae9126376f32446cd90b5c790735b7684e5b4d1fe6afa","observation_id":"c69002cd-d6a6-482e-9b3a-c10e7b9a2beb","resolution":{"observed_at":"2026-08-03T20:29:47.634542Z","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-03T20:29:47.764378Z","title":"Algorithms for stochastic optimizat ion with function or expectation constraints,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.764378Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:6aa48432546a00209271930314ba6525a9c74bfbe63231b9dce57570b4d57c6e","observation_id":"1fd20dfb-c9da-4247-b617-fc5391a16376","resolution":{"observed_at":"2026-08-03T20:29:47.764378Z","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-03T20:29:47.857929Z","title":"Random minibatch subgradient algorithms for convex problems with functional constraints,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.857929Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:310f7b1bb1548ac5e99fed847d43ce9e51ba4ccee1546866ae3b327b8d4ca019","observation_id":"2d79c8ca-e67b-44f5-8be4-0719402d8d5e","resolution":{"observed_at":"2026-08-03T20:29:47.857929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.03401","last_updated":"2019-06-15T17:08:45Z","snapshot_observed_at":"2026-08-15T01:16:01.545770Z","submitted_at":"2019-06-08T06:56:39Z","title":"Optimal Convergence for Stochastic Optimization with Multiple Expectation Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.03401","snapshot_observed_at":"2026-08-03T20:29:47.956509Z","title":"Optimal convergence for stochast ic optimization with multiple expectation constraints,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:47.956509Z"},"links":{"cited_paper":"/paper/1906.03401","citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:638be27e8bdb9fe4612740eff11a52bbdc5aa963bae78cb4910749a56e58ea29","observation_id":"a1156a5a-892e-4930-9768-6d86c0e8dbf9","resolution":{"observed_at":"2026-08-03T20:29:47.956509Z","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-03T20:29:48.042469Z","title":"Mirror descent and convex optimization problems with non- smooth inequality constraints,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.042469Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:a5dd5b462711e3c44d2b0abddc6ed931e4d374d0669075b3f598dc3e14c6b54e","observation_id":"44afb445-8a42-4f6a-95b6-6f8bc17f4d69","resolution":{"observed_at":"2026-08-03T20:29:48.042469Z","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-03T20:29:48.109677Z","title":"Primal-dual stochastic gradient method for con vex programs with many functional constraints,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.109677Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:68a7b1533891cc542f5a46aef9c2df7ba4df0722e335a500bd7617e65a1060f1","observation_id":"5fd8625a-3636-40c7-a67b-55208e4c3d07","resolution":{"observed_at":"2026-08-03T20:29:48.109677Z","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-03T20:29:48.174320Z","title":"A ran- domized block-coordinate primal-dual method for large-sc ale stochastic saddle point problems,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.174320Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:78abc51c35a661414f147bd132e66d92d5f88d3d7a33b3e3aaa1d4c46f43279d","observation_id":"4dbc9a89-0ee8-4281-8baf-b231eeefc67d","resolution":{"observed_at":"2026-08-03T20:29:48.174320Z","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-03T20:29:48.281140Z","title":"A stochastic primal-dual met hod for optimization with conditional value at risk constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.281140Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:47f9ee2163b48a07c0c9af3888082a63e022eb9932c67ed2ab58cf9eae80e28e","observation_id":"1adb257d-98f9-45a5-ada9-ad9b20783154","resolution":{"observed_at":"2026-08-03T20:29:48.281140Z","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-03T20:29:48.408810Z","title":"Adaptive primal-dual stochastic grad ient method for expectation-constrained convex stochastic programs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.408810Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:068322f5645ae677e1d63ad53f27111c61e15ab6422842d9e5ac89ec32ef4e6d","observation_id":"9a1641f5-0b06-4e9b-8614-989472d613a7","resolution":{"observed_at":"2026-08-03T20:29:48.408810Z","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-03T20:29:48.477207Z","title":"Online convex optimization f or cumulative constraints,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.477207Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:4a7134a1ccdf81111071823be220f784285330b9483a2f9083a808a3e5b4f291","observation_id":"3c6a3c62-f469-4b4b-bf01-e0208883457d","resolution":{"observed_at":"2026-08-03T20:29:48.477207Z","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-03T20:29:48.586145Z","title":"Online convex optimization with s tochastic constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.586145Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:2ef92356b64e3f826626ee5179b2f6169e3a0199023369f10ffc00889790908a","observation_id":"d51a03ad-4379-4b46-8049-0112ed52f45c","resolution":{"observed_at":"2026-08-03T20:29:48.586145Z","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-03T20:29:48.710037Z","title":"Level-set methods for finite- sum con- strained convex optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.710037Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:f1b67dcc0fd4e1b5975e49c71d92e188f405587e61cfb778f83e7d374005fea7","observation_id":"b6afb661-65e7-432e-bd1b-74961e6f9e18","resolution":{"observed_at":"2026-08-03T20:29:48.710037Z","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-03T20:29:48.828093Z","title":"Exact penalty functio ns in nonlinear programming,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.828093Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:945ef032d183633dfadf086421c94da323897bf9c1334d6ab80437c99bb175a7","observation_id":"b0059e3f-e53e-4a9e-891a-bdeffb0a1e74","resolution":{"observed_at":"2026-08-03T20:29:48.828093Z","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-03T20:29:48.955592Z","title":"Some exact penalty results for nonlinear programs and mathematical programs with equilibrium const raints,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.955592Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:b822a664f136abd8e5329bea437cdfaf2491f6fad00113b396ebbe07294f42ae","observation_id":"f8231086-7504-4663-8446-1d683cc0ab3e","resolution":{"observed_at":"2026-08-03T20:29:48.955592Z","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-03T20:29:49.038780Z","title":"Stochastic variance-reduced pro x-linear algo- rithms for nonconvex composite optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.038780Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:556fadd365990422c3e6d7a39ee439caee913b1270f65a3711a8c1c2bc468726","observation_id":"745eb9b6-4183-4e9c-8df5-3c348bb1b37b","resolution":{"observed_at":"2026-08-03T20:29:49.038780Z","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-03T20:29:49.124862Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.124862Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:4159f398c709e1a0f65494ed74c3b1dd0a02f6bc35f3031e2e7e8b7fc07b80b1","observation_id":"1789619c-5396-445d-95a4-42176e611c12","resolution":{"observed_at":"2026-08-03T20:29:49.124862Z","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-03T20:29:49.182272Z","title":"Tracking moving ag ents via inexact online gradient descent algorithm,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.182272Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:f654e9e5b4c4d17de7df3239bf24bad1867c3ff9cc7a3f3654c4fd58597a91d1","observation_id":"4e00c311-93bb-41ef-b1f9-69eed4cea4dd","resolution":{"observed_at":"2026-08-03T20:29:49.182272Z","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-03T20:29:49.311900Z","title":"Sequential quadratic programmi ng methods,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.311900Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:f1f645b4b02265b5505e624e312ae8487ce109b93543860a70d6925dd46f9d0d","observation_id":"0e114189-8663-4617-ae93-0f0105696803","resolution":{"observed_at":"2026-08-03T20:29:49.311900Z","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-03T20:29:49.376339Z","title":"Sequential qu adratic optimization for stochastic optimization with determinis tic nonlinear inequality and equality constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.376339Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:065f2f903ff0d0a7466b6414ee30538dacec5434b85b27b4bab9396d48099d1b","observation_id":"3bb0a197-6d6d-4dbb-809c-f05c2d15c276","resolution":{"observed_at":"2026-08-03T20:29:49.376339Z","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-03T20:29:49.467822Z","title":"High-order optimization me thods for fully composite problems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.467822Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:bae95b931416f0b7f7239b73334d3a53f2f9f885b8230e79e2f2a54a85fe0e6c","observation_id":"b219cb1a-818e-40ba-aeb7-90291e9a4663","resolution":{"observed_at":"2026-08-03T20:29:49.467822Z","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-03T20:29:49.535026Z","title":"Stochastic model-based minimization of weakly convex functions,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.535026Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:79ae3f3c58614845ce3d201001b5d09ab16f3380ada68e43d1fff85725dbe280","observation_id":"cced435a-19b9-4cc5-8c5e-b17e1ed2d105","resolution":{"observed_at":"2026-08-03T20:29:49.535026Z","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-03T20:29:49.590219Z","title":"Penalty methods with sto chastic approximation for stochastic nonlinear programming,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.590219Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:edc1c0c28a3e4ef3f6d0a08539decb05a0c582367e7253b2a836345f2e528425","observation_id":"740f9ab1-f920-4c67-a335-c421185701f0","resolution":{"observed_at":"2026-08-03T20:29:49.590219Z","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-03T20:29:49.667095Z","title":"Penalized stochastic gradient methods for st ochastic convex optimization with expectation constraints,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.667095Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:4922dbf4d184c79453b850b5722bc83c367e0e9b60c4470713694325a6a9583c","observation_id":"845a2168-44bd-4969-88bb-49d95ffe6158","resolution":{"observed_at":"2026-08-03T20:29:49.667095Z","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-03T20:29:49.728550Z","title":"Optimal design of queuin g systems via compositional stochastic programming,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.728550Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:947c308d20dc8fc1d1a546e12ee2ce78d658d3b5340082f9f693fadb8b1ce7bf","observation_id":"1444734a-9c1c-4035-9d5c-f97d75ebabbc","resolution":{"observed_at":"2026-08-03T20:29:49.728550Z","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-03T20:29:49.793730Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.793730Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:de82c30ac2f89aa4852eb26c50f827167ae966df066d73b1c4ea5eea09c5e982","observation_id":"655cad02-9b85-4503-8bcc-13a1abbc19f4","resolution":{"observed_at":"2026-08-03T20:29:49.793730Z","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-03T20:29:49.873923Z","title":"O(log t) projections for stochastic optimization of smooth and strongly convex func tions,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.873923Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:b327739354501a2d8c4ecf8615d81752a628e2903d649ba696abe8454b428e6f","observation_id":"9a3f11d5-7c92-4b96-8931-81e9bf440032","resolution":{"observed_at":"2026-08-03T20:29:49.873923Z","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-03T20:29:49.930012Z","title":"Optimal stochastic strongly convex optimization with a logarithmic number of p rojections,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:49.930012Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:d30dc5793b185e5ea389549d7249808575b5821bc349699e59acbe78815874dc","observation_id":"6af28f51-568b-4173-9453-4aa0daec91b5","resolution":{"observed_at":"2026-08-03T20:29:49.930012Z","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-03T20:29:50.000954Z","title":"Stochasti c gradient descent with only one projection,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.000954Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:8fd7621f1102690a43a2e73407939d134dd7c4a1c94eeeab321bf9e0eca940ad","observation_id":"ee117459-a161-40b3-934d-40f98f4c5a18","resolution":{"observed_at":"2026-08-03T20:29:50.000954Z","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-03T20:29:50.087745Z","title":"A unified variance-reduced ac celerated gradient method for convex optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.087745Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:0ad248c43b886a1fed462b9a94167f885153c5805f2ae5980f8de5dc63340831","observation_id":"04481b31-5bd0-4e6f-999f-0b906c6d47d6","resolution":{"observed_at":"2026-08-03T20:29:50.087745Z","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-03T20:29:50.193114Z","title":"Primal-dual incremental gradient met hod for nonsmooth and convex optimization problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.193114Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:27500a1a36b18122caa3c0d2ccd8d2f3363ad9224b7f6c2ca37b422342295f6b","observation_id":"a4610f50-2b52-4aac-961e-c15ddb017df1","resolution":{"observed_at":"2026-08-03T20:29:50.193114Z","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-03T20:29:50.229858Z","title":"Alm ost surely constrained convex optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.229858Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:c4ca6f4da3a4a60bf7959bda882e86bcf74a5b6bbe440595a269c1031199f609","observation_id":"4542f938-0797-4bae-b10c-43c61fd50215","resolution":{"observed_at":"2026-08-03T20:29:50.229858Z","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-03T20:29:50.323813Z","title":"Convex optimiz ation over intersection of simple sets: improved convergence rate gua rantees via an exact penalty approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.323813Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:3b241b4b07ca8d3a0db4fe06e37c337992a290fc4d366df3a8983ae4ce39eb86","observation_id":"2cac88ef-8af4-481f-a367-99ae6dbde98e","resolution":{"observed_at":"2026-08-03T20:29:50.323813Z","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-03T20:29:50.438435Z","title":"Stochastic first-order met hods for con- vex and nonconvex functional constrained optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.438435Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:67cee6a46b1f36a29ec2b118dde66bcce2cbd480aed7ff03f7973d62ef961c4d","observation_id":"c83aba84-5e1c-4404-98f6-291e2207586f","resolution":{"observed_at":"2026-08-03T20:29:50.438435Z","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-03T20:29:50.543049Z","title":"Conservative stochastic optimization with expectation constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.543049Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:04087668348c89f84451e1a1dfeb96f1541a43527c89a066e51c66e3e069c7dd","observation_id":"1445f090-989c-4aec-9391-5df9bb46b889","resolution":{"observed_at":"2026-08-03T20:29:50.543049Z","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-03T20:29:50.661917Z","title":"Optimizing QOS for erasu re-coded wireless data centers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.661917Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:9420d76cfe17acdcac5c46723bf4bdb9a8bb228dfa7f67e3db18b165ff95fc99","observation_id":"7e480036-758e-4e2a-8638-c7c1e87f2594","resolution":{"observed_at":"2026-08-03T20:29:50.661917Z","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-03T20:29:50.843651Z","title":"Stochastic compositional gradient descent under compositional constraints,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:50.843651Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:dbf12a3ec4cda2b002e5be913035026654372503f15162f9b1495e8d63c4d570","observation_id":"7c3ff43d-ffd9-4380-aac9-503260fb1e27","resolution":{"observed_at":"2026-08-03T20:29:50.843651Z","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-03T20:29:51.003119Z","title":"Minibatch stochastic subgra dient-based projection algorithms for feasibility problems with conve x inequalities,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.003119Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:8b9179c6db4727f9878bbec245a80a1b299c04cfb0ceafe0d982d305e5947a44","observation_id":"14daede8-bffa-4158-8703-64834648067e","resolution":{"observed_at":"2026-08-03T20:29:51.003119Z","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-03T20:29:51.115384Z","title":"Solving non-smoo th constrained programs with lower complexity than O(1/ε): a primal-dual homotopy smoothing approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.115384Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:8bebfcdd875c3e5faac85b483aefe6e3c01ec50d794a2ed5342283e5f0eda5a2","observation_id":"b1032f32-3c9d-4759-b989-13c6b1cd8a1e","resolution":{"observed_at":"2026-08-03T20:29:51.115384Z","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-03T20:29:51.231878Z","title":"A richer theory of convex c onstrained optimization with reduced projections and improved rates,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.231878Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:36bfffe77ab38f9c4e2bd778bba1769d3812a740444c58d8193964bee1dabe91","observation_id":"5bcda29f-fb2b-4b91-8c3e-cf61f361f9e4","resolution":{"observed_at":"2026-08-03T20:29:51.231878Z","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-03T20:29:51.310856Z","title":"Online convex optimi zation with hard constraints: towards the best of two worlds and beyond,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.310856Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:7a0e4de1acdad8112034f87e88f31e33bc3c8377414231569b9e88a152ac20e0","observation_id":"5ab57eea-6372-44c7-85f8-c5dc4bdf3eda","resolution":{"observed_at":"2026-08-03T20:29:51.310856Z","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-03T20:29:51.401532Z","title":"Optimal algorithms for online con vex optimiza- tion with adversarial constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.401532Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:a7940e3a75481f754f123d42c3a1b8b076dbbb5112dd37b263982c8cee93ea99","observation_id":"6d1fafb5-4f8d-422f-aaaf-58942652b558","resolution":{"observed_at":"2026-08-03T20:29:51.401532Z","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-03T20:29:51.482610Z","title":"Decentraliz ed stochastic successive convex approximation for composite non-convex problems with non-linear functional constraints,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.482610Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:e039975d369bb47036ccb22befc7f9843210fd4e943017b0c16898d01dae9c06","observation_id":"70d75ce7-6f62-4efb-ba66-1134945b02a8","resolution":{"observed_at":"2026-08-03T20:29:51.482610Z","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-03T20:29:51.592640Z","title":"Stochastic methods for composi te and weakly convex optimization problems,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.592640Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:0d755dcb5abee4f39e1d277b25151f6d8f841fa183e59ede896cce92d33c82e3","observation_id":"50a8c07a-e094-4e50-ac9c-7ed5a64509f4","resolution":{"observed_at":"2026-08-03T20:29:51.592640Z","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-03T20:29:51.708161Z","title":"Efficiency of minimiz ing composi- tions of convex functions and smooth maps,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.708161Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:2e1a9a3a08151fada2ffba762f3c01821cd6538e3c1435c85a6dfd91e09674ff","observation_id":"801f8269-7278-4b77-939c-5f58046c31ee","resolution":{"observed_at":"2026-08-03T20:29:51.708161Z","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-03T20:29:51.811726Z","title":"A convex framework for fair regression ,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.811726Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:b4a8f8c318df0fb708d9d7fb5a507e9bf46ddeadbb36d1a722c3f570e918789f","observation_id":"1067c3f1-e32c-4122-8c42-6415146ba1ba","resolution":{"observed_at":"2026-08-03T20:29:51.811726Z","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-03T20:29:51.903119Z","title":"Uni- fied analysis of stochastic gradient methods for composite c onvex and smooth optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.903119Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:f2bcec4b36ec23e35cae79fb90abe86bed9a590ca18818a44261c968c4f1d0a7","observation_id":"ffb17629-c035-4418-ac23-2d752fc53b0c","resolution":{"observed_at":"2026-08-03T20:29:51.903119Z","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-03T20:29:51.983107Z","title":"A unified th eory of sgd: V ariance reduction, sampling, quantization and coordinat e descent,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:51.983107Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:6a94d181548cf54b98257f8b7bdb8b44ba50e856b4e108568e95316af3f810c9","observation_id":"bce4e6bf-17e0-4f02-a324-e8aa5cb41094","resolution":{"observed_at":"2026-08-03T20:29:51.983107Z","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-03T20:29:52.071910Z","title":"ProxSkip: Y es! local gradient steps provably lead to communication ac celeration! finally!","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.071910Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:454c60ffdffc268d08d8ec1a761491c37e3c4b2077ad0061cc9ec10bccab3af7","observation_id":"07d2e045-ebed-4ce9-94e8-4fd5cbe92606","resolution":{"observed_at":"2026-08-03T20:29:52.071910Z","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-03T20:29:52.162854Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.162854Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:74a53307de304a8db110a5f0ee93cb96533c066181719ff1a8b889e326f15e5a","observation_id":"5a032e9e-21f3-4ce2-afd1-e11c254bd3be","resolution":{"observed_at":"2026-08-03T20:29:52.162854Z","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-03T20:29:52.209061Z","title":"A svrg: Accelerated proximal SVRG,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.209061Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:69fd4b303eb936c747c5d9a2a310b43f07254cca148f245a1af6bb4c0c2fec72","observation_id":"e1959801-8b4d-4e27-916f-514003fce547","resolution":{"observed_at":"2026-08-03T20:29:52.209061Z","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-03T20:29:52.320451Z","title":"V ariance reduction via acc elerated dual averaging for finite-sum optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.320451Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:d89407145be6ab722fc39f6ec02cfd01e1969f4720e1388a5971f66159bfebff","observation_id":"d68b3470-6413-4210-a2f9-1e20f2052fd9","resolution":{"observed_at":"2026-08-03T20:29:52.320451Z","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-03T20:29:52.425854Z","title":"Iteration complexity of inexact augmented lagr angian methods for constrained convex programming,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.425854Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:15c01958c5e41d795e1a3812ceb65af7f9d180ec17f930055f614b1d47b30f1f","observation_id":"40821dcb-78de-4e9f-ab04-5ac06028b5f2","resolution":{"observed_at":"2026-08-03T20:29:52.425854Z","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-03T20:29:52.567849Z","title":"A level-set metho d for convex op- timization with a feasible solution path,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.567849Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:89793aa03c6ac10eeb28017e95fe218349698ee78f3f8d26f3d0147000386523","observation_id":"63f696f6-9acf-4e91-a1b3-a2905df75277","resolution":{"observed_at":"2026-08-03T20:29:52.567849Z","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-03T20:29:52.697920Z","title":"A simple parallel algorithm with a n O(1/t) convergence rate for general convex programs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.697920Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:687c1580d1da67586554a488e8a05e649d062edb4d435b72e068aefe88a21637","observation_id":"6f894603-d709-42b4-8f08-27c2cb2af1b7","resolution":{"observed_at":"2026-08-03T20:29:52.697920Z","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-03T20:29:52.801366Z","title":"¨Uber das navigationsproblem bei ruhender oder ver¨ anderlicher windverteilung,","venue":null,"work_id":null,"year":1931},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.801366Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:d72f9c1f6bb6b7efcb0063dd14fd02d43e3797345c2c69d42f8cd6019770bd38","observation_id":"6f5e472a-7b96-46e7-8fa8-c985de56f809","resolution":{"observed_at":"2026-08-03T20:29:52.801366Z","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-03T20:29:52.893777Z","title":"(2025) Mercator ocean – ocean forecasters","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.893777Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:4a1fdb152cfa7d4123aefabdc8bcd2825ff9b79528a79fc96a649fe307a23532","observation_id":"55566f04-e38e-47d7-8013-ee47587f9dea","resolution":{"observed_at":"2026-08-03T20:29:52.893777Z","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-03T20:29:52.973915Z","title":"(2025) Copernicus marine e nvironment monitoring service","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:52.973915Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:6b5a9737a4a842105b8b37971b48691e79f4f958aae9cb447d7c213abdb8467a","observation_id":"d7566685-cb1a-49c7-bcdd-99f1368a7892","resolution":{"observed_at":"2026-08-03T20:29:52.973915Z","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-03T20:29:53.077950Z","title":"Planning energy-efficien t trajectories in strong disturbances,","venue":null,"work_id":null,"year":2080},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.077950Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:55ecf515dbf0fd651edc7370a60d1b5c7387bec8b96a7c2fd9c406eb9f188786","observation_id":"8bb1b9b1-199e-445b-8ac1-7dddd5db7274","resolution":{"observed_at":"2026-08-03T20:29:53.077950Z","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-03T20:29:53.211651Z","title":"Set-m embership estimation for complex networks subject to linear and nonli near bounded attacks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.211651Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:80b0db4ae5a1b9cef696de194f0ad909d96049d8bbbe8e3e0b464c538f732d11","observation_id":"df1457f2-449f-41dc-8a57-0e202d95a538","resolution":{"observed_at":"2026-08-03T20:29:53.211651Z","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-03T20:29:53.363770Z","title":"LIBSVM Data Repos- itory, [Online; accessed 8-Sept-2025]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.363770Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:13ead5e130cedd332de42f448840e8f7fb1758a1ae639e31da5c3c8a9f4eda0b","observation_id":"0d8f59de-ec6c-4c9c-b114-e3e925b8124b","resolution":{"observed_at":"2026-08-03T20:29:53.363770Z","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-03T20:29:53.474333Z","title":"(129) Summing over t = 1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.474333Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:af2cbcc1b7b8d9295da315e0ec108317e3d41c14e141c1008afe83a3862daaed","observation_id":"4be83c52-ce53-448b-8a1e-5e196aa67c1f","resolution":{"observed_at":"2026-08-03T20:29:53.474333Z","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-03T20:29:53.641604Z","title":"Now by (125) and (124) we get the SFO and QMO complex- ities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.641604Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:59e6cc0068bb3a73f8bd21f9006d4686e294d6c156d03758ea578b815030919f","observation_id":"0b413c96-5f01-4ea2-96ae-eb6d21200e79","resolution":{"observed_at":"2026-08-03T20:29:53.641604Z","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-03T20:29:53.773699Z","title":"(134) 17 Summing over t = 1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.773699Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:af89ce5543595171992bf1cdfc666f9285044dee9d91fd805b68208f5cdb62ce","observation_id":"9d356945-c938-4432-8eea-020e0dacf1ce","resolution":{"observed_at":"2026-08-03T20:29:53.773699Z","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-03T20:29:53.913356Z","title":"Observe that the parameter setting is same as in the smooth convex case with µ = 0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.913356Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:5b367ce2181e59c1b82104fa312875e0e9284490d2ca405a4dbcc1d1d5993521","observation_id":"83e0077e-f210-4067-8369-9b642d39b722","resolution":{"observed_at":"2026-08-03T20:29:53.913356Z","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-03T20:29:53.991954Z","title":"By multiplying with Γt−1 on both sides of (100), we obtain βs αs Γt−1∆t + Γt 1 2 δz t ≤ βsωs αs Γt−1 ˜∆s−1 + βs αs (1 − αs − ωs)Γt−1∆t−1 + Γt−1 1 2 δz t−1 (139) Summing over t = 1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:53.991954Z"},"links":{"citing_paper":"/paper/2511.20178"},"observation_digest":"sha256:857fbfbdf346b88b42f8eda090e4164ae65c0f736e5251517e0ba33ab6220ccc","observation_id":"5196ea24-c7ea-48f6-96ad-d28c6c626e11","resolution":{"observed_at":"2026-08-03T20:29:53.991954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.20178","last_updated":"2026-07-23T08:13:09Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T13:55:49.098846Z","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":71,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":71},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2511.20178."}