{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2M22D3V54QO7GQ3HQXHBYS7P4P","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":"efb2469ebc48233fc03ba1ef7f4bfac58fd74072ffcc7451ddd29b34230e3af4","cross_cats_sorted":["cs.CC","cs.NA","math.DG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T12:35:16Z","title_canon_sha256":"412ce0e818c2559ae201c2abe50b4c49bb10173b988de4c1f8aa1ee55e4ef684"},"schema_version":"1.0","source":{"id":"2307.12743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12743","created_at":"2026-07-05T06:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12743v1","created_at":"2026-07-05T06:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12743","created_at":"2026-07-05T06:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"2M22D3V54QO7","created_at":"2026-07-05T06:33:58Z"},{"alias_kind":"pith_short_16","alias_value":"2M22D3V54QO7GQ3H","created_at":"2026-07-05T06:33:58Z"},{"alias_kind":"pith_short_8","alias_value":"2M22D3V5","created_at":"2026-07-05T06:33:58Z"}],"graph_snapshots":[{"event_id":"sha256:8544a7a9ef55df51cce2d149c4d49e69e4c69fd3647ec908a29487390365d82d","target":"graph","created_at":"2026-07-05T06:33:58Z","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/2307.12743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f \\colon \\mathcal{M} \\to \\mathbb{R}$ be a Lipschitz and geodesically convex function defined on a $d$-dimensional Riemannian manifold $\\mathcal{M}$. Does there exist a first-order deterministic algorithm which (a) uses at most $O(\\mathrm{poly}(d) \\log(\\epsilon^{-1}))$ subgradient queries to find a point with target accuracy $\\epsilon$, and (b) requires only $O(\\mathrm{poly}(d))$ arithmetic operations per query? In convex optimization, the classical ellipsoid method achieves this. After detailing related work, we provide an ellipsoid-like algorithm with query complexity $O(d^2 \\log^2(\\epsi","authors_text":"Christopher Criscitiello, David Mart\\'inez-Rubio, Nicolas Boumal","cross_cats":["cs.CC","cs.NA","math.DG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T12:35:16Z","title":"Open Problem: Polynomial linearly-convergent method for geodesically convex optimization?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12743","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:8d180fcbb4150f2719ffef302e96ba62ca167ea54747a429ba735eda92995a15","target":"record","created_at":"2026-07-05T06:33:58Z","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":"efb2469ebc48233fc03ba1ef7f4bfac58fd74072ffcc7451ddd29b34230e3af4","cross_cats_sorted":["cs.CC","cs.NA","math.DG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T12:35:16Z","title_canon_sha256":"412ce0e818c2559ae201c2abe50b4c49bb10173b988de4c1f8aa1ee55e4ef684"},"schema_version":"1.0","source":{"id":"2307.12743","kind":"arxiv","version":1}},"canonical_sha256":"d335a1eebde41df3436785ce1c4befe3d7dd154baab99c59a3ef1f3cd1af82e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d335a1eebde41df3436785ce1c4befe3d7dd154baab99c59a3ef1f3cd1af82e9","first_computed_at":"2026-07-05T06:33:58.082733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:33:58.082733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"henGpHuaJkjfWiSAYIbQNgK6koisu1qdOTqMM73BSXovA/MhuQD8mOdJGSic1jDOHysIUHRXOmLnQFGmK4+1DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:33:58.083170Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.12743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d180fcbb4150f2719ffef302e96ba62ca167ea54747a429ba735eda92995a15","sha256:8544a7a9ef55df51cce2d149c4d49e69e4c69fd3647ec908a29487390365d82d"],"state_sha256":"1b44665d9b7cbb18abed45f37e71052698ba59fe65ee7545a8c50515c75f23a3"}