{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SIIHJCTP6KDQUOGH3FOUBAHDDZ","short_pith_number":"pith:SIIHJCTP","schema_version":"1.0","canonical_sha256":"9210748a6ff2870a38c7d95d4080e31e6ec899b0151a7186538bd490090408e8","source":{"kind":"arxiv","id":"2209.05201","version":1},"attestation_state":"computed","paper":{"title":"Proof-Stitch: Proof Combination for Divide and Conquer SAT Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Abhishek Nair, Alex Ozdemir, Clark Barrett, Haoze Wu, Saranyu Chattopadhyay","submitted_at":"2022-09-04T19:16:40Z","abstract_excerpt":"With the increasing availability of parallel computing power, there is a growing focus on parallelizing algorithms for important automated reasoning problems such as Boolean satisfiability (SAT). Divide-and-Conquer (D&C) is a popular parallel SAT solving paradigm that partitions SAT instances into independent sub-problems which are then solved in parallel. For unsatisfiable instances, state-of-the-art D&C solvers generate DRAT refutations for each sub-problem. However, they do not generate a single refutation for the original instance. To close this gap, we present Proof-Stitch, a procedure fo"},"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":"2209.05201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-09-04T19:16:40Z","cross_cats_sorted":[],"title_canon_sha256":"386ec68ebcdf4725d5435e8d48b3a5ce73abe5c444ec6a363de4823290da4f41","abstract_canon_sha256":"4833b10b045260cffdbc5ba09b87177e4075d3d3005afbb07397b3992124602b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:28.004093Z","signature_b64":"1i/ZJmKuWTWThxxZ24ENzULrZAjcaSodjYPzBbPdF8MvSQW3BJ1BN9CrinUCCzeoVbTzJ6Fjz8+GMFxw+InBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9210748a6ff2870a38c7d95d4080e31e6ec899b0151a7186538bd490090408e8","last_reissued_at":"2026-07-05T04:56:28.003722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:28.003722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof-Stitch: Proof Combination for Divide and Conquer SAT Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Abhishek Nair, Alex Ozdemir, Clark Barrett, Haoze Wu, Saranyu Chattopadhyay","submitted_at":"2022-09-04T19:16:40Z","abstract_excerpt":"With the increasing availability of parallel computing power, there is a growing focus on parallelizing algorithms for important automated reasoning problems such as Boolean satisfiability (SAT). Divide-and-Conquer (D&C) is a popular parallel SAT solving paradigm that partitions SAT instances into independent sub-problems which are then solved in parallel. For unsatisfiable instances, state-of-the-art D&C solvers generate DRAT refutations for each sub-problem. However, they do not generate a single refutation for the original instance. To close this gap, we present Proof-Stitch, a procedure fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05201","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/2209.05201/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":"2209.05201","created_at":"2026-07-05T04:56:28.003776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05201v1","created_at":"2026-07-05T04:56:28.003776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05201","created_at":"2026-07-05T04:56:28.003776+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIIHJCTP6KDQ","created_at":"2026-07-05T04:56:28.003776+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIIHJCTP6KDQUOGH","created_at":"2026-07-05T04:56:28.003776+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIIHJCTP","created_at":"2026-07-05T04:56:28.003776+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/SIIHJCTP6KDQUOGH3FOUBAHDDZ","json":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ.json","graph_json":"https://pith.science/api/pith-number/SIIHJCTP6KDQUOGH3FOUBAHDDZ/graph.json","events_json":"https://pith.science/api/pith-number/SIIHJCTP6KDQUOGH3FOUBAHDDZ/events.json","paper":"https://pith.science/paper/SIIHJCTP"},"agent_actions":{"view_html":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ","download_json":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ.json","view_paper":"https://pith.science/paper/SIIHJCTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05201&json=true","fetch_graph":"https://pith.science/api/pith-number/SIIHJCTP6KDQUOGH3FOUBAHDDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SIIHJCTP6KDQUOGH3FOUBAHDDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ/action/storage_attestation","attest_author":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ/action/author_attestation","sign_citation":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ/action/citation_signature","submit_replication":"https://pith.science/pith/SIIHJCTP6KDQUOGH3FOUBAHDDZ/action/replication_record"}},"created_at":"2026-07-05T04:56:28.003776+00:00","updated_at":"2026-07-05T04:56:28.003776+00:00"}