{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JZKPLAC4Z2OKWQBAF7RK7WJYQL","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":"92ab676285a8a4bf5eea9fbee08749fc345697ed63f0bad2ff57520013813b18","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-10-11T02:46:28Z","title_canon_sha256":"ccec8a2f04188f43e4e041165ec2c6b5934961bf5e747ce004bd032a9ed63b95"},"schema_version":"1.0","source":{"id":"2210.05105","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05105","created_at":"2026-07-05T08:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05105v3","created_at":"2026-07-05T08:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05105","created_at":"2026-07-05T08:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"JZKPLAC4Z2OK","created_at":"2026-07-05T08:12:41Z"},{"alias_kind":"pith_short_16","alias_value":"JZKPLAC4Z2OKWQBA","created_at":"2026-07-05T08:12:41Z"},{"alias_kind":"pith_short_8","alias_value":"JZKPLAC4","created_at":"2026-07-05T08:12:41Z"}],"graph_snapshots":[{"event_id":"sha256:ce1268d113134c7799bbce6497b2416b27210f21bb15ca064dfeb6dce4c06460","target":"graph","created_at":"2026-07-05T08:12:41Z","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/2210.05105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aydin Bulu\\c{c}, James Demmel, Osman Asif Malik, Riley Murray, Vivek Bharadwaj","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-10-11T02:46:28Z","title":"Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05105","kind":"arxiv","version":3},"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:95a85bbf2c0c37828aebedc3a4cf1cec5be2b0f15f4eb85e44c796e6a1fe75e9","target":"record","created_at":"2026-07-05T08:12:41Z","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":"92ab676285a8a4bf5eea9fbee08749fc345697ed63f0bad2ff57520013813b18","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-10-11T02:46:28Z","title_canon_sha256":"ccec8a2f04188f43e4e041165ec2c6b5934961bf5e747ce004bd032a9ed63b95"},"schema_version":"1.0","source":{"id":"2210.05105","kind":"arxiv","version":3}},"canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","first_computed_at":"2026-07-05T08:12:41.630398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:12:41.630398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0hZYSknu0PKQJYhiQFPpGJ5Ac+rm7TCxFx8k7/aoJQg7EGx5Fusl0MGifjGaiOmz1gTuYZLk5v+vx3lNS2cBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:12:41.630905Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.05105","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a85bbf2c0c37828aebedc3a4cf1cec5be2b0f15f4eb85e44c796e6a1fe75e9","sha256:ce1268d113134c7799bbce6497b2416b27210f21bb15ca064dfeb6dce4c06460"],"state_sha256":"d5375156dc2814f9353776d175d3d46db3435237d8050a80d353a4dd6276f7d0"}