{"as_of":"2026-08-12T11:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c491a2cba93c627eccf641c3e3261e27ba9d3f835cc23f1f6ef860135f78a0d","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:54:31.269368Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:13:04.507340Z","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-06T11:17:34.925815Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17594","snapshot_observed_at":"2026-08-07T01:13:04.507340Z","title":"Liuzzi and S","venue":null,"work_id":null,"year":2025},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.507340Z"},"links":{"cited_paper":"/paper/2505.17594","citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:969cb89c923624f7554215d497eefb7bc05a534a44df86250e56a760a6cf8b03","observation_id":"7c9bfe77-3b7a-4986-b9fd-6c7c6b98658e","resolution":{"observed_at":"2026-08-07T01:13:04.507340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2505.17594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.17594","snapshot_observed_at":"2026-08-06T11:17:34.925815Z","title":"Worst-case complexity analysis of derivative-free methods for multi-objective optimization","venue":"math.OC","work_id":"b6459a3e-b1ec-4f89-9a54-9acfdfa42e3e","year":2025},"citing_paper":{"arxiv_id":"2507.23054","last_updated":"2025-07-30T19:29:51Z","snapshot_observed_at":"2026-08-07T00:00:31.195591Z","submitted_at":"2025-07-30T19:29:51Z","title":"Adaptive direct search algorithms for constrained optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T11:17:34.467170Z"},"links":{"cited_paper":"/paper/2505.17594","citing_paper":"/paper/2507.23054"},"observation_digest":"sha256:e25e66e49a844d6d685aa6390ec24c00eab9a88cb1e2b48799c8b5e327655fa7","observation_id":"9f673279-a2f1-4fcf-91f7-75883c913b27","resolution":{"observed_at":"2026-08-06T11:17:34.930960Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.17594/citation-record","integrity":"/paper/2505.17594/integrity","json":"/paper/2505.17594/citation-record.json","paper":"/paper/2505.17594"},"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-07T14:54:33.311862Z","title":null,"venue":null,"work_id":"ab920faa-c836-486c-ba6f-46fca18324a2","year":2021},"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":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.183068Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:e4cbd2e7a566800640fe571ef6aec8603864a86b5ccf35048131e3f43595d752","observation_id":"189d0b98-590a-440a-814b-9e23ee2e8ffa","resolution":{"observed_at":"2026-08-07T14:54:33.420284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:33.018133Z","title":"Cartis, N","venue":null,"work_id":"04bc9825-4618-4a1c-9f88-828af3ac05c9","year":2022},"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":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.259362Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:90bbf96b77f47d0fabfee8e99c6ddc30f5f336206a78f2bf9c4a8cdc1669b7ca","observation_id":"07595d3c-988a-4fc9-8e6c-fc04f0d5e4ca","resolution":{"observed_at":"2026-08-07T14:54:33.163975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.961432Z","title":"Cartis, N","venue":null,"work_id":"7aa61b29-2538-4c91-a424-2bb0367ec1a4","year":2010},"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":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.355949Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:13ed8479e464f4ae8b03698e0af2ca913fb6e2b5733b28db351a63497820552c","observation_id":"847a5744-e728-4686-867c-42092bd4253f","resolution":{"observed_at":"2026-08-07T14:54:33.004200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.823657Z","title":null,"venue":null,"work_id":"eb4723cc-739d-4c27-a9af-e2d973230f75","year":2017},"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":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.454325Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:5b4796e3a4c60c3b9ea896f6b290a7bd15b5e292a0b250452306664f2be5f79b","observation_id":"68a7e720-6398-46b6-9455-a8a4c8f8c148","resolution":{"observed_at":"2026-08-07T14:54:32.894957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.721767Z","title":null,"venue":null,"work_id":"d8f4751c-c00a-44fe-9f8f-84f10f3e39e6","year":2013},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.517417Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:260098d73dcbe36f92b9cefbcc4cc380f98f1caa42f7d9880f5e8c2705b7f880","observation_id":"2fb80a1f-ad9a-46c7-8097-e510571a3f1b","resolution":{"observed_at":"2026-08-07T14:54:32.775271Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.592961Z","title":"Brilli, M","venue":null,"work_id":"2d71a4e0-87f0-4e50-b66a-50e8a8899c1c","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":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.601955Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:3fb104a2429d47d171ff5e17dba4833fe00ecea50268f4a9682a6739bb1bfac9","observation_id":"25aa5071-6193-4d40-9f1a-eca3db1e3d36","resolution":{"observed_at":"2026-08-07T14:54:32.648082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.470376Z","title":"Cartis, N","venue":null,"work_id":"c682dfb6-230b-44bd-930d-0a3a7490c3a7","year":2012},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.661716Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:79343198490c71d57074d76c300d98e8df1c6fba61ee442e8aa3feb93c633bf3","observation_id":"6dd923ea-7cfa-45a4-8623-d007cbb3c93d","resolution":{"observed_at":"2026-08-07T14:54:32.529246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.291229Z","title":"Cartis, N","venue":null,"work_id":"512d9433-3d67-4f68-8f43-c26fd7bfcc4b","year":2011},"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":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.761602Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:641d9c6c1364f0dac75eb8fe8fd0279570fc80e35a6ef1e1fd1801aa43c3d9b6","observation_id":"6287585d-da39-4c6b-b0da-49e6c67f3af5","resolution":{"observed_at":"2026-08-07T14:54:32.369925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.167841Z","title":"Cartis, N","venue":null,"work_id":"12521fd1-9d67-48af-b499-7a8c88263309","year":2011},"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":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.810283Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:d0ece0f12021e45a338c65c1a8b0e8eb73c4ac666af6db5542fd5528738c5654","observation_id":"ecd51706-c722-40e4-b186-ef1e4a6b4017","resolution":{"observed_at":"2026-08-07T14:54:32.237486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:32.060066Z","title":"Complexity of gradient descent for multiobjective optimization.Optimization Methods and Software, 34(5):949–959, 2019","venue":null,"work_id":"81c9b84b-f06a-4643-a71a-1ec900d0017c","year":2019},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.869320Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:f3c108ef4e1ec9cedc5623737d3a7e905d7ef67d9660a2dae70e1da71ea3de5d","observation_id":"49c6854f-e3d0-4a86-8e4e-a20521bf1251","resolution":{"observed_at":"2026-08-07T14:54:32.107216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:31.943187Z","title":"Calder´ on, M","venue":null,"work_id":"eea13e23-a6d6-4d0e-9f2a-9f09f6c3b393","year":2022},"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":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.948966Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:44721e1ccaea1bb7371b22b52062889052e22862bdd023fd58ef35be544ddded","observation_id":"b3e34137-2021-479c-86a9-8fdcfe78fbe0","resolution":{"observed_at":"2026-08-07T14:54:32.004394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:31.835823Z","title":null,"venue":null,"work_id":"733b688b-5caa-4c2e-91ec-4489f11b5f7a","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":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:30.995051Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:4cb5622e29496a81a572a5325db5f7f4992815e1ad1a6fb9f7f28c74946c35c7","observation_id":"7552e829-09da-49f9-9cff-ac83e7e24d2b","resolution":{"observed_at":"2026-08-07T14:54:31.878784Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:54:31.694593Z","title":"Fliege and B","venue":null,"work_id":"54295284-acd6-4ec5-b2b6-1c463e3d73a9","year":2000},"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":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:31.142973Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:d3d459c0781762be6f23d13df4e6a16f8e3b7f1042bb8934aab42a06987f2bc5","observation_id":"4a9a187a-9261-4d3c-affa-f522704049b9","resolution":{"observed_at":"2026-08-07T14:54:31.766073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:31.570807Z","title":null,"venue":null,"work_id":"01e7b7db-e7f3-43c8-877f-d08b39a5409f","year":2011},"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":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:31.188831Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:ffde6c31aa185ea6fe0739a8d616c50197bf3a2da75485d286962d7e53018bf5","observation_id":"f41dcc02-00d8-4200-befd-03e8d9bb5bb6","resolution":{"observed_at":"2026-08-07T14:54:31.645761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:54:31.411311Z","title":"Liuzzi, S","venue":null,"work_id":"37477b51-0906-4f8e-96ea-722f72cefb23","year":2016},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:54:31.269368Z"},"links":{"citing_paper":"/paper/2505.17594"},"observation_digest":"sha256:5f5a63762b6aac75b22c040cc53cd2770196a58d653eecc18140d323fdde25a1","observation_id":"77be846f-2586-4eb3-91e2-1f268e9fbc95","resolution":{"observed_at":"2026-08-07T14:54:31.485002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17594","last_updated":"2025-05-23T07:59:03Z","latest_version":1,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":16},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 2 inbound Pith citation observations for arXiv:2505.17594."}