{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F25UZUQ2QIT7PQBILRDK62LR2S","short_pith_number":"pith:F25UZUQ2","schema_version":"1.0","canonical_sha256":"2ebb4cd21a8227f7c0285c46af6971d48003dd2b34045003b56db25b56e531e7","source":{"kind":"arxiv","id":"1408.5946","version":2},"attestation_state":"computed","paper":{"title":"Algorithms that satisfy a stopping criterion, probably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Farbod Roosta-Khorasani, Uri Ascher","submitted_at":"2014-08-25T23:23:56Z","abstract_excerpt":"Iterative numerical algorithms are typically equipped with a stopping criterion, where the iteration process is terminated when some error or misfit measure is deemed to be below a given tolerance. This is a useful setting for comparing algorithm performance, among other purposes. However, in practical applications a precise value for such a tolerance is rarely known; rather, only some possibly vague idea of the desired quality of the numerical approximation is at hand. We discuss four case studies from different areas of numerical computation, where uncertainty in the error tolerance value an"},"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":"1408.5946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-08-25T23:23:56Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"f51079a2186edd1f250ea29946e10d214ae0ba10c0a469ad014ccd8e23f65a29","abstract_canon_sha256":"1b65e35d50c8b7fd336b3c4f4840b311e2ee62ce479bd33360c14b56a383a4cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:13.761069Z","signature_b64":"sUN7S5Ar57Qgwl8FnB3fERCO8O3Z2WHVrymK1UQhbG7hipDufB+Hrbb/WG0uQDhRgvfUCXe9G7lQ8GJh0RM/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ebb4cd21a8227f7c0285c46af6971d48003dd2b34045003b56db25b56e531e7","last_reissued_at":"2026-05-18T02:32:13.760504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:13.760504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms that satisfy a stopping criterion, probably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Farbod Roosta-Khorasani, Uri Ascher","submitted_at":"2014-08-25T23:23:56Z","abstract_excerpt":"Iterative numerical algorithms are typically equipped with a stopping criterion, where the iteration process is terminated when some error or misfit measure is deemed to be below a given tolerance. This is a useful setting for comparing algorithm performance, among other purposes. However, in practical applications a precise value for such a tolerance is rarely known; rather, only some possibly vague idea of the desired quality of the numerical approximation is at hand. We discuss four case studies from different areas of numerical computation, where uncertainty in the error tolerance value an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5946","kind":"arxiv","version":2},"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":"1408.5946","created_at":"2026-05-18T02:32:13.760601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5946v2","created_at":"2026-05-18T02:32:13.760601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5946","created_at":"2026-05-18T02:32:13.760601+00:00"},{"alias_kind":"pith_short_12","alias_value":"F25UZUQ2QIT7","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F25UZUQ2QIT7PQBI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F25UZUQ2","created_at":"2026-05-18T12:28:28.263976+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/F25UZUQ2QIT7PQBILRDK62LR2S","json":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S.json","graph_json":"https://pith.science/api/pith-number/F25UZUQ2QIT7PQBILRDK62LR2S/graph.json","events_json":"https://pith.science/api/pith-number/F25UZUQ2QIT7PQBILRDK62LR2S/events.json","paper":"https://pith.science/paper/F25UZUQ2"},"agent_actions":{"view_html":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S","download_json":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S.json","view_paper":"https://pith.science/paper/F25UZUQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5946&json=true","fetch_graph":"https://pith.science/api/pith-number/F25UZUQ2QIT7PQBILRDK62LR2S/graph.json","fetch_events":"https://pith.science/api/pith-number/F25UZUQ2QIT7PQBILRDK62LR2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S/action/storage_attestation","attest_author":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S/action/author_attestation","sign_citation":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S/action/citation_signature","submit_replication":"https://pith.science/pith/F25UZUQ2QIT7PQBILRDK62LR2S/action/replication_record"}},"created_at":"2026-05-18T02:32:13.760601+00:00","updated_at":"2026-05-18T02:32:13.760601+00:00"}