{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3AXN6KN7K7BFBTAHBSYZTA4ICH","short_pith_number":"pith:3AXN6KN7","schema_version":"1.0","canonical_sha256":"d82edf29bf57c250cc070cb199838811fc5a6af985fa5fe2fbd7b00462998f41","source":{"kind":"arxiv","id":"2505.04155","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive Mixed Precision and Dynamically Scaled Preconditioned Conjugate Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric de Sturler, Tim Warburton, Yichen Guo","submitted_at":"2025-05-07T06:11:49Z","abstract_excerpt":"We propose an adaptive mixed precision and dynamically scaled preconditioned conjugate gradient algorithm (AMP-PCG). It dynamically adjusts the precision for storing vectors and computing, exploiting low precision when appropriate, while maintaining a convergence rate and accuracy comparable to that of double precision PCG. Our mixed precision strategy consists of three main components: (1) The residual and matrix-vector product are initially computed in double precision, and the algorithm switches these to single precision based on the chosen convergence tolerance and an estimate of the resid"},"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":"2505.04155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-05-07T06:11:49Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"9e5767074c4e7fb1ca56438cc5e41c5d383b96f77476c4afbee70c53bbea3e04","abstract_canon_sha256":"4d0d84c5954af3a3aaafc3f8c1c98338733640be56f09427a5f02bb7e3c5b635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:37.570732Z","signature_b64":"HEy3t3vK5nSoirO/y+xZDKtO4ruthBRmvqK4GkwcaIDDLwhcyC/EPs73ykL0VYs+fOBkGWo4i9usNUvMyGH8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82edf29bf57c250cc070cb199838811fc5a6af985fa5fe2fbd7b00462998f41","last_reissued_at":"2026-07-05T10:59:37.570235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:37.570235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Mixed Precision and Dynamically Scaled Preconditioned Conjugate Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric de Sturler, Tim Warburton, Yichen Guo","submitted_at":"2025-05-07T06:11:49Z","abstract_excerpt":"We propose an adaptive mixed precision and dynamically scaled preconditioned conjugate gradient algorithm (AMP-PCG). It dynamically adjusts the precision for storing vectors and computing, exploiting low precision when appropriate, while maintaining a convergence rate and accuracy comparable to that of double precision PCG. Our mixed precision strategy consists of three main components: (1) The residual and matrix-vector product are initially computed in double precision, and the algorithm switches these to single precision based on the chosen convergence tolerance and an estimate of the resid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04155","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/2505.04155/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":"2505.04155","created_at":"2026-07-05T10:59:37.570294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04155v1","created_at":"2026-07-05T10:59:37.570294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04155","created_at":"2026-07-05T10:59:37.570294+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AXN6KN7K7BF","created_at":"2026-07-05T10:59:37.570294+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AXN6KN7K7BFBTAH","created_at":"2026-07-05T10:59:37.570294+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AXN6KN7","created_at":"2026-07-05T10:59:37.570294+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21695","citing_title":"Efficient Domain Decomposition for the Helmholtz Equation on GPUs","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13433","citing_title":"PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH","json":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH.json","graph_json":"https://pith.science/api/pith-number/3AXN6KN7K7BFBTAHBSYZTA4ICH/graph.json","events_json":"https://pith.science/api/pith-number/3AXN6KN7K7BFBTAHBSYZTA4ICH/events.json","paper":"https://pith.science/paper/3AXN6KN7"},"agent_actions":{"view_html":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH","download_json":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH.json","view_paper":"https://pith.science/paper/3AXN6KN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04155&json=true","fetch_graph":"https://pith.science/api/pith-number/3AXN6KN7K7BFBTAHBSYZTA4ICH/graph.json","fetch_events":"https://pith.science/api/pith-number/3AXN6KN7K7BFBTAHBSYZTA4ICH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH/action/storage_attestation","attest_author":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH/action/author_attestation","sign_citation":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH/action/citation_signature","submit_replication":"https://pith.science/pith/3AXN6KN7K7BFBTAHBSYZTA4ICH/action/replication_record"}},"created_at":"2026-07-05T10:59:37.570294+00:00","updated_at":"2026-07-05T10:59:37.570294+00:00"}