{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LQWORG2N6Z2Q6AXMR3QYHP3HD2","short_pith_number":"pith:LQWORG2N","canonical_record":{"source":{"id":"2301.03310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T12:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"b31950538f3ab74f51e93ae65b8f61c57d37303e844597049e7ec2024b12948e","abstract_canon_sha256":"748a6ba81b165786b48cc061b1aff54bc6eadaf9786b28732efed3da1846772d"},"schema_version":"1.0"},"canonical_sha256":"5c2ce89b4df6750f02ec8ee183bf671e9635d98439ce1e9435cacde9c64d1330","source":{"kind":"arxiv","id":"2301.03310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03310","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03310v1","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03310","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_12","alias_value":"LQWORG2N6Z2Q","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_16","alias_value":"LQWORG2N6Z2Q6AXM","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_8","alias_value":"LQWORG2N","created_at":"2026-07-05T05:51:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LQWORG2N6Z2Q6AXMR3QYHP3HD2","target":"record","payload":{"canonical_record":{"source":{"id":"2301.03310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T12:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"b31950538f3ab74f51e93ae65b8f61c57d37303e844597049e7ec2024b12948e","abstract_canon_sha256":"748a6ba81b165786b48cc061b1aff54bc6eadaf9786b28732efed3da1846772d"},"schema_version":"1.0"},"canonical_sha256":"5c2ce89b4df6750f02ec8ee183bf671e9635d98439ce1e9435cacde9c64d1330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:44.016143Z","signature_b64":"kFqm72L98OwEUz6qTz5hbFhn9m2HK703mcAbwWORsm1RyurkbzgjKsYH6eL2dYFgfB/I6iMzPwuhy/X70IFkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c2ce89b4df6750f02ec8ee183bf671e9635d98439ce1e9435cacde9c64d1330","last_reissued_at":"2026-07-05T05:51:44.015637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:44.015637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.03310","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-05T05:51:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkEw134/XzFE9plbo7ra4MR+YQfGzHAqN/5uSMwbT2mdsA85frU1L7t9zG54pCGugAHlnE8JSQXj2ymwoVf3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:37:35.143142Z"},"content_sha256":"55a21b8505f28e6745c1e1a0bd959c759882d200bac89b9d1ad15253402909d7","schema_version":"1.0","event_id":"sha256:55a21b8505f28e6745c1e1a0bd959c759882d200bac89b9d1ad15253402909d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LQWORG2N6Z2Q6AXMR3QYHP3HD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Front Steepest Descent for Multi-objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matteo Lapucci, Pierluigi Mansueto","submitted_at":"2023-01-09T12:58:06Z","abstract_excerpt":"In this paper, we deal with the Front Steepest Descent algorithm for multi-objective optimization. We point out that the algorithm from the literature is often incapable, by design, of spanning large portions of the Pareto front. We thus introduce some modifications within the algorithm aimed to overcome this significant limitation. We prove that the asymptotic convergence properties of the algorithm are preserved and numerically show that the proposed method significantly outperforms the original one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03310","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/2301.03310/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-05T05:51:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/UUh7YzHF4zyccwOQRavoim+rh/9716yml8arm+XcqtHzndPq7pQWjFnJNCulvzDZmbpdXAPCHIhPuThdAJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:37:35.143638Z"},"content_sha256":"3f8deb57779c45b4d8d13ef8fb77a099fa00180db919dccca65841a0a0cd87f6","schema_version":"1.0","event_id":"sha256:3f8deb57779c45b4d8d13ef8fb77a099fa00180db919dccca65841a0a0cd87f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/bundle.json","state_url":"https://pith.science/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/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-15T10:37:35Z","links":{"resolver":"https://pith.science/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2","bundle":"https://pith.science/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/bundle.json","state":"https://pith.science/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQWORG2N6Z2Q6AXMR3QYHP3HD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LQWORG2N6Z2Q6AXMR3QYHP3HD2","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":"748a6ba81b165786b48cc061b1aff54bc6eadaf9786b28732efed3da1846772d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T12:58:06Z","title_canon_sha256":"b31950538f3ab74f51e93ae65b8f61c57d37303e844597049e7ec2024b12948e"},"schema_version":"1.0","source":{"id":"2301.03310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03310","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03310v1","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03310","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_12","alias_value":"LQWORG2N6Z2Q","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_16","alias_value":"LQWORG2N6Z2Q6AXM","created_at":"2026-07-05T05:51:44Z"},{"alias_kind":"pith_short_8","alias_value":"LQWORG2N","created_at":"2026-07-05T05:51:44Z"}],"graph_snapshots":[{"event_id":"sha256:3f8deb57779c45b4d8d13ef8fb77a099fa00180db919dccca65841a0a0cd87f6","target":"graph","created_at":"2026-07-05T05:51:44Z","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/2301.03310/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we deal with the Front Steepest Descent algorithm for multi-objective optimization. We point out that the algorithm from the literature is often incapable, by design, of spanning large portions of the Pareto front. We thus introduce some modifications within the algorithm aimed to overcome this significant limitation. We prove that the asymptotic convergence properties of the algorithm are preserved and numerically show that the proposed method significantly outperforms the original one.","authors_text":"Matteo Lapucci, Pierluigi Mansueto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T12:58:06Z","title":"Improved Front Steepest Descent for Multi-objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03310","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:55a21b8505f28e6745c1e1a0bd959c759882d200bac89b9d1ad15253402909d7","target":"record","created_at":"2026-07-05T05:51:44Z","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":"748a6ba81b165786b48cc061b1aff54bc6eadaf9786b28732efed3da1846772d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-09T12:58:06Z","title_canon_sha256":"b31950538f3ab74f51e93ae65b8f61c57d37303e844597049e7ec2024b12948e"},"schema_version":"1.0","source":{"id":"2301.03310","kind":"arxiv","version":1}},"canonical_sha256":"5c2ce89b4df6750f02ec8ee183bf671e9635d98439ce1e9435cacde9c64d1330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c2ce89b4df6750f02ec8ee183bf671e9635d98439ce1e9435cacde9c64d1330","first_computed_at":"2026-07-05T05:51:44.015637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:44.015637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFqm72L98OwEUz6qTz5hbFhn9m2HK703mcAbwWORsm1RyurkbzgjKsYH6eL2dYFgfB/I6iMzPwuhy/X70IFkCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:44.016143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.03310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55a21b8505f28e6745c1e1a0bd959c759882d200bac89b9d1ad15253402909d7","sha256:3f8deb57779c45b4d8d13ef8fb77a099fa00180db919dccca65841a0a0cd87f6"],"state_sha256":"d0eea34a7546c7894afcc74d5ec8a1451b37d2e79d05f84eaa88209361cd8979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csUT/rw933/4Q6rqc2RtjKZd4SFmuev7rIvKAjvorZAYW0wqwu3+ErzSDblc4hotoNlsMNORND4wHuCj4KPSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:37:35.148592Z","bundle_sha256":"2551d1873396659682004de97a83eac026eaca17a47d645d7f659b7a43130949"}}