{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KJKZNWXMHVIG5DSFKRAYUFOHG7","short_pith_number":"pith:KJKZNWXM","canonical_record":{"source":{"id":"2502.16912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-24T07:18:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1057ee5eadb386755af014ab5ba278db84fb110449afea67b01061973c4362ce","abstract_canon_sha256":"51ca57171d47bcf08c38e3b1fae4b43081d1e579cb36443d6ac12c09ae9111b3"},"schema_version":"1.0"},"canonical_sha256":"525596daec3d506e8e4554418a15c737d6858be864a11340d72d3b40ccf4d7c7","source":{"kind":"arxiv","id":"2502.16912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16912","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16912v1","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16912","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"KJKZNWXMHVIG","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"KJKZNWXMHVIG5DSF","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"KJKZNWXM","created_at":"2026-07-05T10:19:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KJKZNWXMHVIG5DSFKRAYUFOHG7","target":"record","payload":{"canonical_record":{"source":{"id":"2502.16912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-24T07:18:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1057ee5eadb386755af014ab5ba278db84fb110449afea67b01061973c4362ce","abstract_canon_sha256":"51ca57171d47bcf08c38e3b1fae4b43081d1e579cb36443d6ac12c09ae9111b3"},"schema_version":"1.0"},"canonical_sha256":"525596daec3d506e8e4554418a15c737d6858be864a11340d72d3b40ccf4d7c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:02.186983Z","signature_b64":"UPVgHQg4Ig3s6qkaibYrIs1aEgtz5YKSLZUu5lTm9TJP0+xjCe0081+XfHDHAd4+tTjXPf+DUaxMPniB9VD6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"525596daec3d506e8e4554418a15c737d6858be864a11340d72d3b40ccf4d7c7","last_reissued_at":"2026-07-05T10:19:02.186472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:02.186472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.16912","source_version":1,"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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1c3+h5VvIuC9+pIrIcuhcqL+f9xi07+wyylafyb8VD8TYHvTihvNIs7D/oNEYoHm5lIIW3fItC8iXYw009eyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:35:46.801325Z"},"content_sha256":"68b5ae829a03e9a4b9e3ff843a2ac5520d7b6648a8e6668b78187aad2bbd0b70","schema_version":"1.0","event_id":"sha256:68b5ae829a03e9a4b9e3ff843a2ac5520d7b6648a8e6668b78187aad2bbd0b70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KJKZNWXMHVIG5DSFKRAYUFOHG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CC","authors_text":"Chenyang Li, Yingyu Liang, Zhao Song, Zhenmei Shi","submitted_at":"2025-02-24T07:18:24Z","abstract_excerpt":"The weighted low-rank approximation problem is a fundamental numerical linear algebra problem and has many applications in machine learning. Given a $n \\times n$ weight matrix $W$ and a $n \\times n$ matrix $A$, the goal is to find two low-rank matrices $U, V \\in \\mathbb{R}^{n \\times k}$ such that the cost of $\\| W \\circ (U V^\\top - A) \\|_F^2$ is minimized. Previous work has to pay $\\Omega(n^2)$ time when matrices $A$ and $W$ are dense, e.g., having $\\Omega(n^2)$ non-zero entries. In this work, we show that there is a certain regime, even if $A$ and $W$ are dense, we can still hope to solve the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16912","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.16912/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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cC/nO6y61ESNzE4a+vcn7Qucph5yLxICxWIb9gZO835WdsGnMkYtMWnW+4JiNimnc+S4U/0W+NHBQvjMGafaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:35:46.801836Z"},"content_sha256":"fe0c27385587be6f0b2c28bb2535e2be41833742a4a668907017a2b7843ced00","schema_version":"1.0","event_id":"sha256:fe0c27385587be6f0b2c28bb2535e2be41833742a4a668907017a2b7843ced00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/bundle.json","state_url":"https://pith.science/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/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-14T23:35:46Z","links":{"resolver":"https://pith.science/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7","bundle":"https://pith.science/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/bundle.json","state":"https://pith.science/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJKZNWXMHVIG5DSFKRAYUFOHG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KJKZNWXMHVIG5DSFKRAYUFOHG7","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":"51ca57171d47bcf08c38e3b1fae4b43081d1e579cb36443d6ac12c09ae9111b3","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-24T07:18:24Z","title_canon_sha256":"1057ee5eadb386755af014ab5ba278db84fb110449afea67b01061973c4362ce"},"schema_version":"1.0","source":{"id":"2502.16912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16912","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16912v1","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16912","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"KJKZNWXMHVIG","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"KJKZNWXMHVIG5DSF","created_at":"2026-07-05T10:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"KJKZNWXM","created_at":"2026-07-05T10:19:02Z"}],"graph_snapshots":[{"event_id":"sha256:fe0c27385587be6f0b2c28bb2535e2be41833742a4a668907017a2b7843ced00","target":"graph","created_at":"2026-07-05T10:19:02Z","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/2502.16912/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The weighted low-rank approximation problem is a fundamental numerical linear algebra problem and has many applications in machine learning. Given a $n \\times n$ weight matrix $W$ and a $n \\times n$ matrix $A$, the goal is to find two low-rank matrices $U, V \\in \\mathbb{R}^{n \\times k}$ such that the cost of $\\| W \\circ (U V^\\top - A) \\|_F^2$ is minimized. Previous work has to pay $\\Omega(n^2)$ time when matrices $A$ and $W$ are dense, e.g., having $\\Omega(n^2)$ non-zero entries. In this work, we show that there is a certain regime, even if $A$ and $W$ are dense, we can still hope to solve the","authors_text":"Chenyang Li, Yingyu Liang, Zhao Song, Zhenmei Shi","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-24T07:18:24Z","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16912","kind":"arxiv","version":1},"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:68b5ae829a03e9a4b9e3ff843a2ac5520d7b6648a8e6668b78187aad2bbd0b70","target":"record","created_at":"2026-07-05T10:19:02Z","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":"51ca57171d47bcf08c38e3b1fae4b43081d1e579cb36443d6ac12c09ae9111b3","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-02-24T07:18:24Z","title_canon_sha256":"1057ee5eadb386755af014ab5ba278db84fb110449afea67b01061973c4362ce"},"schema_version":"1.0","source":{"id":"2502.16912","kind":"arxiv","version":1}},"canonical_sha256":"525596daec3d506e8e4554418a15c737d6858be864a11340d72d3b40ccf4d7c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"525596daec3d506e8e4554418a15c737d6858be864a11340d72d3b40ccf4d7c7","first_computed_at":"2026-07-05T10:19:02.186472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:02.186472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UPVgHQg4Ig3s6qkaibYrIs1aEgtz5YKSLZUu5lTm9TJP0+xjCe0081+XfHDHAd4+tTjXPf+DUaxMPniB9VD6Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:02.186983Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.16912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68b5ae829a03e9a4b9e3ff843a2ac5520d7b6648a8e6668b78187aad2bbd0b70","sha256:fe0c27385587be6f0b2c28bb2535e2be41833742a4a668907017a2b7843ced00"],"state_sha256":"3c97ba27ca8fbe584e551b23bf9d096ce87abd9a12aec26e5e82459790da618f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofrcNPMAZWmEHR94r9rG4shhJ2C0cckzmdXxzh5bEeG8lOjIvPQST+evEKHeJjZdGJ8whqEpRdwQyV4w3wujCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T23:35:46.807111Z","bundle_sha256":"228e0f22567614c64286eb7fde1e81ac9287fb7afaebce276b770ce03f487c10"}}