{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FTAJSH6DAXPPNAEAILUNROZ7WC","short_pith_number":"pith:FTAJSH6D","schema_version":"1.0","canonical_sha256":"2cc0991fc305def6808042e8d8bb3fb0924ac723c438fd343c27773ae5532445","source":{"kind":"arxiv","id":"2009.12101","version":1},"attestation_state":"computed","paper":{"title":"Compressed Basis GMRES on High Performance GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Andr\\'es E. Tom\\'as, Enrique S. Quintana-Ort\\'i, Hartwig Anzt, Jos\\'e I. Aliaga, Thomas Gr\\\"utzmacher","submitted_at":"2020-09-25T09:37:38Z","abstract_excerpt":"Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in all current computer architectures, motivating the recent investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures).\n  This paper introduces a new communication-reduction strategy for the (Krylov) GMRES solver that advocates"},"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":"2009.12101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2020-09-25T09:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"c2d3faf80142ba3251f18dfde0f5ae4d1d798abe9f6444117782cccea61a1b41","abstract_canon_sha256":"8cf279915febfdd20f44e345b88954ce00baaa48ecc9e55b9247b0a1c4fdbec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:59.503836Z","signature_b64":"Lg8zfU8xJrzrAXuJ6lHclPf8FSYUYeJvdndWQ0/d23vDPegR4OvHRa0491M0Ozw276y0DrG47jl4CJOkIHDICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc0991fc305def6808042e8d8bb3fb0924ac723c438fd343c27773ae5532445","last_reissued_at":"2026-07-05T01:37:59.503446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:59.503446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Basis GMRES on High Performance GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Andr\\'es E. Tom\\'as, Enrique S. Quintana-Ort\\'i, Hartwig Anzt, Jos\\'e I. Aliaga, Thomas Gr\\\"utzmacher","submitted_at":"2020-09-25T09:37:38Z","abstract_excerpt":"Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in all current computer architectures, motivating the recent investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures).\n  This paper introduces a new communication-reduction strategy for the (Krylov) GMRES solver that advocates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12101","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/2009.12101/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":"2009.12101","created_at":"2026-07-05T01:37:59.503509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.12101v1","created_at":"2026-07-05T01:37:59.503509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12101","created_at":"2026-07-05T01:37:59.503509+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTAJSH6DAXPP","created_at":"2026-07-05T01:37:59.503509+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTAJSH6DAXPPNAEA","created_at":"2026-07-05T01:37:59.503509+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTAJSH6D","created_at":"2026-07-05T01:37:59.503509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.08059","citing_title":"Parameter optimization for restarted mixed precision iterative sparse solver","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC","json":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC.json","graph_json":"https://pith.science/api/pith-number/FTAJSH6DAXPPNAEAILUNROZ7WC/graph.json","events_json":"https://pith.science/api/pith-number/FTAJSH6DAXPPNAEAILUNROZ7WC/events.json","paper":"https://pith.science/paper/FTAJSH6D"},"agent_actions":{"view_html":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC","download_json":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC.json","view_paper":"https://pith.science/paper/FTAJSH6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.12101&json=true","fetch_graph":"https://pith.science/api/pith-number/FTAJSH6DAXPPNAEAILUNROZ7WC/graph.json","fetch_events":"https://pith.science/api/pith-number/FTAJSH6DAXPPNAEAILUNROZ7WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC/action/storage_attestation","attest_author":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC/action/author_attestation","sign_citation":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC/action/citation_signature","submit_replication":"https://pith.science/pith/FTAJSH6DAXPPNAEAILUNROZ7WC/action/replication_record"}},"created_at":"2026-07-05T01:37:59.503509+00:00","updated_at":"2026-07-05T01:37:59.503509+00:00"}