{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DHANUQBKYKN6LEOAYJTT7B3KS4","short_pith_number":"pith:DHANUQBK","schema_version":"1.0","canonical_sha256":"19c0da402ac29be591c0c2673f876a97244de27acc17a7cb00d101d737f629f1","source":{"kind":"arxiv","id":"2409.09471","version":1},"attestation_state":"computed","paper":{"title":"Randomized sketched TT-GMRES for linear systems with tensor structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alberto Bucci, Davide Palitta, Leonardo Robol","submitted_at":"2024-09-14T15:44:21Z","abstract_excerpt":"In the last decade, tensors have shown their potential as valuable tools for various tasks in numerical linear algebra. While most of the research has been focusing on how to compress a given tensor in order to maintain information as well as reducing the storage demand for its allocation, the solution of linear tensor equations is a less explored venue. Even if many of the routines available in the literature are based on alternating minimization schemes (ALS), we pursue a different path and utilize Krylov methods instead. The use of Krylov methods in the tensor realm is not new. However, the"},"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":"2409.09471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-09-14T15:44:21Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fa9ffe6168cbd9d3c4b6cfec5931320be1acc29667e6284891483842e1397d49","abstract_canon_sha256":"cd95f8a138a8e4f553098976c2600a97321ea4e19e263d268f52082c358556f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:10.212423Z","signature_b64":"go/oVEAD5sETEzWMhdVpiEKN1qCw414yEvmGMyhoq8avPo+rlXe9tpbmjEO7pS7UnM1W1ksIl+D/nwKIkZacBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c0da402ac29be591c0c2673f876a97244de27acc17a7cb00d101d737f629f1","last_reissued_at":"2026-07-05T09:07:10.212061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:10.212061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized sketched TT-GMRES for linear systems with tensor structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alberto Bucci, Davide Palitta, Leonardo Robol","submitted_at":"2024-09-14T15:44:21Z","abstract_excerpt":"In the last decade, tensors have shown their potential as valuable tools for various tasks in numerical linear algebra. While most of the research has been focusing on how to compress a given tensor in order to maintain information as well as reducing the storage demand for its allocation, the solution of linear tensor equations is a less explored venue. Even if many of the routines available in the literature are based on alternating minimization schemes (ALS), we pursue a different path and utilize Krylov methods instead. The use of Krylov methods in the tensor realm is not new. However, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09471","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/2409.09471/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":"2409.09471","created_at":"2026-07-05T09:07:10.212117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09471v1","created_at":"2026-07-05T09:07:10.212117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09471","created_at":"2026-07-05T09:07:10.212117+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHANUQBKYKN6","created_at":"2026-07-05T09:07:10.212117+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHANUQBKYKN6LEOA","created_at":"2026-07-05T09:07:10.212117+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHANUQBK","created_at":"2026-07-05T09:07:10.212117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02930","citing_title":"Fast Tensor Network Imaginary Time Evolution by Implicit Stepping on Logarithmic Grids","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2506.18408","citing_title":"Stabilizing randomized GMRES through flexible GMRES","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4","json":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4.json","graph_json":"https://pith.science/api/pith-number/DHANUQBKYKN6LEOAYJTT7B3KS4/graph.json","events_json":"https://pith.science/api/pith-number/DHANUQBKYKN6LEOAYJTT7B3KS4/events.json","paper":"https://pith.science/paper/DHANUQBK"},"agent_actions":{"view_html":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4","download_json":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4.json","view_paper":"https://pith.science/paper/DHANUQBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09471&json=true","fetch_graph":"https://pith.science/api/pith-number/DHANUQBKYKN6LEOAYJTT7B3KS4/graph.json","fetch_events":"https://pith.science/api/pith-number/DHANUQBKYKN6LEOAYJTT7B3KS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4/action/storage_attestation","attest_author":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4/action/author_attestation","sign_citation":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4/action/citation_signature","submit_replication":"https://pith.science/pith/DHANUQBKYKN6LEOAYJTT7B3KS4/action/replication_record"}},"created_at":"2026-07-05T09:07:10.212117+00:00","updated_at":"2026-07-05T09:07:10.212117+00:00"}