{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JZKPLAC4Z2OKWQBAF7RK7WJYQL","short_pith_number":"pith:JZKPLAC4","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"},"canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","source":{"kind":"arxiv","id":"2210.05105","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JZKPLAC4Z2OKWQBAF7RK7WJYQL","target":"record","payload":{"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"},"canonical_sha256":"4e54f5805cce9cab40202fe2afd93882f451ddb5e0beb6d37799cfa71364f5a8","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"},"source_kind":"arxiv","source_id":"2210.05105","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2uDfq+cx9WLdtePx0qgftFULVvu3pjRDG1df3umeodV35BiXw8WLJG0SqeKpKxnK7Qv3DtCYL+p20J6imy3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:42:34.449568Z"},"content_sha256":"95a85bbf2c0c37828aebedc3a4cf1cec5be2b0f15f4eb85e44c796e6a1fe75e9","schema_version":"1.0","event_id":"sha256:95a85bbf2c0c37828aebedc3a4cf1cec5be2b0f15f4eb85e44c796e6a1fe75e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JZKPLAC4Z2OKWQBAF7RK7WJYQL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6VjErcs3Qqt946r6XYQQsjN09s5fDxyWRA+Y9xoSq7EzhoW2Z7kUXdqMC1vyekgcN9PnVLnnhwK6Wl2RlIqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:42:34.449945Z"},"content_sha256":"ce1268d113134c7799bbce6497b2416b27210f21bb15ca064dfeb6dce4c06460","schema_version":"1.0","event_id":"sha256:ce1268d113134c7799bbce6497b2416b27210f21bb15ca064dfeb6dce4c06460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/bundle.json","state_url":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T18:42:34Z","links":{"resolver":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL","bundle":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/bundle.json","state":"https://pith.science/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZKPLAC4Z2OKWQBAF7RK7WJYQL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iH0G1KHkSu8Fzs6akcZW87r5h1VYyLdn8LMd0lowETpGnEO4G90cESSk5HMQJAm2wwlvrvrf8xUXdPQRblWODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:42:34.451861Z","bundle_sha256":"c70d28654cf6c5789c8e86010da511921a0ce97ce5a4c0f5caba2564cb525747"}}