{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SEOQOLXVRD4BJLK2QSPXRMWP3Y","short_pith_number":"pith:SEOQOLXV","schema_version":"1.0","canonical_sha256":"911d072ef588f814ad5a849f78b2cfde0c2dbd8e386ca6f3ba35217408ef72cf","source":{"kind":"arxiv","id":"1701.06600","version":2},"attestation_state":"computed","paper":{"title":"A Practical Randomized CP Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Casey Battaglino, Grey Ballard, Tamara G. Kolda","submitted_at":"2017-01-23T19:37:35Z","abstract_excerpt":"The CANDECOMP/PARAFAC (CP) decomposition is a leading method for the analysis of multiway data. The standard alternating least squares algorithm for the CP decomposition (CP-ALS) involves a series of highly overdetermined linear least squares problems. We extend randomized least squares methods to tensors and show the workload of CP-ALS can be drastically reduced without a sacrifice in quality. We introduce techniques for efficiently preprocessing, sampling, and computing randomized least squares on a dense tensor of arbitrary order, as well as an efficient sampling-based technique for checkin"},"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":"1701.06600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-01-23T19:37:35Z","cross_cats_sorted":[],"title_canon_sha256":"517cc9ce511ca02def418a94f8be7327bc9ecf22e2324e4f8ca6d033af4f0dd6","abstract_canon_sha256":"6f3e3a503e68a7099af962b1783ddaffe2618c8452fd84c66cc91fb6de7e3fcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.247552Z","signature_b64":"jRb0eIA2C4EMzUmoxy6b3oAzCPCiEVJ8Rzgh3+qI0oeZyymuhE0Ya6AyRqXrldLn9Xz5lryy80Wgu+vaLKUfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"911d072ef588f814ad5a849f78b2cfde0c2dbd8e386ca6f3ba35217408ef72cf","last_reissued_at":"2026-05-18T00:07:33.247000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.247000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical Randomized CP Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Casey Battaglino, Grey Ballard, Tamara G. Kolda","submitted_at":"2017-01-23T19:37:35Z","abstract_excerpt":"The CANDECOMP/PARAFAC (CP) decomposition is a leading method for the analysis of multiway data. The standard alternating least squares algorithm for the CP decomposition (CP-ALS) involves a series of highly overdetermined linear least squares problems. We extend randomized least squares methods to tensors and show the workload of CP-ALS can be drastically reduced without a sacrifice in quality. We introduce techniques for efficiently preprocessing, sampling, and computing randomized least squares on a dense tensor of arbitrary order, as well as an efficient sampling-based technique for checkin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06600","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1701.06600","created_at":"2026-05-18T00:07:33.247096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06600v2","created_at":"2026-05-18T00:07:33.247096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06600","created_at":"2026-05-18T00:07:33.247096+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEOQOLXVRD4B","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEOQOLXVRD4BJLK2","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEOQOLXV","created_at":"2026-05-18T12:31:43.269735+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/SEOQOLXVRD4BJLK2QSPXRMWP3Y","json":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y.json","graph_json":"https://pith.science/api/pith-number/SEOQOLXVRD4BJLK2QSPXRMWP3Y/graph.json","events_json":"https://pith.science/api/pith-number/SEOQOLXVRD4BJLK2QSPXRMWP3Y/events.json","paper":"https://pith.science/paper/SEOQOLXV"},"agent_actions":{"view_html":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y","download_json":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y.json","view_paper":"https://pith.science/paper/SEOQOLXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06600&json=true","fetch_graph":"https://pith.science/api/pith-number/SEOQOLXVRD4BJLK2QSPXRMWP3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/SEOQOLXVRD4BJLK2QSPXRMWP3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y/action/storage_attestation","attest_author":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y/action/author_attestation","sign_citation":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y/action/citation_signature","submit_replication":"https://pith.science/pith/SEOQOLXVRD4BJLK2QSPXRMWP3Y/action/replication_record"}},"created_at":"2026-05-18T00:07:33.247096+00:00","updated_at":"2026-05-18T00:07:33.247096+00:00"}