{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DVFY5ZWTCZNE634ST54Y6O45DV","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":"c1b91d6bdafbe68bb60aa14207c965b361d6e7c6c68167d06ccc80643c49a137","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-04T04:58:09Z","title_canon_sha256":"d0968d133fa2c4de8ec8a99f9a0c4aeef66b6f6c1e09d2d8e554a5cd0a423b86"},"schema_version":"1.0","source":{"id":"2502.02010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02010","created_at":"2026-07-05T10:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02010v1","created_at":"2026-07-05T10:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02010","created_at":"2026-07-05T10:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"DVFY5ZWTCZNE","created_at":"2026-07-05T10:09:22Z"},{"alias_kind":"pith_short_16","alias_value":"DVFY5ZWTCZNE634S","created_at":"2026-07-05T10:09:22Z"},{"alias_kind":"pith_short_8","alias_value":"DVFY5ZWT","created_at":"2026-07-05T10:09:22Z"}],"graph_snapshots":[{"event_id":"sha256:db6e98574d320a45749b40cab53ca64961b70458fa94a7e4d0d458b8d8f4f913","target":"graph","created_at":"2026-07-05T10:09:22Z","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/2502.02010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a new steepest gradient descent method for solving nonconvex finite minimax problems using non-monotone adaptive step sizes and providing proof of convergence results in cases of the nonconvex, quasiconvex, and pseudoconvex differentiate component functions. The proposed method is applied using a referenced-based approach to solve the nonconvex multiobjective programming problems. The convergence to weakly efficient or Pareto stationary solutions is proved for pseudoconvex or quasiconvex multiobjective optimization problems, respectively. A variety of numerical experiments ","authors_text":"Nguyen Duc Anh, Tran Ngoc Thang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-04T04:58:09Z","title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02010","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:6e12d30482e42c1ea5aaf1266aeb6325538ba3c94cc3cc65f537634addd64bd3","target":"record","created_at":"2026-07-05T10:09:22Z","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":"c1b91d6bdafbe68bb60aa14207c965b361d6e7c6c68167d06ccc80643c49a137","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-04T04:58:09Z","title_canon_sha256":"d0968d133fa2c4de8ec8a99f9a0c4aeef66b6f6c1e09d2d8e554a5cd0a423b86"},"schema_version":"1.0","source":{"id":"2502.02010","kind":"arxiv","version":1}},"canonical_sha256":"1d4b8ee6d3165a4f6f929f798f3b9d1d6565527527229ce7b4ac68b3df7c6f35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d4b8ee6d3165a4f6f929f798f3b9d1d6565527527229ce7b4ac68b3df7c6f35","first_computed_at":"2026-07-05T10:09:22.281311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:22.281311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U5NUVBDd8qfdYWn1J3GiqIw/UZmWGGpBVf7S5hzj81R1Z9elxGHOXv63nBiLp0EBF102bOg0O1Hq8f9AsS+kDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:22.281755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e12d30482e42c1ea5aaf1266aeb6325538ba3c94cc3cc65f537634addd64bd3","sha256:db6e98574d320a45749b40cab53ca64961b70458fa94a7e4d0d458b8d8f4f913"],"state_sha256":"78fdfccf503c40a4d860efbfc3e88898820732dce4abdce639cd44b5565277bb"}