{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TQO3WWSFNZOONIREWS22GLKHZK","short_pith_number":"pith:TQO3WWSF","schema_version":"1.0","canonical_sha256":"9c1dbb5a456e5ce6a224b4b5a32d47ca90b652e9d66425eaeae6837712e2608f","source":{"kind":"arxiv","id":"1701.00858","version":3},"attestation_state":"computed","paper":{"title":"Constrained Low-rank Matrix Estimation: Phase Transitions, Approximate Message Passing and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Florent Krzakala, Lenka Zdeborov\\'a, Thibault Lesieur","submitted_at":"2017-01-03T22:50:47Z","abstract_excerpt":"This article is an extended version of previous work of the authors [40, 41] on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic methods used in data analysis for unsupervised learning of relevant features and other types of dimensionality reduction. We present a framework to study the constrained low-rank matrix estimation for a general prior on the factors, and a general output channel through which the matrix is observed. We draw a paralel with the study of vector-spin glass models"},"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":"1701.00858","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-03T22:50:47Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","stat.TH"],"title_canon_sha256":"10237f561b9a853b87973f6073a1bd8fcdd62064630569ebe32fab7193f85a5c","abstract_canon_sha256":"182cdb83d8c0a893a9d92594bfc15ebb8e63eeaf6db0fb37592d9b25ec0246ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.620117Z","signature_b64":"K+v/d8mixyA9C0j5Y2EpQ5xg3ULqsjLWaWwz2b9+CUQynkeHE0YoMdFxSE5V38IjDQaJjzg4rXPnK10Xgu72Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1dbb5a456e5ce6a224b4b5a32d47ca90b652e9d66425eaeae6837712e2608f","last_reissued_at":"2026-05-18T00:36:43.619553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.619553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Low-rank Matrix Estimation: Phase Transitions, Approximate Message Passing and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Florent Krzakala, Lenka Zdeborov\\'a, Thibault Lesieur","submitted_at":"2017-01-03T22:50:47Z","abstract_excerpt":"This article is an extended version of previous work of the authors [40, 41] on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic methods used in data analysis for unsupervised learning of relevant features and other types of dimensionality reduction. We present a framework to study the constrained low-rank matrix estimation for a general prior on the factors, and a general output channel through which the matrix is observed. We draw a paralel with the study of vector-spin glass models"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00858","kind":"arxiv","version":3},"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":"1701.00858","created_at":"2026-05-18T00:36:43.619624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00858v3","created_at":"2026-05-18T00:36:43.619624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00858","created_at":"2026-05-18T00:36:43.619624+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQO3WWSFNZOO","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQO3WWSFNZOONIRE","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQO3WWSF","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02095","citing_title":"Understanding Phase Transitions via Mutual Information and MMSE","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK","json":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK.json","graph_json":"https://pith.science/api/pith-number/TQO3WWSFNZOONIREWS22GLKHZK/graph.json","events_json":"https://pith.science/api/pith-number/TQO3WWSFNZOONIREWS22GLKHZK/events.json","paper":"https://pith.science/paper/TQO3WWSF"},"agent_actions":{"view_html":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK","download_json":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK.json","view_paper":"https://pith.science/paper/TQO3WWSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00858&json=true","fetch_graph":"https://pith.science/api/pith-number/TQO3WWSFNZOONIREWS22GLKHZK/graph.json","fetch_events":"https://pith.science/api/pith-number/TQO3WWSFNZOONIREWS22GLKHZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK/action/storage_attestation","attest_author":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK/action/author_attestation","sign_citation":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK/action/citation_signature","submit_replication":"https://pith.science/pith/TQO3WWSFNZOONIREWS22GLKHZK/action/replication_record"}},"created_at":"2026-05-18T00:36:43.619624+00:00","updated_at":"2026-05-18T00:36:43.619624+00:00"}