{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L2UO634U3LEJVCXYLZSH2TM6LE","short_pith_number":"pith:L2UO634U","schema_version":"1.0","canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","source":{"kind":"arxiv","id":"1503.08601","version":2},"attestation_state":"computed","paper":{"title":"Finding a low-rank basis in a matrix subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Andr\\'e Uschmajew, Tasuku Soma, Yuji Nakatsukasa","submitted_at":"2015-03-30T09:04:40Z","abstract_excerpt":"For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained by the tensor CP decomposition. For the higher rank case, the situation is not as straightforward. In this work we present an algorithm based on a greedy process applicable to higher rank problems. Our algorithm first estimates the minimum rank by applying soft singular value thresholding to a nuclear norm relaxation, and then computes a matrix with that ran"},"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":"1503.08601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-03-30T09:04:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6af7b04e4d9ba0d235f399368618589b813da54f493a1660a4b2cb3e50ab6980","abstract_canon_sha256":"1f34aee998186fdb5f4af51354507bb64ed17df42ba104ece1b785c3095905cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:51.743406Z","signature_b64":"v1045CsfmJwHyDKHugFDi2hQDA88eB/sAua7ZosShEaK1yK25WdBxw+ctzA70dMFWjKBVMUWgqs17AQKxQhXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","last_reissued_at":"2026-05-18T01:11:51.742945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:51.742945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a low-rank basis in a matrix subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Andr\\'e Uschmajew, Tasuku Soma, Yuji Nakatsukasa","submitted_at":"2015-03-30T09:04:40Z","abstract_excerpt":"For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained by the tensor CP decomposition. For the higher rank case, the situation is not as straightforward. In this work we present an algorithm based on a greedy process applicable to higher rank problems. Our algorithm first estimates the minimum rank by applying soft singular value thresholding to a nuclear norm relaxation, and then computes a matrix with that ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08601","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":"1503.08601","created_at":"2026-05-18T01:11:51.743008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08601v2","created_at":"2026-05-18T01:11:51.743008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08601","created_at":"2026-05-18T01:11:51.743008+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2UO634U3LEJ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2UO634U3LEJVCXY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2UO634U","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE","json":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE.json","graph_json":"https://pith.science/api/pith-number/L2UO634U3LEJVCXYLZSH2TM6LE/graph.json","events_json":"https://pith.science/api/pith-number/L2UO634U3LEJVCXYLZSH2TM6LE/events.json","paper":"https://pith.science/paper/L2UO634U"},"agent_actions":{"view_html":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE","download_json":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE.json","view_paper":"https://pith.science/paper/L2UO634U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08601&json=true","fetch_graph":"https://pith.science/api/pith-number/L2UO634U3LEJVCXYLZSH2TM6LE/graph.json","fetch_events":"https://pith.science/api/pith-number/L2UO634U3LEJVCXYLZSH2TM6LE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/action/storage_attestation","attest_author":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/action/author_attestation","sign_citation":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/action/citation_signature","submit_replication":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/action/replication_record"}},"created_at":"2026-05-18T01:11:51.743008+00:00","updated_at":"2026-05-18T01:11:51.743008+00:00"}