{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TA2EGORJRKNG5NHY2A5T4YJNWN","short_pith_number":"pith:TA2EGORJ","schema_version":"1.0","canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","source":{"kind":"arxiv","id":"2406.04696","version":1},"attestation_state":"computed","paper":{"title":"PolySAT: Word-level Bit-vector Reasoning in Z3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Clemens Eisenhofer, Daniela Kaufmann, Jakob Rath, Laura Kov\\'acs, Nikolaj Bj{\\o}rner","submitted_at":"2024-06-07T07:15:22Z","abstract_excerpt":"PolySAT is a word-level decision procedure supporting bit-precise SMT reasoning over polynomial arithmetic with large bit-vector operations. The PolySAT calculus extends conflict-driven clause learning modulo theories with two key components: (i) a bit-vector plugin to the equality graph, and (ii) a theory solver for bit-vector arithmetic with non-linear polynomials. PolySAT implements dedicated procedures to extract bit-vector intervals from polynomial inequalities. For the purpose of conflict analysis and resolution, PolySAT comes with on-demand lemma generation over non-linear bit-vector ar"},"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":"2406.04696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-06-07T07:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"4e5e515e5f8431a8c16b6c1e23dd55c4fecc23af20698ee5fc301d2fc113fa08","abstract_canon_sha256":"e5884cdc0a1df172ebdf596d8c84903df92611e99ee3f2f6834a83f386caa299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:47.826858Z","signature_b64":"dOvK02d4mU52HvyUMkKZxXmfnkY9OarBSOd10gH4SbhBK/SodSLAiuUR7puS8Hapk6hyezh1EOmilqCkYXagDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","last_reissued_at":"2026-07-05T08:28:47.826432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:47.826432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PolySAT: Word-level Bit-vector Reasoning in Z3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Clemens Eisenhofer, Daniela Kaufmann, Jakob Rath, Laura Kov\\'acs, Nikolaj Bj{\\o}rner","submitted_at":"2024-06-07T07:15:22Z","abstract_excerpt":"PolySAT is a word-level decision procedure supporting bit-precise SMT reasoning over polynomial arithmetic with large bit-vector operations. The PolySAT calculus extends conflict-driven clause learning modulo theories with two key components: (i) a bit-vector plugin to the equality graph, and (ii) a theory solver for bit-vector arithmetic with non-linear polynomials. PolySAT implements dedicated procedures to extract bit-vector intervals from polynomial inequalities. For the purpose of conflict analysis and resolution, PolySAT comes with on-demand lemma generation over non-linear bit-vector ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04696","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.04696/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":"2406.04696","created_at":"2026-07-05T08:28:47.826496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.04696v1","created_at":"2026-07-05T08:28:47.826496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04696","created_at":"2026-07-05T08:28:47.826496+00:00"},{"alias_kind":"pith_short_12","alias_value":"TA2EGORJRKNG","created_at":"2026-07-05T08:28:47.826496+00:00"},{"alias_kind":"pith_short_16","alias_value":"TA2EGORJRKNG5NHY","created_at":"2026-07-05T08:28:47.826496+00:00"},{"alias_kind":"pith_short_8","alias_value":"TA2EGORJ","created_at":"2026-07-05T08:28:47.826496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11036","citing_title":"Scaling Program Synthesis Based Technology Mapping with Equality Saturation","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN","json":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN.json","graph_json":"https://pith.science/api/pith-number/TA2EGORJRKNG5NHY2A5T4YJNWN/graph.json","events_json":"https://pith.science/api/pith-number/TA2EGORJRKNG5NHY2A5T4YJNWN/events.json","paper":"https://pith.science/paper/TA2EGORJ"},"agent_actions":{"view_html":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN","download_json":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN.json","view_paper":"https://pith.science/paper/TA2EGORJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.04696&json=true","fetch_graph":"https://pith.science/api/pith-number/TA2EGORJRKNG5NHY2A5T4YJNWN/graph.json","fetch_events":"https://pith.science/api/pith-number/TA2EGORJRKNG5NHY2A5T4YJNWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/action/storage_attestation","attest_author":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/action/author_attestation","sign_citation":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/action/citation_signature","submit_replication":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/action/replication_record"}},"created_at":"2026-07-05T08:28:47.826496+00:00","updated_at":"2026-07-05T08:28:47.826496+00:00"}