{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UL6AZTX25LGGIHBA7XOC4P4WLC","short_pith_number":"pith:UL6AZTX2","schema_version":"1.0","canonical_sha256":"a2fc0ccefaeacc641c20fddc2e3f96588982fc6177d8d21f79cc5f1521e7b2eb","source":{"kind":"arxiv","id":"2107.07889","version":1},"attestation_state":"computed","paper":{"title":"Single Pass Entrywise-Transformed Low Rank Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Jiaxin Wang, Yifei Jiang, Yi Li, Yiming Sun","submitted_at":"2021-07-16T13:22:29Z","abstract_excerpt":"In applications such as natural language processing or computer vision, one is given a large $n \\times d$ matrix $A = (a_{i,j})$ and would like to compute a matrix decomposition, e.g., a low rank approximation, of a function $f(A) = (f(a_{i,j}))$ applied entrywise to $A$. A very important special case is the likelihood function $f\\left( A \\right ) = \\log{\\left( \\left| a_{ij}\\right| +1\\right)}$. A natural way to do this would be to simply apply $f$ to each entry of $A$, and then compute the matrix decomposition, but this requires storing all of $A$ as well as multiple passes over its entries. R"},"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":"2107.07889","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-16T13:22:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a4cda4797ba553fb6251ef0d685cb2b8781ed6fc6d912bdba0661860ca103d02","abstract_canon_sha256":"27e8352ea521a7c6827148525e36afbdfbf9b3b8f83abba3667e894665b07b97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:30.239409Z","signature_b64":"Za8T4U2xh8tzSsVMzZx9HsgGvIhP1P9TmA4gonJLDsxWi24RpIgquNGXsQh2qWn9ODsaB2XsOttHrzPqJd2ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2fc0ccefaeacc641c20fddc2e3f96588982fc6177d8d21f79cc5f1521e7b2eb","last_reissued_at":"2026-07-05T02:58:30.239029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:30.239029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Pass Entrywise-Transformed Low Rank Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Jiaxin Wang, Yifei Jiang, Yi Li, Yiming Sun","submitted_at":"2021-07-16T13:22:29Z","abstract_excerpt":"In applications such as natural language processing or computer vision, one is given a large $n \\times d$ matrix $A = (a_{i,j})$ and would like to compute a matrix decomposition, e.g., a low rank approximation, of a function $f(A) = (f(a_{i,j}))$ applied entrywise to $A$. A very important special case is the likelihood function $f\\left( A \\right ) = \\log{\\left( \\left| a_{ij}\\right| +1\\right)}$. A natural way to do this would be to simply apply $f$ to each entry of $A$, and then compute the matrix decomposition, but this requires storing all of $A$ as well as multiple passes over its entries. R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07889","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/2107.07889/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":"2107.07889","created_at":"2026-07-05T02:58:30.239085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07889v1","created_at":"2026-07-05T02:58:30.239085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07889","created_at":"2026-07-05T02:58:30.239085+00:00"},{"alias_kind":"pith_short_12","alias_value":"UL6AZTX25LGG","created_at":"2026-07-05T02:58:30.239085+00:00"},{"alias_kind":"pith_short_16","alias_value":"UL6AZTX25LGGIHBA","created_at":"2026-07-05T02:58:30.239085+00:00"},{"alias_kind":"pith_short_8","alias_value":"UL6AZTX2","created_at":"2026-07-05T02:58:30.239085+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/UL6AZTX25LGGIHBA7XOC4P4WLC","json":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC.json","graph_json":"https://pith.science/api/pith-number/UL6AZTX25LGGIHBA7XOC4P4WLC/graph.json","events_json":"https://pith.science/api/pith-number/UL6AZTX25LGGIHBA7XOC4P4WLC/events.json","paper":"https://pith.science/paper/UL6AZTX2"},"agent_actions":{"view_html":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC","download_json":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC.json","view_paper":"https://pith.science/paper/UL6AZTX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07889&json=true","fetch_graph":"https://pith.science/api/pith-number/UL6AZTX25LGGIHBA7XOC4P4WLC/graph.json","fetch_events":"https://pith.science/api/pith-number/UL6AZTX25LGGIHBA7XOC4P4WLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC/action/storage_attestation","attest_author":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC/action/author_attestation","sign_citation":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC/action/citation_signature","submit_replication":"https://pith.science/pith/UL6AZTX25LGGIHBA7XOC4P4WLC/action/replication_record"}},"created_at":"2026-07-05T02:58:30.239085+00:00","updated_at":"2026-07-05T02:58:30.239085+00:00"}