{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LXYMFCXGLR64A54KEPEI4SZ3SE","short_pith_number":"pith:LXYMFCXG","schema_version":"1.0","canonical_sha256":"5df0c28ae65c7dc0778a23c88e4b3b913ade79617bdbafd78f6b7b36aea7c265","source":{"kind":"arxiv","id":"2409.08262","version":2},"attestation_state":"computed","paper":{"title":"Learning incomplete factorization preconditioners for GMRES","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Aleix Nieto Juscafresa, Jens Sj\\\"olund, Paul H\\\"ausner","submitted_at":"2024-09-12T17:55:44Z","abstract_excerpt":"Incomplete LU factorizations of sparse matrices are widely used as preconditioners in Krylov subspace methods to speed up solving linear systems. Unfortunately, computing the preconditioner itself can be time-consuming and sensitive to hyper-parameters. Instead, we replace the hand-engineered algorithm with a graph neural network that is trained to approximate the matrix factorization directly. To apply the output of the neural network as a preconditioner, we propose an output activation function that guarantees that the predicted factorization is invertible. Further, applying a graph neural n"},"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.08262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-12T17:55:44Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"1c3f023caa01bfb64bada2e04dd35c9a4097c1cdd04f26a21e0ee5a20e00e813","abstract_canon_sha256":"320e5d1866539d2a729f4d88c6e4cfa9b5e520f74aefe0dc4ceb421caf689f47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:34.721347Z","signature_b64":"1LKIa+mknNCj12zSsNX6MH7i6REJ2odHB9yc8vzIzYr3TikQNDTOGRDsOnk8Ixfz3FSdMNU9fFqFvO2WpjbLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5df0c28ae65c7dc0778a23c88e4b3b913ade79617bdbafd78f6b7b36aea7c265","last_reissued_at":"2026-07-05T09:47:34.720813Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:34.720813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning incomplete factorization preconditioners for GMRES","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Aleix Nieto Juscafresa, Jens Sj\\\"olund, Paul H\\\"ausner","submitted_at":"2024-09-12T17:55:44Z","abstract_excerpt":"Incomplete LU factorizations of sparse matrices are widely used as preconditioners in Krylov subspace methods to speed up solving linear systems. Unfortunately, computing the preconditioner itself can be time-consuming and sensitive to hyper-parameters. Instead, we replace the hand-engineered algorithm with a graph neural network that is trained to approximate the matrix factorization directly. To apply the output of the neural network as a preconditioner, we propose an output activation function that guarantees that the predicted factorization is invertible. Further, applying a graph neural n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08262","kind":"arxiv","version":2},"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.08262/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.08262","created_at":"2026-07-05T09:47:34.720881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08262v2","created_at":"2026-07-05T09:47:34.720881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08262","created_at":"2026-07-05T09:47:34.720881+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXYMFCXGLR64","created_at":"2026-07-05T09:47:34.720881+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXYMFCXGLR64A54K","created_at":"2026-07-05T09:47:34.720881+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXYMFCXG","created_at":"2026-07-05T09:47:34.720881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22742","citing_title":"Factored Sparse Approximate Inverse Preconditioning via Spectral Optimization","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE","json":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE.json","graph_json":"https://pith.science/api/pith-number/LXYMFCXGLR64A54KEPEI4SZ3SE/graph.json","events_json":"https://pith.science/api/pith-number/LXYMFCXGLR64A54KEPEI4SZ3SE/events.json","paper":"https://pith.science/paper/LXYMFCXG"},"agent_actions":{"view_html":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE","download_json":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE.json","view_paper":"https://pith.science/paper/LXYMFCXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08262&json=true","fetch_graph":"https://pith.science/api/pith-number/LXYMFCXGLR64A54KEPEI4SZ3SE/graph.json","fetch_events":"https://pith.science/api/pith-number/LXYMFCXGLR64A54KEPEI4SZ3SE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE/action/storage_attestation","attest_author":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE/action/author_attestation","sign_citation":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE/action/citation_signature","submit_replication":"https://pith.science/pith/LXYMFCXGLR64A54KEPEI4SZ3SE/action/replication_record"}},"created_at":"2026-07-05T09:47:34.720881+00:00","updated_at":"2026-07-05T09:47:34.720881+00:00"}