{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TA2EGORJRKNG5NHY2A5T4YJNWN","short_pith_number":"pith:TA2EGORJ","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"},"canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","source":{"kind":"arxiv","id":"2406.04696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.04696","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"2406.04696v1","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04696","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"TA2EGORJRKNG","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"TA2EGORJRKNG5NHY","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"TA2EGORJ","created_at":"2026-07-05T08:28:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TA2EGORJRKNG5NHY2A5T4YJNWN","target":"record","payload":{"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"},"canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","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"},"source_kind":"arxiv","source_id":"2406.04696","source_version":1,"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-07-05T08:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1GQGZl8sh87Ys7XD53yc5vMi5QgGx4calZe3ZXtixGj0K7mKd17UMrytyQ0zR1dUU/QHSUvtQQyMS9wK42TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:53:00.468453Z"},"content_sha256":"1dae3799756dcb38362830b0eb795c0302d63f69e97f77772da46ffb16534851","schema_version":"1.0","event_id":"sha256:1dae3799756dcb38362830b0eb795c0302d63f69e97f77772da46ffb16534851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TA2EGORJRKNG5NHY2A5T4YJNWN","target":"graph","payload":{"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"},"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-07-05T08:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzVgzNL4gw9jC+0jzjzP3e2dV8STjHUH2B/4FayHU3SwG0uWsbnzzQmbGG+x6V2l00x87xaaKkSfd++qxC9FDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:53:00.469087Z"},"content_sha256":"99cbe93ef68061f243aae914174340263c5c26bf8a8b190e5d111e86b87c6b5d","schema_version":"1.0","event_id":"sha256:99cbe93ef68061f243aae914174340263c5c26bf8a8b190e5d111e86b87c6b5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/bundle.json","state_url":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/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-08-21T14:53:00Z","links":{"resolver":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN","bundle":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/bundle.json","state":"https://pith.science/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TA2EGORJRKNG5NHY2A5T4YJNWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TA2EGORJRKNG5NHY2A5T4YJNWN","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":"e5884cdc0a1df172ebdf596d8c84903df92611e99ee3f2f6834a83f386caa299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-06-07T07:15:22Z","title_canon_sha256":"4e5e515e5f8431a8c16b6c1e23dd55c4fecc23af20698ee5fc301d2fc113fa08"},"schema_version":"1.0","source":{"id":"2406.04696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.04696","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"2406.04696v1","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04696","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"TA2EGORJRKNG","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"TA2EGORJRKNG5NHY","created_at":"2026-07-05T08:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"TA2EGORJ","created_at":"2026-07-05T08:28:47Z"}],"graph_snapshots":[{"event_id":"sha256:99cbe93ef68061f243aae914174340263c5c26bf8a8b190e5d111e86b87c6b5d","target":"graph","created_at":"2026-07-05T08:28:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.04696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Clemens Eisenhofer, Daniela Kaufmann, Jakob Rath, Laura Kov\\'acs, Nikolaj Bj{\\o}rner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-06-07T07:15:22Z","title":"PolySAT: Word-level Bit-vector Reasoning in Z3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04696","kind":"arxiv","version":1},"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:1dae3799756dcb38362830b0eb795c0302d63f69e97f77772da46ffb16534851","target":"record","created_at":"2026-07-05T08:28:47Z","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":"e5884cdc0a1df172ebdf596d8c84903df92611e99ee3f2f6834a83f386caa299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-06-07T07:15:22Z","title_canon_sha256":"4e5e515e5f8431a8c16b6c1e23dd55c4fecc23af20698ee5fc301d2fc113fa08"},"schema_version":"1.0","source":{"id":"2406.04696","kind":"arxiv","version":1}},"canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9834433a298a9a6eb4f8d03b3e612db344cef8e01702c6ec739e22d423fe81bc","first_computed_at":"2026-07-05T08:28:47.826432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:47.826432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dOvK02d4mU52HvyUMkKZxXmfnkY9OarBSOd10gH4SbhBK/SodSLAiuUR7puS8Hapk6hyezh1EOmilqCkYXagDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:47.826858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.04696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dae3799756dcb38362830b0eb795c0302d63f69e97f77772da46ffb16534851","sha256:99cbe93ef68061f243aae914174340263c5c26bf8a8b190e5d111e86b87c6b5d"],"state_sha256":"c2bc0baebeb5923ba75454c7e9985181b2f9657ef3c1bc3a4c6aaed2f518a462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsN+0Lw4NimyL8T1Kj5E1tIkxH0ih1xbvZ0p4/S+0eu593y9T3ZtzWUBZyeFSybJKVhUj4yfbKSZwYxOCVlnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T14:53:00.475213Z","bundle_sha256":"a9fd418254f845b34b5cd1ab6e4eef03eaf466ab18f05c0b96cf2667db3a6183"}}