{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GXXNFXF2Q5LU6FEE2WE6QPWWMT","short_pith_number":"pith:GXXNFXF2","schema_version":"1.0","canonical_sha256":"35eed2dcba87574f1484d589e83ed664d4c5106c5c140df0577b4084e892ab51","source":{"kind":"arxiv","id":"2006.16438","version":3},"attestation_state":"computed","paper":{"title":"Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Brett W. Larsen, Tamara G. Kolda","submitted_at":"2020-06-30T00:01:22Z","abstract_excerpt":"The low-rank canonical polyadic tensor decomposition is useful in data analysis and can be computed by solving a sequence of overdetermined least squares subproblems. Motivated by consideration of sparse tensors, we propose sketching each subproblem using leverage scores to select a subset of the rows, with probabilistic guarantees on the solution accuracy. We randomly sample rows proportional to leverage score upper bounds that can be efficiently computed using the special Khatri-Rao subproblem structure inherent in tensor decomposition. Crucially, for a $(d+1)$-way tensor, the number of rows"},"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":"2006.16438","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-06-30T00:01:22Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ed2097c1091660110a0b6bab683639f62358083f17252b9acac89644f458011e","abstract_canon_sha256":"239454d22ed97eeeab5aaa60a06ff4964abea040aac90aa97c67ff0181cfa1b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:45:07.689774Z","signature_b64":"ZMQV5WGIvWIKqBBtpaMqz6CyjzTALtrVqzGZbanS9p3M2/VEuOHu6ZOgWyRclXKwJgJcOltY0PDjx+s+CVMlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35eed2dcba87574f1484d589e83ed664d4c5106c5c140df0577b4084e892ab51","last_reissued_at":"2026-07-05T03:45:07.689301Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:45:07.689301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Brett W. Larsen, Tamara G. Kolda","submitted_at":"2020-06-30T00:01:22Z","abstract_excerpt":"The low-rank canonical polyadic tensor decomposition is useful in data analysis and can be computed by solving a sequence of overdetermined least squares subproblems. Motivated by consideration of sparse tensors, we propose sketching each subproblem using leverage scores to select a subset of the rows, with probabilistic guarantees on the solution accuracy. We randomly sample rows proportional to leverage score upper bounds that can be efficiently computed using the special Khatri-Rao subproblem structure inherent in tensor decomposition. Crucially, for a $(d+1)$-way tensor, the number of rows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.16438","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/2006.16438/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":"2006.16438","created_at":"2026-07-05T03:45:07.689367+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.16438v3","created_at":"2026-07-05T03:45:07.689367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.16438","created_at":"2026-07-05T03:45:07.689367+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXXNFXF2Q5LU","created_at":"2026-07-05T03:45:07.689367+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXXNFXF2Q5LU6FEE","created_at":"2026-07-05T03:45:07.689367+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXXNFXF2","created_at":"2026-07-05T03:45:07.689367+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/GXXNFXF2Q5LU6FEE2WE6QPWWMT","json":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT.json","graph_json":"https://pith.science/api/pith-number/GXXNFXF2Q5LU6FEE2WE6QPWWMT/graph.json","events_json":"https://pith.science/api/pith-number/GXXNFXF2Q5LU6FEE2WE6QPWWMT/events.json","paper":"https://pith.science/paper/GXXNFXF2"},"agent_actions":{"view_html":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT","download_json":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT.json","view_paper":"https://pith.science/paper/GXXNFXF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.16438&json=true","fetch_graph":"https://pith.science/api/pith-number/GXXNFXF2Q5LU6FEE2WE6QPWWMT/graph.json","fetch_events":"https://pith.science/api/pith-number/GXXNFXF2Q5LU6FEE2WE6QPWWMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT/action/storage_attestation","attest_author":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT/action/author_attestation","sign_citation":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT/action/citation_signature","submit_replication":"https://pith.science/pith/GXXNFXF2Q5LU6FEE2WE6QPWWMT/action/replication_record"}},"created_at":"2026-07-05T03:45:07.689367+00:00","updated_at":"2026-07-05T03:45:07.689367+00:00"}