{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JNJRFGSWXFBAMSEKCOVJAA4M5D","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":"6e2764d165b152e88d7b2fa912333e5331a63a095c2353c16536870a34b4b63c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T23:30:07Z","title_canon_sha256":"e392bc6a42612270b221337824b70e25f1566eb46f9f2b7fe51bbbb739478661"},"schema_version":"1.0","source":{"id":"2605.12820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12820","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12820v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12820","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"JNJRFGSWXFBA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JNJRFGSWXFBAMSEK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JNJRFGSW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c3125860cd0de951094371dab80f663a8deca2665b57b20dba22f1fba3878f89","target":"graph","created_at":"2026-05-18T03:09:12Z","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 derive convergence for any differentiable strongly convex objective"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That ellipses can be constructed at each step to capture the ill-conditioning of an arbitrary differentiable strongly convex function while preserving the linear rate."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ME achieves linear convergence for any differentiable strongly convex objective by centering iterates inside carefully chosen ellipses."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Method of Ellipcenters converges linearly for any differentiable strongly convex objective."}],"snapshot_sha256":"8ae79aed078c66456e9dbcbdd8216c1c97f064b37b068c88d15e545f89af3d76"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"27fd2771551744247b65e9ac4d5ab9c05bc6eb699ce6b711e55dd8741e7a8927"},"paper":{"abstract_excerpt":"This work is about ME, the Method of Ellipcenters. ME was recently introduced by these very authors as a first order accelerated scheme for unconstrained minimization. Its iterates are all centers of ellipses carefully designed to somehow capture ill-conditioning of the underlying optimization problem. In the first article on ME, we were able to prove that it converges with linear rate when the objective function is quadratic and strongly convex, while here we derive convergence for any differentiable strongly convex objective. This investigation was inspired by the great performance of ME in ","authors_text":"Eduarda Ferreira, Ramyro Correa, Roger Behling, Vincent Guigues","cross_cats":[],"headline":"The Method of Ellipcenters converges linearly for any differentiable strongly convex objective.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T23:30:07Z","title":"The Method of Ellipcenters for strongly convex minimization"},"references":{"count":18,"internal_anchors":0,"resolved_work":18,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Introducing the method of ellipcenters, a new first order technique for unconstrained optimization.arXiv, 2025","work_id":"c4cbd59c-3022-4100-a06d-1f19779b82cc","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Two-Point Step Size Gradient Methods.IMA Journal of Numerical Analysis, 8(1):141–148, 1988","work_id":"be5eaf88-5c64-4c93-8ea4-129ea47b55f1","year":1988},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"IMAGING SCIENCES, 2 (1):183-202, 2009","work_id":"531d720c-2005-43a5-bd3a-4b7a42d17640","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"M´ ethode g´ en´ erale pour la r´ esolution des syst` emes d’´ equations simultan´ ees","work_id":"9a725802-dd94-40ee-abc7-a06928e5964b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Practical Methods of Optimization (2nd ed.)New York: John Wiley & Son, 1987","work_id":"a9338e2f-d654-4205-a98b-6a129d9705ed","year":1987}],"snapshot_sha256":"5500ba8f7e0d591f545eefc92eae7e9b1aa684d43fb8ab1a1c87b418c2911456"},"source":{"id":"2605.12820","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:32:12.041251Z","id":"a8693639-17a0-4946-a468-750632053cad","model_set":{"reader":"grok-4.3"},"one_line_summary":"ME achieves linear convergence for any differentiable strongly convex objective by centering iterates inside carefully chosen ellipses.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Method of Ellipcenters converges linearly for any differentiable strongly convex objective.","strongest_claim":"we derive convergence for any differentiable strongly convex objective","weakest_assumption":"That ellipses can be constructed at each step to capture the ill-conditioning of an arbitrary differentiable strongly convex function while preserving the linear rate."}},"verdict_id":"a8693639-17a0-4946-a468-750632053cad"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:040b0838166cc0ef51a9b48f1435633e16fe6ab647a50606680d2e2a3500cf43","target":"record","created_at":"2026-05-18T03:09:12Z","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":"6e2764d165b152e88d7b2fa912333e5331a63a095c2353c16536870a34b4b63c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T23:30:07Z","title_canon_sha256":"e392bc6a42612270b221337824b70e25f1566eb46f9f2b7fe51bbbb739478661"},"schema_version":"1.0","source":{"id":"2605.12820","kind":"arxiv","version":1}},"canonical_sha256":"4b53129a56b94206488a13aa90038ce8c716dbd5680dc77f95aa4a88d69479e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b53129a56b94206488a13aa90038ce8c716dbd5680dc77f95aa4a88d69479e5","first_computed_at":"2026-05-18T03:09:12.228237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.228237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KLcdAa21cG+KalYaoK/gqWsHgc56RWdbbsorgdSAxxnJdn8rVBr20TzRLS9tNHEqpmY31FCnp0EyLeRgJG7sBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.228924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:040b0838166cc0ef51a9b48f1435633e16fe6ab647a50606680d2e2a3500cf43","sha256:c3125860cd0de951094371dab80f663a8deca2665b57b20dba22f1fba3878f89"],"state_sha256":"292653091e83da5ae2750363bff6f45eccf7365ef6ce25441ca52db21209271f"}