{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:55EN3JIWJWGFIRNWJBW6LKQEM3","short_pith_number":"pith:55EN3JIW","schema_version":"1.0","canonical_sha256":"ef48dda5164d8c5445b6486de5aa0466d0806931752339884c2a050abe50d6b0","source":{"kind":"arxiv","id":"1807.07476","version":3},"attestation_state":"computed","paper":{"title":"Minimizing convex quadratic with variable precision conjugate gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"D. Titley-Peloquin, E. Simon, Ph. L. Toint, S. Gratton","submitted_at":"2018-07-17T14:10:15Z","abstract_excerpt":"We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring in the theoretical bounds estimated, leading to a practical algorithm. Numerical experiments suggest that this approach has significant potential, including in the steadily more important context of multi-precision computations"},"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":"1807.07476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-17T14:10:15Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"3174a7147a33cd10bbecead626463e3d373840108cf3cb48b16e9347553cb910","abstract_canon_sha256":"7a4fc6952ce3bca0757eb06b1e198c0e1e738c804b20753757c45ced6928c7fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:12:08.332567Z","signature_b64":"logwlEtCcCima/cmyEb0AyBfzHaohNs5ylApzAzqj8FvV06iKqhSkXAHAORFxdgtO8j+gcUC6DDaYIig12XfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef48dda5164d8c5445b6486de5aa0466d0806931752339884c2a050abe50d6b0","last_reissued_at":"2026-06-04T19:12:08.332156Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:12:08.332156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing convex quadratic with variable precision conjugate gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"D. Titley-Peloquin, E. Simon, Ph. L. Toint, S. Gratton","submitted_at":"2018-07-17T14:10:15Z","abstract_excerpt":"We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring in the theoretical bounds estimated, leading to a practical algorithm. Numerical experiments suggest that this approach has significant potential, including in the steadily more important context of multi-precision computations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07476","kind":"arxiv","version":3},"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/1807.07476/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":"1807.07476","created_at":"2026-06-04T19:12:08.332219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07476v3","created_at":"2026-06-04T19:12:08.332219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07476","created_at":"2026-06-04T19:12:08.332219+00:00"},{"alias_kind":"pith_short_12","alias_value":"55EN3JIWJWGF","created_at":"2026-06-04T19:12:08.332219+00:00"},{"alias_kind":"pith_short_16","alias_value":"55EN3JIWJWGFIRNW","created_at":"2026-06-04T19:12:08.332219+00:00"},{"alias_kind":"pith_short_8","alias_value":"55EN3JIW","created_at":"2026-06-04T19:12:08.332219+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/55EN3JIWJWGFIRNWJBW6LKQEM3","json":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3.json","graph_json":"https://pith.science/api/pith-number/55EN3JIWJWGFIRNWJBW6LKQEM3/graph.json","events_json":"https://pith.science/api/pith-number/55EN3JIWJWGFIRNWJBW6LKQEM3/events.json","paper":"https://pith.science/paper/55EN3JIW"},"agent_actions":{"view_html":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3","download_json":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3.json","view_paper":"https://pith.science/paper/55EN3JIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07476&json=true","fetch_graph":"https://pith.science/api/pith-number/55EN3JIWJWGFIRNWJBW6LKQEM3/graph.json","fetch_events":"https://pith.science/api/pith-number/55EN3JIWJWGFIRNWJBW6LKQEM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3/action/storage_attestation","attest_author":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3/action/author_attestation","sign_citation":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3/action/citation_signature","submit_replication":"https://pith.science/pith/55EN3JIWJWGFIRNWJBW6LKQEM3/action/replication_record"}},"created_at":"2026-06-04T19:12:08.332219+00:00","updated_at":"2026-06-04T19:12:08.332219+00:00"}