{"as_of":"2026-08-11T15:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2e5aced098edbf1b27c951ab1d48a3ead0aa32b194a1a4072185fd33256b87b","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T12:17:46.414837Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2604.14368/citation-record","integrity":"/paper/2604.14368/integrity","json":"/paper/2604.14368/citation-record.json","paper":"/paper/2604.14368"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Derivative-free optimization of noisy functions via quasi-Newton methods.SIAM Journal on Optimization, 29(2):965– 993","venue":null,"work_id":"cbf264eb-8033-4851-985d-0f3149a3d503","year":2019},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:abdb9e55cc45ddfe49ffdd8cee503fc899d5a0243e58f8894b4601af98787798","observation_id":"b4c2ce79-2c89-4223-9f4c-0072e84d987a","resolution":{"observed_at":"2026-05-19T11:43:03.836183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"87697f16-7f77-410f-b336-e5db7a60cad7","year":2005},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:49429f0a16542774c0324e06c8e387d1e5918740f78da734bec2794c8ffba228","observation_id":"a34f6e53-2499-4abd-acac-5c592f9e0780","resolution":{"observed_at":"2026-05-19T11:43:03.834290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A robust sequential quadratic programming method.Mathematical Programming, 43(1):277–303","venue":null,"work_id":"69aefd5f-a54b-4139-91f4-36586906f11f","year":1989},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:382cae3a18ddbcee0db5343d1127453d0b30e46ce9cad7d012d5c79834810744","observation_id":"3649d489-7c94-4c7d-88a7-a292e650b05c","resolution":{"observed_at":"2026-05-19T11:43:03.832640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"An algo- rithm for nonlinear optimization using linear programming and equality constrained subproblems.Mathematical Programming, 100(1):27–48","venue":null,"work_id":"3f2f9282-d8e7-4581-9886-8748a53d64d3","year":2003},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:a18bd3a84d3817c3d58cac1a7619ae1852490c6b7075fb3a7700c743116fe031","observation_id":"8f6f5e86-dcf5-4ab3-b517-e90d9f52d691","resolution":{"observed_at":"2026-05-19T11:43:03.821945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A line search exact penalty method using steering rules.Mathematical Programming, 133(1-2):39–73","venue":null,"work_id":"8dc96e42-86c8-4b0b-8cc4-4b073175c58d","year":2012},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:854536af2b72b96dc26d9bcffdd02d951508c55c89aa34ac2ba71b908b325a2c","observation_id":"fd4db11a-7e26-434c-adb3-b853c43d39d5","resolution":{"observed_at":"2026-05-19T11:43:03.828245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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":"2502.11302","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11302","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations","venue":null,"work_id":"1aaa6812-4803-444b-8cea-5b775b1b393e","year":2025},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"cited_paper":"/paper/2502.11302","citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:dcb2852249f13c9e79418affc49b99116557daa102a01d152ad1d365a85a1d58","observation_id":"53d2b8d2-72ff-4608-b6f2-792bfaad04ba","resolution":{"observed_at":"2026-05-10T12:20:22.656292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"An interior-point algorithm for large-scale nonlinear optimization with inexact step computations.SIAM Journal on Scientific Computing, 32(6):3447–3475","venue":null,"work_id":"9e6bca05-88b1-4eb2-9a80-aa79ec1c8e83","year":2010},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:e48ca695de9f98dbc8dab29b9374a491072c2e7999a56442aee102831df32e7c","observation_id":"405fbbb8-6030-46a1-a68c-193657980900","resolution":{"observed_at":"2026-05-19T11:43:03.827562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02943","last_updated":"2025-07-28T06:39:52Z","snapshot_observed_at":"2026-07-06T15:51:00.588745Z","submitted_at":"2023-07-06T12:19:24Z","title":"Stochastic Approximation for Expectation Objective and Expectation Inequality-Constrained Nonconvex Optimization","version":3},"cited_work":{"arxiv_id":"2307.02943","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02943","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic approximation for expectation objective and expectation inequality-constrained nonconvex optimization","venue":null,"work_id":"436a2970-c274-4a8a-be2e-b3aed53f5173","year":2023},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"cited_paper":"/paper/2307.02943","citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:b87199d9d8553c4f753adbc511e3dab98509774e8e15fecf132f5ff0e5107542","observation_id":"07cd7767-8698-4ad1-b3d5-2670319042fb","resolution":{"observed_at":"2026-05-10T12:20:22.653466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"On the stability of general convex programs under slater’s condition and primal solution boundedness.Optimization, 32(4):291–299","venue":null,"work_id":"102ce386-7b9c-462c-ad67-435df1705b5e","year":1995},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:8ade86c825a7ebcd6086d59c3bc296c5c711c4af216bf54b2c98e90e583d28b2","observation_id":"daea8e24-3dd6-4c86-9c9e-2a6082229aee","resolution":{"observed_at":"2026-05-19T11:43:03.829286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A necessary and sufficient regularity condition to have bounded mul- tipliers in nonconvex programming.Mathematical Programming, 12(1):136–138","venue":null,"work_id":"301ef0b2-b30e-4a1c-b70f-fc7135404e9b","year":1977},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:7b350d7588f32a34a967cd75271afa3405c24bf189f67428797969db3ae466c7","observation_id":"72aee4d2-2670-4386-a089-2e3b4608e8bc","resolution":{"observed_at":"2026-05-19T11:43:03.824522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Convergence of successive linear programming algorithms for noisy functions.Computational Optimization and Applications, 88(2):567–601","venue":null,"work_id":"0529269b-989c-4afb-b61e-39a13b4d548b","year":2024},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:d9416d07c86ef29a72d7d41c14f09f615ef3a050cd1901ddad63faa354917f59","observation_id":"af4d8496-34ed-40ea-9fea-028c0ffcebbc","resolution":{"observed_at":"2026-05-19T11:43:03.820013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Solving nonlinear programming problems with noisy function values and noisy gradients.Journal of optimization theory and applications, 114(1):133–169","venue":null,"work_id":"bf1247db-8d12-4c23-b46f-082be047c486","year":2002},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:5e1ae2d175e35fbd2e6934b0230116a257ad2b0cde6ec39920f18f0be2ba1ae3","observation_id":"ed6198d9-bf30-4e4d-8a3f-339938164f07","resolution":{"observed_at":"2026-05-19T11:43:03.831043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15007","last_updated":"2024-10-02T18:39:11Z","snapshot_observed_at":"2026-07-06T17:21:01.918787Z","submitted_at":"2024-01-26T17:08:07Z","title":"Design Guidelines for Noise-Tolerant Optimization with Applications in Robust Design","version":2},"cited_work":{"arxiv_id":"2401.15007","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15007","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Design guidelines for noise-tolerant optimization with applications in robust design","venue":null,"work_id":"6b9f1197-6883-4e29-8f19-93aebecc5ce0","year":2024},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"cited_paper":"/paper/2401.15007","citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:c21bcb613ef467b0227b6cb5a7c6642cef60aaad7af57c15ed73615526a6577a","observation_id":"7346b3a2-7c18-46aa-a1b3-d6892af33d6d","resolution":{"observed_at":"2026-05-10T12:20:22.650633Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Springer","venue":null,"work_id":"153d79e8-cd14-4af9-99b0-f2efaaec1a72","year":1999},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:d36bd2b4ef51da4a20852de3829e8a59f8d5016ae7ccdb50863b022b0822b56a","observation_id":"f73412c0-d941-43cc-ab60-62044ca3970c","resolution":{"observed_at":"2026-05-19T11:43:03.833455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Constrained optimization in the presence of noise.SIAM Journal on Optimization, 33(3):2118–2136","venue":null,"work_id":"624eb4a3-a9fd-4f0f-970d-d2435ccc5f00","year":2023},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:473c1595043070fd13f9ae56bcd0a54bcfd7261c2d33e19079ded8ce0eb231ae","observation_id":"dab9e457-9a5f-4033-a300-99c69d88fd9a","resolution":{"observed_at":"2026-05-19T11:43:03.814422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Nonlinear programming methods in the presence of noise.Mathematical programming, 14:87–97","venue":null,"work_id":"15c15328-7cc0-4a88-b81e-299ae027be94","year":1978},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:1e13a1979a404a10ee96a42cee1090880b03021eacc5ec607f54a46f3514d10e","observation_id":"3319419d-977e-4bad-83b6-b9724d25dd74","resolution":{"observed_at":"2026-05-19T11:43:03.810842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A robust implementation of a sequential quadratic programming algorithm with successive error restoration.Optimization Letters, 5:283–296","venue":null,"work_id":"75248ecb-91ef-4788-a68a-c611d76a1059","year":2011},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:0dcf97c6eb75f8dd269ddffe83d41dbf877121ae4a944d5a131bd7acd7fc834d","observation_id":"a9e58f9a-1fef-408a-988b-516659158d60","resolution":{"observed_at":"2026-05-19T11:43:03.810993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A noise-tolerant quasi- newton algorithm for unconstrained optimization.SIAM Journal on Optimization, 32(1):29–55","venue":null,"work_id":"36ce0dd1-4712-4e75-971e-13b8d2e70d98","year":2022},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:6035351360d257511dcb35e713004e97ec9d3a19954249d8fe808a9405e4cbde","observation_id":"a207b23f-3b78-4e73-8f98-185abf8c01db","resolution":{"observed_at":"2026-05-19T11:43:03.816191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A trust region method for noisy unconstrained opti- mization.Mathematical Programming, 202(1):445–472","venue":null,"work_id":"2d52aac2-f6ca-4147-bcae-830fcf08b571","year":2023},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:fefe48682d09551e76cc05f14b857d6aeaa41f28279236bf114836fce24b3bfa","observation_id":"bb14dfd7-6daf-43e5-a2b9-5b21da898950","resolution":{"observed_at":"2026-05-19T11:43:03.812700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02665","last_updated":"2024-11-04T23:04:03Z","snapshot_observed_at":"2026-07-06T19:45:13.078526Z","submitted_at":"2024-11-04T23:04:03Z","title":"A Trust-Region Algorithm for Noisy Equality Constrained Optimization","version":1},"cited_work":{"arxiv_id":"2411.02665","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.02665","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A trust-region algorithm for noisy equality constrained optimization","venue":null,"work_id":"d02aa763-06e5-4625-b335-f9e0e289aba4","year":2024},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"cited_paper":"/paper/2411.02665","citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:efc15c98b3ee52fd42c7c8823e4d2f416bd6bffba97fade8547a12f53de3dce3","observation_id":"7c6b51fd-3197-4edb-b50b-605e8b19dec2","resolution":{"observed_at":"2026-05-10T12:20:22.647372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":15},"total_outbound_references":20},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2604.14368."}