{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4PCJJCLAHPGBW3OTX3V4EZ47MY","short_pith_number":"pith:4PCJJCLA","schema_version":"1.0","canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","source":{"kind":"arxiv","id":"2605.28220","version":1},"attestation_state":"computed","paper":{"title":"Generalizing CDCL with Graph Backtracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Laura Kov\\'acs, Robin Coutelier, Thomas Hader","submitted_at":"2026-05-27T09:36:11Z","abstract_excerpt":"We present graph backtracking, a novel, fine-grained backtracking scheme for CDCL-based SAT solving, parametrized by a user-defined weight function. For conflict repair, we challenge the decision level abstraction and use the implication graph as a precise guiding structure to minimize the weight of literals that are unassigned. Graph backtracking is sound and complete. We show that it is a generalization of chronological and non-chronological backtracking by simulating them with specific weight functions. Our approach is implemented in the experimental solver NapSAT. Empirical results show th"},"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":"2605.28220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-27T09:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"69d0c7d9114bf90b7351fb07c3c5874cf28a917cc962125e0cd1a027b622b573","abstract_canon_sha256":"2a76e1ddef5ede818bdfcdbedbf6d2c9904602d65c1533d7be48cadbd509c76b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:03.023072Z","signature_b64":"H52UDTjcpmH6UOaTrVnTSm1VVWuIUZmmGlEwLdd/gwWGeRQxeonXcO705RLBb97Bodu+ZMtGGxO5GOtwfPSkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","last_reissued_at":"2026-05-28T01:05:03.022603Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:03.022603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing CDCL with Graph Backtracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Laura Kov\\'acs, Robin Coutelier, Thomas Hader","submitted_at":"2026-05-27T09:36:11Z","abstract_excerpt":"We present graph backtracking, a novel, fine-grained backtracking scheme for CDCL-based SAT solving, parametrized by a user-defined weight function. For conflict repair, we challenge the decision level abstraction and use the implication graph as a precise guiding structure to minimize the weight of literals that are unassigned. Graph backtracking is sound and complete. We show that it is a generalization of chronological and non-chronological backtracking by simulating them with specific weight functions. Our approach is implemented in the experimental solver NapSAT. Empirical results show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28220","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/2605.28220/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":"2605.28220","created_at":"2026-05-28T01:05:03.022678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28220v1","created_at":"2026-05-28T01:05:03.022678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28220","created_at":"2026-05-28T01:05:03.022678+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PCJJCLAHPGB","created_at":"2026-05-28T01:05:03.022678+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PCJJCLAHPGBW3OT","created_at":"2026-05-28T01:05:03.022678+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PCJJCLA","created_at":"2026-05-28T01:05:03.022678+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/4PCJJCLAHPGBW3OTX3V4EZ47MY","json":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY.json","graph_json":"https://pith.science/api/pith-number/4PCJJCLAHPGBW3OTX3V4EZ47MY/graph.json","events_json":"https://pith.science/api/pith-number/4PCJJCLAHPGBW3OTX3V4EZ47MY/events.json","paper":"https://pith.science/paper/4PCJJCLA"},"agent_actions":{"view_html":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY","download_json":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY.json","view_paper":"https://pith.science/paper/4PCJJCLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28220&json=true","fetch_graph":"https://pith.science/api/pith-number/4PCJJCLAHPGBW3OTX3V4EZ47MY/graph.json","fetch_events":"https://pith.science/api/pith-number/4PCJJCLAHPGBW3OTX3V4EZ47MY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/action/storage_attestation","attest_author":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/action/author_attestation","sign_citation":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/action/citation_signature","submit_replication":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/action/replication_record"}},"created_at":"2026-05-28T01:05:03.022678+00:00","updated_at":"2026-05-28T01:05:03.022678+00:00"}