{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","short_pith_number":"pith:ZAYFJ5A6","schema_version":"1.0","canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","source":{"kind":"arxiv","id":"2506.11929","version":1},"attestation_state":"computed","paper":{"title":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari, Giampaolo Liuzzi, Marianna De Santis, Stefano Lucidi","submitted_at":"2025-06-13T16:31:27Z","abstract_excerpt":"In this paper, we are concerned with a worst-case complexity analysis of a-posteriori algorithms for unconstrained multiobjective optimization. Specifically, we propose an algorithmic framework that generates sets of points by means of $p$th-order models regularized with a power $p+1$ of the norm of the step. Through a tailored search procedure, several trial points are generated at each iteration and they can be added to the current set if a decrease is obtained for at least one objective function. Building upon this idea, we devise two algorithmic versions: at every iteration, the first trie"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.11929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T16:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"fc94c2b92cdd5364921203dac14028b9e471d4df2355e187e10e3da77d1c3128","abstract_canon_sha256":"aef9b70d1ba200a5c0da688ce31aec1cf83368aaca2db0370931a4703682bd33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:13.029608Z","signature_b64":"Gv2UpTFvs6UHZkYpIV/qI2j558vcnk/F8YMV4xIorvn+k+ZdB/H+X7E1KfEU1govHeQx3b87JQr13zASikCvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","last_reissued_at":"2026-07-05T11:21:13.029183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:13.029183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari, Giampaolo Liuzzi, Marianna De Santis, Stefano Lucidi","submitted_at":"2025-06-13T16:31:27Z","abstract_excerpt":"In this paper, we are concerned with a worst-case complexity analysis of a-posteriori algorithms for unconstrained multiobjective optimization. Specifically, we propose an algorithmic framework that generates sets of points by means of $p$th-order models regularized with a power $p+1$ of the norm of the step. Through a tailored search procedure, several trial points are generated at each iteration and they can be added to the current set if a decrease is obtained for at least one objective function. Building upon this idea, we devise two algorithmic versions: at every iteration, the first trie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11929","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.11929/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.11929","created_at":"2026-07-05T11:21:13.029238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11929v1","created_at":"2026-07-05T11:21:13.029238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11929","created_at":"2026-07-05T11:21:13.029238+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAYFJ5A62CXV","created_at":"2026-07-05T11:21:13.029238+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAYFJ5A62CXVSCJ5","created_at":"2026-07-05T11:21:13.029238+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAYFJ5A6","created_at":"2026-07-05T11:21:13.029238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","json":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA.json","graph_json":"https://pith.science/api/pith-number/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/graph.json","events_json":"https://pith.science/api/pith-number/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/events.json","paper":"https://pith.science/paper/ZAYFJ5A6"},"agent_actions":{"view_html":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","download_json":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA.json","view_paper":"https://pith.science/paper/ZAYFJ5A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11929&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/action/storage_attestation","attest_author":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/action/author_attestation","sign_citation":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/action/citation_signature","submit_replication":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/action/replication_record"}},"created_at":"2026-07-05T11:21:13.029238+00:00","updated_at":"2026-07-05T11:21:13.029238+00:00"}