{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MU46R57TVFBN2UMNAPIMQTI7DD","short_pith_number":"pith:MU46R57T","schema_version":"1.0","canonical_sha256":"6539e8f7f3a942dd518d03d0c84d1f18c7a277b700847ee97e0f86cad3571987","source":{"kind":"arxiv","id":"1603.09290","version":1},"attestation_state":"computed","paper":{"title":"LifeJacket: Verifying precise floating-point optimizations in LLVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andres N\\\"otzli, Fraser Brown","submitted_at":"2016-03-30T17:46:57Z","abstract_excerpt":"Optimizing floating-point arithmetic is vital because it is ubiquitous, costly, and used in compute-heavy workloads. Implementing precise optimizations correctly, however, is difficult, since developers must account for all the esoteric properties of floating-point arithmetic to ensure that their transformations do not alter the output of a program. Manual reasoning is error prone and stifles incorporation of new optimizations. We present an approach to automate reasoning about floating-point optimizations using satisfiability modulo theories (SMT) solvers. We implement the approach in LifeJac"},"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":"1603.09290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-30T17:46:57Z","cross_cats_sorted":[],"title_canon_sha256":"0903824cdbdccaf288f59920d542547e16f1bccbf7589bb607660bda5d993964","abstract_canon_sha256":"08e7f6a59f29e737835f44cef9b3b0daf43a595af0170a11afe0dc07510a2025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:00.862953Z","signature_b64":"HSm7ELgIY/9ZL/rC85e//9DMbfpEefnFfdoowFRM3o7GlWv0hM2FkIZWiXbGHWIRDhGbjlNk/XB3RHj9tHmhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6539e8f7f3a942dd518d03d0c84d1f18c7a277b700847ee97e0f86cad3571987","last_reissued_at":"2026-05-18T01:18:00.862038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:00.862038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LifeJacket: Verifying precise floating-point optimizations in LLVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andres N\\\"otzli, Fraser Brown","submitted_at":"2016-03-30T17:46:57Z","abstract_excerpt":"Optimizing floating-point arithmetic is vital because it is ubiquitous, costly, and used in compute-heavy workloads. Implementing precise optimizations correctly, however, is difficult, since developers must account for all the esoteric properties of floating-point arithmetic to ensure that their transformations do not alter the output of a program. Manual reasoning is error prone and stifles incorporation of new optimizations. We present an approach to automate reasoning about floating-point optimizations using satisfiability modulo theories (SMT) solvers. We implement the approach in LifeJac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09290","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":"1603.09290","created_at":"2026-05-18T01:18:00.862192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09290v1","created_at":"2026-05-18T01:18:00.862192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09290","created_at":"2026-05-18T01:18:00.862192+00:00"},{"alias_kind":"pith_short_12","alias_value":"MU46R57TVFBN","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MU46R57TVFBN2UMN","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MU46R57T","created_at":"2026-05-18T12:30:32.724797+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/MU46R57TVFBN2UMNAPIMQTI7DD","json":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD.json","graph_json":"https://pith.science/api/pith-number/MU46R57TVFBN2UMNAPIMQTI7DD/graph.json","events_json":"https://pith.science/api/pith-number/MU46R57TVFBN2UMNAPIMQTI7DD/events.json","paper":"https://pith.science/paper/MU46R57T"},"agent_actions":{"view_html":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD","download_json":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD.json","view_paper":"https://pith.science/paper/MU46R57T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09290&json=true","fetch_graph":"https://pith.science/api/pith-number/MU46R57TVFBN2UMNAPIMQTI7DD/graph.json","fetch_events":"https://pith.science/api/pith-number/MU46R57TVFBN2UMNAPIMQTI7DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD/action/storage_attestation","attest_author":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD/action/author_attestation","sign_citation":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD/action/citation_signature","submit_replication":"https://pith.science/pith/MU46R57TVFBN2UMNAPIMQTI7DD/action/replication_record"}},"created_at":"2026-05-18T01:18:00.862192+00:00","updated_at":"2026-05-18T01:18:00.862192+00:00"}