{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JZKPLAC4Z2OKWQBAF7RK7WJYQL","short_pith_number":"pith:JZKPLAC4","schema_version":"1.0","canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","source":{"kind":"arxiv","id":"2210.05105","version":3},"attestation_state":"computed","paper":{"title":"Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Aydin Bulu\\c{c}, James Demmel, Osman Asif Malik, Riley Murray, Vivek Bharadwaj","submitted_at":"2022-10-11T02:46:28Z","abstract_excerpt":"Candecomp / PARAFAC (CP) decomposition, a generalization of the matrix singular value decomposition to higher-dimensional tensors, is a popular tool for analyzing multidimensional sparse data. On tensors with billions of nonzero entries, computing a CP decomposition is a computationally intensive task. We propose the first distributed-memory implementations of two randomized CP decomposition algorithms, CP-ARLS-LEV and STS-CP, that offer nearly an order-of-magnitude speedup at high decomposition ranks over well-tuned non-randomized decomposition packages. Both algorithms rely on leverage score"},"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":"2210.05105","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-10-11T02:46:28Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ccec8a2f04188f43e4e041165ec2c6b5934961bf5e747ce004bd032a9ed63b95","abstract_canon_sha256":"92ab676285a8a4bf5eea9fbee08749fc345697ed63f0bad2ff57520013813b18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:41.630905Z","signature_b64":"W0hZYSknu0PKQJYhiQFPpGJ5Ac+rm7TCxFx8k7/aoJQg7EGx5Fusl0MGifjGaiOmz1gTuYZLk5v+vx3lNS2cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","last_reissued_at":"2026-07-05T08:12:41.630398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:41.630398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Aydin Bulu\\c{c}, James Demmel, Osman Asif Malik, Riley Murray, Vivek Bharadwaj","submitted_at":"2022-10-11T02:46:28Z","abstract_excerpt":"Candecomp / PARAFAC (CP) decomposition, a generalization of the matrix singular value decomposition to higher-dimensional tensors, is a popular tool for analyzing multidimensional sparse data. On tensors with billions of nonzero entries, computing a CP decomposition is a computationally intensive task. We propose the first distributed-memory implementations of two randomized CP decomposition algorithms, CP-ARLS-LEV and STS-CP, that offer nearly an order-of-magnitude speedup at high decomposition ranks over well-tuned non-randomized decomposition packages. Both algorithms rely on leverage score"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05105","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/2210.05105/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":"2210.05105","created_at":"2026-07-05T08:12:41.630457+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.05105v3","created_at":"2026-07-05T08:12:41.630457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05105","created_at":"2026-07-05T08:12:41.630457+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZKPLAC4Z2OK","created_at":"2026-07-05T08:12:41.630457+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZKPLAC4Z2OKWQBA","created_at":"2026-07-05T08:12:41.630457+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZKPLAC4","created_at":"2026-07-05T08:12:41.630457+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/JZKPLAC4Z2OKWQBAF7RK7WJYQL","json":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL.json","graph_json":"https://pith.science/api/pith-number/JZKPLAC4Z2OKWQBAF7RK7WJYQL/graph.json","events_json":"https://pith.science/api/pith-number/JZKPLAC4Z2OKWQBAF7RK7WJYQL/events.json","paper":"https://pith.science/paper/JZKPLAC4"},"agent_actions":{"view_html":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL","download_json":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL.json","view_paper":"https://pith.science/paper/JZKPLAC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.05105&json=true","fetch_graph":"https://pith.science/api/pith-number/JZKPLAC4Z2OKWQBAF7RK7WJYQL/graph.json","fetch_events":"https://pith.science/api/pith-number/JZKPLAC4Z2OKWQBAF7RK7WJYQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/action/storage_attestation","attest_author":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/action/author_attestation","sign_citation":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/action/citation_signature","submit_replication":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/action/replication_record"}},"created_at":"2026-07-05T08:12:41.630457+00:00","updated_at":"2026-07-05T08:12:41.630457+00:00"}