{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T5TQZDWOQIU2REWLUEQ4L55ZVG","short_pith_number":"pith:T5TQZDWO","schema_version":"1.0","canonical_sha256":"9f670c8ece8229a892cba121c5f7b9a981760677dbd5f669274f6ad854d5e190","source":{"kind":"arxiv","id":"2409.19636","version":1},"attestation_state":"computed","paper":{"title":"Newton Method for Set Optimization Problems with Set-Valued Mapping of Finitely Many Vector-Valued Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anshika, Debdas Ghosh, Qamrul Hasan Ansari, Xiaopeng Zhao","submitted_at":"2024-09-29T09:49:18Z","abstract_excerpt":"In this paper, we propose a Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by finitely many strongly convex twice continuously differentiable vector-valued functions. At first, with the help of a family of vector optimization problems and the Gerstewitz scalarizing function, we identify a necessary optimality condition for weakly minimal solutions of the considered problem. In the proposed Newton method, we derive a sequence of iterative po"},"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":"2409.19636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-29T09:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"f619fc1a6ab2005db399a3c275b8c9b3ef803e9b4e6b26f00757e8adb2ca6fd2","abstract_canon_sha256":"fb1931f565f3cfd4ef04313feaf76a6e97d278fd73060f837fc37343e0ad69bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:19.988293Z","signature_b64":"Mzq8VO3oICr/fbz7iH+dXCIOonZYV5/qhGX8NW7QnR3uE4B9FX+bG5mIe+Wc1Y8c0UHuAePvz7+FuJOqv8S9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f670c8ece8229a892cba121c5f7b9a981760677dbd5f669274f6ad854d5e190","last_reissued_at":"2026-07-05T09:13:19.987766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:19.987766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Newton Method for Set Optimization Problems with Set-Valued Mapping of Finitely Many Vector-Valued Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anshika, Debdas Ghosh, Qamrul Hasan Ansari, Xiaopeng Zhao","submitted_at":"2024-09-29T09:49:18Z","abstract_excerpt":"In this paper, we propose a Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by finitely many strongly convex twice continuously differentiable vector-valued functions. At first, with the help of a family of vector optimization problems and the Gerstewitz scalarizing function, we identify a necessary optimality condition for weakly minimal solutions of the considered problem. In the proposed Newton method, we derive a sequence of iterative po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19636","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/2409.19636/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":"2409.19636","created_at":"2026-07-05T09:13:19.987833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.19636v1","created_at":"2026-07-05T09:13:19.987833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19636","created_at":"2026-07-05T09:13:19.987833+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5TQZDWOQIU2","created_at":"2026-07-05T09:13:19.987833+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5TQZDWOQIU2REWL","created_at":"2026-07-05T09:13:19.987833+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5TQZDWO","created_at":"2026-07-05T09:13:19.987833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.25252","citing_title":"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG","json":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG.json","graph_json":"https://pith.science/api/pith-number/T5TQZDWOQIU2REWLUEQ4L55ZVG/graph.json","events_json":"https://pith.science/api/pith-number/T5TQZDWOQIU2REWLUEQ4L55ZVG/events.json","paper":"https://pith.science/paper/T5TQZDWO"},"agent_actions":{"view_html":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG","download_json":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG.json","view_paper":"https://pith.science/paper/T5TQZDWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.19636&json=true","fetch_graph":"https://pith.science/api/pith-number/T5TQZDWOQIU2REWLUEQ4L55ZVG/graph.json","fetch_events":"https://pith.science/api/pith-number/T5TQZDWOQIU2REWLUEQ4L55ZVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG/action/storage_attestation","attest_author":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG/action/author_attestation","sign_citation":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG/action/citation_signature","submit_replication":"https://pith.science/pith/T5TQZDWOQIU2REWLUEQ4L55ZVG/action/replication_record"}},"created_at":"2026-07-05T09:13:19.987833+00:00","updated_at":"2026-07-05T09:13:19.987833+00:00"}