{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JWQDS3H57542IKAIF4O7T2K5PK","short_pith_number":"pith:JWQDS3H5","schema_version":"1.0","canonical_sha256":"4da0396cfdff79a428082f1df9e95d7a968085a2a0c4a207091b88f822794f9a","source":{"kind":"arxiv","id":"2606.07003","version":1},"attestation_state":"computed","paper":{"title":"A Single-Loop Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bohao Ma, Junyu Zhang, Nachuan Xiao","submitted_at":"2026-06-05T07:49:32Z","abstract_excerpt":"For smooth nonconvex-strongly-concave minimax problems, existing second-order methods share a common double-loop structure where the inner maximization is solved to sufficiently high accuracy before each second-order step. First-order methods are often adopted in the inner loops for scalability, but they also undermine the condition-insensitivity of second-order methods, limiting these methods to instances with mild conditioning. To resolve this issue, we propose a novel single-loop framework based on an equivalent regularized minimization reformulation of the original problem. By deriving a n"},"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":"2606.07003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-05T07:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"170ce00effdb0cc8335297e627809fb94823af756a42faf524d74ca7cb4cbac3","abstract_canon_sha256":"e5750ab6259b538569bf7fd932ff75353c221eab6bb0a9f4338d2ad193960f53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:40.682415Z","signature_b64":"7whZzN3m90embGv8H3zW00tQiGCrLid2qDrc3ORF8tQRaX4WxCvtUviDJvG60zIuQB3XxLJFgdNz9HqRvYtiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da0396cfdff79a428082f1df9e95d7a968085a2a0c4a207091b88f822794f9a","last_reissued_at":"2026-06-08T01:04:40.681636Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:40.681636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-Loop Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bohao Ma, Junyu Zhang, Nachuan Xiao","submitted_at":"2026-06-05T07:49:32Z","abstract_excerpt":"For smooth nonconvex-strongly-concave minimax problems, existing second-order methods share a common double-loop structure where the inner maximization is solved to sufficiently high accuracy before each second-order step. First-order methods are often adopted in the inner loops for scalability, but they also undermine the condition-insensitivity of second-order methods, limiting these methods to instances with mild conditioning. To resolve this issue, we propose a novel single-loop framework based on an equivalent regularized minimization reformulation of the original problem. By deriving a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07003","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/2606.07003/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":"2606.07003","created_at":"2026-06-08T01:04:40.681753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07003v1","created_at":"2026-06-08T01:04:40.681753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07003","created_at":"2026-06-08T01:04:40.681753+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWQDS3H57542","created_at":"2026-06-08T01:04:40.681753+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWQDS3H57542IKAI","created_at":"2026-06-08T01:04:40.681753+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWQDS3H5","created_at":"2026-06-08T01:04:40.681753+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/JWQDS3H57542IKAIF4O7T2K5PK","json":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK.json","graph_json":"https://pith.science/api/pith-number/JWQDS3H57542IKAIF4O7T2K5PK/graph.json","events_json":"https://pith.science/api/pith-number/JWQDS3H57542IKAIF4O7T2K5PK/events.json","paper":"https://pith.science/paper/JWQDS3H5"},"agent_actions":{"view_html":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK","download_json":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK.json","view_paper":"https://pith.science/paper/JWQDS3H5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07003&json=true","fetch_graph":"https://pith.science/api/pith-number/JWQDS3H57542IKAIF4O7T2K5PK/graph.json","fetch_events":"https://pith.science/api/pith-number/JWQDS3H57542IKAIF4O7T2K5PK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK/action/storage_attestation","attest_author":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK/action/author_attestation","sign_citation":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK/action/citation_signature","submit_replication":"https://pith.science/pith/JWQDS3H57542IKAIF4O7T2K5PK/action/replication_record"}},"created_at":"2026-06-08T01:04:40.681753+00:00","updated_at":"2026-06-08T01:04:40.681753+00:00"}