{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U24CT4MQP5AJCAB2YLOHD5SEGJ","short_pith_number":"pith:U24CT4MQ","canonical_record":{"source":{"id":"2605.15512","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T01:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"bf5c5e9023657c0d4a09ed07ac18952bc4da1203fac355640f03e7ae9a17e6f4","abstract_canon_sha256":"b74a58b1eeb50e8240ead1010c73a830889254a5526c33c5cba261c955ae6a1a"},"schema_version":"1.0"},"canonical_sha256":"a6b829f1907f4091003ac2dc71f64432732a8a78d91a1200c6c0acf4aad94f41","source":{"kind":"arxiv","id":"2605.15512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15512","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15512v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15512","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"U24CT4MQP5AJ","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"U24CT4MQP5AJCAB2","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"U24CT4MQ","created_at":"2026-05-20T00:01:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U24CT4MQP5AJCAB2YLOHD5SEGJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15512","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T01:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"bf5c5e9023657c0d4a09ed07ac18952bc4da1203fac355640f03e7ae9a17e6f4","abstract_canon_sha256":"b74a58b1eeb50e8240ead1010c73a830889254a5526c33c5cba261c955ae6a1a"},"schema_version":"1.0"},"canonical_sha256":"a6b829f1907f4091003ac2dc71f64432732a8a78d91a1200c6c0acf4aad94f41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:02.434981Z","signature_b64":"5soj5kLl897EDRYIk+GMQ+2oB9YWoZ7aaHVAjI/i29NUtGDbfAdmF+qAyjHcBU+xjfOKZ0J7AZFxUkuRL0NYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b829f1907f4091003ac2dc71f64432732a8a78d91a1200c6c0acf4aad94f41","last_reissued_at":"2026-05-20T00:01:02.434205Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:02.434205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15512","source_version":1,"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-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6cP+x9ioiau1nQsusfXxpaNRVzeg4P7MphYs11dHclD0O2xt1QeOU5cqnZaKxfS70rKFTLqa1Rw8SRx8ERvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:49:01.178209Z"},"content_sha256":"e522a28c927785b06df44dc350d3e1ea56abd1fd324a2224280ecb6feae09d1a","schema_version":"1.0","event_id":"sha256:e522a28c927785b06df44dc350d3e1ea56abd1fd324a2224280ecb6feae09d1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U24CT4MQP5AJCAB2YLOHD5SEGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auto-Conditioned Frank-Wolfe Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Frank-Wolfe methods converge with local Lipschitz estimates alone","cross_cats":[],"primary_cat":"math.OC","authors_text":"Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Soroosh Shafiee","submitted_at":"2026-05-15T01:12:32Z","abstract_excerpt":"Frank-Wolfe methods are projection-free algorithms for constrained optimization whose practical performance often depends critically on the choice of step size. Classical closed-loop step-size rules typically require prior knowledge of a global smoothness constant, while line-search variants avoid this requirement at the cost of additional function evaluations and implementation overhead. In this paper, we develop a fully auto-conditioned framework for Frank-Wolfe-type methods. The framework replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator compu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We develop a fully auto-conditioned framework for Frank-Wolfe-type methods that replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator computed from first-order information along the iterates, establishing convergence to stationary points in the nonconvex setting and recovering standard sublinear convergence guarantees in the convex setting without requiring prior knowledge of a global smoothness constant.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The local Lipschitz estimator computed from first-order information along the iterates is accurate enough to serve as a drop-in replacement for the global smoothness constant while preserving the convergence analysis for the general class of methods including standard Frank-Wolfe, Matching Pursuit, pairwise Frank-Wolfe, and away-step Frank-Wolfe.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Auto-conditioned Frank-Wolfe methods use local Lipschitz estimators from first-order information to achieve convergence guarantees in convex and nonconvex settings without prior global smoothness knowledge.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Frank-Wolfe methods converge with local Lipschitz estimates alone","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"59f08c421274a0462cca023e92935f5b94cbd8e5b515308e8051c53598c5b0c5"},"source":{"id":"2605.15512","kind":"arxiv","version":1},"verdict":{"id":"69114878-b05a-4e8b-8c5d-48c2ae917e6c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:29:18.700844Z","strongest_claim":"We develop a fully auto-conditioned framework for Frank-Wolfe-type methods that replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator computed from first-order information along the iterates, establishing convergence to stationary points in the nonconvex setting and recovering standard sublinear convergence guarantees in the convex setting without requiring prior knowledge of a global smoothness constant.","one_line_summary":"Auto-conditioned Frank-Wolfe methods use local Lipschitz estimators from first-order information to achieve convergence guarantees in convex and nonconvex settings without prior global smoothness knowledge.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The local Lipschitz estimator computed from first-order information along the iterates is accurate enough to serve as a drop-in replacement for the global smoothness constant while preserving the convergence analysis for the general class of methods including standard Frank-Wolfe, Matching Pursuit, pairwise Frank-Wolfe, and away-step Frank-Wolfe.","pith_extraction_headline":"Frank-Wolfe methods converge with local Lipschitz estimates alone"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15512/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.912268Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:40:36.682832Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:54.960637Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.055095Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.848252Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.387156Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.634630Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"30a0fcc2951c5874d155ffc2704696e7a70a1c961d78229f3de7752d5aeaea7b"},"references":{"count":63,"sample":[{"doi":"","year":2023,"title":"A. Alacaoglu, A. Böhm, and Y. Malitsky. Beyond the golden ratio for variational inequality algorithms.Journal of Machine Learning Research, 24(172):1–33, 2023","work_id":"671d0dea-e43e-4b03-9308-9d05f7a41900","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"A. Alacaoglu, Y. Malitsky, and V. Cevher. Convergence of adaptive algorithms for constrained weakly convex optimization. InAdvances in Neural Information Processing Systems, pages 14214– 14225, 2021","work_id":"fe69efe5-2905-4972-8e80-975a441fed09","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"A. Ansari-Önnestam and Y. Malitsky. Adaptive gradient descent on Riemannian manifolds with nonnegative curvature.arXiv:2504.16724, 2025","work_id":"e8db28f1-c3f6-4e57-89b5-5b4cf94b45cc","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"A. Asuncion and D. Newman. The UCI Machine Learning Repository, 2007","work_id":"e23fd56f-7a97-4d0a-a705-6ef8dbc14d6d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A. Attia and T. Koren. SGD with AdaGrad stepsizes: Full adaptivity with high probability to unknown parameters, unbounded gradients and affine variance. InInternational Conference on Machine Learning,","work_id":"f47c6c13-31e3-49fb-9a3a-cc619e3cd66c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":63,"snapshot_sha256":"7a5bda1bd113d19984334bf2e58585ec2824b0623945d63fb15268b221634e19","internal_anchors":4},"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":"69114878-b05a-4e8b-8c5d-48c2ae917e6c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvhT2nT7e17a1Z1gzubH2NV/MsdfVT1kT0+9iNeV5qCtco+ba/HrupSbpb7sSAOhcCuM7pP9S6PaDoOU0siRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:49:01.179543Z"},"content_sha256":"447dea176b37ed695db3435edea87121930bcf25a3331b83cc2567faacdbb2be","schema_version":"1.0","event_id":"sha256:447dea176b37ed695db3435edea87121930bcf25a3331b83cc2567faacdbb2be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/bundle.json","state_url":"https://pith.science/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/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-05-25T09:49:01Z","links":{"resolver":"https://pith.science/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ","bundle":"https://pith.science/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/bundle.json","state":"https://pith.science/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U24CT4MQP5AJCAB2YLOHD5SEGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U24CT4MQP5AJCAB2YLOHD5SEGJ","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":"b74a58b1eeb50e8240ead1010c73a830889254a5526c33c5cba261c955ae6a1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T01:12:32Z","title_canon_sha256":"bf5c5e9023657c0d4a09ed07ac18952bc4da1203fac355640f03e7ae9a17e6f4"},"schema_version":"1.0","source":{"id":"2605.15512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15512","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15512v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15512","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"U24CT4MQP5AJ","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"U24CT4MQP5AJCAB2","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"U24CT4MQ","created_at":"2026-05-20T00:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:447dea176b37ed695db3435edea87121930bcf25a3331b83cc2567faacdbb2be","target":"graph","created_at":"2026-05-20T00:01:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We develop a fully auto-conditioned framework for Frank-Wolfe-type methods that replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator computed from first-order information along the iterates, establishing convergence to stationary points in the nonconvex setting and recovering standard sublinear convergence guarantees in the convex setting without requiring prior knowledge of a global smoothness constant."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The local Lipschitz estimator computed from first-order information along the iterates is accurate enough to serve as a drop-in replacement for the global smoothness constant while preserving the convergence analysis for the general class of methods including standard Frank-Wolfe, Matching Pursuit, pairwise Frank-Wolfe, and away-step Frank-Wolfe."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Auto-conditioned Frank-Wolfe methods use local Lipschitz estimators from first-order information to achieve convergence guarantees in convex and nonconvex settings without prior global smoothness knowledge."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Frank-Wolfe methods converge with local Lipschitz estimates alone"}],"snapshot_sha256":"59f08c421274a0462cca023e92935f5b94cbd8e5b515308e8051c53598c5b0c5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.912268Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:40:36.682832Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:54.960637Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.055095Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.848252Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.387156Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.634630Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15512/integrity.json","findings":[],"snapshot_sha256":"30a0fcc2951c5874d155ffc2704696e7a70a1c961d78229f3de7752d5aeaea7b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Frank-Wolfe methods are projection-free algorithms for constrained optimization whose practical performance often depends critically on the choice of step size. Classical closed-loop step-size rules typically require prior knowledge of a global smoothness constant, while line-search variants avoid this requirement at the cost of additional function evaluations and implementation overhead. In this paper, we develop a fully auto-conditioned framework for Frank-Wolfe-type methods. The framework replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator compu","authors_text":"Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Soroosh Shafiee","cross_cats":[],"headline":"Frank-Wolfe methods converge with local Lipschitz estimates alone","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms"},"references":{"count":63,"internal_anchors":4,"resolved_work":63,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Alacaoglu, A. Böhm, and Y. Malitsky. Beyond the golden ratio for variational inequality algorithms.Journal of Machine Learning Research, 24(172):1–33, 2023","work_id":"671d0dea-e43e-4b03-9308-9d05f7a41900","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A. Alacaoglu, Y. Malitsky, and V. Cevher. Convergence of adaptive algorithms for constrained weakly convex optimization. InAdvances in Neural Information Processing Systems, pages 14214– 14225, 2021","work_id":"fe69efe5-2905-4972-8e80-975a441fed09","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A. Ansari-Önnestam and Y. Malitsky. Adaptive gradient descent on Riemannian manifolds with nonnegative curvature.arXiv:2504.16724, 2025","work_id":"e8db28f1-c3f6-4e57-89b5-5b4cf94b45cc","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A. Asuncion and D. Newman. The UCI Machine Learning Repository, 2007","work_id":"e23fd56f-7a97-4d0a-a705-6ef8dbc14d6d","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A. Attia and T. Koren. SGD with AdaGrad stepsizes: Full adaptivity with high probability to unknown parameters, unbounded gradients and affine variance. InInternational Conference on Machine Learning,","work_id":"f47c6c13-31e3-49fb-9a3a-cc619e3cd66c","year":2023}],"snapshot_sha256":"7a5bda1bd113d19984334bf2e58585ec2824b0623945d63fb15268b221634e19"},"source":{"id":"2605.15512","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:29:18.700844Z","id":"69114878-b05a-4e8b-8c5d-48c2ae917e6c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Auto-conditioned Frank-Wolfe methods use local Lipschitz estimators from first-order information to achieve convergence guarantees in convex and nonconvex settings without prior global smoothness knowledge.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Frank-Wolfe methods converge with local Lipschitz estimates alone","strongest_claim":"We develop a fully auto-conditioned framework for Frank-Wolfe-type methods that replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator computed from first-order information along the iterates, establishing convergence to stationary points in the nonconvex setting and recovering standard sublinear convergence guarantees in the convex setting without requiring prior knowledge of a global smoothness constant.","weakest_assumption":"The local Lipschitz estimator computed from first-order information along the iterates is accurate enough to serve as a drop-in replacement for the global smoothness constant while preserving the convergence analysis for the general class of methods including standard Frank-Wolfe, Matching Pursuit, pairwise Frank-Wolfe, and away-step Frank-Wolfe."}},"verdict_id":"69114878-b05a-4e8b-8c5d-48c2ae917e6c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e522a28c927785b06df44dc350d3e1ea56abd1fd324a2224280ecb6feae09d1a","target":"record","created_at":"2026-05-20T00:01:02Z","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":"b74a58b1eeb50e8240ead1010c73a830889254a5526c33c5cba261c955ae6a1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T01:12:32Z","title_canon_sha256":"bf5c5e9023657c0d4a09ed07ac18952bc4da1203fac355640f03e7ae9a17e6f4"},"schema_version":"1.0","source":{"id":"2605.15512","kind":"arxiv","version":1}},"canonical_sha256":"a6b829f1907f4091003ac2dc71f64432732a8a78d91a1200c6c0acf4aad94f41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b829f1907f4091003ac2dc71f64432732a8a78d91a1200c6c0acf4aad94f41","first_computed_at":"2026-05-20T00:01:02.434205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:02.434205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5soj5kLl897EDRYIk+GMQ+2oB9YWoZ7aaHVAjI/i29NUtGDbfAdmF+qAyjHcBU+xjfOKZ0J7AZFxUkuRL0NYAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:02.434981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e522a28c927785b06df44dc350d3e1ea56abd1fd324a2224280ecb6feae09d1a","sha256:447dea176b37ed695db3435edea87121930bcf25a3331b83cc2567faacdbb2be"],"state_sha256":"948f70eeff8a4a0acba87ba5df8cbc33d3e8667b6d11a348e560e66a1f01a17a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOXXUHSWpH8RV+Gfg47/WGYA5/CLBEpw7GGIgidh5RAbrOJdSW9tIdec32gfBZbvrZXM0J0QbZzxvS2+x6NvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:49:01.184375Z","bundle_sha256":"b27261de3617d481d01704643104637065d0150b01f0e7bea110026f6debb5ff"}}