{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CCZIYEIFREICMYYZRMJIBZV2LJ","short_pith_number":"pith:CCZIYEIF","schema_version":"1.0","canonical_sha256":"10b28c110589102663198b1280e6ba5a582151ced6487d26034d7e5ad0205c7c","source":{"kind":"arxiv","id":"1506.00575","version":2},"attestation_state":"computed","paper":{"title":"A Riemannian low-rank method for optimization over semidefinite matrices with block-diagonal constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.CO"],"primary_cat":"math.OC","authors_text":"Nicolas Boumal","submitted_at":"2015-06-01T17:17:49Z","abstract_excerpt":"We propose a new algorithm to solve optimization problems of the form $\\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems often arise as the result of relaxing a rank constraint (lifting). In particular, many estimation tasks involving phases, rotations, orthonormal bases or permutations fit in this framework, and so do certain relaxations of combinatorial problems such as Max-Cut. The proposed algorithm exploits the facts that (1) such formulations admit low-rank solutions, and "},"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":"1506.00575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-01T17:17:49Z","cross_cats_sorted":["cs.CV","stat.CO"],"title_canon_sha256":"8dd3a6cdf2e129adad1034e2e09eefd57a10c51a2e44af16ea3c08876850ef74","abstract_canon_sha256":"7c405071845a6d817bf439185c09a4b8802e1bbb8a7ece297a5fd4375827dfa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:18.802569Z","signature_b64":"8yME5xvot+Po7fQrYo0ZGqK1XfYzMRypRi9Rrif5U2EEMXy4rv8OLZ3BoxA5W9riI7B/3JnGNaMWXeViaxtICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10b28c110589102663198b1280e6ba5a582151ced6487d26034d7e5ad0205c7c","last_reissued_at":"2026-05-18T01:23:18.801920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:18.801920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Riemannian low-rank method for optimization over semidefinite matrices with block-diagonal constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.CO"],"primary_cat":"math.OC","authors_text":"Nicolas Boumal","submitted_at":"2015-06-01T17:17:49Z","abstract_excerpt":"We propose a new algorithm to solve optimization problems of the form $\\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems often arise as the result of relaxing a rank constraint (lifting). In particular, many estimation tasks involving phases, rotations, orthonormal bases or permutations fit in this framework, and so do certain relaxations of combinatorial problems such as Max-Cut. The proposed algorithm exploits the facts that (1) such formulations admit low-rank solutions, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00575","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":""},"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":"1506.00575","created_at":"2026-05-18T01:23:18.802015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00575v2","created_at":"2026-05-18T01:23:18.802015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00575","created_at":"2026-05-18T01:23:18.802015+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCZIYEIFREIC","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCZIYEIFREICMYYZ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCZIYEIF","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.01267","citing_title":"Certifiable Factor Graph Optimization","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ","json":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ.json","graph_json":"https://pith.science/api/pith-number/CCZIYEIFREICMYYZRMJIBZV2LJ/graph.json","events_json":"https://pith.science/api/pith-number/CCZIYEIFREICMYYZRMJIBZV2LJ/events.json","paper":"https://pith.science/paper/CCZIYEIF"},"agent_actions":{"view_html":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ","download_json":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ.json","view_paper":"https://pith.science/paper/CCZIYEIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00575&json=true","fetch_graph":"https://pith.science/api/pith-number/CCZIYEIFREICMYYZRMJIBZV2LJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CCZIYEIFREICMYYZRMJIBZV2LJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ/action/storage_attestation","attest_author":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ/action/author_attestation","sign_citation":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ/action/citation_signature","submit_replication":"https://pith.science/pith/CCZIYEIFREICMYYZRMJIBZV2LJ/action/replication_record"}},"created_at":"2026-05-18T01:23:18.802015+00:00","updated_at":"2026-05-18T01:23:18.802015+00:00"}