{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IF5222FC7SYOQYAEVWV2Z67ERE","short_pith_number":"pith:IF5222FC","schema_version":"1.0","canonical_sha256":"417bad68a2fcb0e86004adabacfbe4892ea7afc9db554ec48d5df9d1b3e6f22b","source":{"kind":"arxiv","id":"2405.07147","version":2},"attestation_state":"computed","paper":{"title":"Randomized algorithms for computing the tensor train approximation and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hong Yan, Maolin Che, Yimin Wei","submitted_at":"2024-05-12T03:31:27Z","abstract_excerpt":"In this paper, we focus on the fixed TT-rank and precision problems of finding an approximation of the tensor train (TT) decomposition of a tensor. Note that the TT-SVD and TT-cross are two well-known algorithms for these two problems. Firstly, by combining the random projection technique with the power scheme, we obtain two types of randomized algorithms for the fixed TT-rank problem. Secondly, by using the non-asymptotic theory of sub-random Gaussian matrices, we derive the upper bounds of the proposed randomized algorithms. Thirdly, we deduce a new deterministic strategy to estimate the des"},"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":"2405.07147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-05-12T03:31:27Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1e7f6c923ff4eb603d502d6d570ed64a209dfbdd9366d937458cf1bba84a28b6","abstract_canon_sha256":"07466d4e7569b035c9fcd47d1cda8cf163d00ec6eb59dc1ea1eb57ec7f2d22e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:58.693233Z","signature_b64":"gf70OO8s6laRGtnxeAhbmx861tp/HlO0oUWDSBVR27de4rD9pEGkgoVJ4YnXRaYkeboWS0pd9R7R5gRm4M5xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417bad68a2fcb0e86004adabacfbe4892ea7afc9db554ec48d5df9d1b3e6f22b","last_reissued_at":"2026-07-05T10:11:58.692767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:58.692767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized algorithms for computing the tensor train approximation and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hong Yan, Maolin Che, Yimin Wei","submitted_at":"2024-05-12T03:31:27Z","abstract_excerpt":"In this paper, we focus on the fixed TT-rank and precision problems of finding an approximation of the tensor train (TT) decomposition of a tensor. Note that the TT-SVD and TT-cross are two well-known algorithms for these two problems. Firstly, by combining the random projection technique with the power scheme, we obtain two types of randomized algorithms for the fixed TT-rank problem. Secondly, by using the non-asymptotic theory of sub-random Gaussian matrices, we derive the upper bounds of the proposed randomized algorithms. Thirdly, we deduce a new deterministic strategy to estimate the des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07147","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/2405.07147/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":"2405.07147","created_at":"2026-07-05T10:11:58.692829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07147v2","created_at":"2026-07-05T10:11:58.692829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07147","created_at":"2026-07-05T10:11:58.692829+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF5222FC7SYO","created_at":"2026-07-05T10:11:58.692829+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF5222FC7SYOQYAE","created_at":"2026-07-05T10:11:58.692829+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF5222FC","created_at":"2026-07-05T10:11:58.692829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11603","citing_title":"A Two-Sided Sketching Algorithm for Low-rank Tensor Train Approximation","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE","json":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE.json","graph_json":"https://pith.science/api/pith-number/IF5222FC7SYOQYAEVWV2Z67ERE/graph.json","events_json":"https://pith.science/api/pith-number/IF5222FC7SYOQYAEVWV2Z67ERE/events.json","paper":"https://pith.science/paper/IF5222FC"},"agent_actions":{"view_html":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE","download_json":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE.json","view_paper":"https://pith.science/paper/IF5222FC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07147&json=true","fetch_graph":"https://pith.science/api/pith-number/IF5222FC7SYOQYAEVWV2Z67ERE/graph.json","fetch_events":"https://pith.science/api/pith-number/IF5222FC7SYOQYAEVWV2Z67ERE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE/action/storage_attestation","attest_author":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE/action/author_attestation","sign_citation":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE/action/citation_signature","submit_replication":"https://pith.science/pith/IF5222FC7SYOQYAEVWV2Z67ERE/action/replication_record"}},"created_at":"2026-07-05T10:11:58.692829+00:00","updated_at":"2026-07-05T10:11:58.692829+00:00"}