{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IPIPCTPMZ6ST3OPMLGVDR3IOSJ","short_pith_number":"pith:IPIPCTPM","schema_version":"1.0","canonical_sha256":"43d0f14deccfa53db9ec59aa38ed0e925791a0e499bfad737a2e7550fbc4bcc3","source":{"kind":"arxiv","id":"2606.08852","version":1},"attestation_state":"computed","paper":{"title":"Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Ilana Shapiro, Nikolaj Bj{\\o}rner, Sorin Lerner","submitted_at":"2026-06-07T21:45:08Z","abstract_excerpt":"Exploiting parallelism in modern CPU architectures remains a longstanding challenge in optimizing SMT solvers. We introduce a novel parallel framework that dynamically builds a binary partition tree of the search space by sampling from workers' VSIDS statistics during solving. We leverage the full power of core-based CDCL-style pruning to continuously shrink the partition tree. We further optimize our architecture by incorporating online backbone detection into worker threads, as well as a terminate-on-demand mechanism to eagerly eliminate work on pruned subproblems. The resulting algorithm is"},"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":"2606.08852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-06-07T21:45:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7dfce97be556b28d5f23ee4788b0fd873b07b8f8269568b872ebc10a2e011a05","abstract_canon_sha256":"0420cd192d2543c6a6a2298cfeb85e9427a8ad050c189a0bf3d6fe51585881a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:42.927624Z","signature_b64":"Ty2utJcfAskIa715evMg6riU/wNl2or9H6J2xglCbdwMPh2rwVGrBAlPLOu8Tz60ey9IN4HOS+9aCLX3qqTACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d0f14deccfa53db9ec59aa38ed0e925791a0e499bfad737a2e7550fbc4bcc3","last_reissued_at":"2026-06-09T02:07:42.926753Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:42.926753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Ilana Shapiro, Nikolaj Bj{\\o}rner, Sorin Lerner","submitted_at":"2026-06-07T21:45:08Z","abstract_excerpt":"Exploiting parallelism in modern CPU architectures remains a longstanding challenge in optimizing SMT solvers. We introduce a novel parallel framework that dynamically builds a binary partition tree of the search space by sampling from workers' VSIDS statistics during solving. We leverage the full power of core-based CDCL-style pruning to continuously shrink the partition tree. We further optimize our architecture by incorporating online backbone detection into worker threads, as well as a terminate-on-demand mechanism to eagerly eliminate work on pruned subproblems. The resulting algorithm is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08852","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/2606.08852/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":"2606.08852","created_at":"2026-06-09T02:07:42.926897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08852v1","created_at":"2026-06-09T02:07:42.926897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08852","created_at":"2026-06-09T02:07:42.926897+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPIPCTPMZ6ST","created_at":"2026-06-09T02:07:42.926897+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPIPCTPMZ6ST3OPM","created_at":"2026-06-09T02:07:42.926897+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPIPCTPM","created_at":"2026-06-09T02:07:42.926897+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/IPIPCTPMZ6ST3OPMLGVDR3IOSJ","json":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ.json","graph_json":"https://pith.science/api/pith-number/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/graph.json","events_json":"https://pith.science/api/pith-number/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/events.json","paper":"https://pith.science/paper/IPIPCTPM"},"agent_actions":{"view_html":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ","download_json":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ.json","view_paper":"https://pith.science/paper/IPIPCTPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08852&json=true","fetch_graph":"https://pith.science/api/pith-number/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/action/storage_attestation","attest_author":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/action/author_attestation","sign_citation":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/action/citation_signature","submit_replication":"https://pith.science/pith/IPIPCTPMZ6ST3OPMLGVDR3IOSJ/action/replication_record"}},"created_at":"2026-06-09T02:07:42.926897+00:00","updated_at":"2026-06-09T02:07:42.926897+00:00"}