{"as_of":"2026-08-13T11:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ece2f7a55a96f86ae8ac60f00a6c7de7a4709b1f19f56ba16b55f2f6396d9732","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:13:04.629758Z","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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11929/citation-record","integrity":"/paper/2506.11929/integrity","json":"/paper/2506.11929/citation-record.json","paper":"/paper/2506.11929"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:03.838153Z","title":null,"venue":null,"work_id":null,"year":1999},"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":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:03.838153Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:979df53285e95c4f909a7b8a191314efe527518da4c86df220a96c62658bb115","observation_id":"edb36a60-6330-4f00-8582-69bb2e97c8b2","resolution":{"observed_at":"2026-08-07T01:13:03.838153Z","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-07T01:13:06.180545Z","title":null,"venue":null,"work_id":"9aef7805-4dbd-4ec5-b219-e16f10638989","year":2017},"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":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:03.904811Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:127011d0d4de3f5807e2ff3bf79db1e5a3cca039b149a1fc30005b2b0cad2ae8","observation_id":"fb6fc63a-ce45-4cb0-a3c0-5dc77c5fb81c","resolution":{"observed_at":"2026-08-07T01:13:06.238651Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:03.959929Z","title":"Calder´ on, M","venue":null,"work_id":null,"year":2022},"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":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:03.959929Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:a13f5ec6ad45d41181e830cb1f8f6173238323279ddab2fbf003c53203efca5e","observation_id":"d748b058-5d82-41c5-9230-835905597bf4","resolution":{"observed_at":"2026-08-07T01:13:03.959929Z","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":"10.1007/s10208-017-9363-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Cartis, N","venue":"Foundations of Computational Mathematics","work_id":"5f93ce3f-40ae-4998-bbea-1174835c3923","year":2018},"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":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:03.991081Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:0aea6db8f4f8ed544699e1bd72e2690431f8a39191a473a06d88b2fe4f9557da","observation_id":"e97240d9-6bd7-4763-a492-0ab07b998154","resolution":{"observed_at":"2026-08-07T01:13:05.315354Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s10589-020-00204-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Cocchi and M","venue":"Computational Optimization and Applications","work_id":"4e463ebe-5dba-4442-8417-188de9f93524","year":2020},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.020165Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:1b5cb3b23c7d5d723fd2e8ad9349a00d66a67f9b7e9f6f80c0d04926f2222a18","observation_id":"1452d12d-e71d-4538-b8ea-cc16b1f6b331","resolution":{"observed_at":"2026-08-07T01:13:05.216665Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s10589-020-00192-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Cocchi, G","venue":"Computational Optimization and Applications","work_id":"c6352072-8eec-4c45-8bff-2a487ac11926","year":2020},"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":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.087385Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:af056ffe38e9535246607bdf9bccb2453224843ad74b36f220fa89975848403a","observation_id":"f9e7c381-9dbf-4a64-a9f6-481d8aa1d46c","resolution":{"observed_at":"2026-08-07T01:13:05.140547Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:04.120508Z","title":"Cocchi, M","venue":null,"work_id":null,"year":2021},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.120508Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:03e7c142f102f91d8757294765cd61a74b99d7c61468f271bf94ac6745e8bc10","observation_id":"b3eaff5d-fa15-4fdf-8566-3a498e90aa6b","resolution":{"observed_at":"2026-08-07T01:13:04.120508Z","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":"10.1007/s10957-024-02478-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Cristofari, M","venue":"Journal of Optimization Theory and Applications","work_id":"260b23ac-9d69-4830-a975-954267ab2a89","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":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.144485Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:cd2881418f4ddd5e180ec719a8189ac3a672cb6f4874c040503417b45164d199","observation_id":"35a5eb27-3f80-415b-9dbb-7a1dd14fb27f","resolution":{"observed_at":"2026-08-07T01:13:05.031230Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:04.172427Z","title":null,"venue":null,"work_id":null,"year":2011},"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":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.172427Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:504d3776503821d7c5cd75da653a77302e1005718d0a26f8e56fc7eb62f8bc0e","observation_id":"46d853dc-3e61-4b06-a577-d608acb129cf","resolution":{"observed_at":"2026-08-07T01:13:04.172427Z","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-07T01:13:06.008587Z","title":null,"venue":null,"work_id":"0326526d-9b03-490e-be60-3f4ea247bd90","year":2021},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.243348Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:d19836336a3da773b6141261a74e97ed45731fd4dfd205f44da9ce6c8ded703b","observation_id":"30568018-4811-4f0d-a685-8c87c361a763","resolution":{"observed_at":"2026-08-07T01:13:06.097205Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-07T01:13:05.933046Z","title":"Fliege and B","venue":null,"work_id":"5cd81e33-f1c3-4d3f-8f1b-fd01ccde8ac4","year":2000},"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":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.271871Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:b26834c3d7282340ba87303e2bf75c8c99f148ea5116a5793d09a6bab686f231","observation_id":"471439e2-cfa7-4ad4-af9d-d99c3aa10a71","resolution":{"observed_at":"2026-08-07T01:13:05.983455Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:04.330556Z","title":"Fliege, A","venue":null,"work_id":null,"year":2019},"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":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.330556Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:47c7075eff9a5bb556f905398b50f837137abee7dfc8af605c0a8a0bb3930174","observation_id":"cf2ffeac-8a92-4ada-b5fc-ff4ffee0822e","resolution":{"observed_at":"2026-08-07T01:13:04.330556Z","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":"2024.10711","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:05.572678Z","title":null,"venue":null,"work_id":"c409a13f-1f3c-41f7-8321-727cbebccf1f","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":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.361142Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:be9edabf4d93977644a3c1d5defec7d460fe763cb4c2457d8c46f44a51296555","observation_id":"37efa37d-84c2-4245-bb2b-28c14c641b38","resolution":{"observed_at":"2026-08-07T01:13:05.623375Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":"10.1016/j.orl.2023.03","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:13:04.903747Z","title":"Lapucci and P","venue":null,"work_id":"bd7e9f85-08fd-4d40-842f-38a7f21e8cad","year":2023},"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":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.410963Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:d4e1595dabc6bae83281e8889806e921a4cb615da70a66253ee361e813005445","observation_id":"8e6afb84-7400-4134-8a1b-27a1aaaf8e9a","resolution":{"observed_at":"2026-08-07T01:13:04.947486Z","resolver_source":"doi","status":"verified_exact"},"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":{"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:a320502b13504a1a304901dd348e495b15f8e567a305f1ae97b190410bb45f57","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-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":{"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1037810","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Liuzzi, S","venue":"SIAM Journal on Optimization","work_id":"c390d2ce-b4c5-4457-9d73-df83eacf67c6","year":2016},"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":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.565901Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:0e6b881647aae996a2b65bb77540812f4f642e17e06ffbb30fcd3388d73e1a5f","observation_id":"919a0ebb-7fcb-4723-bee4-ea1f87d2a66d","resolution":{"observed_at":"2026-08-07T01:13:04.831613Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s10589-023-00510-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Mohammadi and A","venue":"Computational Optimization and Applications","work_id":"6e3ad18d-c9b5-4b85-85ba-d75b1fabb6df","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":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:13:04.629758Z"},"links":{"citing_paper":"/paper/2506.11929"},"observation_digest":"sha256:d2d275358993127f0b612f6005f0984e6f0c924b0225b5aa913a690c73b66492","observation_id":"ec0eb224-b422-4377-a497-b561432972bd","resolution":{"observed_at":"2026-08-07T01:13:04.719061Z","resolver_source":"doi","status":"verified_exact"},"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":"2506.11929","last_updated":"2026-07-22T15:32:20Z","latest_version":2,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":3,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2506.11929."}