{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SFPFCYIKLE6D4LVL4H5DOJS4AH","short_pith_number":"pith:SFPFCYIK","schema_version":"1.0","canonical_sha256":"915e51610a593c3e2eabe1fa37265c01c4a79ade94fb03c60d52c1c8f7f25cb8","source":{"kind":"arxiv","id":"2606.10132","version":1},"attestation_state":"computed","paper":{"title":"WING: A Simple Windowed Nonorthogonalized Initial Guess Procedure for Repeated Matrix Solves","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Boyce E. Griffith, David Wells, Matthew G. Knepley","submitted_at":"2026-06-08T20:07:52Z","abstract_excerpt":"Many numerical methods require solution of a sequence of linear systems with the same matrix and similar right-hand sides. Krylov subspace methods are a common tool for solving such linear systems, and a carefully chosen initial guess for the solution can reduce the total number of iterations, and thereby the total computational cost, required for convergence to a specified numerical tolerance. This paper introduces the WING algorithm, a modification of Fischer's second algorithm, which lowers the cost of forming an acceptably close initial guess by skipping orthogonalization and solving the p"},"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":"2606.10132","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-08T20:07:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"10c2e578dcfb41e32ce2b05860aba42cd59300f73f0a4989530981ea57cc012a","abstract_canon_sha256":"43c07d7aa44bf1d8f4f928209f4d331bd8025fcc1bf821548e0a9da13ca69182"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:55.989713Z","signature_b64":"/RWZoi2P0nRXIN77WWJBme7BuJWI9I9ljS98/tOtdZl506pThl4rjKzWYLN5gNM15ZO2WEsoID7UCJklwoOcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"915e51610a593c3e2eabe1fa37265c01c4a79ade94fb03c60d52c1c8f7f25cb8","last_reissued_at":"2026-06-10T01:08:55.988835Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:55.988835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WING: A Simple Windowed Nonorthogonalized Initial Guess Procedure for Repeated Matrix Solves","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Boyce E. Griffith, David Wells, Matthew G. Knepley","submitted_at":"2026-06-08T20:07:52Z","abstract_excerpt":"Many numerical methods require solution of a sequence of linear systems with the same matrix and similar right-hand sides. Krylov subspace methods are a common tool for solving such linear systems, and a carefully chosen initial guess for the solution can reduce the total number of iterations, and thereby the total computational cost, required for convergence to a specified numerical tolerance. This paper introduces the WING algorithm, a modification of Fischer's second algorithm, which lowers the cost of forming an acceptably close initial guess by skipping orthogonalization and solving the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10132","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/2606.10132/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":"2606.10132","created_at":"2026-06-10T01:08:55.988963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10132v1","created_at":"2026-06-10T01:08:55.988963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10132","created_at":"2026-06-10T01:08:55.988963+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFPFCYIKLE6D","created_at":"2026-06-10T01:08:55.988963+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFPFCYIKLE6D4LVL","created_at":"2026-06-10T01:08:55.988963+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFPFCYIK","created_at":"2026-06-10T01:08:55.988963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH","json":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH.json","graph_json":"https://pith.science/api/pith-number/SFPFCYIKLE6D4LVL4H5DOJS4AH/graph.json","events_json":"https://pith.science/api/pith-number/SFPFCYIKLE6D4LVL4H5DOJS4AH/events.json","paper":"https://pith.science/paper/SFPFCYIK"},"agent_actions":{"view_html":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH","download_json":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH.json","view_paper":"https://pith.science/paper/SFPFCYIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10132&json=true","fetch_graph":"https://pith.science/api/pith-number/SFPFCYIKLE6D4LVL4H5DOJS4AH/graph.json","fetch_events":"https://pith.science/api/pith-number/SFPFCYIKLE6D4LVL4H5DOJS4AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH/action/storage_attestation","attest_author":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH/action/author_attestation","sign_citation":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH/action/citation_signature","submit_replication":"https://pith.science/pith/SFPFCYIKLE6D4LVL4H5DOJS4AH/action/replication_record"}},"created_at":"2026-06-10T01:08:55.988963+00:00","updated_at":"2026-06-10T01:08:55.988963+00:00"}