{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZDCE7XY3I3NF5TBYA6DSMXLA76","short_pith_number":"pith:ZDCE7XY3","schema_version":"1.0","canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","source":{"kind":"arxiv","id":"2606.11603","version":1},"attestation_state":"computed","paper":{"title":"A Two-Sided Sketching Algorithm for Low-rank Tensor Train Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ailun Jian, Gaohang Yu, Xiaohao Cai, Yihao Pan","submitted_at":"2026-06-10T03:00:32Z","abstract_excerpt":"Tensor train (TT) decomposition is a powerful method to acquire low-rank tensors. However, the computational process is frequently obstructed by the large-scale matrix singular value decomposition (SVD). The sketching algorithm serves as an efficient data compression technique that can quickly derive low-rank matrix approximations. In this paper, we propose a randomized algorithm to obtain the TT approximation of tensors using a one-pass sketching algorithm and subspace iteration, and offer thorough error-bound and robustness analysis. Numerical experiments on synthetic and real-world datasets"},"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":"2606.11603","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-10T03:00:32Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"61ba14019d1f0d9772089eedba19fcbed8f454c39610a38cf2b5ba5a3926fc32","abstract_canon_sha256":"523256b8725d502f0c2826a5fdeae991328e4d93c97ff84724c938417f00ecbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:58.579987Z","signature_b64":"uzWS/KBlVliiMJOxPNVcWlefw2qjAUUMIuCtcj61C9ASB95SjecNG3dm1SErK0DoGvS/2WXQA9DLySVktjNxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","last_reissued_at":"2026-06-11T01:09:58.578964Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:58.578964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Two-Sided Sketching Algorithm for Low-rank Tensor Train Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ailun Jian, Gaohang Yu, Xiaohao Cai, Yihao Pan","submitted_at":"2026-06-10T03:00:32Z","abstract_excerpt":"Tensor train (TT) decomposition is a powerful method to acquire low-rank tensors. However, the computational process is frequently obstructed by the large-scale matrix singular value decomposition (SVD). The sketching algorithm serves as an efficient data compression technique that can quickly derive low-rank matrix approximations. In this paper, we propose a randomized algorithm to obtain the TT approximation of tensors using a one-pass sketching algorithm and subspace iteration, and offer thorough error-bound and robustness analysis. Numerical experiments on synthetic and real-world datasets"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11603","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/2606.11603/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":"2606.11603","created_at":"2026-06-11T01:09:58.579085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11603v1","created_at":"2026-06-11T01:09:58.579085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11603","created_at":"2026-06-11T01:09:58.579085+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDCE7XY3I3NF","created_at":"2026-06-11T01:09:58.579085+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDCE7XY3I3NF5TBY","created_at":"2026-06-11T01:09:58.579085+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDCE7XY3","created_at":"2026-06-11T01:09:58.579085+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/ZDCE7XY3I3NF5TBYA6DSMXLA76","json":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76.json","graph_json":"https://pith.science/api/pith-number/ZDCE7XY3I3NF5TBYA6DSMXLA76/graph.json","events_json":"https://pith.science/api/pith-number/ZDCE7XY3I3NF5TBYA6DSMXLA76/events.json","paper":"https://pith.science/paper/ZDCE7XY3"},"agent_actions":{"view_html":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76","download_json":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76.json","view_paper":"https://pith.science/paper/ZDCE7XY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11603&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDCE7XY3I3NF5TBYA6DSMXLA76/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDCE7XY3I3NF5TBYA6DSMXLA76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/action/storage_attestation","attest_author":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/action/author_attestation","sign_citation":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/action/citation_signature","submit_replication":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/action/replication_record"}},"created_at":"2026-06-11T01:09:58.579085+00:00","updated_at":"2026-06-11T01:09:58.579085+00:00"}