{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NEFMG2OAMAM63LS4C2ZEUIMLUQ","short_pith_number":"pith:NEFMG2OA","schema_version":"1.0","canonical_sha256":"690ac369c06019edae5c16b24a218ba40f145074bb875269f17ca72da7311b2e","source":{"kind":"arxiv","id":"1908.00633","version":1},"attestation_state":"computed","paper":{"title":"A Randomized Algorithm for Preconditioner Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","stat.ML"],"primary_cat":"math.NA","authors_text":"Conner DiPaolo, Weiqing Gu","submitted_at":"2019-08-01T21:11:30Z","abstract_excerpt":"The task of choosing a preconditioner $\\boldsymbol{M}$ to use when solving a linear system $\\boldsymbol{Ax}=\\boldsymbol{b}$ with iterative methods is difficult. For instance, even if one has access to a collection $\\boldsymbol{M}_1,\\boldsymbol{M}_2,\\ldots,\\boldsymbol{M}_n$ of candidate preconditioners, it is currently unclear how to practically choose the $\\boldsymbol{M}_i$ which minimizes the number of iterations of an iterative algorithm to achieve a suitable approximation to $\\boldsymbol{x}$. This paper makes progress on this sub-problem by showing that the preconditioner stability $\\|\\bold"},"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":"1908.00633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-01T21:11:30Z","cross_cats_sorted":["cs.DS","cs.NA","stat.ML"],"title_canon_sha256":"826efad4847448d1ac4131ed347deca488e2764e74ebc3618915757f26290832","abstract_canon_sha256":"6d6664e50e33632f83fbb908443e1a60f2cd16532b2e7c49c632a1ef32840540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:46.147069Z","signature_b64":"I0T5SoMGl8szF9qTmTJLm4qPxllyvs6KeUMapJVREhFY64W1i+xl54KuJE4TApgFxg91Wv3Sq9lB3vMSR7TvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690ac369c06019edae5c16b24a218ba40f145074bb875269f17ca72da7311b2e","last_reissued_at":"2026-07-05T09:09:46.146675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:46.146675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomized Algorithm for Preconditioner Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","stat.ML"],"primary_cat":"math.NA","authors_text":"Conner DiPaolo, Weiqing Gu","submitted_at":"2019-08-01T21:11:30Z","abstract_excerpt":"The task of choosing a preconditioner $\\boldsymbol{M}$ to use when solving a linear system $\\boldsymbol{Ax}=\\boldsymbol{b}$ with iterative methods is difficult. For instance, even if one has access to a collection $\\boldsymbol{M}_1,\\boldsymbol{M}_2,\\ldots,\\boldsymbol{M}_n$ of candidate preconditioners, it is currently unclear how to practically choose the $\\boldsymbol{M}_i$ which minimizes the number of iterations of an iterative algorithm to achieve a suitable approximation to $\\boldsymbol{x}$. This paper makes progress on this sub-problem by showing that the preconditioner stability $\\|\\bold"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00633","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/1908.00633/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":"1908.00633","created_at":"2026-07-05T09:09:46.146732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00633v1","created_at":"2026-07-05T09:09:46.146732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00633","created_at":"2026-07-05T09:09:46.146732+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEFMG2OAMAM6","created_at":"2026-07-05T09:09:46.146732+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEFMG2OAMAM63LS4","created_at":"2026-07-05T09:09:46.146732+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEFMG2OA","created_at":"2026-07-05T09:09:46.146732+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/NEFMG2OAMAM63LS4C2ZEUIMLUQ","json":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ.json","graph_json":"https://pith.science/api/pith-number/NEFMG2OAMAM63LS4C2ZEUIMLUQ/graph.json","events_json":"https://pith.science/api/pith-number/NEFMG2OAMAM63LS4C2ZEUIMLUQ/events.json","paper":"https://pith.science/paper/NEFMG2OA"},"agent_actions":{"view_html":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ","download_json":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ.json","view_paper":"https://pith.science/paper/NEFMG2OA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00633&json=true","fetch_graph":"https://pith.science/api/pith-number/NEFMG2OAMAM63LS4C2ZEUIMLUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NEFMG2OAMAM63LS4C2ZEUIMLUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ/action/storage_attestation","attest_author":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ/action/author_attestation","sign_citation":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ/action/citation_signature","submit_replication":"https://pith.science/pith/NEFMG2OAMAM63LS4C2ZEUIMLUQ/action/replication_record"}},"created_at":"2026-07-05T09:09:46.146732+00:00","updated_at":"2026-07-05T09:09:46.146732+00:00"}