{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5ISA5QOT6IAJCPBO3VXVQOEL6I","short_pith_number":"pith:5ISA5QOT","schema_version":"1.0","canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","source":{"kind":"arxiv","id":"2306.04169","version":3},"attestation_state":"computed","paper":{"title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Junze Yin, Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-06-07T05:38:55Z","abstract_excerpt":"Weighted low rank approximation is a fundamental problem in numerical linear algebra, and it has many applications in machine learning. Given a matrix $M \\in \\mathbb{R}^{n \\times n}$, a non-negative weight matrix $W \\in \\mathbb{R}_{\\geq 0}^{n \\times n}$, a parameter $k$, the goal is to output two matrices $X,Y\\in \\mathbb{R}^{n \\times k}$ such that $\\| W \\circ (M - X Y^\\top) \\|_F$ is minimized, where $\\circ$ denotes the Hadamard product. It naturally generalizes the well-studied low rank matrix completion problem. Such a problem is known to be NP-hard and even hard to approximate assuming the E"},"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":"2306.04169","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-07T05:38:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fa5463717cdf7024023bd0c9d3ab74e435a5c6da7c27beada19f53ebc4dd0c36","abstract_canon_sha256":"37cd469d6a69dee0fd9f6fb6708e346f7e5d2834d745e8c7fc5b4f3d7bcbf150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:35.742797Z","signature_b64":"hQwXA6Z+dso2s7bTHWSK0FhF+yTTA60fsh8gdrLSdK9Qbqq3ojOvjrlKUkfznZL9sWyDLYLxWUP3AHAwRRZPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","last_reissued_at":"2026-07-05T10:14:35.742393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:35.742393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Junze Yin, Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-06-07T05:38:55Z","abstract_excerpt":"Weighted low rank approximation is a fundamental problem in numerical linear algebra, and it has many applications in machine learning. Given a matrix $M \\in \\mathbb{R}^{n \\times n}$, a non-negative weight matrix $W \\in \\mathbb{R}_{\\geq 0}^{n \\times n}$, a parameter $k$, the goal is to output two matrices $X,Y\\in \\mathbb{R}^{n \\times k}$ such that $\\| W \\circ (M - X Y^\\top) \\|_F$ is minimized, where $\\circ$ denotes the Hadamard product. It naturally generalizes the well-studied low rank matrix completion problem. Such a problem is known to be NP-hard and even hard to approximate assuming the E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04169","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.04169/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.04169","created_at":"2026-07-05T10:14:35.742449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04169v3","created_at":"2026-07-05T10:14:35.742449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04169","created_at":"2026-07-05T10:14:35.742449+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ISA5QOT6IAJ","created_at":"2026-07-05T10:14:35.742449+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ISA5QOT6IAJCPBO","created_at":"2026-07-05T10:14:35.742449+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ISA5QOT","created_at":"2026-07-05T10:14:35.742449+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/5ISA5QOT6IAJCPBO3VXVQOEL6I","json":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I.json","graph_json":"https://pith.science/api/pith-number/5ISA5QOT6IAJCPBO3VXVQOEL6I/graph.json","events_json":"https://pith.science/api/pith-number/5ISA5QOT6IAJCPBO3VXVQOEL6I/events.json","paper":"https://pith.science/paper/5ISA5QOT"},"agent_actions":{"view_html":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I","download_json":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I.json","view_paper":"https://pith.science/paper/5ISA5QOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04169&json=true","fetch_graph":"https://pith.science/api/pith-number/5ISA5QOT6IAJCPBO3VXVQOEL6I/graph.json","fetch_events":"https://pith.science/api/pith-number/5ISA5QOT6IAJCPBO3VXVQOEL6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/action/storage_attestation","attest_author":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/action/author_attestation","sign_citation":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/action/citation_signature","submit_replication":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/action/replication_record"}},"created_at":"2026-07-05T10:14:35.742449+00:00","updated_at":"2026-07-05T10:14:35.742449+00:00"}