{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L2UO634U3LEJVCXYLZSH2TM6LE","short_pith_number":"pith:L2UO634U","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"},"canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","source":{"kind":"arxiv","id":"1503.08601","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08601","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08601v2","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08601","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2UO634U3LEJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2UO634U3LEJVCXY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2UO634U","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L2UO634U3LEJVCXYLZSH2TM6LE","target":"record","payload":{"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"},"canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","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"},"source_kind":"arxiv","source_id":"1503.08601","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-18T01:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGEAxbPOnGvo0UgYxSsDUUYy50UPTiNF7FEP0a89UrvHZDT17DjGktzeBfOF2CbAOXWN+p2h8HVpOE9+uDeoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:41:18.913847Z"},"content_sha256":"970aea44aa31855a4e88a3b74ec370e2b6935b89ff10998513020bed93af2b39","schema_version":"1.0","event_id":"sha256:970aea44aa31855a4e88a3b74ec370e2b6935b89ff10998513020bed93af2b39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L2UO634U3LEJVCXYLZSH2TM6LE","target":"graph","payload":{"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"},"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-18T01:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJ1uwJawKoxvZPD0vLHYzRiCW7idFIKhpGDOfXG+tkxoRy33MnABhUBGf3sxgGcffePaQEeX6MtHF3usmv7DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:41:18.914521Z"},"content_sha256":"8c5de4f7dc4b0c3003f9ff033051f570fa285d1af85e757b8d1d03180484d12e","schema_version":"1.0","event_id":"sha256:8c5de4f7dc4b0c3003f9ff033051f570fa285d1af85e757b8d1d03180484d12e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/bundle.json","state_url":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2UO634U3LEJVCXYLZSH2TM6LE/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-05-31T14:41:18Z","links":{"resolver":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE","bundle":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/bundle.json","state":"https://pith.science/pith/L2UO634U3LEJVCXYLZSH2TM6LE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2UO634U3LEJVCXYLZSH2TM6LE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L2UO634U3LEJVCXYLZSH2TM6LE","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":"1f34aee998186fdb5f4af51354507bb64ed17df42ba104ece1b785c3095905cf","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-03-30T09:04:40Z","title_canon_sha256":"6af7b04e4d9ba0d235f399368618589b813da54f493a1660a4b2cb3e50ab6980"},"schema_version":"1.0","source":{"id":"1503.08601","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08601","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08601v2","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08601","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2UO634U3LEJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2UO634U3LEJVCXY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2UO634U","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:8c5de4f7dc4b0c3003f9ff033051f570fa285d1af85e757b8d1d03180484d12e","target":"graph","created_at":"2026-05-18T01:11:51Z","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"},"paper":{"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","authors_text":"Andr\\'e Uschmajew, Tasuku Soma, Yuji Nakatsukasa","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-03-30T09:04:40Z","title":"Finding a low-rank basis in a matrix subspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08601","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:970aea44aa31855a4e88a3b74ec370e2b6935b89ff10998513020bed93af2b39","target":"record","created_at":"2026-05-18T01:11:51Z","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":"1f34aee998186fdb5f4af51354507bb64ed17df42ba104ece1b785c3095905cf","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-03-30T09:04:40Z","title_canon_sha256":"6af7b04e4d9ba0d235f399368618589b813da54f493a1660a4b2cb3e50ab6980"},"schema_version":"1.0","source":{"id":"1503.08601","kind":"arxiv","version":2}},"canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ea8ef6f94dac89a8af85e647d4d9e593f36e8ec27b0f2698092b8ab420490ef","first_computed_at":"2026-05-18T01:11:51.742945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:51.742945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v1045CsfmJwHyDKHugFDi2hQDA88eB/sAua7ZosShEaK1yK25WdBxw+ctzA70dMFWjKBVMUWgqs17AQKxQhXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:51.743406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08601","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:970aea44aa31855a4e88a3b74ec370e2b6935b89ff10998513020bed93af2b39","sha256:8c5de4f7dc4b0c3003f9ff033051f570fa285d1af85e757b8d1d03180484d12e"],"state_sha256":"c0aa06588a7a8821cf2bad3e7bb0741ded4224ceb6acbb5e0da01bb759c94415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1dXVScio07bERYANcnByVLD8tLFAhA0H+qfv0kcTBynpZiyYIXQmpLVSJyik/YhRO5GO4eLrwRixUBrLRVhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:41:18.918441Z","bundle_sha256":"5a3c7d8ad2cdf206269d75723bd48c764f69972d8f12cd735208c78ca10df930"}}