{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2TRTYYYP6UKJEQLCEAWZL3IRYF","short_pith_number":"pith:2TRTYYYP","schema_version":"1.0","canonical_sha256":"d4e33c630ff514924162202d95ed11c153d147cb3213519016f1dfe321a1d954","source":{"kind":"arxiv","id":"2308.16004","version":1},"attestation_state":"computed","paper":{"title":"Riemannian Optimistic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Deming Yuan, Guodong Shi, Lei Wang, Xi Wang, Yiguang Hong, Zihao Hu","submitted_at":"2023-08-30T12:47:21Z","abstract_excerpt":"In this paper, we consider Riemannian online convex optimization with dynamic regret. First, we propose two novel algorithms, namely the Riemannian Online Optimistic Gradient Descent (R-OOGD) and the Riemannian Adaptive Online Optimistic Gradient Descent (R-AOOGD), which combine the advantages of classical optimistic algorithms with the rich geometric properties of Riemannian manifolds. We analyze the dynamic regrets of the R-OOGD and R-AOOGD in terms of regularity of the sequence of cost functions and comparators. Next, we apply the R-OOGD to Riemannian zero-sum games, leading to the Riemanni"},"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":"2308.16004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-30T12:47:21Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e474acf8bf4ffed6282a5174f5ccf2048b9e2cdc87b881ab4cdc1793c3c7bbcf","abstract_canon_sha256":"96322f44cb866728bd3e70c723fe1c06fdb3f60b335059d8c294d35f5a2b264e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:17.064879Z","signature_b64":"AQvp32OHXub2yjDVkZzN999/TVU9FodGqL+efjZCJ0uzsNuuqntAP/MuVL5mrWXeUu+XGchb3qngR1vfGFUJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e33c630ff514924162202d95ed11c153d147cb3213519016f1dfe321a1d954","last_reissued_at":"2026-07-05T06:46:17.064344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:17.064344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Riemannian Optimistic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Deming Yuan, Guodong Shi, Lei Wang, Xi Wang, Yiguang Hong, Zihao Hu","submitted_at":"2023-08-30T12:47:21Z","abstract_excerpt":"In this paper, we consider Riemannian online convex optimization with dynamic regret. First, we propose two novel algorithms, namely the Riemannian Online Optimistic Gradient Descent (R-OOGD) and the Riemannian Adaptive Online Optimistic Gradient Descent (R-AOOGD), which combine the advantages of classical optimistic algorithms with the rich geometric properties of Riemannian manifolds. We analyze the dynamic regrets of the R-OOGD and R-AOOGD in terms of regularity of the sequence of cost functions and comparators. Next, we apply the R-OOGD to Riemannian zero-sum games, leading to the Riemanni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16004","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/2308.16004/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":"2308.16004","created_at":"2026-07-05T06:46:17.064410+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16004v1","created_at":"2026-07-05T06:46:17.064410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16004","created_at":"2026-07-05T06:46:17.064410+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TRTYYYP6UKJ","created_at":"2026-07-05T06:46:17.064410+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TRTYYYP6UKJEQLC","created_at":"2026-07-05T06:46:17.064410+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TRTYYYP","created_at":"2026-07-05T06:46:17.064410+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07779","citing_title":"Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF","json":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF.json","graph_json":"https://pith.science/api/pith-number/2TRTYYYP6UKJEQLCEAWZL3IRYF/graph.json","events_json":"https://pith.science/api/pith-number/2TRTYYYP6UKJEQLCEAWZL3IRYF/events.json","paper":"https://pith.science/paper/2TRTYYYP"},"agent_actions":{"view_html":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF","download_json":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF.json","view_paper":"https://pith.science/paper/2TRTYYYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16004&json=true","fetch_graph":"https://pith.science/api/pith-number/2TRTYYYP6UKJEQLCEAWZL3IRYF/graph.json","fetch_events":"https://pith.science/api/pith-number/2TRTYYYP6UKJEQLCEAWZL3IRYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF/action/storage_attestation","attest_author":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF/action/author_attestation","sign_citation":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF/action/citation_signature","submit_replication":"https://pith.science/pith/2TRTYYYP6UKJEQLCEAWZL3IRYF/action/replication_record"}},"created_at":"2026-07-05T06:46:17.064410+00:00","updated_at":"2026-07-05T06:46:17.064410+00:00"}