{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NTLXVCQADMDLQ55ZCDCKJMMFAK","short_pith_number":"pith:NTLXVCQA","schema_version":"1.0","canonical_sha256":"6cd77a8a001b06b877b910c4a4b1850280142411920780d5fe53eec23d757314","source":{"kind":"arxiv","id":"2407.02454","version":3},"attestation_state":"computed","paper":{"title":"Learning tensor networks with tensor cross interpolation: new algorithms and libraries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"physics.comp-ph","authors_text":"Hiroshi Shinaoka, Jan von Delft, Jheng-Wei Li, Marc K. Ritter, Matthieu Jeannin, Olivier Parcollet, Satoshi Terasaki, Thibaud Louvet, Thomas Kloss, Xavier Waintal, Yuriel N\\'u\\~nez Fern\\'andez","submitted_at":"2024-07-02T17:32:29Z","abstract_excerpt":"The tensor cross interpolation (TCI) algorithm is a rank-revealing algorithm for decomposing low-rank, high-dimensional tensors into tensor trains/matrix product states (MPS). TCI learns a compact MPS representation of the entire object from a tiny training data set. Once obtained, the large existing MPS toolbox provides exponentially fast algorithms for performing a large set of operations. We discuss several improvements and variants of TCI. In particular, we show that replacing the cross interpolation by the partially rank-revealing LU decomposition yields a more stable and more flexible al"},"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":"2407.02454","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.comp-ph","submitted_at":"2024-07-02T17:32:29Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"b3dac0c790a61eadf51afee565e514eb2e73a35039f1bb37f2a22eee8838a35f","abstract_canon_sha256":"5610246fb89d59048c530e8047178daf655d1a34fce57cd46b309062afa78d7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:09.316570Z","signature_b64":"yfoSqRWGGKSEYJ6Uppi7RvSM+dftW40nVhKbY0WkUCXQO3vnH1M3iFi3RwXjeMuRgtVATDvwSzP8sEktTfB6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd77a8a001b06b877b910c4a4b1850280142411920780d5fe53eec23d757314","last_reissued_at":"2026-07-05T10:39:09.316068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:09.316068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning tensor networks with tensor cross interpolation: new algorithms and libraries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"physics.comp-ph","authors_text":"Hiroshi Shinaoka, Jan von Delft, Jheng-Wei Li, Marc K. Ritter, Matthieu Jeannin, Olivier Parcollet, Satoshi Terasaki, Thibaud Louvet, Thomas Kloss, Xavier Waintal, Yuriel N\\'u\\~nez Fern\\'andez","submitted_at":"2024-07-02T17:32:29Z","abstract_excerpt":"The tensor cross interpolation (TCI) algorithm is a rank-revealing algorithm for decomposing low-rank, high-dimensional tensors into tensor trains/matrix product states (MPS). TCI learns a compact MPS representation of the entire object from a tiny training data set. Once obtained, the large existing MPS toolbox provides exponentially fast algorithms for performing a large set of operations. We discuss several improvements and variants of TCI. In particular, we show that replacing the cross interpolation by the partially rank-revealing LU decomposition yields a more stable and more flexible al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02454","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/2407.02454/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":"2407.02454","created_at":"2026-07-05T10:39:09.316123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.02454v3","created_at":"2026-07-05T10:39:09.316123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02454","created_at":"2026-07-05T10:39:09.316123+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTLXVCQADMDL","created_at":"2026-07-05T10:39:09.316123+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTLXVCQADMDLQ55Z","created_at":"2026-07-05T10:39:09.316123+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTLXVCQA","created_at":"2026-07-05T10:39:09.316123+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.05202","citing_title":"Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2503.17230","citing_title":"Tensor Cross Interpolation of Purities in Quantum Many-Body Systems","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK","json":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK.json","graph_json":"https://pith.science/api/pith-number/NTLXVCQADMDLQ55ZCDCKJMMFAK/graph.json","events_json":"https://pith.science/api/pith-number/NTLXVCQADMDLQ55ZCDCKJMMFAK/events.json","paper":"https://pith.science/paper/NTLXVCQA"},"agent_actions":{"view_html":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK","download_json":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK.json","view_paper":"https://pith.science/paper/NTLXVCQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.02454&json=true","fetch_graph":"https://pith.science/api/pith-number/NTLXVCQADMDLQ55ZCDCKJMMFAK/graph.json","fetch_events":"https://pith.science/api/pith-number/NTLXVCQADMDLQ55ZCDCKJMMFAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK/action/storage_attestation","attest_author":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK/action/author_attestation","sign_citation":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK/action/citation_signature","submit_replication":"https://pith.science/pith/NTLXVCQADMDLQ55ZCDCKJMMFAK/action/replication_record"}},"created_at":"2026-07-05T10:39:09.316123+00:00","updated_at":"2026-07-05T10:39:09.316123+00:00"}