{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3C2YLOVQRVYYBZHKKEPUQFJCFR","short_pith_number":"pith:3C2YLOVQ","schema_version":"1.0","canonical_sha256":"d8b585bab08d7180e4ea511f4815222c69f1242948659972a3d59864ec1c86ee","source":{"kind":"arxiv","id":"1006.2195","version":1},"attestation_state":"computed","paper":{"title":"Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ely Kerman, Olgica Milenkovic, Wei Dai","submitted_at":"2010-06-11T04:22:13Z","abstract_excerpt":"We describe a new algorithm, termed subspace evolution and transfer (SET), for solving low-rank matrix completion problems. The algorithm takes as its input a subset of entries of a low-rank matrix, and outputs one low-rank matrix consistent with the given observations. The completion task is accomplished by searching for a column space on the Grassmann manifold that matches the incomplete observations. The SET algorithm consists of two parts -- subspace evolution and subspace transfer. In the evolution part, we use a gradient descent method on the Grassmann manifold to refine our estimate of "},"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":"1006.2195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-11T04:22:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e22b124bfd016be4ea9a049bfcb7bd340441a857f78277d8ba8261aa817f01e","abstract_canon_sha256":"e6881f531ba1f2b54d18784a15768099da305dc9831b5abaa85205ed7fe116c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:54.773215Z","signature_b64":"+Cssq/tlneY4R9idQAh+UzOgKgeH+9mO+9jLvDUS1nje+dZ30qB25Hns/KAxq60G3aI3NeY9yxDnJyvm52twCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b585bab08d7180e4ea511f4815222c69f1242948659972a3d59864ec1c86ee","last_reissued_at":"2026-05-18T02:06:54.772388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:54.772388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ely Kerman, Olgica Milenkovic, Wei Dai","submitted_at":"2010-06-11T04:22:13Z","abstract_excerpt":"We describe a new algorithm, termed subspace evolution and transfer (SET), for solving low-rank matrix completion problems. The algorithm takes as its input a subset of entries of a low-rank matrix, and outputs one low-rank matrix consistent with the given observations. The completion task is accomplished by searching for a column space on the Grassmann manifold that matches the incomplete observations. The SET algorithm consists of two parts -- subspace evolution and subspace transfer. In the evolution part, we use a gradient descent method on the Grassmann manifold to refine our estimate of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2195","kind":"arxiv","version":1},"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":"1006.2195","created_at":"2026-05-18T02:06:54.772519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.2195v1","created_at":"2026-05-18T02:06:54.772519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2195","created_at":"2026-05-18T02:06:54.772519+00:00"},{"alias_kind":"pith_short_12","alias_value":"3C2YLOVQRVYY","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3C2YLOVQRVYYBZHK","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3C2YLOVQ","created_at":"2026-05-18T12:26:03.138858+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/3C2YLOVQRVYYBZHKKEPUQFJCFR","json":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR.json","graph_json":"https://pith.science/api/pith-number/3C2YLOVQRVYYBZHKKEPUQFJCFR/graph.json","events_json":"https://pith.science/api/pith-number/3C2YLOVQRVYYBZHKKEPUQFJCFR/events.json","paper":"https://pith.science/paper/3C2YLOVQ"},"agent_actions":{"view_html":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR","download_json":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR.json","view_paper":"https://pith.science/paper/3C2YLOVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.2195&json=true","fetch_graph":"https://pith.science/api/pith-number/3C2YLOVQRVYYBZHKKEPUQFJCFR/graph.json","fetch_events":"https://pith.science/api/pith-number/3C2YLOVQRVYYBZHKKEPUQFJCFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR/action/storage_attestation","attest_author":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR/action/author_attestation","sign_citation":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR/action/citation_signature","submit_replication":"https://pith.science/pith/3C2YLOVQRVYYBZHKKEPUQFJCFR/action/replication_record"}},"created_at":"2026-05-18T02:06:54.772519+00:00","updated_at":"2026-05-18T02:06:54.772519+00:00"}