{"as_of":"2026-08-10T04:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ee0ba2e8ed710155d77bf0a1c4b463e74379847a192d2b10781c545adad3b12","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:01:57.128540Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:18:45.227744Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.11236","snapshot_observed_at":"2026-08-01T10:18:45.227744Z","title":"Online optimization on Hadamard manifolds: Curvature independent regret bounds on horospherically convex objectives,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20316","last_updated":"2026-07-22T16:03:43Z","snapshot_observed_at":"2026-08-07T05:42:13.531403Z","submitted_at":"2026-07-22T16:03:43Z","title":"Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T10:18:45.227744Z"},"links":{"cited_paper":"/paper/2509.11236","citing_paper":"/paper/2607.20316"},"observation_digest":"sha256:2bdc949ae28e633de05078b04bc49a06fc6d608bbe1dbd163dacd89aac5fa935","observation_id":"5ef9bba4-5747-45ca-ab63-2bb1f7be11ed","resolution":{"observed_at":"2026-08-01T10:18:45.227744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.11236/citation-record","integrity":"/paper/2509.11236/integrity","json":"/paper/2509.11236/citation-record.json","paper":"/paper/2509.11236"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:56.976330Z","title":"Optimization algorithms on matrix manifolds","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:56.976330Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:e65eb56aca659800494c91bc6cab2b522e92b06b79de18a16e98b8445e78ac4f","observation_id":"445a2c8b-fe91-4ab2-addc-88b069199bfd","resolution":{"observed_at":"2026-08-04T17:01:56.976330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:56.981812Z","title":"A continuous-time perspective for modeling acceleration in riemannian optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:56.981812Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:9b6057266b11d435e0ff02af298ed3833a3491f4a3f51db88cfe211f347a0b11","observation_id":"8ca696f9-7f06-4ec2-82ae-6161ec2fd188","resolution":{"observed_at":"2026-08-04T17:01:56.981812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:56.987031Z","title":"Walter de Gruyter GmbH & Co KG, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:56.987031Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:b9491e2f8f7db5fdb5e00ae624ffa2ccb1a1b2b8d7de550c83b0091ecce7081c","observation_id":"e2b5382d-39db-4c5a-a96b-f01906d7abc4","resolution":{"observed_at":"2026-08-04T17:01:56.987031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:56.992030Z","title":"Stochastic gradient descent on riemannian manifolds","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:56.992030Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:5c5f24c57a9aeb8f08253d3eb8cfdefc0d4da413ed74a8ec4c72dc3917167dc3","observation_id":"cacd3cec-d213-46e0-b44d-4e45a5367a6f","resolution":{"observed_at":"2026-08-04T17:01:56.992030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:56.996737Z","title":"Cambridge University Press, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:56.996737Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:4f711f5f3ad567fda40df4b7d536f457e01896b9dc8d76bf6f57ee6d957b7885","observation_id":"a29505c6-1cd9-494b-8459-640f1aae0c83","resolution":{"observed_at":"2026-08-04T17:01:56.996737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05128","last_updated":"2024-10-07T15:28:34Z","snapshot_observed_at":"2026-07-06T19:29:05.492290Z","submitted_at":"2024-10-07T15:28:34Z","title":"Decentralized Online Riemannian Optimization with Dynamic Environments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05128","snapshot_observed_at":"2026-08-04T17:01:57.001317Z","title":"Decentralized online riemannian opti- mization with dynamic environments.arXiv preprint arXiv:2410.05128, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.001317Z"},"links":{"cited_paper":"/paper/2410.05128","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:feee002e940c965345f3ec7ad5b811b86a9f6ac7310b06690613c725b6934974","observation_id":"767a1c0a-24d8-4abb-9196-9d256a92cf22","resolution":{"observed_at":"2026-08-04T17:01:57.001317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.006816Z","title":"Decentralized riemannian gradient descent on the stiefel manifold","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.006816Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:6cc55c8bd5093bd8ed13258dd978b1923de40ba88ba828aef12cb92bb230fd0e","observation_id":"6067fc61-6354-493e-aa50-c3ce6ab33ce1","resolution":{"observed_at":"2026-08-04T17:01:57.006816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.011079Z","title":"Riemannian dictionary learning and sparse coding for positive definite matrices.IEEE transactions on neural networks and learning systems, 28(12):2859–2871, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.011079Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:f2e6792beb841a776a7f83c38632ac09802d8b803c72f1ff668891bb5267d627","observation_id":"fa6d5f72-241a-4190-a43e-c365a1a2a25e","resolution":{"observed_at":"2026-08-04T17:01:57.011079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16970","last_updated":"2025-05-22T17:50:10Z","snapshot_observed_at":"2026-08-08T01:02:59.562855Z","submitted_at":"2025-05-22T17:50:10Z","title":"Horospherically Convex Optimization on Hadamard Manifolds Part I: Analysis and Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16970","snapshot_observed_at":"2026-08-04T17:01:57.015490Z","title":"Horospherically convex optimization on hadamard manifolds part i: Analysis and algorithms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.015490Z"},"links":{"cited_paper":"/paper/2505.16970","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:40d2f333aa3af10487410d743bbf269597a5e9e211ba7d33955aa9d4fb86dc4a","observation_id":"eba555f0-eb6c-4165-84cd-2c33e5efc4da","resolution":{"observed_at":"2026-08-04T17:01:57.015490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.020114Z","title":"The geometry of algorithms with orthogonality constraints.SIAM journal on Matrix Analysis and Applications, 20(2):303–353, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.020114Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:125087f3362efba8b21a236ae35cdd203e443243afcc4bddb32b58ec3eb8f319","observation_id":"d7d9a172-dc02-44db-8c05-78e41d7c4d59","resolution":{"observed_at":"2026-08-04T17:01:57.020114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.024597Z","title":"A subgradient splitting algorithm for optimization on nonpos- itively curved metric spaces.arXiv preprint arXiv:2412.06730, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.024597Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:ac1c309995d159d189c79d17401ba35644b4a50b64d6f51bf40547e6a08bd44b","observation_id":"d4e9a26d-5835-4ca1-8ad5-e6eac281f78a","resolution":{"observed_at":"2026-08-04T17:01:57.024597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.028920Z","title":"Introduction to online convex optimization.Founda- tions and Trends® in Optimization, 2(3-4):157–325, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.028920Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:64191342ccf81cbd48a038d0304677fa042a67b3b6bce33b223faa6c3aa6f425","observation_id":"ffc4140d-1106-4201-b470-1c02d045ef98","resolution":{"observed_at":"2026-08-04T17:01:57.028920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.033561Z","title":"Convex analysis on hadamard spaces and scaling problems.Foundations of Computational Mathematics, 24(6):1979– 2016, 2024","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.033561Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:515789cb3e5d24d1de809467a0ce26769369b6adc57e816611d5b17a857749cc","observation_id":"6c7a8913-6333-4f99-9b92-1766c7621a64","resolution":{"observed_at":"2026-08-04T17:01:57.033561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.038169Z","title":"Riemannian projection-free online learning.Advances in Neural Information Pro- cessing Systems, 36:41980–42014, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.038169Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:a12d5dc0103b0cdf9b20137b049b0f52e8b83b1c6de833e0f4328547861242d0","observation_id":"d9c620a9-f784-41b7-9d03-338c8583745e","resolution":{"observed_at":"2026-08-04T17:01:57.038169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15749","last_updated":"2024-04-02T18:11:09Z","snapshot_observed_at":"2026-07-06T17:49:24.075614Z","submitted_at":"2024-03-23T07:34:18Z","title":"Horoballs and the subgradient method","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15749","snapshot_observed_at":"2026-08-04T17:01:57.042317Z","title":"Horoballs and the subgradient method.arXiv preprint arXiv:2403.15749, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.042317Z"},"links":{"cited_paper":"/paper/2403.15749","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:99a4171893fc1339ebecd984a59f53be2f72ec93f289484c4f0bd5c1f11dc5c0","observation_id":"eac34c23-3c8e-4ccc-9c6d-4dc4aa0f16d1","resolution":{"observed_at":"2026-08-04T17:01:57.042317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.047102Z","title":"Cheap orthogonal constraints in neural networks: A simple parametrization of the or- thogonal and unitary group","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.047102Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:a025e00aac8b1e7aee3a4c0a2a745f18123a0b1576dc16a36847a30fbfb69a5d","observation_id":"f301ebed-2a45-4cc9-a68b-e867a1491ed2","resolution":{"observed_at":"2026-08-04T17:01:57.047102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.051855Z","title":"Tracking and regret bounds for online zeroth-order euclidean and riemannian optimization.SIAM Journal on Optimization, 32(2):445–469, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.051855Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:fd91466dfea07279cd0efefc497e9dd94477f6adf4a5225fdc0a49ac9bea30b4","observation_id":"c541adf1-87b6-42de-8e04-e95c359bb86c","resolution":{"observed_at":"2026-08-04T17:01:57.051855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.056035Z","title":"A differential geometric approach to the geometric mean of symmetric positive-definite matrices.SIAM journal on matrix analysis and applications, 26(3):735–747, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.056035Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:a24d6d4a1d45a7a634c19367ff551680017fca6657619fbc735b57dddafe1f9f","observation_id":"91feb76a-9ebc-44b3-a7c4-1775bfbc81ad","resolution":{"observed_at":"2026-08-04T17:01:57.056035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.060408Z","title":"Poincar ´e embeddings for learning hierarchical representations.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.060408Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:ce2d63aabeb27a3035d03c41a39f990a9c121349382f458d943f20563a5e2ad3","observation_id":"bfa3547b-7024-47e8-8575-60b3f26d9914","resolution":{"observed_at":"2026-08-04T17:01:57.060408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07779","last_updated":"2026-06-06T13:17:33Z","snapshot_observed_at":"2026-08-08T13:46:27.908621Z","submitted_at":"2025-09-09T14:14:46Z","title":"Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07779","snapshot_observed_at":"2026-08-04T17:01:57.066122Z","title":"Decentralized online rie- mannian optimization beyond hadamard manifolds.arXiv preprint arXiv:2509.07779, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.066122Z"},"links":{"cited_paper":"/paper/2509.07779","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:16d4c99b205cfb05ab680ca176739cf18969e9953efdf0b1deac8cd27870d33c","observation_id":"4fa5a365-a798-4875-afee-b40cfd68702a","resolution":{"observed_at":"2026-08-04T17:01:57.066122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.071188Z","title":"Consensus optimization on manifolds.SIAM journal on Control and Optimization, 48(1):56–76, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.071188Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:9516da577a51be4622c2196d9564564559c4abec96659d8648ad1ffd9f753c9f","observation_id":"9fb3f1d3-a47b-420a-8d07-afbef0db7ca0","resolution":{"observed_at":"2026-08-04T17:01:57.071188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.075426Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.075426Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:a09418e63d1095165cf134a46a4880de60ffd07f0717828d6c3208e4937b1ade","observation_id":"d1380b04-30a7-4580-bab2-236a57e27239","resolution":{"observed_at":"2026-08-04T17:01:57.075426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.079656Z","title":"Riemannian optimization on unit sphere with p-norm and its applications.Computational Optimization and Applications, 85(3):897–935, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.079656Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:14787a1a67496e326c0ad61cb1a7ca8420deb59b51ae7ac7b05951a7eea2ba86","observation_id":"981fa927-fee6-4bc0-b6bd-de0e844df974","resolution":{"observed_at":"2026-08-04T17:01:57.079656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.084019Z","title":"Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport.SIAM Journal on Optimization, 29(2):1444–1472, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.084019Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:530ebb1626c390556d6fc63de2d4ad66b8bfe42b55c3cf1846888c47e1ad96f0","observation_id":"bd8c827c-32b6-471e-8ce5-3681a6f684bd","resolution":{"observed_at":"2026-08-04T17:01:57.084019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.088361Z","title":"Riemannian optimal identification method for linear systems with symmetric positive-definite matrix.IEEE Transactions on Automatic Control, 65(11):4493–4508, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.088361Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:debc2a5a8c6f2789b569840c61740d0d4c34fca9a3e19ae3f2f634ca124c2340","observation_id":"a4ae544c-767d-4131-94ea-0d2786e8ddfe","resolution":{"observed_at":"2026-08-04T17:01:57.088361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11590","last_updated":"2024-12-07T16:06:54Z","snapshot_observed_at":"2026-08-06T06:35:56.681575Z","submitted_at":"2024-05-19T15:50:57Z","title":"Retraction-Free Decentralized Non-convex Optimization with Orthogonal Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11590","snapshot_observed_at":"2026-08-04T17:01:57.093557Z","title":"Retraction-free decentralized non-convex optimization with orthogonal constraints.arXiv preprint arXiv:2405.11590, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.093557Z"},"links":{"cited_paper":"/paper/2405.11590","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:b32eed7019c98f6461e9e55688b918b02ece9065b9207efab242f34ccae842b4","observation_id":"b1254e57-f932-472d-b198-d98c5e785ef3","resolution":{"observed_at":"2026-08-04T17:01:57.093557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.098402Z","title":"Policy optimization over subman- ifolds for linearly constrained feedback synthesis.IEEE Transactions on Automatic Control, 69(5):3024–3039, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.098402Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:feb9f2464400d223f1ef2b571e81d5df40a92c037ee6bcafe7a96a5ce61cb09f","observation_id":"a880e50e-c0a7-4e0c-86c6-42e10c9069ca","resolution":{"observed_at":"2026-08-04T17:01:57.098402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.103285Z","title":"Low-rank matrix completion by riemannian opti- mization.SIAM Journal on Optimization, 23(2):1214–1236, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.103285Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:94e63d3b253a311ac02603dd9cb3516c44d59fb0621a21125962871e4d2cc892","observation_id":"478e3656-ead9-4877-98a2-330a20d36adb","resolution":{"observed_at":"2026-08-04T17:01:57.103285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06373","last_updated":"2018-06-17T12:29:01Z","snapshot_observed_at":"2026-07-06T06:45:12.662244Z","submitted_at":"2018-06-17T12:29:01Z","title":"Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.06373","snapshot_observed_at":"2026-08-04T17:01:57.107300Z","title":"Geodesic convex optimization: Differentiation on manifolds, geodesics, and convexity.arXiv preprint arXiv:1806.06373, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.107300Z"},"links":{"cited_paper":"/paper/1806.06373","citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:70a8fa596ac33e1d1540331b6d5928fd3bb3e7194e3e97a61d9202c682332d16","observation_id":"2bc6c7da-eb9a-47bb-9116-ef3d9b6178f6","resolution":{"observed_at":"2026-08-04T17:01:57.107300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.111921Z","title":"Riemannian online learning.Foundations and Trends® in Optimization, 9(3):248–406, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.111921Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:af79f553d4d5d9f87634e515fe323f396346f47226c9a15d3c62cccb7eaa9663","observation_id":"5db898a7-1650-4c7e-9cc3-39e2af733286","resolution":{"observed_at":"2026-08-04T17:01:57.111921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.116739Z","title":"Online optimization over riemannian manifolds.Journal of Machine Learning Research, 24(84):1–67, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.116739Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:ee44e77ea5eba0a2027eba3b4e12f1c9f23f18fc6ecc6a42da25596be076fffd","observation_id":"955a19bc-2ef7-4a30-ae01-14b6396ad2ac","resolution":{"observed_at":"2026-08-04T17:01:57.116739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.120696Z","title":"Riemannian online optimistic algorithms with dynamic regret.IEEE Transactions on Automatic Control, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.120696Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:76a867c59052317de783ae9eca37948a28d3c507a67f7b1c36726de68c80f232","observation_id":"5d858ddf-bb57-4085-a646-e8ffa9e7f0c0","resolution":{"observed_at":"2026-08-04T17:01:57.120696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.124560Z","title":"Riemannian svrg: Fast stochastic optimization on riemannian manifolds.Advances in Neural Information Processing Systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.124560Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:8d9c1e24da06518c87d0470e69d3dd466faf57b03dcd727c1cfb62804565cfb3","observation_id":"238ef623-5a02-4a4f-9b83-99e0384d551f","resolution":{"observed_at":"2026-08-04T17:01:57.124560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:01:57.128540Z","title":"First-order methods for geodesically convex optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:57.128540Z"},"links":{"citing_paper":"/paper/2509.11236"},"observation_digest":"sha256:caed373f85fba771ad06bc6c3b41372abbbdf0e1ce0900a6977c34f4524e9945","observation_id":"fceaf0dd-bf8b-4519-bd98-d31a4c9bc496","resolution":{"observed_at":"2026-08-04T17:01:57.128540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.11236","last_updated":"2025-09-14T12:27:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T01:04:11.830615Z","submitted_at":"2025-09-14T12:27:31Z","title":"Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2509.11236."}