{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5SGM767JU4H56P625FUREPWTM7","short_pith_number":"pith:5SGM767J","schema_version":"1.0","canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","source":{"kind":"arxiv","id":"1611.10146","version":2},"attestation_state":"computed","paper":{"title":"Matching Multiplications in Bit-Vector Formulas","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ashutosh Gupta, Rahul Jain, Supratik Chakraborty","submitted_at":"2016-11-30T13:45:30Z","abstract_excerpt":"Bit-vector formulas arising from hardware verification problems often contain word-level arithmetic operations. Empirical evidence shows that state-of-the-art SMT solvers are not very efficient at reasoning about bit-vector formulas with multiplication. This is particularly true when multiplication operators are decomposed and represented in alternative ways in the formula.We present a pre-processing heuristic that identifies certain types of decomposed multipliers, and adds special assertions to the input formula encoding the equivalence of sub-terms to word-level multiplication. The pre-proc"},"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":"1611.10146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2016-11-30T13:45:30Z","cross_cats_sorted":[],"title_canon_sha256":"06f53b6c34833f1335f47aa15d7c6cee5182452b58e9eda925bc4f2ce98da63d","abstract_canon_sha256":"b5f279375255e88c403cb0acdbac9bd5beab3340e6a92b4be1f2dd0d091c345b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.217954Z","signature_b64":"fQKWUVQ2tbMFVFiG6YukYYjDnwixupGzmjmDxvQ2EhZ/pmEALTI+DBC2rbZomJtFAoB5L5D0VGspSdTnsBNwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","last_reissued_at":"2026-05-18T00:55:20.217279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.217279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching Multiplications in Bit-Vector Formulas","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ashutosh Gupta, Rahul Jain, Supratik Chakraborty","submitted_at":"2016-11-30T13:45:30Z","abstract_excerpt":"Bit-vector formulas arising from hardware verification problems often contain word-level arithmetic operations. Empirical evidence shows that state-of-the-art SMT solvers are not very efficient at reasoning about bit-vector formulas with multiplication. This is particularly true when multiplication operators are decomposed and represented in alternative ways in the formula.We present a pre-processing heuristic that identifies certain types of decomposed multipliers, and adds special assertions to the input formula encoding the equivalence of sub-terms to word-level multiplication. The pre-proc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10146","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":"1611.10146","created_at":"2026-05-18T00:55:20.217403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10146v2","created_at":"2026-05-18T00:55:20.217403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10146","created_at":"2026-05-18T00:55:20.217403+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SGM767JU4H5","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SGM767JU4H56P62","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SGM767J","created_at":"2026-05-18T12:30:01.593930+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/5SGM767JU4H56P625FUREPWTM7","json":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7.json","graph_json":"https://pith.science/api/pith-number/5SGM767JU4H56P625FUREPWTM7/graph.json","events_json":"https://pith.science/api/pith-number/5SGM767JU4H56P625FUREPWTM7/events.json","paper":"https://pith.science/paper/5SGM767J"},"agent_actions":{"view_html":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7","download_json":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7.json","view_paper":"https://pith.science/paper/5SGM767J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10146&json=true","fetch_graph":"https://pith.science/api/pith-number/5SGM767JU4H56P625FUREPWTM7/graph.json","fetch_events":"https://pith.science/api/pith-number/5SGM767JU4H56P625FUREPWTM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/action/storage_attestation","attest_author":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/action/author_attestation","sign_citation":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/action/citation_signature","submit_replication":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/action/replication_record"}},"created_at":"2026-05-18T00:55:20.217403+00:00","updated_at":"2026-05-18T00:55:20.217403+00:00"}