{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","short_pith_number":"pith:ZAYFJ5A6","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"},"canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","source":{"kind":"arxiv","id":"2506.11929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11929","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11929v1","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11929","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZAYFJ5A62CXV","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZAYFJ5A62CXVSCJ5","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZAYFJ5A6","created_at":"2026-07-05T11:21:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","target":"record","payload":{"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"},"canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","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"},"source_kind":"arxiv","source_id":"2506.11929","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAwmoQh3L81dUntRU3MJYGsG5jtzqTRAr5ppM/wz8UOg16kGI3reFKLWAlhW+D6o+PliKV94Hdn4i4j4E6N2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:18:45.032874Z"},"content_sha256":"684f71025968bd2af89df884b1bda9f1bcda48fd9bc98b90818f9f2223dde944","schema_version":"1.0","event_id":"sha256:684f71025968bd2af89df884b1bda9f1bcda48fd9bc98b90818f9f2223dde944"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Osiy7IEvmhQDuNQprxwG/M0BYmHfyoq/BMLhvbWdaTwniiElkEYyZO4DyzNI/zQN+aP9Ax7S1zrTckq77GdOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:18:45.033405Z"},"content_sha256":"9a1016fea245b729d7cc2c6bc952e8a5d380b472d4638dd887e5136a7bd39972","schema_version":"1.0","event_id":"sha256:9a1016fea245b729d7cc2c6bc952e8a5d380b472d4638dd887e5136a7bd39972"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/bundle.json","state_url":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T06:18:45Z","links":{"resolver":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","bundle":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/bundle.json","state":"https://pith.science/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAYFJ5A62CXVSCJ5LA2RZ5MFDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZAYFJ5A62CXVSCJ5LA2RZ5MFDA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aef9b70d1ba200a5c0da688ce31aec1cf83368aaca2db0370931a4703682bd33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T16:31:27Z","title_canon_sha256":"fc94c2b92cdd5364921203dac14028b9e471d4df2355e187e10e3da77d1c3128"},"schema_version":"1.0","source":{"id":"2506.11929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11929","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11929v1","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11929","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZAYFJ5A62CXV","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZAYFJ5A62CXVSCJ5","created_at":"2026-07-05T11:21:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZAYFJ5A6","created_at":"2026-07-05T11:21:13Z"}],"graph_snapshots":[{"event_id":"sha256:9a1016fea245b729d7cc2c6bc952e8a5d380b472d4638dd887e5136a7bd39972","target":"graph","created_at":"2026-07-05T11:21:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.11929/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Cristofari, Giampaolo Liuzzi, Marianna De Santis, Stefano Lucidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T16:31:27Z","title":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11929","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:684f71025968bd2af89df884b1bda9f1bcda48fd9bc98b90818f9f2223dde944","target":"record","created_at":"2026-07-05T11:21:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aef9b70d1ba200a5c0da688ce31aec1cf83368aaca2db0370931a4703682bd33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T16:31:27Z","title_canon_sha256":"fc94c2b92cdd5364921203dac14028b9e471d4df2355e187e10e3da77d1c3128"},"schema_version":"1.0","source":{"id":"2506.11929","kind":"arxiv","version":1}},"canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c83054f41ed0af59093d58351cf5851827abea09d5a64915570a10d97aecf4dc","first_computed_at":"2026-07-05T11:21:13.029183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:13.029183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gv2UpTFvs6UHZkYpIV/qI2j558vcnk/F8YMV4xIorvn+k+ZdB/H+X7E1KfEU1govHeQx3b87JQr13zASikCvBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:13.029608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.11929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:684f71025968bd2af89df884b1bda9f1bcda48fd9bc98b90818f9f2223dde944","sha256:9a1016fea245b729d7cc2c6bc952e8a5d380b472d4638dd887e5136a7bd39972"],"state_sha256":"a3e8821d9afc2de7374b5f3854379054053937a6e0d441a80598788fd3556dc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6eCR5E85K1zEoJf0KyZxKzRhXExzVNmU6j+Et8o1vhqtgyBhyj1H2GujZJ4A7yw88wv10xv+0/4gO38hp3bBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T06:18:45.038742Z","bundle_sha256":"b2451994b993131cff8559dca576665b81bb89ae89b980e428ff430a06b456d8"}}