{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SGXLBNWJDNN4GLXUVB7UK65YYC","short_pith_number":"pith:SGXLBNWJ","schema_version":"1.0","canonical_sha256":"91aeb0b6c91b5bc32ef4a87f457bb8c0af5168219d770fdfafb1368d49bbbdc0","source":{"kind":"arxiv","id":"2306.00406","version":1},"attestation_state":"computed","paper":{"title":"Faster Robust Tensor Power Method for Arbitrary Order","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Junze Yin, Yichuan Deng, Zhao Song","submitted_at":"2023-06-01T07:12:00Z","abstract_excerpt":"Tensor decomposition is a fundamental method used in various areas to deal with high-dimensional data. \\emph{Tensor power method} (TPM) is one of the widely-used techniques in the decomposition of tensors. This paper presents a novel tensor power method for decomposing arbitrary order tensors, which overcomes limitations of existing approaches that are often restricted to lower-order (less than $3$) tensors or require strong assumptions about the underlying data structure. We apply sketching method, and we are able to achieve the running time of $\\widetilde{O}(n^{p-1})$, on the power $p$ and d"},"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":"2306.00406","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-01T07:12:00Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"15287412cbf4c6bf2f7ffb5f2c72fc9de42d0cbb6c3766d1f792dc7607ada854","abstract_canon_sha256":"d63b9012b972c0ae40540a876c6dcb96895582e436e69f548aa33cbdabfd5f67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:26.063522Z","signature_b64":"EENm/NhSBc+K8WM44uz8CTifni4mQIJEXTWpVQl+AOGDT/+bmByOwIOit+Wp8TeR0gIIzHE401+dqRydz3vXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91aeb0b6c91b5bc32ef4a87f457bb8c0af5168219d770fdfafb1368d49bbbdc0","last_reissued_at":"2026-07-05T06:16:26.063078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:26.063078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Robust Tensor Power Method for Arbitrary Order","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Junze Yin, Yichuan Deng, Zhao Song","submitted_at":"2023-06-01T07:12:00Z","abstract_excerpt":"Tensor decomposition is a fundamental method used in various areas to deal with high-dimensional data. \\emph{Tensor power method} (TPM) is one of the widely-used techniques in the decomposition of tensors. This paper presents a novel tensor power method for decomposing arbitrary order tensors, which overcomes limitations of existing approaches that are often restricted to lower-order (less than $3$) tensors or require strong assumptions about the underlying data structure. We apply sketching method, and we are able to achieve the running time of $\\widetilde{O}(n^{p-1})$, on the power $p$ and d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00406","kind":"arxiv","version":1},"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/2306.00406/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":"2306.00406","created_at":"2026-07-05T06:16:26.063138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.00406v1","created_at":"2026-07-05T06:16:26.063138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00406","created_at":"2026-07-05T06:16:26.063138+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGXLBNWJDNN4","created_at":"2026-07-05T06:16:26.063138+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGXLBNWJDNN4GLXU","created_at":"2026-07-05T06:16:26.063138+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGXLBNWJ","created_at":"2026-07-05T06:16:26.063138+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16284","citing_title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC","json":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC.json","graph_json":"https://pith.science/api/pith-number/SGXLBNWJDNN4GLXUVB7UK65YYC/graph.json","events_json":"https://pith.science/api/pith-number/SGXLBNWJDNN4GLXUVB7UK65YYC/events.json","paper":"https://pith.science/paper/SGXLBNWJ"},"agent_actions":{"view_html":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC","download_json":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC.json","view_paper":"https://pith.science/paper/SGXLBNWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.00406&json=true","fetch_graph":"https://pith.science/api/pith-number/SGXLBNWJDNN4GLXUVB7UK65YYC/graph.json","fetch_events":"https://pith.science/api/pith-number/SGXLBNWJDNN4GLXUVB7UK65YYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC/action/storage_attestation","attest_author":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC/action/author_attestation","sign_citation":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC/action/citation_signature","submit_replication":"https://pith.science/pith/SGXLBNWJDNN4GLXUVB7UK65YYC/action/replication_record"}},"created_at":"2026-07-05T06:16:26.063138+00:00","updated_at":"2026-07-05T06:16:26.063138+00:00"}