{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7D4KMFGQPD6TB2K6264I7NVP4","short_pith_number":"pith:K7D4KMFG","schema_version":"1.0","canonical_sha256":"57c7c530a683c7e9874af6bdc47db57f322ca7e99f9b7c97aefab955dd50dfc4","source":{"kind":"arxiv","id":"2412.08059","version":7},"attestation_state":"computed","paper":{"title":"Parameter optimization for restarted mixed precision iterative sparse solver","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander V. Prolubnikov","submitted_at":"2024-12-11T03:02:58Z","abstract_excerpt":"The problem of optimal precision switching for the conjugate gradient (CG) method applied to sparse linear systems is considered. A sparse matrix is defined as an $n\\!\\times\\!n$ matrix with $m\\!=\\!O(n)$ nonzero entries. The algorithm first computes an approximate solution in single precision with tolerance $\\varepsilon_1$, then switches to double precision to refine the solution to the required stopping tolerance $\\varepsilon_2$. Based on estimates of system matrix parameters -- computed in time which does not exceed $1\\%$ of the time needed to solve the system in double precision -- we determ"},"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":"2412.08059","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2024-12-11T03:02:58Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4844704049bfb89283751ab6fb3e1e2243f81b66bbd0f3c97a033ab8b8c22114","abstract_canon_sha256":"d6df93ce011f6eaec171f539ed6728e8dc771f5607498cef5ac4c9c3a2159c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:19.654079Z","signature_b64":"naVoW8w64A5IW4EpooCsnAh/yR/RllFKLNdX+uP/yXNF8u2v1t1qSwTxgWKemVyjzcgbwQ4/60UGzmJ0N2lVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c7c530a683c7e9874af6bdc47db57f322ca7e99f9b7c97aefab955dd50dfc4","last_reissued_at":"2026-06-12T01:10:19.653074Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:19.653074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter optimization for restarted mixed precision iterative sparse solver","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander V. Prolubnikov","submitted_at":"2024-12-11T03:02:58Z","abstract_excerpt":"The problem of optimal precision switching for the conjugate gradient (CG) method applied to sparse linear systems is considered. A sparse matrix is defined as an $n\\!\\times\\!n$ matrix with $m\\!=\\!O(n)$ nonzero entries. The algorithm first computes an approximate solution in single precision with tolerance $\\varepsilon_1$, then switches to double precision to refine the solution to the required stopping tolerance $\\varepsilon_2$. Based on estimates of system matrix parameters -- computed in time which does not exceed $1\\%$ of the time needed to solve the system in double precision -- we determ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08059","kind":"arxiv","version":7},"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/2412.08059/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":"2412.08059","created_at":"2026-06-12T01:10:19.653277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08059v7","created_at":"2026-06-12T01:10:19.653277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08059","created_at":"2026-06-12T01:10:19.653277+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7D4KMFGQPD6","created_at":"2026-06-12T01:10:19.653277+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7D4KMFGQPD6TB2K","created_at":"2026-06-12T01:10:19.653277+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7D4KMFG","created_at":"2026-06-12T01:10:19.653277+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/K7D4KMFGQPD6TB2K6264I7NVP4","json":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4.json","graph_json":"https://pith.science/api/pith-number/K7D4KMFGQPD6TB2K6264I7NVP4/graph.json","events_json":"https://pith.science/api/pith-number/K7D4KMFGQPD6TB2K6264I7NVP4/events.json","paper":"https://pith.science/paper/K7D4KMFG"},"agent_actions":{"view_html":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4","download_json":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4.json","view_paper":"https://pith.science/paper/K7D4KMFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08059&json=true","fetch_graph":"https://pith.science/api/pith-number/K7D4KMFGQPD6TB2K6264I7NVP4/graph.json","fetch_events":"https://pith.science/api/pith-number/K7D4KMFGQPD6TB2K6264I7NVP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4/action/storage_attestation","attest_author":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4/action/author_attestation","sign_citation":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4/action/citation_signature","submit_replication":"https://pith.science/pith/K7D4KMFGQPD6TB2K6264I7NVP4/action/replication_record"}},"created_at":"2026-06-12T01:10:19.653277+00:00","updated_at":"2026-06-12T01:10:19.653277+00:00"}