{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LESXKYUQ5I24CCMF5JK3RFROZ3","short_pith_number":"pith:LESXKYUQ","schema_version":"1.0","canonical_sha256":"5925756290ea35c10985ea55b8962eced4343427a6f172627ba72efe69ac00f5","source":{"kind":"arxiv","id":"1708.07850","version":1},"attestation_state":"computed","paper":{"title":"Structured Low-Rank Matrix Factorization: Global Optimality, Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA"],"primary_cat":"cs.LG","authors_text":"Benjamin D. Haeffele, Rene Vidal","submitted_at":"2017-08-25T18:14:44Z","abstract_excerpt":"Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it challenging to apply them to large scale datasets. Moreover, in many applications the data can display structures beyond simply being low-rank, e.g., images and videos present complex spatio-temporal structures that are largely ignored by standard low-rank methods. In this paper we study a matrix factorization technique that is suitable for large datasets and capt"},"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":"1708.07850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-25T18:14:44Z","cross_cats_sorted":["cs.CV","cs.NA"],"title_canon_sha256":"16f4a73a136d87f05422331777698e2c467c78221dca4700e7c645b4308646d5","abstract_canon_sha256":"434200cbe4a715c86be84ba81ca9729ff34e7d640a2f5c879edec5ce86fe4ac1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.885707Z","signature_b64":"pWSojflS8SZSPESPtFQ2B9PpKuRAqn1Gvg6FtOdqw+VBhbaVjMcpD5WKE7d3c8VcEtbyz+/FFcE8XX4bHj2cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5925756290ea35c10985ea55b8962eced4343427a6f172627ba72efe69ac00f5","last_reissued_at":"2026-05-18T00:36:37.885049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.885049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Low-Rank Matrix Factorization: Global Optimality, Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA"],"primary_cat":"cs.LG","authors_text":"Benjamin D. Haeffele, Rene Vidal","submitted_at":"2017-08-25T18:14:44Z","abstract_excerpt":"Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it challenging to apply them to large scale datasets. Moreover, in many applications the data can display structures beyond simply being low-rank, e.g., images and videos present complex spatio-temporal structures that are largely ignored by standard low-rank methods. In this paper we study a matrix factorization technique that is suitable for large datasets and capt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07850","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":"1708.07850","created_at":"2026-05-18T00:36:37.885158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07850v1","created_at":"2026-05-18T00:36:37.885158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07850","created_at":"2026-05-18T00:36:37.885158+00:00"},{"alias_kind":"pith_short_12","alias_value":"LESXKYUQ5I24","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LESXKYUQ5I24CCMF","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LESXKYUQ","created_at":"2026-05-18T12:31:28.150371+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/LESXKYUQ5I24CCMF5JK3RFROZ3","json":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3.json","graph_json":"https://pith.science/api/pith-number/LESXKYUQ5I24CCMF5JK3RFROZ3/graph.json","events_json":"https://pith.science/api/pith-number/LESXKYUQ5I24CCMF5JK3RFROZ3/events.json","paper":"https://pith.science/paper/LESXKYUQ"},"agent_actions":{"view_html":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3","download_json":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3.json","view_paper":"https://pith.science/paper/LESXKYUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07850&json=true","fetch_graph":"https://pith.science/api/pith-number/LESXKYUQ5I24CCMF5JK3RFROZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/LESXKYUQ5I24CCMF5JK3RFROZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3/action/storage_attestation","attest_author":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3/action/author_attestation","sign_citation":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3/action/citation_signature","submit_replication":"https://pith.science/pith/LESXKYUQ5I24CCMF5JK3RFROZ3/action/replication_record"}},"created_at":"2026-05-18T00:36:37.885158+00:00","updated_at":"2026-05-18T00:36:37.885158+00:00"}