{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NEFMG2OAMAM63LS4C2ZEUIMLUQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6d6664e50e33632f83fbb908443e1a60f2cd16532b2e7c49c632a1ef32840540","cross_cats_sorted":["cs.DS","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-01T21:11:30Z","title_canon_sha256":"826efad4847448d1ac4131ed347deca488e2764e74ebc3618915757f26290832"},"schema_version":"1.0","source":{"id":"1908.00633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00633","created_at":"2026-07-05T09:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00633v1","created_at":"2026-07-05T09:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00633","created_at":"2026-07-05T09:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"NEFMG2OAMAM6","created_at":"2026-07-05T09:09:46Z"},{"alias_kind":"pith_short_16","alias_value":"NEFMG2OAMAM63LS4","created_at":"2026-07-05T09:09:46Z"},{"alias_kind":"pith_short_8","alias_value":"NEFMG2OA","created_at":"2026-07-05T09:09:46Z"}],"graph_snapshots":[{"event_id":"sha256:47e712f40464ca4c29c4a3ec22478487f4458542fc54f253fe7da7dc9739ecb0","target":"graph","created_at":"2026-07-05T09:09:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00633/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Conner DiPaolo, Weiqing Gu","cross_cats":["cs.DS","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-01T21:11:30Z","title":"A Randomized Algorithm for Preconditioner Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00633","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:39115ff8964dcf7c3732c6c47d33da5205f12d9cdab93ab3c758da86678fdfe4","target":"record","created_at":"2026-07-05T09:09:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6d6664e50e33632f83fbb908443e1a60f2cd16532b2e7c49c632a1ef32840540","cross_cats_sorted":["cs.DS","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-01T21:11:30Z","title_canon_sha256":"826efad4847448d1ac4131ed347deca488e2764e74ebc3618915757f26290832"},"schema_version":"1.0","source":{"id":"1908.00633","kind":"arxiv","version":1}},"canonical_sha256":"690ac369c06019edae5c16b24a218ba40f145074bb875269f17ca72da7311b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690ac369c06019edae5c16b24a218ba40f145074bb875269f17ca72da7311b2e","first_computed_at":"2026-07-05T09:09:46.146675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:46.146675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I0T5SoMGl8szF9qTmTJLm4qPxllyvs6KeUMapJVREhFY64W1i+xl54KuJE4TApgFxg91Wv3Sq9lB3vMSR7TvBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:46.147069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39115ff8964dcf7c3732c6c47d33da5205f12d9cdab93ab3c758da86678fdfe4","sha256:47e712f40464ca4c29c4a3ec22478487f4458542fc54f253fe7da7dc9739ecb0"],"state_sha256":"39390f623310811108d52b2f901acd7d43e6d3e534e13a982b55cf0209486418"}