{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VUZOJYL72XNCEENQ7XSPNLJI22","short_pith_number":"pith:VUZOJYL7","canonical_record":{"source":{"id":"1905.10434","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-24T20:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b7d76c72fef9907ac0eb8167ab1c42bc8ebe4ba8108d058635298ecfca69c2b","abstract_canon_sha256":"eb126e37a21c5c3f89a03058e7836cbc3417ae8ba6e7ebcb13e7eda8c2c8ab23"},"schema_version":"1.0"},"canonical_sha256":"ad32e4e17fd5da2211b0fde4f6ad28d6b9ce06b69ab85dcfbedd41b9b756420d","source":{"kind":"arxiv","id":"1905.10434","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10434","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10434v3","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10434","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"VUZOJYL72XNC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VUZOJYL72XNCEENQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VUZOJYL7","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VUZOJYL72XNCEENQ7XSPNLJI22","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10434","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-24T20:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b7d76c72fef9907ac0eb8167ab1c42bc8ebe4ba8108d058635298ecfca69c2b","abstract_canon_sha256":"eb126e37a21c5c3f89a03058e7836cbc3417ae8ba6e7ebcb13e7eda8c2c8ab23"},"schema_version":"1.0"},"canonical_sha256":"ad32e4e17fd5da2211b0fde4f6ad28d6b9ce06b69ab85dcfbedd41b9b756420d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:57.826469Z","signature_b64":"IiDMVMzRky1Rz3kQLuBsOuXMMEQDXWlN2EwknM77rZl6s4qsriXxeAJwy/LUbNN4bRA81qqUBDDpg3TJ7N0IDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad32e4e17fd5da2211b0fde4f6ad28d6b9ce06b69ab85dcfbedd41b9b756420d","last_reissued_at":"2026-05-17T23:41:57.825822Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:57.825822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10434","source_version":3,"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-17T23:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjfCphw8NeaxXObCGhGJY9ajCcivbgRn5dtXeRTe9QJNlQHslllBcr32wOVoicaXcF/lCjtOemHI9gu9YQM5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:38:14.111443Z"},"content_sha256":"8dac5984ec24ba2b34f2d48a37480055565d8ff4a4acf550a6356627482b722a","schema_version":"1.0","event_id":"sha256:8dac5984ec24ba2b34f2d48a37480055565d8ff4a4acf550a6356627482b722a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VUZOJYL72XNCEENQ7XSPNLJI22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Bit-Width-Independent Proofs in SMT Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aina Niemetz, Andrew Reynolds, Cesare Tinelli, Clark Barrett, Mathias Preiner, Yoni Zohar","submitted_at":"2019-05-24T20:16:08Z","abstract_excerpt":"Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-vector formulas. These approaches, however, cannot be used directly to reason about bit-vectors of symbolic bit-width. To address this shortcoming, we propose a translation from bit-vector formulas of non-fixed bit-width to formulas in a logic supported by SMT solvers that includes non-linear integer arithmetic, uninterpreted functions, and universal quantification. While this logic is undecidable, this approach can still solve many formulas by capitalizing on advancements in SMT solving for non-linear arithme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10434","kind":"arxiv","version":3},"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-17T23:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlma+TcmLlfSYoPXuNI21bBveu8K4BKhVQL4VbZyrI8T2HnwjGGmwO64V6TdDxst5j5K9bRC0jY3UoS1C2flCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:38:14.111844Z"},"content_sha256":"12c654936d08b5d4ffb8cf3fe55615ef23612054e9c9320a64aa0ba7cc20ce76","schema_version":"1.0","event_id":"sha256:12c654936d08b5d4ffb8cf3fe55615ef23612054e9c9320a64aa0ba7cc20ce76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUZOJYL72XNCEENQ7XSPNLJI22/bundle.json","state_url":"https://pith.science/pith/VUZOJYL72XNCEENQ7XSPNLJI22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUZOJYL72XNCEENQ7XSPNLJI22/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-05-28T07:38:14Z","links":{"resolver":"https://pith.science/pith/VUZOJYL72XNCEENQ7XSPNLJI22","bundle":"https://pith.science/pith/VUZOJYL72XNCEENQ7XSPNLJI22/bundle.json","state":"https://pith.science/pith/VUZOJYL72XNCEENQ7XSPNLJI22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUZOJYL72XNCEENQ7XSPNLJI22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VUZOJYL72XNCEENQ7XSPNLJI22","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":"eb126e37a21c5c3f89a03058e7836cbc3417ae8ba6e7ebcb13e7eda8c2c8ab23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-24T20:16:08Z","title_canon_sha256":"8b7d76c72fef9907ac0eb8167ab1c42bc8ebe4ba8108d058635298ecfca69c2b"},"schema_version":"1.0","source":{"id":"1905.10434","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10434","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10434v3","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10434","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"VUZOJYL72XNC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VUZOJYL72XNCEENQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VUZOJYL7","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:12c654936d08b5d4ffb8cf3fe55615ef23612054e9c9320a64aa0ba7cc20ce76","target":"graph","created_at":"2026-05-17T23:41:57Z","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":"Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-vector formulas. These approaches, however, cannot be used directly to reason about bit-vectors of symbolic bit-width. To address this shortcoming, we propose a translation from bit-vector formulas of non-fixed bit-width to formulas in a logic supported by SMT solvers that includes non-linear integer arithmetic, uninterpreted functions, and universal quantification. While this logic is undecidable, this approach can still solve many formulas by capitalizing on advancements in SMT solving for non-linear arithme","authors_text":"Aina Niemetz, Andrew Reynolds, Cesare Tinelli, Clark Barrett, Mathias Preiner, Yoni Zohar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-24T20:16:08Z","title":"Towards Bit-Width-Independent Proofs in SMT Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10434","kind":"arxiv","version":3},"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:8dac5984ec24ba2b34f2d48a37480055565d8ff4a4acf550a6356627482b722a","target":"record","created_at":"2026-05-17T23:41:57Z","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":"eb126e37a21c5c3f89a03058e7836cbc3417ae8ba6e7ebcb13e7eda8c2c8ab23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-24T20:16:08Z","title_canon_sha256":"8b7d76c72fef9907ac0eb8167ab1c42bc8ebe4ba8108d058635298ecfca69c2b"},"schema_version":"1.0","source":{"id":"1905.10434","kind":"arxiv","version":3}},"canonical_sha256":"ad32e4e17fd5da2211b0fde4f6ad28d6b9ce06b69ab85dcfbedd41b9b756420d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad32e4e17fd5da2211b0fde4f6ad28d6b9ce06b69ab85dcfbedd41b9b756420d","first_computed_at":"2026-05-17T23:41:57.825822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:57.825822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IiDMVMzRky1Rz3kQLuBsOuXMMEQDXWlN2EwknM77rZl6s4qsriXxeAJwy/LUbNN4bRA81qqUBDDpg3TJ7N0IDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:57.826469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10434","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dac5984ec24ba2b34f2d48a37480055565d8ff4a4acf550a6356627482b722a","sha256:12c654936d08b5d4ffb8cf3fe55615ef23612054e9c9320a64aa0ba7cc20ce76"],"state_sha256":"8a0781c07423bb127f883c77ed578d868c546a0d3dd44f5db976ff44d2564271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JW0jgUfDm9f71qpUdiTGlmoMRZD6ccyr7BV37EdtyQ7WZ4qQk+64OLbLOcAMK0iPCpuRaH/+OoyLVWTVU4QgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:38:14.114020Z","bundle_sha256":"2cf4f32600f0700c8405c2186058ba7dcd2aff844e8228877cefc674fc2b9b42"}}