{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KRHBG6PXM3VIPIPPCOSY5EYSL5","short_pith_number":"pith:KRHBG6PX","canonical_record":{"source":{"id":"2407.03571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"037396939479df90bf05548e7a58792f5b1379452919079267fb17d7d6da87ed","abstract_canon_sha256":"d6beb6dc8fc917a60abb525798b78117f41460ec7586fe5ef37a249959dd067d"},"schema_version":"1.0"},"canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","source":{"kind":"arxiv","id":"2407.03571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03571","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03571v2","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03571","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"KRHBG6PXM3VI","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"KRHBG6PXM3VIPIPP","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"KRHBG6PX","created_at":"2026-07-05T12:06:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KRHBG6PXM3VIPIPPCOSY5EYSL5","target":"record","payload":{"canonical_record":{"source":{"id":"2407.03571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"037396939479df90bf05548e7a58792f5b1379452919079267fb17d7d6da87ed","abstract_canon_sha256":"d6beb6dc8fc917a60abb525798b78117f41460ec7586fe5ef37a249959dd067d"},"schema_version":"1.0"},"canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:00.570467Z","signature_b64":"D4waZwM2JkQfge4rkdBSMB9qecDpb+j1FFgd+6ObT4YJ4MR0tPR4BjHYkWQ3CkPnWlbBIqrvxkwIwlMLwuSwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","last_reissued_at":"2026-07-05T12:06:00.569847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:00.569847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.03571","source_version":2,"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-05T12:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egsLVwHG2SdAyI6G1IwyS2TgJXu4zu27HWoZa+i4ds/dBDK7kaJ1TZYKK1dN3ZWfJ2qH7hSmAZhk13ylm+v5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:39:52.873354Z"},"content_sha256":"faf471921cb00db74f7e57552bb6125d4ebd9027b33be692ee91f03783ed653b","schema_version":"1.0","event_id":"sha256:faf471921cb00db74f7e57552bb6125d4ebd9027b33be692ee91f03783ed653b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KRHBG6PXM3VIPIPPCOSY5EYSL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Huiling Zhang, Junlin Wang, Zi Xu","submitted_at":"2024-07-04T01:46:07Z","abstract_excerpt":"In this paper, we study second-order algorithms for the convex-concave minimax problem, which has attracted much attention in many fields such as machine learning in recent years. We propose a Lipschitz-free cubic regularization (LF-CR) algorithm for solving the convex-concave minimax optimization problem without knowing the Lipschitz constant. It can be shown that the iteration complexity of the LF-CR algorithm to obtain an $\\epsilon$-optimal solution with respect to the restricted primal-dual gap is upper bounded by $\\mathcal{O}(\\rho^{2/3}\\|z_0-z^*\\|^2\\epsilon^{-2/3})$ , where $z_0=(x_0,y_0)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03571","kind":"arxiv","version":2},"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/2407.03571/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-05T12:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGvWd/35Jhjt+q3Hd1spgVpOUfU3Oc5JG+MAVEoMaF2jbtr0Y04g8k5LopYdAo0N2V9hfxbF+KqMisVNBuySDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:39:52.873889Z"},"content_sha256":"b3376f9ab62b1a3a64a6b5404ed9a1e53cc8d159a04e934ec6fc12f1abf7054a","schema_version":"1.0","event_id":"sha256:b3376f9ab62b1a3a64a6b5404ed9a1e53cc8d159a04e934ec6fc12f1abf7054a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/bundle.json","state_url":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/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-14T08:39:52Z","links":{"resolver":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5","bundle":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/bundle.json","state":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KRHBG6PXM3VIPIPPCOSY5EYSL5","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":"d6beb6dc8fc917a60abb525798b78117f41460ec7586fe5ef37a249959dd067d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","title_canon_sha256":"037396939479df90bf05548e7a58792f5b1379452919079267fb17d7d6da87ed"},"schema_version":"1.0","source":{"id":"2407.03571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03571","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03571v2","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03571","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"KRHBG6PXM3VI","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"KRHBG6PXM3VIPIPP","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"KRHBG6PX","created_at":"2026-07-05T12:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:b3376f9ab62b1a3a64a6b5404ed9a1e53cc8d159a04e934ec6fc12f1abf7054a","target":"graph","created_at":"2026-07-05T12:06:00Z","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/2407.03571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study second-order algorithms for the convex-concave minimax problem, which has attracted much attention in many fields such as machine learning in recent years. We propose a Lipschitz-free cubic regularization (LF-CR) algorithm for solving the convex-concave minimax optimization problem without knowing the Lipschitz constant. It can be shown that the iteration complexity of the LF-CR algorithm to obtain an $\\epsilon$-optimal solution with respect to the restricted primal-dual gap is upper bounded by $\\mathcal{O}(\\rho^{2/3}\\|z_0-z^*\\|^2\\epsilon^{-2/3})$ , where $z_0=(x_0,y_0)","authors_text":"Huiling Zhang, Junlin Wang, Zi Xu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03571","kind":"arxiv","version":2},"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:faf471921cb00db74f7e57552bb6125d4ebd9027b33be692ee91f03783ed653b","target":"record","created_at":"2026-07-05T12:06:00Z","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":"d6beb6dc8fc917a60abb525798b78117f41460ec7586fe5ef37a249959dd067d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","title_canon_sha256":"037396939479df90bf05548e7a58792f5b1379452919079267fb17d7d6da87ed"},"schema_version":"1.0","source":{"id":"2407.03571","kind":"arxiv","version":2}},"canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","first_computed_at":"2026-07-05T12:06:00.569847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:00.569847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D4waZwM2JkQfge4rkdBSMB9qecDpb+j1FFgd+6ObT4YJ4MR0tPR4BjHYkWQ3CkPnWlbBIqrvxkwIwlMLwuSwAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:00.570467Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.03571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faf471921cb00db74f7e57552bb6125d4ebd9027b33be692ee91f03783ed653b","sha256:b3376f9ab62b1a3a64a6b5404ed9a1e53cc8d159a04e934ec6fc12f1abf7054a"],"state_sha256":"b45e212c306b2fcdc4940db8d0afc6029ebde5b862f7d7d7113182e157b92f7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPk94ettMl025XmuVwqH9QVSuuQnO0ae7n1JETfzoP1c5/OeV3pp8nYRaeowoyLX+Jlq/cf9pXMLvqPZqvsMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:39:52.879169Z","bundle_sha256":"7a84ed743213d297cebeba28d76642c2a352a8ff87dd801da7eef844684dc0a7"}}