{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TU2K7Y5PQD5WPEV47TMBVFVK3P","short_pith_number":"pith:TU2K7Y5P","canonical_record":{"source":{"id":"2412.19427","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-27T03:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"4ede68a1162c1bb85e1fe9a46d9746c5a3621fa7d2a5ffdf8efa2eef7571f3b6","abstract_canon_sha256":"30b9a45cdb5c55d790b7d9fdcaba74373e10a541db8fa3d7eb45942b016ee127"},"schema_version":"1.0"},"canonical_sha256":"9d34afe3af80fb6792bcfcd81a96aadbcff6a171119a5c325f4c4ab1107cd656","source":{"kind":"arxiv","id":"2412.19427","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.19427","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2412.19427v2","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19427","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"TU2K7Y5PQD5W","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"TU2K7Y5PQD5WPEV4","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"TU2K7Y5P","created_at":"2026-05-20T00:04:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TU2K7Y5PQD5WPEV47TMBVFVK3P","target":"record","payload":{"canonical_record":{"source":{"id":"2412.19427","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-27T03:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"4ede68a1162c1bb85e1fe9a46d9746c5a3621fa7d2a5ffdf8efa2eef7571f3b6","abstract_canon_sha256":"30b9a45cdb5c55d790b7d9fdcaba74373e10a541db8fa3d7eb45942b016ee127"},"schema_version":"1.0"},"canonical_sha256":"9d34afe3af80fb6792bcfcd81a96aadbcff6a171119a5c325f4c4ab1107cd656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:07.299868Z","signature_b64":"kUrd58syx1EyUegQ+fNVeRLcKZzl+XbKuJ9b30NJXNVi1ZkDKsLPqRD6dl5rvndIVQxmom6pQsjCUFsXmLcmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d34afe3af80fb6792bcfcd81a96aadbcff6a171119a5c325f4c4ab1107cd656","last_reissued_at":"2026-05-20T00:04:07.299172Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:07.299172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.19427","source_version":2,"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-05-20T00:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGVbhKJZwrsCKEC0qyYPjQZgCmUkhpL2PlZ6V9hKoLH+Ui/1LKiFuudD8gsGSPHxBKuqthu+d1zvKyUcH0i6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:33:37.059497Z"},"content_sha256":"a54b67e40fbb521a5f95cc9bb7d99e052318ecc26103b5f46c48f34f4f22f819","schema_version":"1.0","event_id":"sha256:a54b67e40fbb521a5f95cc9bb7d99e052318ecc26103b5f46c48f34f4f22f819"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TU2K7Y5PQD5WPEV47TMBVFVK3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Riemannian conditional gradient methods for composite optimization problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ellen H. Fukuda, Kangming Chen","submitted_at":"2024-12-27T03:38:07Z","abstract_excerpt":"In this paper, we propose Riemannian conditional gradient methods for minimizing composite functions, i.e., those that can be expressed as the sum of a smooth function and a retraction-based convex function. We analyze the convergence of the proposed algorithms, utilizing three types of step-size strategies: adaptive, diminishing, and those based on the Armijo condition. We establish the convergence rate of \\(\\mathcal{O}(1/k)\\) for the adaptive and diminishing step sizes, where \\(k\\) denotes the number of iterations. Additionally, we derive an iteration complexity of \\(\\mathcal{O}(1/\\epsilon^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19427","kind":"arxiv","version":2},"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/2412.19427/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-05-20T00:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STydrC5hj9mMBnOaOFiLrbftvgLwXMqDTpi2IdUIELnppPsVL646rdPYKTPbE6hOjuqxHNQw6NMplxQxl2MPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:33:37.059881Z"},"content_sha256":"ad85cca2dc68c41d0fcaba42e6bd7a377a625304249f43a3a1eddf19563a995e","schema_version":"1.0","event_id":"sha256:ad85cca2dc68c41d0fcaba42e6bd7a377a625304249f43a3a1eddf19563a995e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/bundle.json","state_url":"https://pith.science/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/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-06-02T10:33:37Z","links":{"resolver":"https://pith.science/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P","bundle":"https://pith.science/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/bundle.json","state":"https://pith.science/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TU2K7Y5PQD5WPEV47TMBVFVK3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TU2K7Y5PQD5WPEV47TMBVFVK3P","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":"30b9a45cdb5c55d790b7d9fdcaba74373e10a541db8fa3d7eb45942b016ee127","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-27T03:38:07Z","title_canon_sha256":"4ede68a1162c1bb85e1fe9a46d9746c5a3621fa7d2a5ffdf8efa2eef7571f3b6"},"schema_version":"1.0","source":{"id":"2412.19427","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.19427","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2412.19427v2","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19427","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"TU2K7Y5PQD5W","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"TU2K7Y5PQD5WPEV4","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"TU2K7Y5P","created_at":"2026-05-20T00:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:ad85cca2dc68c41d0fcaba42e6bd7a377a625304249f43a3a1eddf19563a995e","target":"graph","created_at":"2026-05-20T00:04:07Z","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/2412.19427/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose Riemannian conditional gradient methods for minimizing composite functions, i.e., those that can be expressed as the sum of a smooth function and a retraction-based convex function. We analyze the convergence of the proposed algorithms, utilizing three types of step-size strategies: adaptive, diminishing, and those based on the Armijo condition. We establish the convergence rate of \\(\\mathcal{O}(1/k)\\) for the adaptive and diminishing step sizes, where \\(k\\) denotes the number of iterations. Additionally, we derive an iteration complexity of \\(\\mathcal{O}(1/\\epsilon^2","authors_text":"Ellen H. Fukuda, Kangming Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-27T03:38:07Z","title":"Riemannian conditional gradient methods for composite optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19427","kind":"arxiv","version":2},"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:a54b67e40fbb521a5f95cc9bb7d99e052318ecc26103b5f46c48f34f4f22f819","target":"record","created_at":"2026-05-20T00:04:07Z","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":"30b9a45cdb5c55d790b7d9fdcaba74373e10a541db8fa3d7eb45942b016ee127","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-27T03:38:07Z","title_canon_sha256":"4ede68a1162c1bb85e1fe9a46d9746c5a3621fa7d2a5ffdf8efa2eef7571f3b6"},"schema_version":"1.0","source":{"id":"2412.19427","kind":"arxiv","version":2}},"canonical_sha256":"9d34afe3af80fb6792bcfcd81a96aadbcff6a171119a5c325f4c4ab1107cd656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d34afe3af80fb6792bcfcd81a96aadbcff6a171119a5c325f4c4ab1107cd656","first_computed_at":"2026-05-20T00:04:07.299172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:07.299172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUrd58syx1EyUegQ+fNVeRLcKZzl+XbKuJ9b30NJXNVi1ZkDKsLPqRD6dl5rvndIVQxmom6pQsjCUFsXmLcmAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:07.299868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.19427","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a54b67e40fbb521a5f95cc9bb7d99e052318ecc26103b5f46c48f34f4f22f819","sha256:ad85cca2dc68c41d0fcaba42e6bd7a377a625304249f43a3a1eddf19563a995e"],"state_sha256":"af616e4e3f679e68eae59dd07329072731b6c08d8e966ecb8a978d144285e825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffE2lJBdu2E3zMn2mZMVFjDYR+nfMAIKe1ITtxE8Ayr5R6nlZBkvG9p0q1SWjQ04Tpz/VnmjWV3BIXLy7WOHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:33:37.062220Z","bundle_sha256":"4f8707ce14b6089f8bc19c8b3dfec3f8800904f569640605535ff5290aee3919"}}