{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U45SYGSERNWM2XI4ZPTGKMY6V3","short_pith_number":"pith:U45SYGSE","schema_version":"1.0","canonical_sha256":"a73b2c1a448b6ccd5d1ccbe665331eaed40fb44cf52d9348952f979caf23ea39","source":{"kind":"arxiv","id":"2408.03069","version":3},"attestation_state":"computed","paper":{"title":"Probabilistic error analysis of limited-precision stochastic rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"El-Mehdi El Arar (TARAN), Mantas Mikaitis, Massimiliano Fasi, Silviu-Ioan Filip (TARAN)","submitted_at":"2024-08-06T09:54:21Z","abstract_excerpt":"Classical probabilistic rounding error analysis is particularly well suited to stochastic rounding (SR), and it yields strong results when dealing with floating-point algorithms that rely heavily on summation. For many numerical linear algebra algorithms, one can prove probabilistic error bounds that grow as O(nu), where n is the problem size and u is the unit roundoff. These probabilistic bounds are asymptotically tighter than the worst-case ones, which grow as O(nu). For certain classes of algorithms, SR has been shown to be unbiased. However, all these results were derived under the assumpt"},"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":"2408.03069","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-08-06T09:54:21Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"5e8a6d14608b3cc76b1caf7b0fd4163b8fbe703e958f83872b634e40d4c2c122","abstract_canon_sha256":"785cfc82c20fed758239337e8341a771c148cdc81749bb7bd2fd80a93f26bfca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:26.777996Z","signature_b64":"gjZtif8Tjm9oA+55xoCLHrYffGp13l3P4U4mKguZ00H3IbDND6VcVLivPKOnE/89POhOCPN1aC7ZRhuynZj9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a73b2c1a448b6ccd5d1ccbe665331eaed40fb44cf52d9348952f979caf23ea39","last_reissued_at":"2026-07-05T10:19:26.777588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:26.777588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic error analysis of limited-precision stochastic rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"El-Mehdi El Arar (TARAN), Mantas Mikaitis, Massimiliano Fasi, Silviu-Ioan Filip (TARAN)","submitted_at":"2024-08-06T09:54:21Z","abstract_excerpt":"Classical probabilistic rounding error analysis is particularly well suited to stochastic rounding (SR), and it yields strong results when dealing with floating-point algorithms that rely heavily on summation. For many numerical linear algebra algorithms, one can prove probabilistic error bounds that grow as O(nu), where n is the problem size and u is the unit roundoff. These probabilistic bounds are asymptotically tighter than the worst-case ones, which grow as O(nu). For certain classes of algorithms, SR has been shown to be unbiased. However, all these results were derived under the assumpt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03069","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/2408.03069/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":"2408.03069","created_at":"2026-07-05T10:19:26.777645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03069v3","created_at":"2026-07-05T10:19:26.777645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03069","created_at":"2026-07-05T10:19:26.777645+00:00"},{"alias_kind":"pith_short_12","alias_value":"U45SYGSERNWM","created_at":"2026-07-05T10:19:26.777645+00:00"},{"alias_kind":"pith_short_16","alias_value":"U45SYGSERNWM2XI4","created_at":"2026-07-05T10:19:26.777645+00:00"},{"alias_kind":"pith_short_8","alias_value":"U45SYGSE","created_at":"2026-07-05T10:19:26.777645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20634","citing_title":"On Stochastic Rounding with Few Random Bits","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3","json":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3.json","graph_json":"https://pith.science/api/pith-number/U45SYGSERNWM2XI4ZPTGKMY6V3/graph.json","events_json":"https://pith.science/api/pith-number/U45SYGSERNWM2XI4ZPTGKMY6V3/events.json","paper":"https://pith.science/paper/U45SYGSE"},"agent_actions":{"view_html":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3","download_json":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3.json","view_paper":"https://pith.science/paper/U45SYGSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03069&json=true","fetch_graph":"https://pith.science/api/pith-number/U45SYGSERNWM2XI4ZPTGKMY6V3/graph.json","fetch_events":"https://pith.science/api/pith-number/U45SYGSERNWM2XI4ZPTGKMY6V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3/action/storage_attestation","attest_author":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3/action/author_attestation","sign_citation":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3/action/citation_signature","submit_replication":"https://pith.science/pith/U45SYGSERNWM2XI4ZPTGKMY6V3/action/replication_record"}},"created_at":"2026-07-05T10:19:26.777645+00:00","updated_at":"2026-07-05T10:19:26.777645+00:00"}