{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RO2O5BVDBXC7SE4FSZU6QMC7GI","short_pith_number":"pith:RO2O5BVD","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"},"canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","source":{"kind":"arxiv","id":"1711.08859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08859","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08859v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08859","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"RO2O5BVDBXC7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RO2O5BVDBXC7SE4F","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RO2O5BVD","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RO2O5BVDBXC7SE4FSZU6QMC7GI","target":"record","payload":{"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"},"canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","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"},"source_kind":"arxiv","source_id":"1711.08859","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt3P8AgeefJEX07RvO41/WMg96o8r82JAFX89HymlOqLb42WrAMZSH+3eRYMA4XUjfyJXgkyRbHfYth8nW9AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:31:47.055309Z"},"content_sha256":"053e8df83f7fb2d81595a0cf87e502a40f3eaca4ddc4692c07c760c536acf188","schema_version":"1.0","event_id":"sha256:053e8df83f7fb2d81595a0cf87e502a40f3eaca4ddc4692c07c760c536acf188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RO2O5BVDBXC7SE4FSZU6QMC7GI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0/UvPX7Wj1Bbm0E+1Eq7v7V55yPet316Skq+rLQf2BPhe4+oIvrZYgi/a2lTBLHbJwYRgE2txg92rX/wwtmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:31:47.055661Z"},"content_sha256":"e767a00b54e04150e4d14c6e091dcca2e5481ca3ddae23f9fbd4d5808d542eb2","schema_version":"1.0","event_id":"sha256:e767a00b54e04150e4d14c6e091dcca2e5481ca3ddae23f9fbd4d5808d542eb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/bundle.json","state_url":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T20:31:47Z","links":{"resolver":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI","bundle":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/bundle.json","state":"https://pith.science/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO2O5BVDBXC7SE4FSZU6QMC7GI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RO2O5BVDBXC7SE4FSZU6QMC7GI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a3b279164f1dcb5d6ad2ccad0ab67ff58c2338a2053d43932604a57ebc914373","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-24T02:23:41Z","title_canon_sha256":"5fdab73d76bf20105f99ba39f11c3132c85906040a59a88c8c84e187748b6040"},"schema_version":"1.0","source":{"id":"1711.08859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08859","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08859v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08859","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"RO2O5BVDBXC7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RO2O5BVDBXC7SE4F","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RO2O5BVD","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e767a00b54e04150e4d14c6e091dcca2e5481ca3ddae23f9fbd4d5808d542eb2","target":"graph","created_at":"2026-05-18T00:28:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksandar Zeljic, Christoph M. Wintersteiger, Peter Backeman, Philipp Ruemmer","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-24T02:23:41Z","title":"Exploring Approximations for Floating-Point Arithmetic using UppSAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08859","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:053e8df83f7fb2d81595a0cf87e502a40f3eaca4ddc4692c07c760c536acf188","target":"record","created_at":"2026-05-18T00:28:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a3b279164f1dcb5d6ad2ccad0ab67ff58c2338a2053d43932604a57ebc914373","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-24T02:23:41Z","title_canon_sha256":"5fdab73d76bf20105f99ba39f11c3132c85906040a59a88c8c84e187748b6040"},"schema_version":"1.0","source":{"id":"1711.08859","kind":"arxiv","version":2}},"canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bb4ee86a30dc5f913859669e8305f3226be4810541d24995c6d862206e78856","first_computed_at":"2026-05-18T00:28:22.135682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:22.135682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwZ7/ZhPuSLqINkDgD/Ds+EbTRuCcdzF76q5S9XgPunWxfA8RyUzXmfvBOyXpOibUbYSuVrubSxKfm3pWtCEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:22.136470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:053e8df83f7fb2d81595a0cf87e502a40f3eaca4ddc4692c07c760c536acf188","sha256:e767a00b54e04150e4d14c6e091dcca2e5481ca3ddae23f9fbd4d5808d542eb2"],"state_sha256":"ea6776c9a56b18e6001ddddaf61ffb00210aae589756a10a9d1f59c2b3ff6216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bNAM+feHe6+qE/rj0TyIXY6dkEYPyVTTx9mCDKcZfQ43a5lgCIskEyMRV9cokemWtg0CDDtv7sE2Dgg4uqYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:31:47.057558Z","bundle_sha256":"7f98a773ad22cd7b9f7fa0f343d1199dccfa2ce3d4566697b9f93577e58d064f"}}