{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RYSEBH5GJMGW4GUXZVPU2T6FXA","short_pith_number":"pith:RYSEBH5G","schema_version":"1.0","canonical_sha256":"8e24409fa64b0d6e1a97cd5f4d4fc5b8055903f2fdea1c352067a74a31c5617b","source":{"kind":"arxiv","id":"1012.0365","version":2},"attestation_state":"computed","paper":{"title":"A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NA","authors_text":"Siming Wei, Zhouchen Lin","submitted_at":"2010-12-02T01:59:21Z","abstract_excerpt":"Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD). Therefore, their solution suffers from the high computation cost of multiple SVDs. To relieve this issue, we propose using the block Lanczos method to compute the partial SVDs, where the principal singular subspaces obtained in the previous itera"},"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":"1012.0365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-12-02T01:59:21Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"532245f3e22d8652c2f547cc96dbec8695e1170f197fd2e27f648945978f3c1e","abstract_canon_sha256":"67c1f543bc7748b0418f350f8a74df25d74f0157cd615869d575a18250a9d7e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:33.705167Z","signature_b64":"ELvUswjcoNeItFH06tD5J21k9PyIGLrJ03AUJPcKe5ksrujkwj2laSbgb5kcb6q6CfnbaoANqo+sMltM1BwQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e24409fa64b0d6e1a97cd5f4d4fc5b8055903f2fdea1c352067a74a31c5617b","last_reissued_at":"2026-05-18T04:32:33.704532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:33.704532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NA","authors_text":"Siming Wei, Zhouchen Lin","submitted_at":"2010-12-02T01:59:21Z","abstract_excerpt":"Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD). Therefore, their solution suffers from the high computation cost of multiple SVDs. To relieve this issue, we propose using the block Lanczos method to compute the partial SVDs, where the principal singular subspaces obtained in the previous itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0365","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":"1012.0365","created_at":"2026-05-18T04:32:33.704629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0365v2","created_at":"2026-05-18T04:32:33.704629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0365","created_at":"2026-05-18T04:32:33.704629+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYSEBH5GJMGW","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYSEBH5GJMGW4GUX","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYSEBH5G","created_at":"2026-05-18T12:26:13.927090+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/RYSEBH5GJMGW4GUXZVPU2T6FXA","json":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA.json","graph_json":"https://pith.science/api/pith-number/RYSEBH5GJMGW4GUXZVPU2T6FXA/graph.json","events_json":"https://pith.science/api/pith-number/RYSEBH5GJMGW4GUXZVPU2T6FXA/events.json","paper":"https://pith.science/paper/RYSEBH5G"},"agent_actions":{"view_html":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA","download_json":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA.json","view_paper":"https://pith.science/paper/RYSEBH5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0365&json=true","fetch_graph":"https://pith.science/api/pith-number/RYSEBH5GJMGW4GUXZVPU2T6FXA/graph.json","fetch_events":"https://pith.science/api/pith-number/RYSEBH5GJMGW4GUXZVPU2T6FXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA/action/storage_attestation","attest_author":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA/action/author_attestation","sign_citation":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA/action/citation_signature","submit_replication":"https://pith.science/pith/RYSEBH5GJMGW4GUXZVPU2T6FXA/action/replication_record"}},"created_at":"2026-05-18T04:32:33.704629+00:00","updated_at":"2026-05-18T04:32:33.704629+00:00"}