{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:74QGMGDEY2V5IJB4F2KJJTRPL7","short_pith_number":"pith:74QGMGDE","canonical_record":{"source":{"id":"2106.08839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T14:58:19Z","cross_cats_sorted":[],"title_canon_sha256":"c78dce88b3e5a922bf77c3efc01043e31d05af7717b238ca4927a0142c09b10b","abstract_canon_sha256":"6146648110bb03cb3f39a9845ea67e1437e8b59ff6672ceff1101722274336bc"},"schema_version":"1.0"},"canonical_sha256":"ff20661864c6abd4243c2e9494ce2f5fc9f2edf4ecfc821cd319d7c9ebfc168c","source":{"kind":"arxiv","id":"2106.08839","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08839","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08839v4","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08839","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"74QGMGDEY2V5","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"74QGMGDEY2V5IJB4","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"74QGMGDE","created_at":"2026-07-05T06:14:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:74QGMGDEY2V5IJB4F2KJJTRPL7","target":"record","payload":{"canonical_record":{"source":{"id":"2106.08839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T14:58:19Z","cross_cats_sorted":[],"title_canon_sha256":"c78dce88b3e5a922bf77c3efc01043e31d05af7717b238ca4927a0142c09b10b","abstract_canon_sha256":"6146648110bb03cb3f39a9845ea67e1437e8b59ff6672ceff1101722274336bc"},"schema_version":"1.0"},"canonical_sha256":"ff20661864c6abd4243c2e9494ce2f5fc9f2edf4ecfc821cd319d7c9ebfc168c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:32.870656Z","signature_b64":"f204wx6xd9f24o0+AejxUdwGNJDAebAwnwhZw8XoEXO8TkwsvntbTMijSdzQbnu/E/97GH41ncjV1MSNHx5UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff20661864c6abd4243c2e9494ce2f5fc9f2edf4ecfc821cd319d7c9ebfc168c","last_reissued_at":"2026-07-05T06:14:32.870298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:32.870298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.08839","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tC75AqYXKvOUQ4XnNjeNIa6yQI3QOr6GFbfq+dOdBnCXgGiZVcaF119LH1XAoK2efzi53RKJJb73iwU6aT5gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:04:16.086080Z"},"content_sha256":"1330744eb69caf2e7986e9a4d3c4110783fe72649387134581ce74438178b54c","schema_version":"1.0","event_id":"sha256:1330744eb69caf2e7986e9a4d3c4110783fe72649387134581ce74438178b54c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:74QGMGDEY2V5IJB4F2KJJTRPL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuation methods for Riemannian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel S\\'eguin, Daniel Kressner","submitted_at":"2021-06-16T14:58:19Z","abstract_excerpt":"Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemannian manifold. For this purpose, a suitable homotopy is constructed between the original problem and a problem that admits an easy solution. We develop and analyze a path-following numerical continuation algorithm on manifolds for solving the resulting parameter-dependent equation. To illustrate our developments, we consider two typical classi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08839","kind":"arxiv","version":4},"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/2106.08839/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo8HVwZOKf44lnzwx1RlcY/jBb43YAbo5V4qFxQ2FkwkX+XpA0bnNGv6hopOG+CpwGtW2aWBwR/zJqqJr8wFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:04:16.086594Z"},"content_sha256":"67d6169d083783928dcebfab753d592af466c14fa1595859e5a9b5f26ec88948","schema_version":"1.0","event_id":"sha256:67d6169d083783928dcebfab753d592af466c14fa1595859e5a9b5f26ec88948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/bundle.json","state_url":"https://pith.science/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T03:04:16Z","links":{"resolver":"https://pith.science/pith/74QGMGDEY2V5IJB4F2KJJTRPL7","bundle":"https://pith.science/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/bundle.json","state":"https://pith.science/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74QGMGDEY2V5IJB4F2KJJTRPL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:74QGMGDEY2V5IJB4F2KJJTRPL7","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":"6146648110bb03cb3f39a9845ea67e1437e8b59ff6672ceff1101722274336bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T14:58:19Z","title_canon_sha256":"c78dce88b3e5a922bf77c3efc01043e31d05af7717b238ca4927a0142c09b10b"},"schema_version":"1.0","source":{"id":"2106.08839","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08839","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08839v4","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08839","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"74QGMGDEY2V5","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"74QGMGDEY2V5IJB4","created_at":"2026-07-05T06:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"74QGMGDE","created_at":"2026-07-05T06:14:32Z"}],"graph_snapshots":[{"event_id":"sha256:67d6169d083783928dcebfab753d592af466c14fa1595859e5a9b5f26ec88948","target":"graph","created_at":"2026-07-05T06:14:32Z","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/2106.08839/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemannian manifold. For this purpose, a suitable homotopy is constructed between the original problem and a problem that admits an easy solution. We develop and analyze a path-following numerical continuation algorithm on manifolds for solving the resulting parameter-dependent equation. To illustrate our developments, we consider two typical classi","authors_text":"Axel S\\'eguin, Daniel Kressner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T14:58:19Z","title":"Continuation methods for Riemannian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08839","kind":"arxiv","version":4},"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:1330744eb69caf2e7986e9a4d3c4110783fe72649387134581ce74438178b54c","target":"record","created_at":"2026-07-05T06:14:32Z","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":"6146648110bb03cb3f39a9845ea67e1437e8b59ff6672ceff1101722274336bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T14:58:19Z","title_canon_sha256":"c78dce88b3e5a922bf77c3efc01043e31d05af7717b238ca4927a0142c09b10b"},"schema_version":"1.0","source":{"id":"2106.08839","kind":"arxiv","version":4}},"canonical_sha256":"ff20661864c6abd4243c2e9494ce2f5fc9f2edf4ecfc821cd319d7c9ebfc168c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff20661864c6abd4243c2e9494ce2f5fc9f2edf4ecfc821cd319d7c9ebfc168c","first_computed_at":"2026-07-05T06:14:32.870298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:14:32.870298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f204wx6xd9f24o0+AejxUdwGNJDAebAwnwhZw8XoEXO8TkwsvntbTMijSdzQbnu/E/97GH41ncjV1MSNHx5UCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:14:32.870656Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.08839","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1330744eb69caf2e7986e9a4d3c4110783fe72649387134581ce74438178b54c","sha256:67d6169d083783928dcebfab753d592af466c14fa1595859e5a9b5f26ec88948"],"state_sha256":"a70473412074023cf2af67cae871060fa96d7e66a60ba3f466a6f3f77d4cad47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbPzlgZN3e6oOGeIErkuyYmP9/UyIpN2nX+r8/RZWcnxviQNxpT4LQVWoJ/T/dVBrJsvLKu/C+VmR1E6aOT2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T03:04:16.090797Z","bundle_sha256":"2877c418d122eec0600ffe297d11c961886c32d154e9bb7c5608b385ef7f2f5b"}}