{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OYCMFXJWKMRY7ZFEKEJ6TSK27V","short_pith_number":"pith:OYCMFXJW","schema_version":"1.0","canonical_sha256":"7604c2dd3653238fe4a45113e9c95afd75d768f7bc7fc1c564598b4adc3e3a6a","source":{"kind":"arxiv","id":"2210.14533","version":1},"attestation_state":"computed","paper":{"title":"A robust GMRES algorithm in Tensor Train format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Luc Giraud (CONCACE), Martina Iannacito (CONCACE), Olivier Coulaud (CONCACE)","submitted_at":"2022-10-26T07:52:06Z","abstract_excerpt":"We consider the solution of linear systems with tensor product structure using a GMRES algorithm. In order to cope with the computational complexity in large dimension both in terms of floating point operations and memory requirement, our algorithm is based on low-rank tensor representation, namely the Tensor Train format.  In a backward error analysis framework, we show how the tensor approximation affects the accuracy of the computed solution. With the bacwkward perspective, we investigate the situations where the $(d+1)$-dimensional problem to be solved results from the concatenation of a s"},"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":"2210.14533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-10-26T07:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"7d863715b4b913d0da4976b519275436202489eb714364d83137f58d843e4ebc","abstract_canon_sha256":"c4a4685db7760fade50b3ce39174940de024b5b199149a95f09ede7b60fafc89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:46.531210Z","signature_b64":"N5AuzASOR2bhusU6oAo4iw+99dPAAjNj/fw8b/yX8LMHfDHLg8r3mIOBTpa5dQL1HnOYyRFFia9yi0e5z8FfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7604c2dd3653238fe4a45113e9c95afd75d768f7bc7fc1c564598b4adc3e3a6a","last_reissued_at":"2026-07-05T05:10:46.530796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:46.530796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust GMRES algorithm in Tensor Train format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Luc Giraud (CONCACE), Martina Iannacito (CONCACE), Olivier Coulaud (CONCACE)","submitted_at":"2022-10-26T07:52:06Z","abstract_excerpt":"We consider the solution of linear systems with tensor product structure using a GMRES algorithm. In order to cope with the computational complexity in large dimension both in terms of floating point operations and memory requirement, our algorithm is based on low-rank tensor representation, namely the Tensor Train format.  In a backward error analysis framework, we show how the tensor approximation affects the accuracy of the computed solution. With the bacwkward perspective, we investigate the situations where the $(d+1)$-dimensional problem to be solved results from the concatenation of a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14533","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/2210.14533/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":"2210.14533","created_at":"2026-07-05T05:10:46.530867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14533v1","created_at":"2026-07-05T05:10:46.530867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14533","created_at":"2026-07-05T05:10:46.530867+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYCMFXJWKMRY","created_at":"2026-07-05T05:10:46.530867+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYCMFXJWKMRY7ZFE","created_at":"2026-07-05T05:10:46.530867+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYCMFXJW","created_at":"2026-07-05T05:10:46.530867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21750","citing_title":"Multilevel Adaptive-Rank Methods for Linear and Nonlinear Systems in the Hierarchical Tucker Format","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V","json":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V.json","graph_json":"https://pith.science/api/pith-number/OYCMFXJWKMRY7ZFEKEJ6TSK27V/graph.json","events_json":"https://pith.science/api/pith-number/OYCMFXJWKMRY7ZFEKEJ6TSK27V/events.json","paper":"https://pith.science/paper/OYCMFXJW"},"agent_actions":{"view_html":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V","download_json":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V.json","view_paper":"https://pith.science/paper/OYCMFXJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14533&json=true","fetch_graph":"https://pith.science/api/pith-number/OYCMFXJWKMRY7ZFEKEJ6TSK27V/graph.json","fetch_events":"https://pith.science/api/pith-number/OYCMFXJWKMRY7ZFEKEJ6TSK27V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V/action/storage_attestation","attest_author":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V/action/author_attestation","sign_citation":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V/action/citation_signature","submit_replication":"https://pith.science/pith/OYCMFXJWKMRY7ZFEKEJ6TSK27V/action/replication_record"}},"created_at":"2026-07-05T05:10:46.530867+00:00","updated_at":"2026-07-05T05:10:46.530867+00:00"}