{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4PCJJCLAHPGBW3OTX3V4EZ47MY","short_pith_number":"pith:4PCJJCLA","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"},"canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","source":{"kind":"arxiv","id":"2605.28220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28220","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28220v1","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28220","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"4PCJJCLAHPGB","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"4PCJJCLAHPGBW3OT","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"4PCJJCLA","created_at":"2026-05-28T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4PCJJCLAHPGBW3OTX3V4EZ47MY","target":"record","payload":{"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"},"canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","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"},"source_kind":"arxiv","source_id":"2605.28220","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-28T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpCZYMp2kPREOwz+64P88XveOu4fv8wYmyg/TjA4PmAqQU4kTR+dnpzUVeP6IBw/YWjlxCJ2VGAt19dQD/b9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:12:09.336922Z"},"content_sha256":"5e052fbf926faab96e81a2074015bacf1e7a440511efa07aff82a127fd45e09f","schema_version":"1.0","event_id":"sha256:5e052fbf926faab96e81a2074015bacf1e7a440511efa07aff82a127fd45e09f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4PCJJCLAHPGBW3OTX3V4EZ47MY","target":"graph","payload":{"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"},"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-28T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7apzLAU4lgNht1rQjKwHxucNKQ7jD2qO3o8vNCmg774AKC9cgGNq+rvpRkDck9BKVOKkETlrGNERHZbbpDbhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:12:09.337285Z"},"content_sha256":"9f6a6635d975eb576067567e122d0be5298adea211c01f6401f6583d1b222526","schema_version":"1.0","event_id":"sha256:9f6a6635d975eb576067567e122d0be5298adea211c01f6401f6583d1b222526"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/bundle.json","state_url":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/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-06-30T14:12:09Z","links":{"resolver":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY","bundle":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/bundle.json","state":"https://pith.science/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PCJJCLAHPGBW3OTX3V4EZ47MY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4PCJJCLAHPGBW3OTX3V4EZ47MY","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":"2a76e1ddef5ede818bdfcdbedbf6d2c9904602d65c1533d7be48cadbd509c76b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-27T09:36:11Z","title_canon_sha256":"69d0c7d9114bf90b7351fb07c3c5874cf28a917cc962125e0cd1a027b622b573"},"schema_version":"1.0","source":{"id":"2605.28220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28220","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28220v1","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28220","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"4PCJJCLAHPGB","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"4PCJJCLAHPGBW3OT","created_at":"2026-05-28T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"4PCJJCLA","created_at":"2026-05-28T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:9f6a6635d975eb576067567e122d0be5298adea211c01f6401f6583d1b222526","target":"graph","created_at":"2026-05-28T01:05:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.28220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Laura Kov\\'acs, Robin Coutelier, Thomas Hader","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-27T09:36:11Z","title":"Generalizing CDCL with Graph Backtracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28220","kind":"arxiv","version":1},"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:5e052fbf926faab96e81a2074015bacf1e7a440511efa07aff82a127fd45e09f","target":"record","created_at":"2026-05-28T01:05:03Z","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":"2a76e1ddef5ede818bdfcdbedbf6d2c9904602d65c1533d7be48cadbd509c76b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-27T09:36:11Z","title_canon_sha256":"69d0c7d9114bf90b7351fb07c3c5874cf28a917cc962125e0cd1a027b622b573"},"schema_version":"1.0","source":{"id":"2605.28220","kind":"arxiv","version":1}},"canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3c49489603bcc1b6dd3beebc2679f6618045d0d6e8d3f2b6a8aefbfa823bb8c","first_computed_at":"2026-05-28T01:05:03.022603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:03.022603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H52UDTjcpmH6UOaTrVnTSm1VVWuIUZmmGlEwLdd/gwWGeRQxeonXcO705RLBb97Bodu+ZMtGGxO5GOtwfPSkBQ==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:03.023072Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e052fbf926faab96e81a2074015bacf1e7a440511efa07aff82a127fd45e09f","sha256:9f6a6635d975eb576067567e122d0be5298adea211c01f6401f6583d1b222526"],"state_sha256":"57098a87c408f3e7fba12730fd8cd9c97407b364569794a968d20233a508c52d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iooaXEWigugtQ6p0mwj/QLRdOnQ3Jqs1uHtVP4y8AEjh30GqNP22ro07EJyLZmL6FTTlYJU+TfTlJoQWYe1aBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T14:12:09.339245Z","bundle_sha256":"9c9b74f1b9b94563b2e82e99ac00bfb86377b02abd6c6fcccad41b534a71dfd4"}}