{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6AAX7RN2653QVPBEFMQLEEJ2DJ","short_pith_number":"pith:6AAX7RN2","schema_version":"1.0","canonical_sha256":"f0017fc5baf7770abc242b20b2113a1a4561f622c3f6d4dae799f11868acbaf3","source":{"kind":"arxiv","id":"2107.10654","version":1},"attestation_state":"computed","paper":{"title":"Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Mehrdad Ghadiri, Thomas Fu","submitted_at":"2021-07-22T13:32:47Z","abstract_excerpt":"Low-rank tensor decomposition generalizes low-rank matrix approximation and is a powerful technique for discovering low-dimensional structure in high-dimensional data. In this paper, we study Tucker decompositions and use tools from randomized numerical linear algebra called ridge leverage scores to accelerate the core tensor update step in the widely-used alternating least squares (ALS) algorithm. Updating the core tensor, a severe bottleneck in ALS, is a highly-structured ridge regression problem where the design matrix is a Kronecker product of the factor matrices. We show how to use approx"},"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.10654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-22T13:32:47Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"a657b35971aa0715170a510b4fb82a2ecf812f9588d6517874bceb6f1e016cac","abstract_canon_sha256":"0b2abea5e358a19413846b148e92a96966203d24debc4a2d6c5a66bf6cf4df1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:02.344733Z","signature_b64":"yAjEeLr3tgdPaIJ+CoNeGRBDnChhjOYVGNdLmbFM017aTsGmmonNg8SlSFlHh1WPeZqUtPQMG/fz05PpBq9ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0017fc5baf7770abc242b20b2113a1a4561f622c3f6d4dae799f11868acbaf3","last_reissued_at":"2026-07-05T03:00:02.344212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:02.344212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Mehrdad Ghadiri, Thomas Fu","submitted_at":"2021-07-22T13:32:47Z","abstract_excerpt":"Low-rank tensor decomposition generalizes low-rank matrix approximation and is a powerful technique for discovering low-dimensional structure in high-dimensional data. In this paper, we study Tucker decompositions and use tools from randomized numerical linear algebra called ridge leverage scores to accelerate the core tensor update step in the widely-used alternating least squares (ALS) algorithm. Updating the core tensor, a severe bottleneck in ALS, is a highly-structured ridge regression problem where the design matrix is a Kronecker product of the factor matrices. We show how to use approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.10654","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.10654/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.10654","created_at":"2026-07-05T03:00:02.344270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.10654v1","created_at":"2026-07-05T03:00:02.344270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.10654","created_at":"2026-07-05T03:00:02.344270+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AAX7RN2653Q","created_at":"2026-07-05T03:00:02.344270+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AAX7RN2653QVPBE","created_at":"2026-07-05T03:00:02.344270+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AAX7RN2","created_at":"2026-07-05T03:00:02.344270+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/6AAX7RN2653QVPBEFMQLEEJ2DJ","json":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ.json","graph_json":"https://pith.science/api/pith-number/6AAX7RN2653QVPBEFMQLEEJ2DJ/graph.json","events_json":"https://pith.science/api/pith-number/6AAX7RN2653QVPBEFMQLEEJ2DJ/events.json","paper":"https://pith.science/paper/6AAX7RN2"},"agent_actions":{"view_html":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ","download_json":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ.json","view_paper":"https://pith.science/paper/6AAX7RN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.10654&json=true","fetch_graph":"https://pith.science/api/pith-number/6AAX7RN2653QVPBEFMQLEEJ2DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6AAX7RN2653QVPBEFMQLEEJ2DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ/action/storage_attestation","attest_author":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ/action/author_attestation","sign_citation":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ/action/citation_signature","submit_replication":"https://pith.science/pith/6AAX7RN2653QVPBEFMQLEEJ2DJ/action/replication_record"}},"created_at":"2026-07-05T03:00:02.344270+00:00","updated_at":"2026-07-05T03:00:02.344270+00:00"}