{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XV3IJM3W7KCV4YQFNTY7U56XFL","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":"93adf01e9fd9ce552d12cf8cdb0c5919729de596d0d8fece6f2758ed77abd687","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-01-14T07:47:16Z","title_canon_sha256":"1c5764889f411d5bd8a0b465a8b6f7d89d0cca64645c2f4854b609babbee90a8"},"schema_version":"1.0","source":{"id":"2501.07904","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07904","created_at":"2026-05-26T02:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07904v3","created_at":"2026-05-26T02:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07904","created_at":"2026-05-26T02:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"XV3IJM3W7KCV","created_at":"2026-05-26T02:03:48Z"},{"alias_kind":"pith_short_16","alias_value":"XV3IJM3W7KCV4YQF","created_at":"2026-05-26T02:03:48Z"},{"alias_kind":"pith_short_8","alias_value":"XV3IJM3W","created_at":"2026-05-26T02:03:48Z"}],"graph_snapshots":[{"event_id":"sha256:ad4fff3eb96f50eb0327562926d8aaca1f00b05d0edbebb5c8fab881f2e53f0c","target":"graph","created_at":"2026-05-26T02:03:48Z","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/2501.07904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Maolin Che, Yimin Wei, Yuchao Wang","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-01-14T07:47:16Z","title":"Effective algorithms for tensor train decomposition via the UTV framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07904","kind":"arxiv","version":3},"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:7a782f89e967a1087ad1d80f7288611c66317515a374981298e9b392ba9f671d","target":"record","created_at":"2026-05-26T02:03:48Z","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":"93adf01e9fd9ce552d12cf8cdb0c5919729de596d0d8fece6f2758ed77abd687","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-01-14T07:47:16Z","title_canon_sha256":"1c5764889f411d5bd8a0b465a8b6f7d89d0cca64645c2f4854b609babbee90a8"},"schema_version":"1.0","source":{"id":"2501.07904","kind":"arxiv","version":3}},"canonical_sha256":"bd7684b376fa855e62056cf1fa77d72ad959f9f71d47d52829ce8f016cf9350c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd7684b376fa855e62056cf1fa77d72ad959f9f71d47d52829ce8f016cf9350c","first_computed_at":"2026-05-26T02:03:48.160553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:03:48.160553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"46LC7L2k36++kn9lGh9cTlQWRBa95Rh5P+D8+HAIMIZB7c8H89uv548p/j+2BSOtVNrIWXc23DUD1DbOzfAaDg==","signature_status":"signed_v1","signed_at":"2026-05-26T02:03:48.161361Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07904","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a782f89e967a1087ad1d80f7288611c66317515a374981298e9b392ba9f671d","sha256:ad4fff3eb96f50eb0327562926d8aaca1f00b05d0edbebb5c8fab881f2e53f0c"],"state_sha256":"36e33f3c26a1f4fc03953fcd1f94e2ecdd51c9fbbdd64032f7fc6e79b2ddee6a"}