{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5ISA5QOT6IAJCPBO3VXVQOEL6I","short_pith_number":"pith:5ISA5QOT","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"},"canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","source":{"kind":"arxiv","id":"2306.04169","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.04169","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"2306.04169v3","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04169","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"5ISA5QOT6IAJ","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_16","alias_value":"5ISA5QOT6IAJCPBO","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_8","alias_value":"5ISA5QOT","created_at":"2026-07-05T10:14:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5ISA5QOT6IAJCPBO3VXVQOEL6I","target":"record","payload":{"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"},"canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","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"},"source_kind":"arxiv","source_id":"2306.04169","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sEHbwypKDC9PDTrs6KhG2zXZn++f5ddp9zpRVTBTD3kuMUp3UhNWmJR+EBeeXk0ndlxn1NdJw9N9cyvIfiBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:20:25.260939Z"},"content_sha256":"57be780f395590125e682eb197572d584a107e24821d8c646f93e96c22c354bb","schema_version":"1.0","event_id":"sha256:57be780f395590125e682eb197572d584a107e24821d8c646f93e96c22c354bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5ISA5QOT6IAJCPBO3VXVQOEL6I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKIlxa+OcPO77WjMYFbXOBlrgef/wBZcIm/nS3WGbNEddsEbsMF8Dae6kqKgnks9OTkhZJ7lbuntQpkSPDebBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:20:25.261710Z"},"content_sha256":"65824e5fa24d0a8de08f451e6beb2834d757175679e72ea7a61afb65617c6eb7","schema_version":"1.0","event_id":"sha256:65824e5fa24d0a8de08f451e6beb2834d757175679e72ea7a61afb65617c6eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/bundle.json","state_url":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-01T09:20:25Z","links":{"resolver":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I","bundle":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/bundle.json","state":"https://pith.science/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ISA5QOT6IAJCPBO3VXVQOEL6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5ISA5QOT6IAJCPBO3VXVQOEL6I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37cd469d6a69dee0fd9f6fb6708e346f7e5d2834d745e8c7fc5b4f3d7bcbf150","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-07T05:38:55Z","title_canon_sha256":"fa5463717cdf7024023bd0c9d3ab74e435a5c6da7c27beada19f53ebc4dd0c36"},"schema_version":"1.0","source":{"id":"2306.04169","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.04169","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"2306.04169v3","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04169","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"5ISA5QOT6IAJ","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_16","alias_value":"5ISA5QOT6IAJCPBO","created_at":"2026-07-05T10:14:35Z"},{"alias_kind":"pith_short_8","alias_value":"5ISA5QOT","created_at":"2026-07-05T10:14:35Z"}],"graph_snapshots":[{"event_id":"sha256:65824e5fa24d0a8de08f451e6beb2834d757175679e72ea7a61afb65617c6eb7","target":"graph","created_at":"2026-07-05T10:14:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.04169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Junze Yin, Lichen Zhang, Mingquan Ye, Zhao Song","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-07T05:38:55Z","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04169","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57be780f395590125e682eb197572d584a107e24821d8c646f93e96c22c354bb","target":"record","created_at":"2026-07-05T10:14:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37cd469d6a69dee0fd9f6fb6708e346f7e5d2834d745e8c7fc5b4f3d7bcbf150","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-07T05:38:55Z","title_canon_sha256":"fa5463717cdf7024023bd0c9d3ab74e435a5c6da7c27beada19f53ebc4dd0c36"},"schema_version":"1.0","source":{"id":"2306.04169","kind":"arxiv","version":3}},"canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea240ec1d3f200913c2edd6f58388bf22cc8853793ee7e3a6a72cd64698a9bf4","first_computed_at":"2026-07-05T10:14:35.742393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:35.742393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQwXA6Z+dso2s7bTHWSK0FhF+yTTA60fsh8gdrLSdK9Qbqq3ojOvjrlKUkfznZL9sWyDLYLxWUP3AHAwRRZPDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:35.742797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.04169","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57be780f395590125e682eb197572d584a107e24821d8c646f93e96c22c354bb","sha256:65824e5fa24d0a8de08f451e6beb2834d757175679e72ea7a61afb65617c6eb7"],"state_sha256":"d9cc5352f981715ee9471266c0b16c5593e73a26e156eaa58c0624bf7e683990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yESC8jS4DoXGvZmRDzxWixUHg7gHNKiFgsfSuq8aT1O/BI77VfXyxcZgs/YKrfAw7WXki5/mme0er9qGzoRMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:20:25.267578Z","bundle_sha256":"812bf0891edac38901ed92cdcc837627b900af39cf8a5526a66823b34d66e5c7"}}