{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5SGM767JU4H56P625FUREPWTM7","short_pith_number":"pith:5SGM767J","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"},"canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","source":{"kind":"arxiv","id":"1611.10146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10146","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10146v2","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10146","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"5SGM767JU4H5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SGM767JU4H56P62","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SGM767J","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5SGM767JU4H56P625FUREPWTM7","target":"record","payload":{"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"},"canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","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"},"source_kind":"arxiv","source_id":"1611.10146","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:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDrVYgWxbs+fL52zYHmcnwNsAOpUW53dLXbTaJnsorHAEn4VllSUTKhbNptWs51okD8gxnWMiR0AacPoQk71DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:53.934709Z"},"content_sha256":"d9c5d8d11d245794512f60015928742af5c2db9a1eb70597a925511e86a4c92f","schema_version":"1.0","event_id":"sha256:d9c5d8d11d245794512f60015928742af5c2db9a1eb70597a925511e86a4c92f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5SGM767JU4H56P625FUREPWTM7","target":"graph","payload":{"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"},"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:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8jwgeoH06VOkf2qa78xe2AhEkrF3SJLPhZ6ZZ+lYAEEN7pB+5Rydssf81ur6Y3YY6IxGc6XOGbsvO9vUKcxiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:53.935395Z"},"content_sha256":"b0d774231d38b2e255df7a09b7d54ea8af64a0c032a0f59028499764742d4081","schema_version":"1.0","event_id":"sha256:b0d774231d38b2e255df7a09b7d54ea8af64a0c032a0f59028499764742d4081"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/bundle.json","state_url":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SGM767JU4H56P625FUREPWTM7/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-25T17:46:53Z","links":{"resolver":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7","bundle":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/bundle.json","state":"https://pith.science/pith/5SGM767JU4H56P625FUREPWTM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SGM767JU4H56P625FUREPWTM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SGM767JU4H56P625FUREPWTM7","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":"b5f279375255e88c403cb0acdbac9bd5beab3340e6a92b4be1f2dd0d091c345b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2016-11-30T13:45:30Z","title_canon_sha256":"06f53b6c34833f1335f47aa15d7c6cee5182452b58e9eda925bc4f2ce98da63d"},"schema_version":"1.0","source":{"id":"1611.10146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10146","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10146v2","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10146","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"5SGM767JU4H5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SGM767JU4H56P62","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SGM767J","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:b0d774231d38b2e255df7a09b7d54ea8af64a0c032a0f59028499764742d4081","target":"graph","created_at":"2026-05-18T00:55:20Z","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":"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","authors_text":"Ashutosh Gupta, Rahul Jain, Supratik Chakraborty","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2016-11-30T13:45:30Z","title":"Matching Multiplications in Bit-Vector Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10146","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:d9c5d8d11d245794512f60015928742af5c2db9a1eb70597a925511e86a4c92f","target":"record","created_at":"2026-05-18T00:55:20Z","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":"b5f279375255e88c403cb0acdbac9bd5beab3340e6a92b4be1f2dd0d091c345b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2016-11-30T13:45:30Z","title_canon_sha256":"06f53b6c34833f1335f47aa15d7c6cee5182452b58e9eda925bc4f2ce98da63d"},"schema_version":"1.0","source":{"id":"1611.10146","kind":"arxiv","version":2}},"canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec8ccffbe9a70fdf3fdae969123ed367f2fee38471e34fa70e1105ba43885a4a","first_computed_at":"2026-05-18T00:55:20.217279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:20.217279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQKWUVQ2tbMFVFiG6YukYYjDnwixupGzmjmDxvQ2EhZ/pmEALTI+DBC2rbZomJtFAoB5L5D0VGspSdTnsBNwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:20.217954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9c5d8d11d245794512f60015928742af5c2db9a1eb70597a925511e86a4c92f","sha256:b0d774231d38b2e255df7a09b7d54ea8af64a0c032a0f59028499764742d4081"],"state_sha256":"b1ba4ecdc00048615dfd76e5a795e345174ee9d14c8e7917ccc51d4e4cbd6007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20m/8PmE9CSFi+dFlrRWV4SyBmGBTOwUFF6CE+lk+Xtn7bafbk2X6JMRO+dWvzFw4hzoO/LMvnOjalLScLyDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:46:53.939072Z","bundle_sha256":"94832e0e24d65b9e9101dbabaced7baf9f10185e109da40ce4a9cb5f7a6c60d8"}}