{"as_of":"2026-08-14T11:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5df83a6a70e6fa06462be7467c43d8871af241c03d21a0d03add58d8feac5d8b","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T00:42:56.901377Z","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-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:54:31.059928Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T01:13:05.384130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08450","snapshot_observed_at":"2026-08-07T14:54:31.059928Z","title":"Lapucci, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17594","last_updated":"2025-05-23T07:59:03Z","snapshot_observed_at":"2026-08-07T14:41:56.424319Z","submitted_at":"2025-05-23T07:59:03Z","title":"Worst-case complexity analysis of derivative-free methods for multi-objective optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:31.059928Z"},"links":{"cited_paper":"/paper/2405.08450","citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:ccffaf01389cf2e6396f9796ad8c0e2052b34aeda932a7a349770d5de92ee23c","observation_id":"eae06d13-0fde-4a55-a67c-36e47f6abb72","resolution":{"observed_at":"2026-08-07T14:54:31.059928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"cited_work":{"arxiv_id":"2405.08450","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.08450","snapshot_observed_at":"2026-08-07T01:13:05.384130Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","venue":"math.OC","work_id":"99df2b5e-0fda-47d3-aa53-188d78b5c576","year":2024},"citing_paper":{"arxiv_id":"2506.11929","last_updated":"2026-07-22T15:32:20Z","snapshot_observed_at":"2026-08-10T17:45:00.619632Z","submitted_at":"2025-06-13T16:31:27Z","title":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.471133Z"},"links":{"cited_paper":"/paper/2405.08450","citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:2adcf97b7f16e36fcb670bf695d4ac703183c22072708857ae4f4ba262fefb61","observation_id":"c1ef07ee-49bd-4a51-83ff-9f4e294332e9","resolution":{"observed_at":"2026-08-07T01:13:05.417521Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08450","snapshot_observed_at":"2026-08-03T04:15:02.665985Z","title":"Effective front-descent algorithms with convergence guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.665985Z"},"links":{"cited_paper":"/paper/2405.08450","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:3a71778f1ae6c8b76a651464a171df186c2c8253b0aa2711d9fdc5e07a6d0e93","observation_id":"870534ad-2db5-4fb6-86e5-8436a52bd89e","resolution":{"observed_at":"2026-08-03T04:15:02.665985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.08450/citation-record","integrity":"/paper/2405.08450/integrity","json":"/paper/2405.08450/citation-record.json","paper":"/paper/2405.08450"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bigeon, S","venue":null,"work_id":"453998d1-ed9e-4814-88f4-fd8565ce9e88","year":2021},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:206d7ed5c0df133e0b83023a3d4b0c2535efe4da0a011812a7c99f45d76c2f0f","observation_id":"b0b8c1db-fcf0-46ac-95ed-49fb368e1a48","resolution":{"observed_at":"2026-05-24T00:43:40.787472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-020-00233-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Optimization and Applications","work_id":"defe0586-0ded-41df-bf7c-013242d2db26","year":2020},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:773f31ece360c1783a2763bb8a4ad3fb2c02d27be1d70757176212416468b93d","observation_id":"1e7b9f9a-fefd-4b39-aa07-2916ef438a7c","resolution":{"observed_at":"2026-05-24T00:43:39.887146Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09797","last_updated":"2023-08-09T08:41:17Z","snapshot_observed_at":"2026-08-13T11:15:19.304018Z","submitted_at":"2023-06-16T12:10:09Z","title":"Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence","version":2},"cited_work":{"arxiv_id":"2306.09797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.09797","snapshot_observed_at":"2026-07-04T14:39:57.046708Z","title":null,"venue":null,"work_id":"0fc452f0-992d-4c95-8676-8c606f11cff2","year":2023},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"cited_paper":"/paper/2306.09797","citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:d390d1c431dee2ebb680d68b302ae2f60636c5da3abb69728f2e3edfdf441da2","observation_id":"07fc1847-667c-4f18-9133-d69a278b2c57","resolution":{"observed_at":"2026-05-24T00:43:40.027808Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cocchi, M","venue":null,"work_id":"14b8d5af-415d-4812-8d90-e3f82ff83010","year":2021},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:1e61986f31309240e8d840d9d8f377ac3307d8b8d08481a24d2006f85768223b","observation_id":"a01de22e-6bed-477f-829c-f5d74c833ea3","resolution":{"observed_at":"2026-05-24T00:43:40.783912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cocchi, G","venue":null,"work_id":"bd1aa772-f2f2-4b8a-8498-9199ca659460","year":2020},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:f09743c5ff452db8101c7131b8d967d89b5821d14d8a097c5b3ece577fc66033","observation_id":"e88a85e1-3941-4e9b-a758-cbf3ed1b00a7","resolution":{"observed_at":"2026-05-24T00:43:40.855126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"34a12c07-f34d-4ca2-a73d-60b8f624a4e8","year":2021},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:9c7d5143e6c4b9da37a3045d77b4b809197a328f0f50b72d8c11ae7a91db53be","observation_id":"814a622a-95fa-4913-9afc-2d323e70d0a3","resolution":{"observed_at":"2026-05-24T00:43:40.858571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5454f389-e1c6-4db5-83d6-43412e70434a","year":2011},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:f7922fadc7642a07d1e9578e84f33933a2d6288d19a25d045c757ec624b1c258","observation_id":"e7cc455e-921b-4962-8fc5-a4bff1453bd6","resolution":{"observed_at":"2026-05-24T00:43:40.848235Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a200921c-6dc3-44f7-bec7-e45cec15f24e","year":2002},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:6a4176061f34db058ee8bd0f6489a3083145f84fe1d2ccddc693fc85ac193121","observation_id":"99d1f108-77c3-4b32-9ce6-2580db33e710","resolution":{"observed_at":"2026-05-24T00:43:40.780432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bc1d200a-d947-4b60-8ef2-8b99edf5e35b","year":2002},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:0d87945b9e9b51d54430ba246381b14f8a91a471f4a327e4ccb9a0ea8b491f26","observation_id":"f2c24732-09f4-435a-ba51-32ed149ef8eb","resolution":{"observed_at":"2026-05-24T00:43:40.777179Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Eichfelder , Twenty years of continuous multiobjective optimization in the twenty-first century, EURO Journal on Computational Optimization, 9 (2021), p","venue":null,"work_id":"4f58e415-c933-4a89-a5fe-eced51a7cbad","year":2021},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:3b04a284e332eb86c7c1691c0d2f8621fa77237865184d0fe5b1378597afc465","observation_id":"7e3ee133-a8e2-4ead-a9b1-8003804495a2","resolution":{"observed_at":"2026-05-24T00:43:40.844246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fliege, L","venue":null,"work_id":"c7391593-b295-491b-b58d-5ed5f9a8889f","year":2009},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:1e79156426c783b8b6e76aba7cc2036a5fb5c2aa41700bf8493c50e3b6a28a68","observation_id":"58145d69-008c-4b9e-b438-7d6e21137431","resolution":{"observed_at":"2026-05-24T00:43:40.851566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fliege and B","venue":null,"work_id":"b903caf5-116c-4341-8a75-0f3c94803c5f","year":2000},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:03e6114a2f72528bcf217285caa1e904531fb5be76642acd3e8cefc8caf810da","observation_id":"29b32e13-fd5a-42cd-a443-b1c1ba63286b","resolution":{"observed_at":"2026-05-24T00:43:40.861957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fliege, A","venue":null,"work_id":"78aad6e7-105d-4305-a5e3-960edfc7b76e","year":2019},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:7db2283ccf8abc52253f8e84d9645eb46c3ee463a08303d9fa03fe32ac01a9a5","observation_id":"78ab0a6f-3dbf-410c-8eb4-48db579854b1","resolution":{"observed_at":"2026-05-24T00:43:40.868615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"96e196a5-21e3-41ac-a544-5e55b3c2430f","year":2022},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:f9df4c65b2000eeb7ff8d417687297e07b1e865c7779bc8275a65e76f849fcab","observation_id":"334c7725-fbbd-4dda-bd47-b20234093054","resolution":{"observed_at":"2026-05-24T00:43:40.871869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Handl, D","venue":null,"work_id":"83e522ff-ecfb-43cf-b37a-c8786e9411e0","year":2007},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:c743ffd31fd0b220cf09639f7a2212c00a7080f9838e5a69a41dffd51337ec8a","observation_id":"638faf20-de13-4e48-9a23-7228f5c1404b","resolution":{"observed_at":"2026-05-24T00:43:40.889118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Huband, P","venue":null,"work_id":"9cdbd3b8-8b5a-4737-ab01-0e6bbeac83dc","year":2006},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:3d440e4ef8bde46e2405e005b5fcbcbc0451aa4844e685f187a7211a9ec30a71","observation_id":"ca0a126d-c769-46c5-b4a1-b7dc55cc555a","resolution":{"observed_at":"2026-05-24T00:43:40.865110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"51a8ceb8-5b0c-4941-8dda-2a69a39ec4e2","year":2001},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:02de10221114c39b9c4e705d2be713b9fd5bfab08656e6a9f3e2123edae56f07","observation_id":"d1568e61-f818-46d1-bc96-0a337229be64","resolution":{"observed_at":"2026-05-24T00:43:40.875765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jin and B","venue":null,"work_id":"f168206d-97ee-492c-a6c5-79f7afc25a30","year":2008},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:eddbf426f3260f13b836f70b942763b6d35a109b8f17d9edacbfa14cb1ef4ff1","observation_id":"1a3f16eb-41c0-4b16-9358-93287752e488","resolution":{"observed_at":"2026-05-24T00:43:40.879271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lacour, K","venue":null,"work_id":"b4a8c40e-5cab-45fa-b6dd-00d3a4bb55e6","year":2017},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:51e3c42b5393b4976e3c433878ecb1e2fca421ec2a456ffe48685da39da3b11f","observation_id":"3b09e47c-7de5-4ddd-9d9a-857a4db69ca2","resolution":{"observed_at":"2026-05-24T00:43:40.826909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lapucci, Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization, Operations Research Letters, 54 (2024), p","venue":null,"work_id":"dc5f3c74-8e44-42ec-9cbd-139fe35ed66b","year":2024},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:8825710b0716a3d29a5cf68a236520d620391da2907c253eab3040527359f7e5","observation_id":"ac6d6890-f647-4857-9c67-5e7319ccfab5","resolution":{"observed_at":"2026-05-24T00:43:40.830578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lapucci and P","venue":null,"work_id":"8f448b75-1fb0-4879-b245-97e1ade0b9d4","year":2023},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:9878f4dc34de58ed4fb27bb9a0aef36458efad8ba7263701f83b7c4127965065","observation_id":"7cc3c825-354b-4efc-bade-733e8359dad9","resolution":{"observed_at":"2026-05-24T00:43:40.837058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lapucci and P","venue":null,"work_id":"76015807-e035-4168-a2c4-2f5b38ca2f2f","year":2023},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:ce47673abccbf45d52dd9e46152d98f3ace1baf1b3d2d855b06bd1651fd671bf","observation_id":"b5c16b97-d862-4f45-93c1-bf6a8ed62cee","resolution":{"observed_at":"2026-05-24T00:43:40.798883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lapucci, P","venue":null,"work_id":"7cf6e256-ae19-4143-8add-616ccff93a10","year":2023},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:acbe9ec4bab8ba81fdd21ab32696fb79ed64b96fa406a21f5a77907c253c1fe9","observation_id":"a906d590-f3aa-4e37-9a9c-70aa10d73a6e","resolution":{"observed_at":"2026-05-24T00:43:40.833876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fecb486e-635e-4632-9033-d5d8b7658192","year":2020},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:58a2cd196da45ad375ec90a12672edf7dce881064022de9cd76d44def786e9a5","observation_id":"0268cef1-a4af-46d6-b3f9-c1346a1994e8","resolution":{"observed_at":"2026-05-24T00:43:40.823260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Liuzzi, S","venue":null,"work_id":"0120da11-5b65-4333-b537-17af8710ffc1","year":2016},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:ebb4aeea1a70e7961f570c8b4bff591a3943a2d4726d1c162b2424a9924523ff","observation_id":"e27b1240-9e6f-42cc-b64f-c76edd5ec3d7","resolution":{"observed_at":"2026-05-24T00:43:40.810837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lucambio P ´erez and L","venue":null,"work_id":"f0fa226f-48ab-4b61-9ae8-f53418b1d588","year":2018},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:9caee21b568ad5b032316ba67fcc2556466f3a0a76f5e66a369d0f95676c2c80","observation_id":"4f3f8c61-d745-4012-b39a-5937dc63d8a5","resolution":{"observed_at":"2026-05-24T00:43:40.885711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"a priori","venue":null,"work_id":"e711c7fc-45e8-47da-8ebb-c845687ae034","year":2008},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:058a1b5eb83faf993fce2afb38239ab204c79bc18a855de09a3073c03006bad2","observation_id":"e4232862-5764-4fcc-8b3e-2d93bdd79990","resolution":{"observed_at":"2026-05-24T00:43:40.807822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mohammadi and A","venue":null,"work_id":"09b0a28f-c98b-4e23-848e-e73862ac0443","year":2024},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:d3d69d404fb293028a0e8fc2a43e55a2982303b94bedcac87b54b48954463a19","observation_id":"cddc6f7f-c9ae-4b05-b219-3d833490c108","resolution":{"observed_at":"2026-05-24T00:43:40.814172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Povalej, Quasi-Newton’s method for multiobjective optimization, Journal of Computational and Applied Mathematics, 255 (2014), pp","venue":null,"work_id":"c4760add-b55d-4064-869a-a29f0055ea13","year":2014},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:f265f2ae6fef89afa2c18e1bbaa9a2c9e049de9d16953209c2c519dbf95a4589","observation_id":"920430c4-ef80-4538-ac68-dd2a1fc25e13","resolution":{"observed_at":"2026-05-24T00:43:40.817798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prudente and D","venue":null,"work_id":"b7b9bdf5-58f3-4c6c-97c8-0e7651ef1653","year":2022},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:7620adc827430c6a28e01b305649057453e1cd5f6478cdefb3e098751baeb562","observation_id":"fe33b03f-27f1-424d-aa76-8672ca5890dc","resolution":{"observed_at":"2026-05-24T00:43:40.882745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rosso, V","venue":null,"work_id":"37bc4a60-6fb2-4813-a6a9-c596979d1692","year":2020},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:0bc8ed3334fed430c9f50a9e9727381674aa8544c6c464d14f448da1855336c7","observation_id":"f40316fc-492e-4c2b-bdf5-ac3be0833dab","resolution":{"observed_at":"2026-05-24T00:43:40.802639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sch ¨utze, A","venue":null,"work_id":"6bd63a20-192f-48f1-a639-fc051d6cec7b","year":2011},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:90e1073235b3694492826e49d013a3c0e4b61c9b52b4d4d1ee34f5d20fcbf46d","observation_id":"70ebdb8e-6922-47b4-822b-4c8d466a8dcf","resolution":{"observed_at":"2026-05-24T00:43:40.840539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhang, A","venue":null,"work_id":"7a084933-b0ed-415d-9883-472af406e57f","year":2009},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:7028ec81070b0027005a3aaea7deedd07ff14f7384e54d30fbf6bc8dee4eabcf","observation_id":"91ac62de-8470-4ed2-9704-248b5dd28bb6","resolution":{"observed_at":"2026-05-24T00:43:40.792227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zitzler and L","venue":null,"work_id":"bb294029-8916-444d-8dfd-d5bbe25b7141","year":1998},"citing_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-24T00:42:56.901377Z"},"links":{"citing_paper":"/paper/2405.08450"},"observation_digest":"sha256:1f684c50ccfb955f75318da142b6edea1eb63446b2121a80dc5c678822a2f184","observation_id":"740ac932-3941-48fb-9cc8-3dcec8cb4af1","resolution":{"observed_at":"2026-05-24T00:43:40.795585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":25},"total_outbound_references":34},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 3 inbound Pith citation observations for arXiv:2405.08450."}