{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RO2O5BVDBXC7SE4FSZU6QMC7GI","short_pith_number":"pith:RO2O5BVD","schema_version":"1.0","canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","source":{"kind":"arxiv","id":"1711.08859","version":2},"attestation_state":"computed","paper":{"title":"Exploring Approximations for Floating-Point Arithmetic using UppSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Aleksandar Zeljic, Christoph M. Wintersteiger, Peter Backeman, Philipp Ruemmer","submitted_at":"2017-11-24T02:23:41Z","abstract_excerpt":"We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT --- a new implementation of a systematic approximation refinement framework [ZWR17] as an abstract SMT solver. Provided with an approximation and a decision procedure (implemented in an off-the-shelf SMT solver), UppSAT yields an approximating SMT solver. Additionally, UppSAT includes a library of predefined approximation components which can be combined and extended to define new encodings, orderings and solving strategies. We propose that UppSAT can be used as a sandbox for ea"},"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":"1711.08859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-24T02:23:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5fdab73d76bf20105f99ba39f11c3132c85906040a59a88c8c84e187748b6040","abstract_canon_sha256":"a3b279164f1dcb5d6ad2ccad0ab67ff58c2338a2053d43932604a57ebc914373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.136470Z","signature_b64":"zwZ7/ZhPuSLqINkDgD/Ds+EbTRuCcdzF76q5S9XgPunWxfA8RyUzXmfvBOyXpOibUbYSuVrubSxKfm3pWtCEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","last_reissued_at":"2026-05-18T00:28:22.135682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.135682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Approximations for Floating-Point Arithmetic using UppSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Aleksandar Zeljic, Christoph M. Wintersteiger, Peter Backeman, Philipp Ruemmer","submitted_at":"2017-11-24T02:23:41Z","abstract_excerpt":"We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT --- a new implementation of a systematic approximation refinement framework [ZWR17] as an abstract SMT solver. Provided with an approximation and a decision procedure (implemented in an off-the-shelf SMT solver), UppSAT yields an approximating SMT solver. Additionally, UppSAT includes a library of predefined approximation components which can be combined and extended to define new encodings, orderings and solving strategies. We propose that UppSAT can be used as a sandbox for ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08859","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":"1711.08859","created_at":"2026-05-18T00:28:22.135829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08859v2","created_at":"2026-05-18T00:28:22.135829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08859","created_at":"2026-05-18T00:28:22.135829+00:00"},{"alias_kind":"pith_short_12","alias_value":"RO2O5BVDBXC7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RO2O5BVDBXC7SE4F","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RO2O5BVD","created_at":"2026-05-18T12:31:39.905425+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/RO2O5BVDBXC7SE4FSZU6QMC7GI","json":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI.json","graph_json":"https://pith.science/api/pith-number/RO2O5BVDBXC7SE4FSZU6QMC7GI/graph.json","events_json":"https://pith.science/api/pith-number/RO2O5BVDBXC7SE4FSZU6QMC7GI/events.json","paper":"https://pith.science/paper/RO2O5BVD"},"agent_actions":{"view_html":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI","download_json":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI.json","view_paper":"https://pith.science/paper/RO2O5BVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08859&json=true","fetch_graph":"https://pith.science/api/pith-number/RO2O5BVDBXC7SE4FSZU6QMC7GI/graph.json","fetch_events":"https://pith.science/api/pith-number/RO2O5BVDBXC7SE4FSZU6QMC7GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/action/storage_attestation","attest_author":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/action/author_attestation","sign_citation":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/action/citation_signature","submit_replication":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/action/replication_record"}},"created_at":"2026-05-18T00:28:22.135829+00:00","updated_at":"2026-05-18T00:28:22.135829+00:00"}