{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XV3IJM3W7KCV4YQFNTY7U56XFL","short_pith_number":"pith:XV3IJM3W","schema_version":"1.0","canonical_sha256":"bd7684b376fa855e62056cf1fa77d72ad959f9f71d47d52829ce8f016cf9350c","source":{"kind":"arxiv","id":"2501.07904","version":3},"attestation_state":"computed","paper":{"title":"Effective algorithms for tensor train decomposition via the UTV framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Maolin Che, Yimin Wei, Yuchao Wang","submitted_at":"2025-01-14T07:47:16Z","abstract_excerpt":"The tensor-train (TT) decomposition is widely used to compress large tensors into a more compact form by exploiting their inherent data structures. A fundamental approach for constructing the TT format is the well-known TT-SVD method, which performs singular value decompositions (SVDs) on the successive matrices sequentially. But in practical applications, it is often unnecessary to compute full SVDs. In this article, we propose a new method called the TT-UTV. It utilizes the virtues of rank-revealing UTV decomposition to compute the TT format for a large-scale tensor, resulting in lower compu"},"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":"2501.07904","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-01-14T07:47:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1c5764889f411d5bd8a0b465a8b6f7d89d0cca64645c2f4854b609babbee90a8","abstract_canon_sha256":"93adf01e9fd9ce552d12cf8cdb0c5919729de596d0d8fece6f2758ed77abd687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:48.161361Z","signature_b64":"46LC7L2k36++kn9lGh9cTlQWRBa95Rh5P+D8+HAIMIZB7c8H89uv548p/j+2BSOtVNrIWXc23DUD1DbOzfAaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7684b376fa855e62056cf1fa77d72ad959f9f71d47d52829ce8f016cf9350c","last_reissued_at":"2026-05-26T02:03:48.160553Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:48.160553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective algorithms for tensor train decomposition via the UTV framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Maolin Che, Yimin Wei, Yuchao Wang","submitted_at":"2025-01-14T07:47:16Z","abstract_excerpt":"The tensor-train (TT) decomposition is widely used to compress large tensors into a more compact form by exploiting their inherent data structures. A fundamental approach for constructing the TT format is the well-known TT-SVD method, which performs singular value decompositions (SVDs) on the successive matrices sequentially. But in practical applications, it is often unnecessary to compute full SVDs. In this article, we propose a new method called the TT-UTV. It utilizes the virtues of rank-revealing UTV decomposition to compute the TT format for a large-scale tensor, resulting in lower compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07904","kind":"arxiv","version":3},"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/2501.07904/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":"2501.07904","created_at":"2026-05-26T02:03:48.160685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07904v3","created_at":"2026-05-26T02:03:48.160685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07904","created_at":"2026-05-26T02:03:48.160685+00:00"},{"alias_kind":"pith_short_12","alias_value":"XV3IJM3W7KCV","created_at":"2026-05-26T02:03:48.160685+00:00"},{"alias_kind":"pith_short_16","alias_value":"XV3IJM3W7KCV4YQF","created_at":"2026-05-26T02:03:48.160685+00:00"},{"alias_kind":"pith_short_8","alias_value":"XV3IJM3W","created_at":"2026-05-26T02:03:48.160685+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/XV3IJM3W7KCV4YQFNTY7U56XFL","json":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL.json","graph_json":"https://pith.science/api/pith-number/XV3IJM3W7KCV4YQFNTY7U56XFL/graph.json","events_json":"https://pith.science/api/pith-number/XV3IJM3W7KCV4YQFNTY7U56XFL/events.json","paper":"https://pith.science/paper/XV3IJM3W"},"agent_actions":{"view_html":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL","download_json":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL.json","view_paper":"https://pith.science/paper/XV3IJM3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07904&json=true","fetch_graph":"https://pith.science/api/pith-number/XV3IJM3W7KCV4YQFNTY7U56XFL/graph.json","fetch_events":"https://pith.science/api/pith-number/XV3IJM3W7KCV4YQFNTY7U56XFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL/action/storage_attestation","attest_author":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL/action/author_attestation","sign_citation":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL/action/citation_signature","submit_replication":"https://pith.science/pith/XV3IJM3W7KCV4YQFNTY7U56XFL/action/replication_record"}},"created_at":"2026-05-26T02:03:48.160685+00:00","updated_at":"2026-05-26T02:03:48.160685+00:00"}