{"as_of":"2026-08-13T14:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb3d232c3955be31f8a8d906f8de99c19595cca34a0cc63d9a641b115d3a59b0","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:48:38.499094Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:40:53.785426Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02010","snapshot_observed_at":"2026-08-04T06:40:53.785426Z","title":"arXiv preprint arXiv:2502.02010 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.18348","last_updated":"2026-08-03T13:46:16Z","snapshot_observed_at":"2026-08-08T04:25:31.456140Z","submitted_at":"2025-12-20T12:25:53Z","title":"Barzilai-Borwein Diagonal Quasi-Newton Method for Nonconvex Multiobjective Optimization Problems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T06:40:53.785426Z"},"links":{"cited_paper":"/paper/2502.02010","citing_paper":"/paper/2512.18348"},"observation_digest":"sha256:591e4c2d35d0fec49f62f53d3f1b8f91674c929f02db8ad5a3365342a0643313","observation_id":"0f1fbd5f-9963-491d-b64c-c0c217564958","resolution":{"observed_at":"2026-08-04T06:40:53.785426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02010/citation-record","integrity":"/paper/2502.02010/integrity","json":"/paper/2502.02010/citation-record.json","paper":"/paper/2502.02010"},"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-09T13:48:39.074422Z","title":"Advances in cone-based preference modeling for decision making with mul- tiple criteria","venue":null,"work_id":"34f204ce-86e8-46cf-b227-f21868c418cd","year":2007},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.086202Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:4d020fa42e6b4cbf389f8380ee27b7f7eab0422614c7f0612eed8139de8ac14d","observation_id":"2ad5b078-82e1-4a9c-a543-eaf7d9f68268","resolution":{"observed_at":"2026-08-09T13:48:39.078261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.064463Z","title":"Finance-based scheduling multi-objective opti- mization: Benchmarking of evolutionary algorithms","venue":null,"work_id":"3a7101ab-e731-473c-8ba0-d27eaa99adc7","year":2020},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.124771Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:20569eab3eda4bbf09da8aa412e50b2d9d01d26f4db5511c615080a9bb44e9a5","observation_id":"ed9f09a5-29f3-4029-b166-2e4ab51d26a1","resolution":{"observed_at":"2026-08-09T13:48:39.068109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.054461Z","title":"Robust multiobjective optimization & applications in portfolio opti- mization","venue":null,"work_id":"62fa6ed1-c82f-4765-b860-fb768f84be96","year":2014},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.144860Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:7331f1783e016e1605b84cf4d0f27d68f84edb5ab73e114eac98dfcfcbf4b1ec","observation_id":"bf7acc75-483e-4424-9922-013fadf43edc","resolution":{"observed_at":"2026-08-09T13:48:39.058044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.043603Z","title":"Multicriteria design optimization: procedures and applications","venue":null,"work_id":"8a0efd9f-1892-414d-85c8-f7e8f436a599","year":2012},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.149007Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:b0ee86c8d7eee0edef328cbf9a73ddaf28b0bea1acf912a22ba909ed624a6f0a","observation_id":"493409dc-dac4-4c25-811d-a5c3a48cb5f3","resolution":{"observed_at":"2026-08-09T13:48:39.047087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.033661Z","title":"Pareto-optimal aircraft technology study for environmental benefits with multi-objective optimization","venue":null,"work_id":"1f9d7893-09a7-46a9-bb19-3a53b6400adc","year":2017},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.153259Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:3ffe43a87089b1f78dba62ca4969bcb142a3410ce898ae5ba179b9d3bcf48b97","observation_id":"e070e35a-7a58-49a2-b515-0a2a9f387871","resolution":{"observed_at":"2026-08-09T13:48:39.037234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.023360Z","title":"Numerical methods in extremal problems","venue":null,"work_id":"d7abc6a9-a752-4f83-9bea-e9cdd84a9404","year":1978},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.156596Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:8fd419c6b06448c6861c0da150835129f9c89fd5e64d60743e07b1b7016b64f8","observation_id":"ed11272f-ac9e-4bb0-8dd2-e6d0a7c10018","resolution":{"observed_at":"2026-08-09T13:48:39.027146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.011939Z","title":"An efficient method to solve the minimax problem directly","venue":null,"work_id":"fcf4a6ef-7e2a-4f95-80de-bf431879382a","year":1978},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.160150Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:f61b14d43c09c89c2b7cb510d5d26db11fe7dba341b0be2f2bd505f4d52e5598","observation_id":"eb2e54c7-386e-4e88-b4ad-ea6008bec398","resolution":{"observed_at":"2026-08-09T13:48:39.015710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:39.001241Z","title":"A globally convergent qp-free algorithm for inequality constrained minimax optimization","venue":null,"work_id":"5e40262d-e38e-4df7-a192-23eef7ce156b","year":2020},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.163403Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:5ca4d56c327bea8794b8a72fa51a9237a41b21b0a0b7cabee6690a3c9ebb6a66","observation_id":"bc79220b-9319-4845-a9fe-d48a38869f40","resolution":{"observed_at":"2026-08-09T13:48:39.005573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.991121Z","title":"Primal interior-point method for large sparse minimax optimization","venue":null,"work_id":"9892e70d-19fa-47d5-8146-03d4a3657008","year":2005},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.166575Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:570d18c3a7eddaa98e85fe1536c085345996b2803c9182c22f87e7943b7fe916","observation_id":"f8e6e147-1c70-4e99-b97c-4f8169f4f43b","resolution":{"observed_at":"2026-08-09T13:48:38.994714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.980464Z","title":"Interior-point method for non-linear non-convex opti- mization","venue":null,"work_id":"5b5ac786-15b6-4fe9-97e0-4a5316a57d3e","year":2004},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.169712Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:9a91134571956e1ef563ec632583ae70069a6691e02232afb0bbdd0bce21d55c","observation_id":"7abe8e20-a6d4-431b-aa37-8c85cbfce8a7","resolution":{"observed_at":"2026-08-09T13:48:38.984341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.970418Z","title":"An interior-point algorithm for nonconvex nonlinear program- ming","venue":null,"work_id":"553b5efc-e93a-419d-a4c8-12925c7b741d","year":1999},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.172503Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:e6cd2318c09cdd3c17a4cfb7d14bc9b9abb22ed9705d7b64603d3252a45c4fbd","observation_id":"396a3559-2441-4629-b32f-393a94148c1d","resolution":{"observed_at":"2026-08-09T13:48:38.973972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.960028Z","title":"A non-monotone conjugate subgradient type method for minimization of convex functions","venue":null,"work_id":"f233883d-c8fe-4b1a-88fe-709c53d945ce","year":2020},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.175399Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:550933111e1957c739c3daac9c26c0178a90d4c27c9995f281d05f57e50b42cf","observation_id":"9631fc98-98e3-4431-b95e-628d30258710","resolution":{"observed_at":"2026-08-09T13:48:38.963829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.949027Z","title":"On solving large-scale finite minimax problems using exponential smoothing","venue":null,"work_id":"c5e94cf3-4dd8-4f74-a202-13b955485a2c","year":2011},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.179411Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:41c94db4181c22d12754c4b6cd0b16b27c5a0ca7aa243f8c1a575499b1579500","observation_id":"14c7df66-50d1-4a9f-96c1-051adfa7dce4","resolution":{"observed_at":"2026-08-09T13:48:38.952975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.937602Z","title":"An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems","venue":null,"work_id":"6e0a8c38-3a95-4820-aef7-b5c8e8742f82","year":2008},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.182187Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:d2eb6ddab62dfa944181caf1c0aa3961b76247c50e34aaecc84643d8954e6d9d","observation_id":"ffbebbd8-0997-4e1e-b0b8-c450f23c3bf5","resolution":{"observed_at":"2026-08-09T13:48:38.942257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.926740Z","title":"On the convergence of the pshenichnyi-pironneau-polak minimax algorithm with an active set strategy","venue":null,"work_id":"90723b51-3540-425b-96c1-984e54728986","year":2008},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.185662Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:9d77f0cf47dbb81bbcad519a99f4b9412fe03f9c68538de2c3120e2be6af2585","observation_id":"30f20502-ddcc-4850-b273-fdd21f61e4bb","resolution":{"observed_at":"2026-08-09T13:48:38.930617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.917386Z","title":"Steepest descent methods for multicriteria optimization","venue":null,"work_id":"f36bff39-c7f3-4b34-a11d-b9878daf4bc3","year":2000},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.188326Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:c3926849ab2ef95f2ead22acac3865045faf9077c6fa13bda9c3437ee6f5bcaf","observation_id":"fe60cc38-6d0c-414a-bbeb-49890798e2ff","resolution":{"observed_at":"2026-08-09T13:48:38.920861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.907987Z","title":"Nonlinear conjugate gradient methods for vector opti- mization","venue":null,"work_id":"53e43dff-a95b-484f-8e07-aba880c36f97","year":2018},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.191598Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:73bb9ae975afa561ccd15d2f8d1d16e6fef43a68b2415789ab2d55f16b60130a","observation_id":"3b76b1f5-c5eb-43d9-9f2c-22228e608181","resolution":{"observed_at":"2026-08-09T13:48:38.911618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.898794Z","title":"Extended newton methods for multiobjective op- timization: majorizing function technique and convergence analysis","venue":null,"work_id":"cfe7e987-9fac-4322-8ce6-de0220d41a82","year":2019},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.195204Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:48dd105d237f9ed1f58ce3679d1144949d1f3f5921aeedd0a467a2027dbcb86f","observation_id":"d2906bcc-d259-4e2f-a682-1970af91c59d","resolution":{"observed_at":"2026-08-09T13:48:38.902302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.888739Z","title":"Convergence of the projected gradient method for quasiconvex multiobjective optimization","venue":null,"work_id":"d9398b3a-8beb-427d-b944-63a626219677","year":2011},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.199085Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:39ec0fbd32f781db67c1ba6d24bb58159a150cf7c3c0d898570f0418b68b4d7d","observation_id":"53be27f3-fc45-4570-98b1-724225e37500","resolution":{"observed_at":"2026-08-09T13:48:38.892699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.877453Z","title":"A projected gradient method for vector optimization prob- lems","venue":null,"work_id":"8dc56b2a-741f-483c-b610-3f8b914ec0e5","year":2004},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.202839Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:44d42e7a3f09ab1c147eb2992bc99882af69f7d51d6d6157c5cf4e5b288dc37b","observation_id":"c9ae68cc-5324-4075-8556-242974963522","resolution":{"observed_at":"2026-08-09T13:48:38.881257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.867314Z","title":"A new nonmonotone line search method for nonsmooth nonconvex optimization","venue":null,"work_id":"786a4f46-6ff1-4d44-a788-e7c73be1a3e4","year":2024},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.206605Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:3cc7ec26299897cce4ea12a8b204d66e394ae1d1c077340411f015ac562b0d22","observation_id":"ea52c1e3-3016-4d54-a752-dd92afc60950","resolution":{"observed_at":"2026-08-09T13:48:38.871042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.856117Z","title":"Interactive multiple criteria decision making based on preference driven evolutionary multiobjective optimization with controllable accuracy","venue":null,"work_id":"710e2bb5-6ae4-4806-908b-35f5e0801ef6","year":2012},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.210270Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:d1243ebaa1bcb080fe630eb212518c8233195ca4b2e0dbaef8b11381fb25825c","observation_id":"d80157ee-2f35-4fd9-b19b-f885028b1032","resolution":{"observed_at":"2026-08-09T13:48:38.860658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.797514Z","title":"A monotonic optimization approach for solving strictly quasiconvex multiobjective programming problems","venue":null,"work_id":"4a9c573f-2149-497e-b0a9-ad3c9cc66837","year":2020},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.213325Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:9f3cbe5670210a705c0a2f02d3a034d61a58d074877779e93fc0803fbf2120e3","observation_id":"3f966ee8-6e88-443b-8b6a-686a7af3e7a7","resolution":{"observed_at":"2026-08-09T13:48:38.824017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.748211Z","title":"Generalized convexity of functions and generalized monotonicity of set-valued maps","venue":null,"work_id":"d80a6899-d29b-4c90-8a42-ac213a7aa763","year":1997},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.216227Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:4b79a2de2096a1b2ad2d095bf4d042d1d4396d1b3027669732551cef2039b697","observation_id":"c7a6d3b1-cc2e-4c7f-89b0-65fac0e29f0d","resolution":{"observed_at":"2026-08-09T13:48:38.774832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.704566Z","title":"Semismooth and semiconvex functions in constrained optimization","venue":null,"work_id":"b2645595-09d9-4e07-8256-01ff90050d02","year":1977},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.220004Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:57cd62bcf02f840f316d5357659ac1433d600c181cd5dacc428f5c7269dd40b0","observation_id":"90061265-267b-455f-a8ae-231cbf6bccd9","resolution":{"observed_at":"2026-08-09T13:48:38.725301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.687160Z","title":"Disciplined quasiconvex programming","venue":null,"work_id":"6ea44d17-986b-440a-a2cf-ee97d8a62fc5","year":2020},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.223271Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:cffae4814a191136e357e5979241f9ef202e7da32b4e0fdde975599a551d6af8","observation_id":"4a5eb585-e2b1-4391-8060-d44454bd36d3","resolution":{"observed_at":"2026-08-09T13:48:38.690331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.676502Z","title":"Iterative algorithms for nonlinear operators","venue":null,"work_id":"d4a7dd6d-416e-46d8-81c5-130012cf3b20","year":2002},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.256456Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:bbc15e4be2d66e439818ef8c4bf2ef0ea7333149c3aaa460c73e30c3643f029c","observation_id":"6e168faf-39b4-45b4-acaf-873606eb2934","resolution":{"observed_at":"2026-08-09T13:48:38.680250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.666172Z","title":"Efficient computation of the search re- gion in multi-objective optimization","venue":null,"work_id":"2524ce3c-6cfc-4ee9-b2fc-565baa72c193","year":2017},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.289005Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:3b5333f29170f5e157f4b3f6c0b1415aafa9ad6f14208f5b651d2bcf50652c00","observation_id":"7e2fb1b0-aff2-4727-b5fc-2755f0a22f5a","resolution":{"observed_at":"2026-08-09T13:48:38.669659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.656122Z","title":"Multiobjective optimization through a series of single- objective formulations","venue":null,"work_id":"a3502671-a595-43de-86ea-3a511901d027","year":2008},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.372205Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:9f445a5cf713c32af0ac4186f0dc636a426aa55bd2fd27ad4f2fff1fce046f61","observation_id":"da34951e-f7d3-4b67-909e-a9b7bf805d9f","resolution":{"observed_at":"2026-08-09T13:48:38.659527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.646314Z","title":"Multicriteria optimization","venue":null,"work_id":"790b499f-13d8-415b-bf97-a41b616bb79c","year":2005},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.441242Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:2a5c3b43a5953604e9c42049de3eebc69df1446ae70efc32e14eb3c432851217","observation_id":"9fbbe7b2-a854-45e8-9d62-af1e463b941f","resolution":{"observed_at":"2026-08-09T13:48:38.649663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.634723Z","title":"Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization","venue":null,"work_id":"8aef608d-fe0b-4fc8-8e35-39fd3c18392d","year":2021},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.469760Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:0adaadd6575f4460f91339d7202cdb5a444c8c6f56eccbba5a8f278e5b9aad96","observation_id":"cc5416d0-25ab-496f-9906-3c71dd2a4a68","resolution":{"observed_at":"2026-08-09T13:48:38.639389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T13:48:38.622812Z","title":"Pareto multi-task learning","venue":null,"work_id":"5cdef776-e635-4bdb-9bf9-9498433f4dd8","year":2019},"citing_paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T13:48:38.499094Z"},"links":{"citing_paper":"/paper/2502.02010"},"observation_digest":"sha256:1442d764dac16e95325fe38c42069a2e0c4bfa98170d72b2eb5673437a283f32","observation_id":"600f8649-650e-4348-9793-6dec57c5fd4c","resolution":{"observed_at":"2026-08-09T13:48:38.627434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.02010","last_updated":"2025-02-04T04:58:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T20:57:04.972899Z","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":32},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 1 inbound Pith citation observation for arXiv:2502.02010."}