{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3Z4CHVXWPL5574OTCLVMBHKMGC","short_pith_number":"pith:3Z4CHVXW","schema_version":"1.0","canonical_sha256":"de7823d6f67afbdff1d312eac09d4c30b96ca8f51229c99a8863071ed702ee8d","source":{"kind":"arxiv","id":"1701.03989","version":1},"attestation_state":"computed","paper":{"title":"The Adaptive $s$-step Conjugate Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Erin Carson","submitted_at":"2017-01-15T03:17:00Z","abstract_excerpt":"On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of $s$-step Krylov subspace method variants, in which iterations are computed in blocks of $s$, which can reduce the number of global synchronizations per iteration by a factor of $O(s)$.\n  Although the $s$-step variants are mathematically equivalent to their classical counterparts, they can behave quite differently in finite precision depending on the parameter $s$. If $s$ is chosen too large, the $s$-step method can suffer a co"},"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":"1701.03989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-01-15T03:17:00Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"b1a768e4e4cb84a7e4c238ed29281b0d9b0959ca9c12a203f895293303d8b933","abstract_canon_sha256":"5128f62fb9526c8cb7ffb110d9a310523d3a82a29df41dcdbee8e912b6c13849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.921732Z","signature_b64":"rv6kkjnuvXzD8AoYbZLfMOfWixOh6IxIq8pd0EB+SlT71oq2XnNLoWm0FpNTzdF/RL7w/x6xbxMpnmuU5LxSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7823d6f67afbdff1d312eac09d4c30b96ca8f51229c99a8863071ed702ee8d","last_reissued_at":"2026-05-18T00:51:01.921233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.921233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Adaptive $s$-step Conjugate Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Erin Carson","submitted_at":"2017-01-15T03:17:00Z","abstract_excerpt":"On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of $s$-step Krylov subspace method variants, in which iterations are computed in blocks of $s$, which can reduce the number of global synchronizations per iteration by a factor of $O(s)$.\n  Although the $s$-step variants are mathematically equivalent to their classical counterparts, they can behave quite differently in finite precision depending on the parameter $s$. If $s$ is chosen too large, the $s$-step method can suffer a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03989","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":""},"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":"1701.03989","created_at":"2026-05-18T00:51:01.921326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03989v1","created_at":"2026-05-18T00:51:01.921326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03989","created_at":"2026-05-18T00:51:01.921326+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z4CHVXWPL55","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z4CHVXWPL5574OT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z4CHVXW","created_at":"2026-05-18T12:30:58.224056+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/3Z4CHVXWPL5574OTCLVMBHKMGC","json":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC.json","graph_json":"https://pith.science/api/pith-number/3Z4CHVXWPL5574OTCLVMBHKMGC/graph.json","events_json":"https://pith.science/api/pith-number/3Z4CHVXWPL5574OTCLVMBHKMGC/events.json","paper":"https://pith.science/paper/3Z4CHVXW"},"agent_actions":{"view_html":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC","download_json":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC.json","view_paper":"https://pith.science/paper/3Z4CHVXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03989&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z4CHVXWPL5574OTCLVMBHKMGC/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z4CHVXWPL5574OTCLVMBHKMGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC/action/storage_attestation","attest_author":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC/action/author_attestation","sign_citation":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC/action/citation_signature","submit_replication":"https://pith.science/pith/3Z4CHVXWPL5574OTCLVMBHKMGC/action/replication_record"}},"created_at":"2026-05-18T00:51:01.921326+00:00","updated_at":"2026-05-18T00:51:01.921326+00:00"}