{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F6KMABHOUIEVNVMI25YS7EDGZK","short_pith_number":"pith:F6KMABHO","schema_version":"1.0","canonical_sha256":"2f94c004eea20956d588d7712f9066ca8c786d215fca29626647e8f74d15b91d","source":{"kind":"arxiv","id":"2212.06644","version":2},"attestation_state":"computed","paper":{"title":"Fast Number Parsing Without Fallback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lemire, Noble Mushtak","submitted_at":"2022-12-13T15:26:46Z","abstract_excerpt":"In recent work, Lemire (2021) presented a fast algorithm to convert number strings into binary floating-point numbers. The algorithm has been adopted by several important systems: e.g., it is part of the runtime libraries of GCC 12, Rust 1.55, and Go 1.16. The algorithm parses any number string with a significand containing no more than 19 digits into an IEEE floating-point number. However, there is a check leading to a fallback function to ensure correctness. This fallback function is never called in practice. We prove that the fallback is unnecessary. Thus we can slightly simplify the algori"},"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":"2212.06644","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-13T15:26:46Z","cross_cats_sorted":[],"title_canon_sha256":"7bf23d1a98fd80de0182f073bcd73f4338fedb33b5e55ccbe34aa662631f71a7","abstract_canon_sha256":"cc10b009a014d2855eb4901951d5f4d34346bbaf30093aa3364356752a114b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:27.259281Z","signature_b64":"2kI7JktfBfXm3HReo43BTiQ5Fv+d0RZxhnAR8maCf7yvGHvTFisGaJKzKWMqGZ0bj4lSo8bZejXC38qe9rrXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f94c004eea20956d588d7712f9066ca8c786d215fca29626647e8f74d15b91d","last_reissued_at":"2026-07-05T06:17:27.258883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:27.258883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Number Parsing Without Fallback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lemire, Noble Mushtak","submitted_at":"2022-12-13T15:26:46Z","abstract_excerpt":"In recent work, Lemire (2021) presented a fast algorithm to convert number strings into binary floating-point numbers. The algorithm has been adopted by several important systems: e.g., it is part of the runtime libraries of GCC 12, Rust 1.55, and Go 1.16. The algorithm parses any number string with a significand containing no more than 19 digits into an IEEE floating-point number. However, there is a check leading to a fallback function to ensure correctness. This fallback function is never called in practice. We prove that the fallback is unnecessary. Thus we can slightly simplify the algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06644","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.06644/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":"2212.06644","created_at":"2026-07-05T06:17:27.258940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06644v2","created_at":"2026-07-05T06:17:27.258940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06644","created_at":"2026-07-05T06:17:27.258940+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6KMABHOUIEV","created_at":"2026-07-05T06:17:27.258940+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6KMABHOUIEVNVMI","created_at":"2026-07-05T06:17:27.258940+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6KMABHO","created_at":"2026-07-05T06:17:27.258940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11717","citing_title":"G\\\"{o}del-type universes in unimodular gravity","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK","json":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK.json","graph_json":"https://pith.science/api/pith-number/F6KMABHOUIEVNVMI25YS7EDGZK/graph.json","events_json":"https://pith.science/api/pith-number/F6KMABHOUIEVNVMI25YS7EDGZK/events.json","paper":"https://pith.science/paper/F6KMABHO"},"agent_actions":{"view_html":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK","download_json":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK.json","view_paper":"https://pith.science/paper/F6KMABHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06644&json=true","fetch_graph":"https://pith.science/api/pith-number/F6KMABHOUIEVNVMI25YS7EDGZK/graph.json","fetch_events":"https://pith.science/api/pith-number/F6KMABHOUIEVNVMI25YS7EDGZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK/action/storage_attestation","attest_author":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK/action/author_attestation","sign_citation":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK/action/citation_signature","submit_replication":"https://pith.science/pith/F6KMABHOUIEVNVMI25YS7EDGZK/action/replication_record"}},"created_at":"2026-07-05T06:17:27.258940+00:00","updated_at":"2026-07-05T06:17:27.258940+00:00"}