{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TRCT4ESOIIQEAS7SHB2OWI6JMN","short_pith_number":"pith:TRCT4ESO","schema_version":"1.0","canonical_sha256":"9c453e124e4220404bf23874eb23c9636e21f26ff77bde74b507be2d0939dc40","source":{"kind":"arxiv","id":"2305.02041","version":4},"attestation_state":"computed","paper":{"title":"Low-complexity subspace-descent over symmetric positive definite manifold","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC"],"primary_cat":"stat.ML","authors_text":"Ketan Rajawat, Yogesh Darmwal","submitted_at":"2023-05-03T11:11:46Z","abstract_excerpt":"This work puts forth low-complexity Riemannian subspace descent algorithms for the minimization of functions over the symmetric positive definite (SPD) manifold. Different from the existing Riemannian gradient descent variants, the proposed approach utilizes carefully chosen subspaces that allow the update to be written as a product of the Cholesky factor of the iterate and a sparse matrix. The resulting updates avoid the costly matrix operations like matrix exponentiation and dense matrix multiplication, which are generally required in almost all other Riemannian optimization algorithms on SP"},"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":"2305.02041","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-05-03T11:11:46Z","cross_cats_sorted":["cs.LG","eess.SP","math.OC"],"title_canon_sha256":"001dfbb16f6feec7b3c30fa48747a81ff43419981ec82a87e3901319f496519f","abstract_canon_sha256":"0b10d56f7a5108b0a825ba104079a11b36958861c4c11b5450a7822a9867be51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:22.888132Z","signature_b64":"9tICunFNTJ4YjWBzsPVx6wbmBz38Va15FNi1G4UHF4ac59WpRidDTKf71IdJkoMVml63+89bWuyerlIKvQixCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c453e124e4220404bf23874eb23c9636e21f26ff77bde74b507be2d0939dc40","last_reissued_at":"2026-07-05T07:25:22.887674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:22.887674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity subspace-descent over symmetric positive definite manifold","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC"],"primary_cat":"stat.ML","authors_text":"Ketan Rajawat, Yogesh Darmwal","submitted_at":"2023-05-03T11:11:46Z","abstract_excerpt":"This work puts forth low-complexity Riemannian subspace descent algorithms for the minimization of functions over the symmetric positive definite (SPD) manifold. Different from the existing Riemannian gradient descent variants, the proposed approach utilizes carefully chosen subspaces that allow the update to be written as a product of the Cholesky factor of the iterate and a sparse matrix. The resulting updates avoid the costly matrix operations like matrix exponentiation and dense matrix multiplication, which are generally required in almost all other Riemannian optimization algorithms on SP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02041","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/2305.02041/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":"2305.02041","created_at":"2026-07-05T07:25:22.887727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02041v4","created_at":"2026-07-05T07:25:22.887727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02041","created_at":"2026-07-05T07:25:22.887727+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRCT4ESOIIQE","created_at":"2026-07-05T07:25:22.887727+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRCT4ESOIIQEAS7S","created_at":"2026-07-05T07:25:22.887727+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRCT4ESO","created_at":"2026-07-05T07:25:22.887727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12378","citing_title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN","json":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN.json","graph_json":"https://pith.science/api/pith-number/TRCT4ESOIIQEAS7SHB2OWI6JMN/graph.json","events_json":"https://pith.science/api/pith-number/TRCT4ESOIIQEAS7SHB2OWI6JMN/events.json","paper":"https://pith.science/paper/TRCT4ESO"},"agent_actions":{"view_html":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN","download_json":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN.json","view_paper":"https://pith.science/paper/TRCT4ESO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02041&json=true","fetch_graph":"https://pith.science/api/pith-number/TRCT4ESOIIQEAS7SHB2OWI6JMN/graph.json","fetch_events":"https://pith.science/api/pith-number/TRCT4ESOIIQEAS7SHB2OWI6JMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN/action/storage_attestation","attest_author":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN/action/author_attestation","sign_citation":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN/action/citation_signature","submit_replication":"https://pith.science/pith/TRCT4ESOIIQEAS7SHB2OWI6JMN/action/replication_record"}},"created_at":"2026-07-05T07:25:22.887727+00:00","updated_at":"2026-07-05T07:25:22.887727+00:00"}