{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RJD5VR5EQGZJUZ23QHZ2ZDYJV4","short_pith_number":"pith:RJD5VR5E","schema_version":"1.0","canonical_sha256":"8a47dac7a481b29a675b81f3ac8f09af0a04d9b50d6c36ac8019390a81f6f4aa","source":{"kind":"arxiv","id":"1605.04580","version":1},"attestation_state":"computed","paper":{"title":"TwinCG: Dual Thread Redundancy with Forward Recovery for Conjugate Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dimitrios S. Nikolopoulos, Kiril Dichev","submitted_at":"2016-05-15T17:34:57Z","abstract_excerpt":"Even though iterative solvers like the Conjugate Gradients method (CG) have been studied for over fifty years, fault tolerance for such solvers has seen much attention in recent years. For iterative solvers, two major reliable strategies of recovery exist: checkpoint-restart for backward recovery, or some type of redundancy technique for forward recovery. Important redundancy techniques like ABFT techniques for sparse matrix-vector products (SpMxV) have recently been proposed, which increase the resilience of CG methods. These techniques offer limited recovery options, and introduce a tolerabl"},"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":"1605.04580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-15T17:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"7291d130529a03f2691df7cfb797badfc0668fb170bc706be51b3aa7c314b1ed","abstract_canon_sha256":"0de3d5f75b5830e559969c2f3baeacc727f3c120c2231b15345f1553422299a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.809629Z","signature_b64":"tBPYWn1FBJLtQKUVu8FMEatOif8qI56H9zAqO1U2Up32RtHJesxdUATLkCQm7y268eQMxZQXhPOhmSSLk9NqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a47dac7a481b29a675b81f3ac8f09af0a04d9b50d6c36ac8019390a81f6f4aa","last_reissued_at":"2026-05-18T01:14:46.808930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.808930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TwinCG: Dual Thread Redundancy with Forward Recovery for Conjugate Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dimitrios S. Nikolopoulos, Kiril Dichev","submitted_at":"2016-05-15T17:34:57Z","abstract_excerpt":"Even though iterative solvers like the Conjugate Gradients method (CG) have been studied for over fifty years, fault tolerance for such solvers has seen much attention in recent years. For iterative solvers, two major reliable strategies of recovery exist: checkpoint-restart for backward recovery, or some type of redundancy technique for forward recovery. Important redundancy techniques like ABFT techniques for sparse matrix-vector products (SpMxV) have recently been proposed, which increase the resilience of CG methods. These techniques offer limited recovery options, and introduce a tolerabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04580","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":"1605.04580","created_at":"2026-05-18T01:14:46.809045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04580v1","created_at":"2026-05-18T01:14:46.809045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04580","created_at":"2026-05-18T01:14:46.809045+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJD5VR5EQGZJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJD5VR5EQGZJUZ23","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJD5VR5E","created_at":"2026-05-18T12:30:41.710351+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/RJD5VR5EQGZJUZ23QHZ2ZDYJV4","json":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4.json","graph_json":"https://pith.science/api/pith-number/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/graph.json","events_json":"https://pith.science/api/pith-number/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/events.json","paper":"https://pith.science/paper/RJD5VR5E"},"agent_actions":{"view_html":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4","download_json":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4.json","view_paper":"https://pith.science/paper/RJD5VR5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04580&json=true","fetch_graph":"https://pith.science/api/pith-number/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/graph.json","fetch_events":"https://pith.science/api/pith-number/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/action/storage_attestation","attest_author":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/action/author_attestation","sign_citation":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/action/citation_signature","submit_replication":"https://pith.science/pith/RJD5VR5EQGZJUZ23QHZ2ZDYJV4/action/replication_record"}},"created_at":"2026-05-18T01:14:46.809045+00:00","updated_at":"2026-05-18T01:14:46.809045+00:00"}