{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2DLFDPS2JBBDGOJDV5Q56FZLDO","short_pith_number":"pith:2DLFDPS2","schema_version":"1.0","canonical_sha256":"d0d651be5a4842333923af61df172b1b8c9b98699336ccdf50033188cb776f7c","source":{"kind":"arxiv","id":"2501.18381","version":1},"attestation_state":"computed","paper":{"title":"Implicit Riemannian Optimism with Applications to Min-Max Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Christophe Roux, David Mart\\'inez-Rubio, Sebastian Pokutta","submitted_at":"2025-01-30T14:31:28Z","abstract_excerpt":"We introduce a Riemannian optimistic online learning algorithm for Hadamard manifolds based on inexact implicit updates. Unlike prior work, our method can handle in-manifold constraints, and matches the best known regret bounds in the Euclidean setting with no dependence on geometric constants, like the minimum curvature. Building on this, we develop algorithms for g-convex, g-concave smooth min-max problems on Hadamard manifolds. Notably, one method nearly matches the gradient oracle complexity of the lower bound for Euclidean problems, for the first time."},"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":"2501.18381","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-30T14:31:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fc3f17ca120d63be1412b6bb5efc1d85ea45306713f03a83bebb848793a74d7","abstract_canon_sha256":"a7797d9eb4e1a0f1f469a161ffa6193afd1796102bc910587b6628162a0f55db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:33.642827Z","signature_b64":"6+fWhhwgJ+CwLEmCBoJMrn5ICX+ihCIKwyeBwcbAxI/7w8pNvpmSy0iJmwhuiG2tRCEmZmVsQxUzmv9H5S3qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d651be5a4842333923af61df172b1b8c9b98699336ccdf50033188cb776f7c","last_reissued_at":"2026-07-05T10:07:33.642376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:33.642376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implicit Riemannian Optimism with Applications to Min-Max Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Christophe Roux, David Mart\\'inez-Rubio, Sebastian Pokutta","submitted_at":"2025-01-30T14:31:28Z","abstract_excerpt":"We introduce a Riemannian optimistic online learning algorithm for Hadamard manifolds based on inexact implicit updates. Unlike prior work, our method can handle in-manifold constraints, and matches the best known regret bounds in the Euclidean setting with no dependence on geometric constants, like the minimum curvature. Building on this, we develop algorithms for g-convex, g-concave smooth min-max problems on Hadamard manifolds. Notably, one method nearly matches the gradient oracle complexity of the lower bound for Euclidean problems, for the first time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18381","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/2501.18381/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":"2501.18381","created_at":"2026-07-05T10:07:33.642435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18381v1","created_at":"2026-07-05T10:07:33.642435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18381","created_at":"2026-07-05T10:07:33.642435+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DLFDPS2JBBD","created_at":"2026-07-05T10:07:33.642435+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DLFDPS2JBBDGOJD","created_at":"2026-07-05T10:07:33.642435+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DLFDPS2","created_at":"2026-07-05T10:07:33.642435+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/2DLFDPS2JBBDGOJDV5Q56FZLDO","json":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO.json","graph_json":"https://pith.science/api/pith-number/2DLFDPS2JBBDGOJDV5Q56FZLDO/graph.json","events_json":"https://pith.science/api/pith-number/2DLFDPS2JBBDGOJDV5Q56FZLDO/events.json","paper":"https://pith.science/paper/2DLFDPS2"},"agent_actions":{"view_html":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO","download_json":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO.json","view_paper":"https://pith.science/paper/2DLFDPS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18381&json=true","fetch_graph":"https://pith.science/api/pith-number/2DLFDPS2JBBDGOJDV5Q56FZLDO/graph.json","fetch_events":"https://pith.science/api/pith-number/2DLFDPS2JBBDGOJDV5Q56FZLDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO/action/storage_attestation","attest_author":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO/action/author_attestation","sign_citation":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO/action/citation_signature","submit_replication":"https://pith.science/pith/2DLFDPS2JBBDGOJDV5Q56FZLDO/action/replication_record"}},"created_at":"2026-07-05T10:07:33.642435+00:00","updated_at":"2026-07-05T10:07:33.642435+00:00"}