{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I4Z2FRSBLRF465L42OAZZWU5AS","short_pith_number":"pith:I4Z2FRSB","schema_version":"1.0","canonical_sha256":"4733a2c6415c4bcf757cd3819cda9d04930eaa1fbd7b7bfe7c3c6136e696bc0f","source":{"kind":"arxiv","id":"2211.02163","version":3},"attestation_state":"computed","paper":{"title":"A Riemannian ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jiaxiang Li, Shiqian Ma, Tejes Srivastava","submitted_at":"2022-11-03T22:12:18Z","abstract_excerpt":"We consider a class of Riemannian optimization problems where the objective is the sum of a smooth function and a nonsmooth function, considered in the ambient space. This class of problems finds important applications in machine learning and statistics such as the sparse principal component analysis, sparse spectral clustering, and orthogonal dictionary learning. We propose a Riemannian alternating direction method of multipliers (ADMM) to solve this class of problems. Our algorithm adopts easily computable steps in each iteration. The iteration complexity of the proposed algorithm for obtain"},"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":"2211.02163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:12:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"85229d4b61c79f5618b4217b462239393a1fd53c80d86ee141b7c02646d5cd3a","abstract_canon_sha256":"fd049918bb56fa1d0332c08ecf2bdb7c853a14b8d7515c7878379a88ae322a3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:13.713468Z","signature_b64":"NDYpLUwfareU6QpraRwszbncq1TFuUM5Yd/r7hHqytQIoXm6anJ+D1rVDd20KVSV8cC0r+/vmx/J6IGc3/yjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4733a2c6415c4bcf757cd3819cda9d04930eaa1fbd7b7bfe7c3c6136e696bc0f","last_reissued_at":"2026-07-05T09:40:13.712949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:13.712949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Riemannian ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jiaxiang Li, Shiqian Ma, Tejes Srivastava","submitted_at":"2022-11-03T22:12:18Z","abstract_excerpt":"We consider a class of Riemannian optimization problems where the objective is the sum of a smooth function and a nonsmooth function, considered in the ambient space. This class of problems finds important applications in machine learning and statistics such as the sparse principal component analysis, sparse spectral clustering, and orthogonal dictionary learning. We propose a Riemannian alternating direction method of multipliers (ADMM) to solve this class of problems. Our algorithm adopts easily computable steps in each iteration. The iteration complexity of the proposed algorithm for obtain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02163","kind":"arxiv","version":3},"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/2211.02163/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":"2211.02163","created_at":"2026-07-05T09:40:13.713013+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02163v3","created_at":"2026-07-05T09:40:13.713013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02163","created_at":"2026-07-05T09:40:13.713013+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4Z2FRSBLRF4","created_at":"2026-07-05T09:40:13.713013+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4Z2FRSBLRF465L4","created_at":"2026-07-05T09:40:13.713013+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4Z2FRSB","created_at":"2026-07-05T09:40:13.713013+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.15006","citing_title":"Distributed Quantum Gaussian Processes for Multi-Agent Systems","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS","json":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS.json","graph_json":"https://pith.science/api/pith-number/I4Z2FRSBLRF465L42OAZZWU5AS/graph.json","events_json":"https://pith.science/api/pith-number/I4Z2FRSBLRF465L42OAZZWU5AS/events.json","paper":"https://pith.science/paper/I4Z2FRSB"},"agent_actions":{"view_html":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS","download_json":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS.json","view_paper":"https://pith.science/paper/I4Z2FRSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02163&json=true","fetch_graph":"https://pith.science/api/pith-number/I4Z2FRSBLRF465L42OAZZWU5AS/graph.json","fetch_events":"https://pith.science/api/pith-number/I4Z2FRSBLRF465L42OAZZWU5AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS/action/storage_attestation","attest_author":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS/action/author_attestation","sign_citation":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS/action/citation_signature","submit_replication":"https://pith.science/pith/I4Z2FRSBLRF465L42OAZZWU5AS/action/replication_record"}},"created_at":"2026-07-05T09:40:13.713013+00:00","updated_at":"2026-07-05T09:40:13.713013+00:00"}