{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","short_pith_number":"pith:M62KI5LT","canonical_record":{"source":{"id":"2605.15506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T00:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"d3a0ec244e355500621dfd723003ffd6817be875a5a46b64036c1393facd1d94","abstract_canon_sha256":"adb079217ef763fbbc609986e699f951b2d48e58904e6abcfef1bfa3ac820223"},"schema_version":"1.0"},"canonical_sha256":"67b4a47573f39712514ade92ed8194e87404bccd3c4bcc975670d14af37b79f7","source":{"kind":"arxiv","id":"2605.15506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15506","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15506v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15506","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"M62KI5LT6OLR","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"M62KI5LT6OLREUKK","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"M62KI5LT","created_at":"2026-05-20T00:01:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T00:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"d3a0ec244e355500621dfd723003ffd6817be875a5a46b64036c1393facd1d94","abstract_canon_sha256":"adb079217ef763fbbc609986e699f951b2d48e58904e6abcfef1bfa3ac820223"},"schema_version":"1.0"},"canonical_sha256":"67b4a47573f39712514ade92ed8194e87404bccd3c4bcc975670d14af37b79f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:02.184072Z","signature_b64":"uCUvXriX9mrDCPBUg4Iw4M51NV1UwKJ0ebIH7SVhDwviO3/SdTISl/OPGsVxJYZMAdAzcnREO2ORsHSHY/VPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b4a47573f39712514ade92ed8194e87404bccd3c4bcc975670d14af37b79f7","last_reissued_at":"2026-05-20T00:01:02.183222Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:02.183222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15506","source_version":1,"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-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D2C3gSBNhQnNY13katQ+gPVmjCM0gWauBqAOhECl57TQ+P8xfRb1IP22kGmcRqC9sbzuFCo5OTWvO8s071wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:38:25.115343Z"},"content_sha256":"2c79aca4136526f2cf6ba9fcc69e8b7f78e01a50e7020e76bb6f31afebc42ede","schema_version":"1.0","event_id":"sha256:2c79aca4136526f2cf6ba9fcc69e8b7f78e01a50e7020e76bb6f31afebc42ede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding CDCL Solvers via Scalability Studies and Proofdoors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Chunxiao Li, Jianwen Li, Moshe Y. Vardi, Shimin Zhang, Vijay Ganesh, Yechuan Xia","submitted_at":"2026-05-15T00:56:53Z","abstract_excerpt":"Over the past several decades, CDCL SAT solvers have proven remarkably effective on large industrial formulas, despite SAT being NP-complete and widely believed to be intractable. While considerable empirical research has been done on solver performance over benchmarks like the SAT competition, as well as scaling studies on random and crafted families, surprisingly little effort has gone into systematic scaling studies over industrial instances. To address this gap, we collect a large benchmark of Bounded Model Checking (BMC) instances (76,600+ across 766 families) and perform a systematic sca"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By contrast, the recently proposed proofdoor parameter explains this phenomenon well. In support of the proofdoor hypothesis, we make three key contributions. First, we empirically show that CDCL solvers do compute small proofdoors for linearly-scaling BMC instances. Second, we show that for exponentially-scaling instances, sampled proofdoors scale exponentially and are typically not incrementally absorbed.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that sampled interpolants between formula chunks accurately represent the solver's internal memoization of reasoning effort, as described in the abstract where each interpolant is said to represent memoization on chunks already analyzed. If this representational link does not hold for actual CDCL execution traces, the claimed explanation for linear versus exponential scaling would not follow from the measurements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b13e5a7c59fbea175696cbb1f08fee28c120627077e87aabbbbb407e2ac63f28"},"source":{"id":"2605.15506","kind":"arxiv","version":1},"verdict":{"id":"b0d90bdf-e268-4143-bb45-ffb6f326d3b2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:24:42.069111Z","strongest_claim":"By contrast, the recently proposed proofdoor parameter explains this phenomenon well. In support of the proofdoor hypothesis, we make three key contributions. First, we empirically show that CDCL solvers do compute small proofdoors for linearly-scaling BMC instances. Second, we show that for exponentially-scaling instances, sampled proofdoors scale exponentially and are typically not incrementally absorbed.","one_line_summary":"CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that sampled interpolants between formula chunks accurately represent the solver's internal memoization of reasoning effort, as described in the abstract where each interpolant is said to represent memoization on chunks already analyzed. If this representational link does not hold for actual CDCL execution traces, the claimed explanation for linear versus exponential scaling would not follow from the measurements.","pith_extraction_headline":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others."},"integrity":{"clean":false,"summary":{"advisory":2,"critical":0,"by_detector":{"doi_compliance":{"total":2,"advisory":2,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.15506/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-24318-418) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":27,"audited_at":"2026-05-19T15:30:41.489213Z","detected_doi":"10.1007/978-3-319-24318-418","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-98334-930) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":29,"audited_at":"2026-05-19T15:30:41.489213Z","detected_doi":"10.1007/978-3-319-98334-930","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.718474Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:30:41.489213Z","status":"completed","version":"1.0.0","findings_count":2},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:55.472797Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.059345Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.851320Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.390244Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.638071Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2c00c35b3e946fdb8086e87b82b8a048f0ee08c28848c816f5d7ac44309fa321"},"references":{"count":41,"sample":[{"doi":"","year":2026,"title":"Proofdoors and Efficiency of CDCL Solvers","work_id":"280522fd-e096-4856-a721-ded4a54bb173","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Bounded Model Checking Using Satisfiability Solving","work_id":"173a06cf-7ce2-4b07-819f-492d43fa6697","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Benefits of bounded model checking at an industrial setting","work_id":"98cc528c-faca-4d95-b397-196b97857fa8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1971,"title":"Feng, Y ., You, H., Zhang, Z., Ji, R., and Gao, Y","work_id":"b7fbfa39-ee97-4677-9a7d-40f8a82a433e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"On the Unreasonable Effectiveness of SAT Solvers","work_id":"05824d8c-07bd-4351-a129-91ea1180e1b2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":41,"snapshot_sha256":"fd781cb6e67e801de25f2d5d408613b1e92b46f4f6749a54915cb7a0cd6b6fe6","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"53f947b227171774cd240bc9be4978fa40d83928367b6228ba4e962e22c2ce8b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b0d90bdf-e268-4143-bb45-ffb6f326d3b2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK4Muj3pnE1V9eEm4k36b2uuImQw2dERLXZ6kM1wg/IORwloBmpSE16J/lCMEcagEfoEl12bDJHO7WCHJwJYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:38:25.118411Z"},"content_sha256":"5f3e14c0724930ea963b2759079d4f8f9d405e601587b159fc374a1dad9e095c","schema_version":"1.0","event_id":"sha256:5f3e14c0724930ea963b2759079d4f8f9d405e601587b159fc374a1dad9e095c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-98334-930) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Edward Zulkoski et al. “Learning-Sensitive Back- doors with Restarts”. In:Principles and Prac- tice of Constraint Programming – CP 2018. Ed. by John N. Hooker. V ol. 11008. Lecture Notes in Computer Science. Cham: Springer, 2018, pp. 453–46","arxiv_id":"2605.15506","detector":"doi_compliance","evidence":{"ref_index":29,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Edward Zulkoski et al. “Learning-Sensitive Back- doors with Restarts”. In:Principles and Prac- tice of Constraint Programming – CP 2018. Ed. by John N. Hooker. V ol. 11008. Lecture Notes in Computer Science. Cham: Springer, 2018, pp. 453–46","reconstructed_doi":"10.1007/978-3-319-98334-930"},"severity":"advisory","ref_index":29,"audited_at":"2026-05-19T15:30:41.489213Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-98334-930","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2710165d0beb5e233defceabaf6372cb19cf3f24cf9e842c66bfc80041133884","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1867,"payload_sha256":"c1d8c5236f8c5e91e5bea1e1a7c2093aa5944371b426248bdd6517b752b09528","signature_b64":"KFX80mEyvRaAIt0XtEmvwqR6EziQaGg1DZQDhLDwSoLcmD10L6ridT3dk7de5ToVo8lbndh74PAqy1zL4OT2CA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T15:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzW2FeeHU3vkO0IfRYkKMLZWPbkNToOLQLgnFIE3JLy/c4WXwdTR+1dqjYoCW838fFChE8HiURpdEpzJXkXzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:38:25.120035Z"},"content_sha256":"350a3907440298335d55c4e967c2e8ddfff0b7a3e6b3b8bdb34945c9dfc4f671","schema_version":"1.0","event_id":"sha256:350a3907440298335d55c4e967c2e8ddfff0b7a3e6b3b8bdb34945c9dfc4f671"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-24318-418) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Carlos Ans ´otegui et al. “Using Community Struc- ture to Detect Relevant Learnt Clauses”. In: Theory and Applications of Satisfiability Testing (SAT). 2015, pp. 238–254.DOI: 10.1007/978-3- 319-24318-4 18","arxiv_id":"2605.15506","detector":"doi_compliance","evidence":{"ref_index":27,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Carlos Ans ´otegui et al. “Using Community Struc- ture to Detect Relevant Learnt Clauses”. In: Theory and Applications of Satisfiability Testing (SAT). 2015, pp. 238–254.DOI: 10.1007/978-3- 319-24318-4 18","reconstructed_doi":"10.1007/978-3-319-24318-418"},"severity":"advisory","ref_index":27,"audited_at":"2026-05-19T15:30:41.489213Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-24318-418","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8cbe0557f1eb99935512c992e35e3d77727fcc8ff8c4f2b1ace0d34e428799d6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1866,"payload_sha256":"734513dd3eb49d485a78f75e70857d32588361f8a75754dce40d33f7ac1f8cf4","signature_b64":"DublB7En5Ye9gOyVQOPJIynmkRLCxhzobPtp7+H5yzqZSEdgrMmgHwee6txbp/ukBQZGDnDuH8G+l1zdL/o4Bw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T15:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtXd74AJ/bMVDxwo9a0FMaVAnzuvU6j0vshStKVrZ1vazp/608Rk5emjSOERhNR5GTLgZ+kFYJSgYlGV1pr/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:38:25.120611Z"},"content_sha256":"b1ddab8606251e3f47c7f48407c5340eafe0d423d4d7a4eda3d0c2953daab76c","schema_version":"1.0","event_id":"sha256:b1ddab8606251e3f47c7f48407c5340eafe0d423d4d7a4eda3d0c2953daab76c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M62KI5LT6OLREUKK32JO3AMU5B/bundle.json","state_url":"https://pith.science/pith/M62KI5LT6OLREUKK32JO3AMU5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M62KI5LT6OLREUKK32JO3AMU5B/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-21T05:38:25Z","links":{"resolver":"https://pith.science/pith/M62KI5LT6OLREUKK32JO3AMU5B","bundle":"https://pith.science/pith/M62KI5LT6OLREUKK32JO3AMU5B/bundle.json","state":"https://pith.science/pith/M62KI5LT6OLREUKK32JO3AMU5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M62KI5LT6OLREUKK32JO3AMU5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:M62KI5LT6OLREUKK32JO3AMU5B","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"adb079217ef763fbbc609986e699f951b2d48e58904e6abcfef1bfa3ac820223","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T00:56:53Z","title_canon_sha256":"d3a0ec244e355500621dfd723003ffd6817be875a5a46b64036c1393facd1d94"},"schema_version":"1.0","source":{"id":"2605.15506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15506","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15506v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15506","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"M62KI5LT6OLR","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"M62KI5LT6OLREUKK","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"M62KI5LT","created_at":"2026-05-20T00:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:5f3e14c0724930ea963b2759079d4f8f9d405e601587b159fc374a1dad9e095c","target":"graph","created_at":"2026-05-20T00:01:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By contrast, the recently proposed proofdoor parameter explains this phenomenon well. In support of the proofdoor hypothesis, we make three key contributions. First, we empirically show that CDCL solvers do compute small proofdoors for linearly-scaling BMC instances. Second, we show that for exponentially-scaling instances, sampled proofdoors scale exponentially and are typically not incrementally absorbed."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that sampled interpolants between formula chunks accurately represent the solver's internal memoization of reasoning effort, as described in the abstract where each interpolant is said to represent memoization on chunks already analyzed. If this representational link does not hold for actual CDCL execution traces, the claimed explanation for linear versus exponential scaling would not follow from the measurements."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others."}],"snapshot_sha256":"b13e5a7c59fbea175696cbb1f08fee28c120627077e87aabbbbb407e2ac63f28"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"53f947b227171774cd240bc9be4978fa40d83928367b6228ba4e962e22c2ce8b"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.718474Z","status":"completed","version":"1.0.0"},{"findings_count":2,"name":"doi_compliance","ran_at":"2026-05-19T15:30:41.489213Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:55.472797Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.059345Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.851320Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.390244Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.638071Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15506/integrity.json","findings":[{"audited_at":"2026-05-19T15:30:41.489213Z","detected_arxiv_id":null,"detected_doi":"10.1007/978-3-319-24318-418","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-24318-418) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":27,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T15:30:41.489213Z","detected_arxiv_id":null,"detected_doi":"10.1007/978-3-319-98334-930","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-98334-930) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":29,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"2c00c35b3e946fdb8086e87b82b8a048f0ee08c28848c816f5d7ac44309fa321","summary":{"advisory":2,"by_detector":{"doi_compliance":{"advisory":2,"critical":0,"informational":0,"total":2}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the past several decades, CDCL SAT solvers have proven remarkably effective on large industrial formulas, despite SAT being NP-complete and widely believed to be intractable. While considerable empirical research has been done on solver performance over benchmarks like the SAT competition, as well as scaling studies on random and crafted families, surprisingly little effort has gone into systematic scaling studies over industrial instances. To address this gap, we collect a large benchmark of Bounded Model Checking (BMC) instances (76,600+ across 766 families) and perform a systematic sca","authors_text":"Chunxiao Li, Jianwen Li, Moshe Y. Vardi, Shimin Zhang, Vijay Ganesh, Yechuan Xia","cross_cats":[],"headline":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T00:56:53Z","title":"Understanding CDCL Solvers via Scalability Studies and Proofdoors"},"references":{"count":41,"internal_anchors":0,"resolved_work":41,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proofdoors and Efficiency of CDCL Solvers","work_id":"280522fd-e096-4856-a721-ded4a54bb173","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bounded Model Checking Using Satisfiability Solving","work_id":"173a06cf-7ce2-4b07-819f-492d43fa6697","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Benefits of bounded model checking at an industrial setting","work_id":"98cc528c-faca-4d95-b397-196b97857fa8","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Feng, Y ., You, H., Zhang, Z., Ji, R., and Gao, Y","work_id":"b7fbfa39-ee97-4677-9a7d-40f8a82a433e","year":1971},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On the Unreasonable Effectiveness of SAT Solvers","work_id":"05824d8c-07bd-4351-a129-91ea1180e1b2","year":2021}],"snapshot_sha256":"fd781cb6e67e801de25f2d5d408613b1e92b46f4f6749a54915cb7a0cd6b6fe6"},"source":{"id":"2605.15506","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:24:42.069111Z","id":"b0d90bdf-e268-4143-bb45-ffb6f326d3b2","model_set":{"reader":"grok-4.3"},"one_line_summary":"CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Proofdoors explain why CDCL solvers scale linearly on some bounded model checking instances but exponentially on others.","strongest_claim":"By contrast, the recently proposed proofdoor parameter explains this phenomenon well. In support of the proofdoor hypothesis, we make three key contributions. First, we empirically show that CDCL solvers do compute small proofdoors for linearly-scaling BMC instances. Second, we show that for exponentially-scaling instances, sampled proofdoors scale exponentially and are typically not incrementally absorbed.","weakest_assumption":"The assumption that sampled interpolants between formula chunks accurately represent the solver's internal memoization of reasoning effort, as described in the abstract where each interpolant is said to represent memoization on chunks already analyzed. If this representational link does not hold for actual CDCL execution traces, the claimed explanation for linear versus exponential scaling would not follow from the measurements."}},"verdict_id":"b0d90bdf-e268-4143-bb45-ffb6f326d3b2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2c79aca4136526f2cf6ba9fcc69e8b7f78e01a50e7020e76bb6f31afebc42ede","target":"record","created_at":"2026-05-20T00:01:02Z","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":"adb079217ef763fbbc609986e699f951b2d48e58904e6abcfef1bfa3ac820223","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T00:56:53Z","title_canon_sha256":"d3a0ec244e355500621dfd723003ffd6817be875a5a46b64036c1393facd1d94"},"schema_version":"1.0","source":{"id":"2605.15506","kind":"arxiv","version":1}},"canonical_sha256":"67b4a47573f39712514ade92ed8194e87404bccd3c4bcc975670d14af37b79f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67b4a47573f39712514ade92ed8194e87404bccd3c4bcc975670d14af37b79f7","first_computed_at":"2026-05-20T00:01:02.183222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:02.183222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uCUvXriX9mrDCPBUg4Iw4M51NV1UwKJ0ebIH7SVhDwviO3/SdTISl/OPGsVxJYZMAdAzcnREO2ORsHSHY/VPBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:02.184072Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15506","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:350a3907440298335d55c4e967c2e8ddfff0b7a3e6b3b8bdb34945c9dfc4f671","sha256:b1ddab8606251e3f47c7f48407c5340eafe0d423d4d7a4eda3d0c2953daab76c"]}],"invalid_events":[],"applied_event_ids":["sha256:2c79aca4136526f2cf6ba9fcc69e8b7f78e01a50e7020e76bb6f31afebc42ede","sha256:5f3e14c0724930ea963b2759079d4f8f9d405e601587b159fc374a1dad9e095c"],"state_sha256":"fc986a916a93ed6bfec615a34b3108d1bdf4204ebdba3e623f79cdb6e1e33782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3D6Ns8dU5+SZON7sbezDyuY796Vdaa/bmwB7IFYl5W5oMgqmv5yopea9HyhwNvEWNqiE8vxkl9rgAKk5ByaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:38:25.125646Z","bundle_sha256":"c08eb9e039dc8e085dae66feb69dc0f2f369788531b7cbd7af58c9523554efba"}}