{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TTVNI27L3PROHX5FVWPZK76PSN","short_pith_number":"pith:TTVNI27L","schema_version":"1.0","canonical_sha256":"9cead46bebdbe2e3dfa5ad9f957fcf9363433b7bacd9aed03064219ba2b0abd1","source":{"kind":"arxiv","id":"2506.08181","version":1},"attestation_state":"computed","paper":{"title":"A Cubic Regularization Method for Multiobjective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Douglas S. Gon\\c{c}alves, Jefferson G. Melo, Max L. N. Gon\\c{c}alves","submitted_at":"2025-06-09T19:45:42Z","abstract_excerpt":"This work introduces a new cubic regularization method for nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each component of the objective function is minimized. This model allows approximations for the first- and second-order derivatives, which must satisfy suitable error conditions. One interesting feature of the proposed algorithm is that the regularization parameter of the model and the accuracy of the derivative approximations are jointly adjusted using a nonmonotone line search criterion. I"},"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.08181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-09T19:45:42Z","cross_cats_sorted":[],"title_canon_sha256":"d619d7e1655eaa97dc573f582a5810cf756090c9a863051a446b664557edb69b","abstract_canon_sha256":"422591e39b42e949c88b756477396e34e37f89492abb7ff491fa577b03e01249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:45.965645Z","signature_b64":"GPDYFM8LTPqzQ8Y+hjG46yBrwqTJQTN7V5IcmsRdrPi4KPKT2qFc3i8PcK5sjKVW2Z64Te7ylo17bYiMDGdaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cead46bebdbe2e3dfa5ad9f957fcf9363433b7bacd9aed03064219ba2b0abd1","last_reissued_at":"2026-07-05T11:18:45.965190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:45.965190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cubic Regularization Method for Multiobjective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Douglas S. Gon\\c{c}alves, Jefferson G. Melo, Max L. N. Gon\\c{c}alves","submitted_at":"2025-06-09T19:45:42Z","abstract_excerpt":"This work introduces a new cubic regularization method for nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each component of the objective function is minimized. This model allows approximations for the first- and second-order derivatives, which must satisfy suitable error conditions. One interesting feature of the proposed algorithm is that the regularization parameter of the model and the accuracy of the derivative approximations are jointly adjusted using a nonmonotone line search criterion. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08181","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.08181/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.08181","created_at":"2026-07-05T11:18:45.965244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08181v1","created_at":"2026-07-05T11:18:45.965244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08181","created_at":"2026-07-05T11:18:45.965244+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTVNI27L3PRO","created_at":"2026-07-05T11:18:45.965244+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTVNI27L3PROHX5F","created_at":"2026-07-05T11:18:45.965244+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTVNI27L","created_at":"2026-07-05T11:18:45.965244+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/TTVNI27L3PROHX5FVWPZK76PSN","json":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN.json","graph_json":"https://pith.science/api/pith-number/TTVNI27L3PROHX5FVWPZK76PSN/graph.json","events_json":"https://pith.science/api/pith-number/TTVNI27L3PROHX5FVWPZK76PSN/events.json","paper":"https://pith.science/paper/TTVNI27L"},"agent_actions":{"view_html":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN","download_json":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN.json","view_paper":"https://pith.science/paper/TTVNI27L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08181&json=true","fetch_graph":"https://pith.science/api/pith-number/TTVNI27L3PROHX5FVWPZK76PSN/graph.json","fetch_events":"https://pith.science/api/pith-number/TTVNI27L3PROHX5FVWPZK76PSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN/action/storage_attestation","attest_author":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN/action/author_attestation","sign_citation":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN/action/citation_signature","submit_replication":"https://pith.science/pith/TTVNI27L3PROHX5FVWPZK76PSN/action/replication_record"}},"created_at":"2026-07-05T11:18:45.965244+00:00","updated_at":"2026-07-05T11:18:45.965244+00:00"}