{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F4XHIH6NTYTCBFB43Y4MZSEIAS","short_pith_number":"pith:F4XHIH6N","canonical_record":{"source":{"id":"1204.6233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-27T14:51:23Z","cross_cats_sorted":["cs.AI","cs.CC","cs.DM","math.CO"],"title_canon_sha256":"5aeb1b37e15da6091eebb8d45f32972be3255f7e9697085baf9833618ba2c9aa","abstract_canon_sha256":"1b5753c4a3a5ef2186efca27285bc09d7803f1095e912ffe5b4a37f1a194ae5f"},"schema_version":"1.0"},"canonical_sha256":"2f2e741fcd9e2620943cde38ccc888049de3d094f6be7f3cb9c4f86363375262","source":{"kind":"arxiv","id":"1204.6233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6233","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6233v1","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6233","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"F4XHIH6NTYTC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F4XHIH6NTYTCBFB4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F4XHIH6N","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F4XHIH6NTYTCBFB43Y4MZSEIAS","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-27T14:51:23Z","cross_cats_sorted":["cs.AI","cs.CC","cs.DM","math.CO"],"title_canon_sha256":"5aeb1b37e15da6091eebb8d45f32972be3255f7e9697085baf9833618ba2c9aa","abstract_canon_sha256":"1b5753c4a3a5ef2186efca27285bc09d7803f1095e912ffe5b4a37f1a194ae5f"},"schema_version":"1.0"},"canonical_sha256":"2f2e741fcd9e2620943cde38ccc888049de3d094f6be7f3cb9c4f86363375262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:46.694881Z","signature_b64":"UImwWAn/XrTey7dp7MxvObzaKHE6PIn4gU99zDtezKfXxPvmt6kdtRQXswlzbdFcWUR/tWw94WeriPQw1DlgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f2e741fcd9e2620943cde38ccc888049de3d094f6be7f3cb9c4f86363375262","last_reissued_at":"2026-05-18T03:56:46.694099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:46.694099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6233","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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owYvG3abMDnK+FiuTK089/gY+QCf9972ri5LG6oTqXSUoWDOg0P5Qu76DwrgtZsJlcwACpzos1Y7VMHoOpfaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:17:25.687900Z"},"content_sha256":"b57902d237ebb09bd50bb09de6aec1537f7076f90023e4a7bb3074c8a93115fc","schema_version":"1.0","event_id":"sha256:b57902d237ebb09bd50bb09de6aec1537f7076f90023e4a7bb3074c8a93115fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F4XHIH6NTYTCBFB43Y4MZSEIAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Backdoors to Bounded Treewidth SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Serge Gaspers, Stefan Szeider","submitted_at":"2012-04-27T14:51:23Z","abstract_excerpt":"There are various approaches to exploiting \"hidden structure\" in instances of hard combinatorial problems to allow faster algorithms than for general unstructured or random instances. For SAT and its counting version #SAT, hidden structure has been exploited in terms of decomposability and strong backdoor sets. Decomposability can be considered in terms of the treewidth of a graph that is associated with the given CNF formula, for instance by considering clauses and variables as vertices of the graph, and making a variable adjacent with all the clauses it appears in. On the other hand, a stron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6233","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":""},"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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a0Du00OXMzD3n0zB+ja61H7TYVmBNoyYu5FTNsZlbYVnolDIKMvCT1dyHxIaUU8jAXlZx+6/TkwpERzHi5SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:17:25.688634Z"},"content_sha256":"d93fc61ddf2517998da6549cad06d17ed07b7deae7319a13c76aa7b3a061dd77","schema_version":"1.0","event_id":"sha256:d93fc61ddf2517998da6549cad06d17ed07b7deae7319a13c76aa7b3a061dd77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/bundle.json","state_url":"https://pith.science/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/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-29T15:17:25Z","links":{"resolver":"https://pith.science/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS","bundle":"https://pith.science/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/bundle.json","state":"https://pith.science/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4XHIH6NTYTCBFB43Y4MZSEIAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F4XHIH6NTYTCBFB43Y4MZSEIAS","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":"1b5753c4a3a5ef2186efca27285bc09d7803f1095e912ffe5b4a37f1a194ae5f","cross_cats_sorted":["cs.AI","cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-27T14:51:23Z","title_canon_sha256":"5aeb1b37e15da6091eebb8d45f32972be3255f7e9697085baf9833618ba2c9aa"},"schema_version":"1.0","source":{"id":"1204.6233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6233","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6233v1","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6233","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"F4XHIH6NTYTC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F4XHIH6NTYTCBFB4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F4XHIH6N","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:d93fc61ddf2517998da6549cad06d17ed07b7deae7319a13c76aa7b3a061dd77","target":"graph","created_at":"2026-05-18T03:56:46Z","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"},"paper":{"abstract_excerpt":"There are various approaches to exploiting \"hidden structure\" in instances of hard combinatorial problems to allow faster algorithms than for general unstructured or random instances. For SAT and its counting version #SAT, hidden structure has been exploited in terms of decomposability and strong backdoor sets. Decomposability can be considered in terms of the treewidth of a graph that is associated with the given CNF formula, for instance by considering clauses and variables as vertices of the graph, and making a variable adjacent with all the clauses it appears in. On the other hand, a stron","authors_text":"Serge Gaspers, Stefan Szeider","cross_cats":["cs.AI","cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-27T14:51:23Z","title":"Strong Backdoors to Bounded Treewidth SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6233","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:b57902d237ebb09bd50bb09de6aec1537f7076f90023e4a7bb3074c8a93115fc","target":"record","created_at":"2026-05-18T03:56:46Z","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":"1b5753c4a3a5ef2186efca27285bc09d7803f1095e912ffe5b4a37f1a194ae5f","cross_cats_sorted":["cs.AI","cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-27T14:51:23Z","title_canon_sha256":"5aeb1b37e15da6091eebb8d45f32972be3255f7e9697085baf9833618ba2c9aa"},"schema_version":"1.0","source":{"id":"1204.6233","kind":"arxiv","version":1}},"canonical_sha256":"2f2e741fcd9e2620943cde38ccc888049de3d094f6be7f3cb9c4f86363375262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f2e741fcd9e2620943cde38ccc888049de3d094f6be7f3cb9c4f86363375262","first_computed_at":"2026-05-18T03:56:46.694099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:46.694099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UImwWAn/XrTey7dp7MxvObzaKHE6PIn4gU99zDtezKfXxPvmt6kdtRQXswlzbdFcWUR/tWw94WeriPQw1DlgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:46.694881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b57902d237ebb09bd50bb09de6aec1537f7076f90023e4a7bb3074c8a93115fc","sha256:d93fc61ddf2517998da6549cad06d17ed07b7deae7319a13c76aa7b3a061dd77"],"state_sha256":"5ca5d0b247dea91e4b9c69cc67f7d02565e83211ba493fb60d71ce8a61738bbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLMa3FvZuD8wPPApXDpdIki2XOhItZCA9W/C0988uvZQxlBl7UibUk5S7IYuJnxsFeA+DoPG43l4Y2duhhPKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:17:25.692461Z","bundle_sha256":"82b9a318e93e0c35f6165597392015e2deb0639ca5eee252e23a5eaf0512e1d7"}}