{"as_of":"2026-08-08T03:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45689abb054c9d5fb5fa88a0b76af38b4260e08be911f566eb73f136875acd5e","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:26:27.529240Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.08506/citation-record","integrity":"/paper/2506.08506/integrity","json":"/paper/2506.08506/citation-record.json","paper":"/paper/2506.08506"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:29.059231Z","title":"Achieving zero constraint violation for constrained reinforcement learning via primal-dual approach","venue":null,"work_id":"b645f308-5e27-4840-825e-88a722d2cc9b","year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.179022Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:64811fda56041f6e85a16627a607091bec5eea1a51cba14bc6dfdc1b54db85db","observation_id":"e16be9d7-10ad-4305-96f1-55ff57811e05","resolution":{"observed_at":"2026-08-07T05:26:29.077219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:29.006084Z","title":null,"venue":null,"work_id":"bb73c26f-364d-49e5-a86b-727623a83a3a","year":2021},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.189263Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:b5af8041d0acdffaa70e0ad8c4319bf529713fe38d6a7db9df2a6117eee99643","observation_id":"76de4335-3374-43a5-afd9-c1962909ba78","resolution":{"observed_at":"2026-08-07T05:26:29.018017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.965676Z","title":"Projected Newton methods for optimization problems with simple con- straints.SIAM Journal on Control and Optimization, 20(2):221–246, 1982","venue":null,"work_id":"62c69113-4bf7-472a-a7f7-4571242a48d0","year":1982},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.201780Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:12c814c6986d8d25242c445106f7ab33d69422292d08c5becf6a691dcf16c36b","observation_id":"4daac793-f4bf-4a5a-aac2-3fd5c6a263ad","resolution":{"observed_at":"2026-08-07T05:26:28.976880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.928839Z","title":"Nonlinear programming.Journal of the Operational Research Society, 48(3):334–334, 1997","venue":null,"work_id":"efb6016f-37eb-4eee-aa06-9c9e4ed0ec30","year":1997},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.210763Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:ca5e941c4969b9e4d87ff6f39080e75ea0f23deaec5e5482446df5dba121d2b2","observation_id":"14750d0b-050d-4567-b0c7-8e951536050f","resolution":{"observed_at":"2026-08-07T05:26:28.940808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.887800Z","title":"Academic press, 2014","venue":null,"work_id":"e3d59721-c4a7-4d2b-abd8-32b34f22c17b","year":2014},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.218951Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f3c8921e024753baf203627635abeb47c8336f4b398f847195de415e798c0844","observation_id":"c267ae15-c201-4340-8396-b04967721f7e","resolution":{"observed_at":"2026-08-07T05:26:28.896695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.850022Z","title":"Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023","venue":null,"work_id":"54a3cf86-357b-45a1-9a32-4d879dbd39a2","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.232411Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:3b3e8e405f382c59852607236505061f3fe62fbda70a702c69d9fe7750b3032e","observation_id":"52a1dd1f-230d-4f64-9c74-166ade6eefad","resolution":{"observed_at":"2026-08-07T05:26:28.859212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:27.246856Z","title":"Cambridge University Press, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.246856Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:779a63cdbb404f35a7d5f2cc7011906254f9c4ffec020ce7c271e60377d37334","observation_id":"91e38455-b649-4ad0-ac69-df9a87a4d929","resolution":{"observed_at":"2026-08-07T05:26:27.246856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.797797Z","title":"On the field of values of a matrix.Proceedings of the American Mathematical Society, 12:61–66, 1961","venue":null,"work_id":"c1b34763-a012-4bd5-a8ef-11659c6b1252","year":1961},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.259474Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:4c536081eb2a2a232088eb122532dad0d881f44b8eba1e7a5f6ea96d58d3d2b1","observation_id":"9f833ce9-923d-4f4d-b8a0-110468bf1081","resolution":{"observed_at":"2026-08-07T05:26:28.805440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:27.272205Z","title":"On the copositive representation of binary and continuous nonconvex quadratic programs.Mathematical Programming, 120(2):479–495, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.272205Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:77924b91af83c4af144f60c49e602126d4fe868ce725966f734aa2beb43609b5","observation_id":"9635febb-7395-4ff4-9575-e8548efe4e53","resolution":{"observed_at":"2026-08-07T05:26:27.272205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.730761Z","title":"MOS-SIAM Series on Optimization, 2022","venue":null,"work_id":"1ff632e4-bf00-4322-bb3b-e40b01cbe732","year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.282200Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:164fe5fb580cad51321ed92ab8cf61eccf1f8c51476799114536852ee3ef4a0c","observation_id":"f5f7884f-d613-42de-a5ad-182d2998c831","resolution":{"observed_at":"2026-08-07T05:26:28.741363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.701264Z","title":"On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming","venue":null,"work_id":"86b33f60-722a-48ea-a37e-ab9aacccdea9","year":2011},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.288426Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:04e53350fc6c758f075a823f9823815759c23feaf4c1afe36a0d037133b6a66f","observation_id":"3e50ac05-fb4c-4cd9-b106-f6a00d0055e2","resolution":{"observed_at":"2026-08-07T05:26:28.709530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.670368Z","title":"On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014","venue":null,"work_id":"0f426c69-659c-4532-8297-5fd2b3a5dfc1","year":2014},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.297820Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f2e52c376ce61be90ee6b7a4f40ac5991e99353075d90574bc06a8b6d19bf2b9","observation_id":"fece937b-24a4-4508-9dbe-4d4909756d46","resolution":{"observed_at":"2026-08-07T05:26:28.679578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.633917Z","title":"A near-optimal primal-dual method for off-policy learning in cmdp.Advances in Neural Information Processing Systems, 35:10521–10532, 2022","venue":null,"work_id":"9959cc90-e6b2-4d68-87a9-cca80d2e277f","year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.306193Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f65e9df7d67ee46044e8c9e3d5b326c10c10aecb3baf7650c2c1dfdaaaec8f5e","observation_id":"9500f6a9-4a1d-45d7-a4aa-c8bd5db3c8d3","resolution":{"observed_at":"2026-08-07T05:26:28.640772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.611322Z","title":"MOS-SIAM Series on Optimization, 2022","venue":null,"work_id":"14cd1ce3-9be8-4036-9afe-f54ae97d512c","year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.313437Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:db7d891d59fb0a86e2c4ddb7d3d30fb985e48301ce581da0855b4b0533a72e50","observation_id":"d50a27fc-288b-49ba-b04a-cfef982c7cf8","resolution":{"observed_at":"2026-08-07T05:26:28.617826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.573068Z","title":"Approximation of the stability number of a graph via copositive programming.SIAM Journal on Optimization, 12(4):875–892, 2002","venue":null,"work_id":"78410c6d-0e98-4033-ad19-448e715683ed","year":2002},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.322669Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:101c20eac7758da92c177c670072156ca167bb011eafc49958a1d9cba416f5dc","observation_id":"b02229b2-d3cf-4cb7-a798-47557be635c1","resolution":{"observed_at":"2026-08-07T05:26:28.584538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.528913Z","title":"Constrained composite optimization and augmented Lagrangian methods.Mathematical Programming, 201(1):863– 896, 2023","venue":null,"work_id":"f005bc26-102e-435f-b995-7af7583be628","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.332438Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:2dc00781ea7f4348b7bf70f84e0709637941898bc9327fdd2b42428ed0c3608d","observation_id":"9ae29e84-5acd-4f95-8d2c-0a26d7dfe0e7","resolution":{"observed_at":"2026-08-07T05:26:28.544645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.489334Z","title":"Copositive programming – a survey","venue":null,"work_id":"d6f36712-f826-4f6d-a909-0b6be2d2e0c2","year":2010},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.343154Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:b5f7579301390d3e4b149964615f389d67e09a1f47572010f5e9e2abb39b844d","observation_id":"d6a497f7-5c1a-46f2-9179-d66886608efe","resolution":{"observed_at":"2026-08-07T05:26:28.499469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18724","last_updated":"2024-04-29T14:12:33Z","snapshot_observed_at":"2026-08-05T10:38:50.717509Z","submitted_at":"2024-04-29T14:12:33Z","title":"Barrier Algorithms for Constrained Non-Convex Optimization","version":1},"cited_work":{"arxiv_id":"2404.18724","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.18724","snapshot_observed_at":"2026-08-07T05:26:27.960283Z","title":"Barrier Algorithms for Constrained Non-Convex Optimization","venue":"math.OC","work_id":"e274b76e-297e-4bdc-9240-d0d12e7c2039","year":2024},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.351596Z"},"links":{"cited_paper":"/paper/2404.18724","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:249ba1e0e7862a76a10933317a8483cf40c4480d26f3c9974c6be0659036de95","observation_id":"9b3144f7-4c47-48fa-8a5a-f79dcd5087df","resolution":{"observed_at":"2026-08-07T05:26:27.969042Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:27.358024Z","title":"On the complexity of an augmented Lagrangian method for nonconvex optimization.IMA Journal of Numerical Analysis, 41(2):1546–1568, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.358024Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:0b4d391430d684d7fc9456df60290feb8b24b9f53144b44eb5b685a856a8a9ef","observation_id":"4aa98d4e-889f-452d-84ee-132af2b6566a","resolution":{"observed_at":"2026-08-07T05:26:27.358024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16659","last_updated":"2024-04-24T17:45:07Z","snapshot_observed_at":"2026-07-06T15:09:32.824067Z","submitted_at":"2023-03-29T13:07:50Z","title":"Safe Zeroth-Order Optimization Using Quadratic Local Approximations","version":4},"cited_work":{"arxiv_id":"2303.16659","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.16659","snapshot_observed_at":"2026-08-07T05:26:27.904857Z","title":"Safe Zeroth-Order Optimization Using Quadratic Local Approximations","venue":"math.OC","work_id":"ea97c40e-7207-4388-80c7-28c61baaf4ab","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.366668Z"},"links":{"cited_paper":"/paper/2303.16659","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:3ed2b538eaf1efae86cd13ab0cc7079b2e230c4e915d31830db7e20e29d5dca8","observation_id":"195f694b-d795-4d41-a3c9-60941af4ffb5","resolution":{"observed_at":"2026-08-07T05:26:27.913323Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.439917Z","title":"Safe zeroth- order convex optimization using quadratic local approximations","venue":null,"work_id":"fea476ee-d538-4bd2-9ba6-8ca5b7ecaa5e","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.377466Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f7512a92fd716e683096e6caa910ab9a91809c9d9692b0892a8e30e778a887fc","observation_id":"71f08c1c-96f1-43d3-8835-d6e274fdd3ab","resolution":{"observed_at":"2026-08-07T05:26:28.446698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01797","last_updated":"2023-04-04T13:55:07Z","snapshot_observed_at":"2026-07-06T15:12:03.520378Z","submitted_at":"2023-04-04T13:55:07Z","title":"Safe Zeroth-Order Optimization Using Linear Programs","version":1},"cited_work":{"arxiv_id":"2304.01797","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.01797","snapshot_observed_at":"2026-08-07T05:26:27.800554Z","title":"Safe Zeroth-Order Optimization Using Linear Programs","venue":"math.OC","work_id":"183ec2b4-fd99-4b28-a346-4017f80a4dad","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.385625Z"},"links":{"cited_paper":"/paper/2304.01797","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:9a1cd65e1c100074135ecd46fc0a369a3d619bafb8e8dfc2967db840ca873105","observation_id":"b44a2a54-280d-4ee7-8a9d-f96524f1d646","resolution":{"observed_at":"2026-08-07T05:26:27.809350Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.398832Z","title":null,"venue":null,"work_id":"f6c93f91-71ae-44f3-8465-0aab2f029553","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.394039Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:971245c9b298681f9c2d13b73df9b3ab1819896552e9af2a81f357aef3aaf5e0","observation_id":"957bc969-b566-4555-9672-3a277b012a87","resolution":{"observed_at":"2026-08-07T05:26:28.410210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.363269Z","title":"Rate-improved inex- act augmented Lagrangian method for constrained nonconvex optimization","venue":null,"work_id":"aeb2ca86-7d6b-4bb6-aff5-0e2999069268","year":2021},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.401392Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:a81237dd5c3c859477d9fe8333a83131f0b9b8e1bd47e97efbd80dbe7c84a2eb","observation_id":"d06c7c10-9aa6-43a6-9e36-65a2df635517","resolution":{"observed_at":"2026-08-07T05:26:28.373524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.322836Z","title":"Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization.Computational Optimization and Applications, 82(1):175–224, 2022","venue":null,"work_id":"a4f0d01d-0df0-4726-83d9-dc57830d3ce4","year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.410124Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:c0ee72114c87d5a426ea62f1c867d61b8db7b9099abd9e12e5319a456f7facc3","observation_id":"afa32485-72cb-4d0f-aa4e-768badfb6850","resolution":{"observed_at":"2026-08-07T05:26:28.332561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.285223Z","title":"A level-set method for convex opti- mization with a feasible solution path.SIAM Journal on Optimization, 28:3290–3311, 2018","venue":null,"work_id":"0b49be9e-d734-4e78-93e9-9d7c1981e6ec","year":2018},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.423779Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f5ac54123353844a84151fbaceb7d6cf3404109b56dc63babddd640d226d6e48","observation_id":"c03f5237-f489-487a-8fa5-b82f2e8a473a","resolution":{"observed_at":"2026-08-07T05:26:28.293412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.242178Z","title":"On Brickman’s theorem.Journal of Convex Analysis, 12:139– 143, 2005","venue":null,"work_id":"c6be0412-0c96-485e-b167-3d1cfb58fa4e","year":2005},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.431312Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:957970b1da9077e737834692039887217127b32011fd7cc7c2435abea5202c5e","observation_id":"ad426628-4ada-44e8-930d-9e3b5847126b","resolution":{"observed_at":"2026-08-07T05:26:28.257454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.206687Z","title":"Kluwer Academic Publishers, 2004","venue":null,"work_id":"aad5ff9e-c168-488b-b31b-cde2755de9b8","year":2004},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.443090Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:4ef1cd871bd0d0a3762461d4232e84a7a9dde997e0eea2df68fa6f56f9fa3d6d","observation_id":"ffb45dce-a7c9-4fc1-9238-c55f77ab1c72","resolution":{"observed_at":"2026-08-07T05:26:28.215089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:27.452174Z","title":"Springer, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.452174Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:32e21b1be278b1287b62697bf7dee54eb51832e1c22f30d40f8e7e7344d582fb","observation_id":"5a718a57-c484-4b92-8e61-940ac4a958ad","resolution":{"observed_at":"2026-08-07T05:26:27.452174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.148160Z","title":"Springer, 1999","venue":null,"work_id":"577391d3-3e15-4ca3-8aa7-e207960c4086","year":1999},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.459646Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:5de86f9bd51c32c5c66416a32689a4058ac05c8cd85f77352628b8a1ca45c596","observation_id":"0bb53b02-439d-4e86-9cd6-3c10050ad97f","resolution":{"observed_at":"2026-08-07T05:26:28.159270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02024","last_updated":"2020-06-02T19:34:52Z","snapshot_observed_at":"2026-07-06T07:05:59.910542Z","submitted_at":"2018-10-04T02:03:58Z","title":"Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02024","snapshot_observed_at":"2026-08-07T05:26:27.469671Z","title":"Convergence to second-order station- arity for constrained non-convex optimization.arXiv preprint arXiv:1810.02024, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.469671Z"},"links":{"cited_paper":"/paper/1810.02024","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:45b4f0aab97d0a7293557548fdfcf52fccb56b6d37ce877173f3f2407f775d34","observation_id":"b6065c6d-0491-4779-a276-9d46561ac752","resolution":{"observed_at":"2026-08-07T05:26:27.469671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.109782Z","title":"Constrained non-convex optimization via stochastic variance reduced approximations","venue":null,"work_id":"5a2dfb8d-2a8a-4e20-939d-ebca21ce5105","year":2019},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.478679Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:87ed75fa6f25ebd59cb742a8ff254b1880fc7a64fa7f6d6dda28351208aeff68","observation_id":"00be3379-2e69-41ff-9b53-2b65d0dd56a2","resolution":{"observed_at":"2026-08-07T05:26:28.119955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.072383Z","title":"An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints.Ad- vances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"2dd206de-bf76-4bc4-a414-fed67ae5bc21","year":2019},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.484578Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:eb394589a0b7938e36adaf9d999f95f3ab1d705b3ab942cdfdc4642e4280e22b","observation_id":"986225fd-f6be-4631-af01-2ec4ad70c339","resolution":{"observed_at":"2026-08-07T05:26:28.082818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.039940Z","title":"On cones of nonnegative quadratic functions.Mathematics of Operations Research, 28:246–267, 2003","venue":null,"work_id":"3602443f-cff4-491a-8579-f0a735205840","year":2003},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.492355Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:76997ffae497b9f18309276fcbab4ee63b952ee9378cc5e35005f8f9737cbe57","observation_id":"3013009b-f1aa-4a3d-9475-552d5eee97a6","resolution":{"observed_at":"2026-08-07T05:26:28.050748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04235","last_updated":"2024-07-05T03:22:51Z","snapshot_observed_at":"2026-08-02T04:02:09.575004Z","submitted_at":"2024-07-05T03:22:51Z","title":"Novel Optimization Techniques for Parameter Estimation","version":1},"cited_work":{"arxiv_id":"2407.04235","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.04235","snapshot_observed_at":"2026-08-07T05:26:27.718437Z","title":"Novel Optimization Techniques for Parameter Estimation","venue":"math.OC","work_id":"43973efb-e3a6-49fd-8ef2-ad460521a30a","year":2024},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.507046Z"},"links":{"cited_paper":"/paper/2407.04235","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:f8f1678c33af8cc5abad15fec7ef5fe1236186ff948b6d776f285763ba9bf54f","observation_id":"87b6499e-0757-4cfe-8617-7db3f9c6d450","resolution":{"observed_at":"2026-08-07T05:26:27.734650Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:27.519072Z","title":"Solving convex smooth function constrained optimization is as almost easy as unconstrained optimization.arXiv preprint arXiv:2210.05807, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.519072Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:b26c3d2656af23c130bc27db810f667213a8f369b3cb48a936ca69abe40ee9be","observation_id":"2cc98ee6-5e16-47ed-a332-213106c1e477","resolution":{"observed_at":"2026-08-07T05:26:27.519072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:28.001458Z","title":"A first-order primal-dual method for nonconvex constrained optimization based on the augmented Lagrangian.Mathematics of Operations Research, 49(1):1–651, 2024","venue":null,"work_id":"4bb2f6ba-2b2f-4633-bc07-b6988a081a8d","year":2024},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.529240Z"},"links":{"citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:03ff6f5184da93e72cea8c18c7cfab75db53bc8cc1556ea4c4a93b68e8e7281a","observation_id":"39be0815-ae79-4ecc-9218-d47f16aaad3c","resolution":{"observed_at":"2026-08-07T05:26:28.010412Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":4,"verified_fuzzy":24},"total_outbound_references":37},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2506.08506."}