Paper Citation Record · LEDGER

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction

As of 12 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2506.11929.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.11929 v2

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T01:13:04.629758Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

18 of 18 outbound references displayed

verified exact8
verified fuzzy0
unresolved6
parse uncertain0
malformed identifier3
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation edb36a60-6330-4f00-8582-69bb2e97c8b2 · outbound

This paper cites an unresolved cited work.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:03.838153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb6fc63a-ce45-4cb0-a3c0-5dc77c5fb81c · outbound

This paper cites an unresolved cited work.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Unresolved cited work

Reference 2

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T01:13:06.238651Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation d748b058-5d82-41c5-9230-835905597bf4 · outbound

This paper cites Calder´ on, M.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Calder´ on, M

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:03.959929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e97240d9-6bd7-4763-a492-0ab07b998154 · outbound

This paper cites Cartis, N.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Cartis, N

Reference 4

Resolution: verified exact; doi, observed 2026-08-07T01:13:05.315354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 1452d12d-e71d-4538-b8ea-cc16b1f6b331 · outbound

This paper cites Cocchi and M.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Cocchi and M

Reference 5

Resolution: verified exact; doi, observed 2026-08-07T01:13:05.216665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f9e7c381-9dbf-4a64-a9f6-481d8aa1d46c · outbound

This paper cites Cocchi, G.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Cocchi, G

Reference 6

Resolution: verified exact; doi, observed 2026-08-07T01:13:05.140547Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b3eaff5d-fa15-4fdf-8566-3a498e90aa6b · outbound

This paper cites Cocchi, M.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Cocchi, M

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:04.120508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35a5eb27-3f80-415b-9dbb-7a1dd14fb27f · outbound

This paper cites Cristofari, M.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Cristofari, M

Reference 8

Resolution: verified exact; doi, observed 2026-08-07T01:13:05.031230Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 46d853dc-3e61-4b06-a577-d608acb129cf · outbound

This paper cites an unresolved cited work.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:04.172427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30568018-4811-4f0d-a685-8c87c361a763 · outbound

This paper cites an unresolved cited work.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Unresolved cited work

Reference 10

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T01:13:06.097205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 471439e2-cfa7-4ad4-af9d-d99c3aa10a71 · outbound

This paper cites Fliege and B.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Fliege and B

Reference 11

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T01:13:05.983455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation cf2ffeac-8a92-4ada-b5fc-ff4ffee0822e · outbound

This paper cites Fliege, A.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Fliege, A

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:04.330556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37efa37d-84c2-4245-bb2b-28c14c641b38 · outbound

This paper cites an unresolved cited work.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Unresolved cited work

Reference 13

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T01:13:05.623375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 8e6afb84-7400-4134-8a1b-27a1aaaf8e9a · outbound

This paper cites Lapucci and P.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Lapucci and P

Reference 14

Resolution: verified exact; doi, observed 2026-08-07T01:13:04.947486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation c1ef07ee-49bd-4a51-83ff-9f4e294332e9 · outbound

This paper cites Effective Front-Descent Algorithms with Convergence Guarantees.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Effective Front-Descent Algorithms with Convergence Guarantees

Reference 15

Resolution: verified exact; local_arxiv, observed 2026-08-07T01:13:05.417521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 7c9bfe77-3b7a-4986-b9fd-6c7c6b98658e · outbound

This paper cites Worst-case complexity analysis of derivative-free methods for multi-objective optimization.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Worst-case complexity analysis of derivative-free methods for multi-objective optimization

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T01:13:04.507340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 919a0ebb-7fcb-4723-bee4-ea1f87d2a66d · outbound

This paper cites Liuzzi, S.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Liuzzi, S

Reference 17

Resolution: verified exact; doi, observed 2026-08-07T01:13:04.831613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ec0eb224-b422-4377-a497-b561432972bd · outbound

This paper cites Mohammadi and A.

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction Mohammadi and A

Reference 18

Resolution: verified exact; doi, observed 2026-08-07T01:13:04.719061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

No inbound Pith citation observations are available.