{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZDCE7XY3I3NF5TBYA6DSMXLA76","short_pith_number":"pith:ZDCE7XY3","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"},"canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","source":{"kind":"arxiv","id":"2606.11603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11603","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11603v1","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11603","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZDCE7XY3I3NF","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZDCE7XY3I3NF5TBY","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZDCE7XY3","created_at":"2026-06-11T01:09:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZDCE7XY3I3NF5TBYA6DSMXLA76","target":"record","payload":{"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"},"canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","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"},"source_kind":"arxiv","source_id":"2606.11603","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/5h1Hr6T8cAORxpuhuLIddce44jXdi92RajcYDFTs43byjB5Tjnz2oh3A6UZLOq2CAufs0i3qf2ej4FPEhVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:26.357732Z"},"content_sha256":"7146a162ef6823f9970ae1e1078ecac913e19bc784c7dfba0197bc48c0a8402c","schema_version":"1.0","event_id":"sha256:7146a162ef6823f9970ae1e1078ecac913e19bc784c7dfba0197bc48c0a8402c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZDCE7XY3I3NF5TBYA6DSMXLA76","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cumk3XPF1U5I1ORkbqHK7I9RpBhle3gkge3afbEFOWE9O7Jfz1/qPZjrP2d41ODTWD14LUkuh/698CasCcnyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:26.358391Z"},"content_sha256":"5de124c6a51b1b8eb5e420e30cdf9121faa5a49339c72c31b3489762a8254873","schema_version":"1.0","event_id":"sha256:5de124c6a51b1b8eb5e420e30cdf9121faa5a49339c72c31b3489762a8254873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/bundle.json","state_url":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T10:01:26Z","links":{"resolver":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76","bundle":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/bundle.json","state":"https://pith.science/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDCE7XY3I3NF5TBYA6DSMXLA76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZDCE7XY3I3NF5TBYA6DSMXLA76","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"523256b8725d502f0c2826a5fdeae991328e4d93c97ff84724c938417f00ecbe","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-10T03:00:32Z","title_canon_sha256":"61ba14019d1f0d9772089eedba19fcbed8f454c39610a38cf2b5ba5a3926fc32"},"schema_version":"1.0","source":{"id":"2606.11603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11603","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11603v1","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11603","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZDCE7XY3I3NF","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZDCE7XY3I3NF5TBY","created_at":"2026-06-11T01:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZDCE7XY3","created_at":"2026-06-11T01:09:58Z"}],"graph_snapshots":[{"event_id":"sha256:5de124c6a51b1b8eb5e420e30cdf9121faa5a49339c72c31b3489762a8254873","target":"graph","created_at":"2026-06-11T01:09:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ailun Jian, Gaohang Yu, Xiaohao Cai, Yihao Pan","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-10T03:00:32Z","title":"A Two-Sided Sketching Algorithm for Low-rank Tensor Train Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11603","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7146a162ef6823f9970ae1e1078ecac913e19bc784c7dfba0197bc48c0a8402c","target":"record","created_at":"2026-06-11T01:09:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"523256b8725d502f0c2826a5fdeae991328e4d93c97ff84724c938417f00ecbe","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-10T03:00:32Z","title_canon_sha256":"61ba14019d1f0d9772089eedba19fcbed8f454c39610a38cf2b5ba5a3926fc32"},"schema_version":"1.0","source":{"id":"2606.11603","kind":"arxiv","version":1}},"canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8c44fdf1b46da5ecc380787265d60ffafa1c94944406f8d6671d69b434300fc","first_computed_at":"2026-06-11T01:09:58.578964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:58.578964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzWS/KBlVliiMJOxPNVcWlefw2qjAUUMIuCtcj61C9ASB95SjecNG3dm1SErK0DoGvS/2WXQA9DLySVktjNxAQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:58.579987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7146a162ef6823f9970ae1e1078ecac913e19bc784c7dfba0197bc48c0a8402c","sha256:5de124c6a51b1b8eb5e420e30cdf9121faa5a49339c72c31b3489762a8254873"],"state_sha256":"d21b319e81907b53a5cdcbd3ad2dea7f646a50db84e0cbc77f77da60bcf39bf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VT1SGWRnmoScZqVmZu0pwEvyNUv3Cty3tOW3KDf/ZKOu2xKjkorW/lxqCn/2Sl1pnXRbrbm/UUvdzY1kuMXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:01:26.361978Z","bundle_sha256":"d45cbbba99ab7a092e938a54f141686bba9b872facfbb37d3d519453d4091cd4"}}