{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OUD4GWMDP5YSJKZAWITBPQSEDO","short_pith_number":"pith:OUD4GWMD","schema_version":"1.0","canonical_sha256":"7507c359837f7124ab20b22617c2441b85c507d388ae0bbc5308120a2f2cb15d","source":{"kind":"arxiv","id":"2110.07631","version":2},"attestation_state":"computed","paper":{"title":"More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Osman Asif Malik","submitted_at":"2021-10-14T18:00:31Z","abstract_excerpt":"Recent papers have developed alternating least squares (ALS) methods for CP and tensor ring decomposition with a per-iteration cost which is sublinear in the number of input tensor entries for low-rank decomposition. However, the per-iteration cost of these methods still has an exponential dependence on the number of tensor modes when parameters are chosen to achieve certain worst-case guarantees. In this paper, we propose sampling-based ALS methods for the CP and tensor ring decompositions whose cost does not have this exponential dependence, thereby significantly improving on the previous st"},"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":"2110.07631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-10-14T18:00:31Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"c1296993bb8730d6e6a596a7479abb0b03d0e909dfd81493977c8a2bf46691ba","abstract_canon_sha256":"f2c7b7fab0afa985244470b6fcaddc806aee9f72896f1f7153209ca9f591cbb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:52.112960Z","signature_b64":"Ir47WUk9Ynmg1L1AZ33RbhCc9FSmqvR9Lkrpuo9QHN5/ZYhLUMDVsq+7Svi59kqjpmANslwsBWqIU0hT8MQoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7507c359837f7124ab20b22617c2441b85c507d388ae0bbc5308120a2f2cb15d","last_reissued_at":"2026-07-05T04:32:52.112536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:52.112536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Osman Asif Malik","submitted_at":"2021-10-14T18:00:31Z","abstract_excerpt":"Recent papers have developed alternating least squares (ALS) methods for CP and tensor ring decomposition with a per-iteration cost which is sublinear in the number of input tensor entries for low-rank decomposition. However, the per-iteration cost of these methods still has an exponential dependence on the number of tensor modes when parameters are chosen to achieve certain worst-case guarantees. In this paper, we propose sampling-based ALS methods for the CP and tensor ring decompositions whose cost does not have this exponential dependence, thereby significantly improving on the previous st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07631","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.07631/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":"2110.07631","created_at":"2026-07-05T04:32:52.112595+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07631v2","created_at":"2026-07-05T04:32:52.112595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07631","created_at":"2026-07-05T04:32:52.112595+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUD4GWMDP5YS","created_at":"2026-07-05T04:32:52.112595+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUD4GWMDP5YSJKZA","created_at":"2026-07-05T04:32:52.112595+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUD4GWMD","created_at":"2026-07-05T04:32:52.112595+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/OUD4GWMDP5YSJKZAWITBPQSEDO","json":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO.json","graph_json":"https://pith.science/api/pith-number/OUD4GWMDP5YSJKZAWITBPQSEDO/graph.json","events_json":"https://pith.science/api/pith-number/OUD4GWMDP5YSJKZAWITBPQSEDO/events.json","paper":"https://pith.science/paper/OUD4GWMD"},"agent_actions":{"view_html":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO","download_json":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO.json","view_paper":"https://pith.science/paper/OUD4GWMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07631&json=true","fetch_graph":"https://pith.science/api/pith-number/OUD4GWMDP5YSJKZAWITBPQSEDO/graph.json","fetch_events":"https://pith.science/api/pith-number/OUD4GWMDP5YSJKZAWITBPQSEDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO/action/storage_attestation","attest_author":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO/action/author_attestation","sign_citation":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO/action/citation_signature","submit_replication":"https://pith.science/pith/OUD4GWMDP5YSJKZAWITBPQSEDO/action/replication_record"}},"created_at":"2026-07-05T04:32:52.112595+00:00","updated_at":"2026-07-05T04:32:52.112595+00:00"}