{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AWQ5EUZCC5RWGIKWXGN2ZB6F6N","short_pith_number":"pith:AWQ5EUZC","canonical_record":{"source":{"id":"1110.6384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-28T16:10:32Z","cross_cats_sorted":["cs.AI","cs.CC","math.CO"],"title_canon_sha256":"fa0879dd0e0b6c88b3beaca0c133ba003a0562feb7167044148d01d3f5bf9ce9","abstract_canon_sha256":"8cf36ffb46b467c3577f7228ca013db30939f5970cc291f08e544f6e6b435a6c"},"schema_version":"1.0"},"canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","source":{"kind":"arxiv","id":"1110.6384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6384","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6384v3","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6384","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"AWQ5EUZCC5RW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWQ5EUZCC5RWGIKW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWQ5EUZC","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AWQ5EUZCC5RWGIKWXGN2ZB6F6N","target":"record","payload":{"canonical_record":{"source":{"id":"1110.6384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-28T16:10:32Z","cross_cats_sorted":["cs.AI","cs.CC","math.CO"],"title_canon_sha256":"fa0879dd0e0b6c88b3beaca0c133ba003a0562feb7167044148d01d3f5bf9ce9","abstract_canon_sha256":"8cf36ffb46b467c3577f7228ca013db30939f5970cc291f08e544f6e6b435a6c"},"schema_version":"1.0"},"canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:50.810185Z","signature_b64":"fcNYp5XIomC6Q8hMyh1CaJKY5YyOFSEM3hFdgCSzuJPRLekviOUsFe0IOdYhPPv/47X8JPzlsqP7lHgZ+LQEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","last_reissued_at":"2026-05-18T04:01:50.809444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:50.809444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.6384","source_version":3,"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-18T04:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vrmOqi6X4UJu/tbs3gMMX8ovOIAKVR3J+3cp/dBeBr+QKyej0NMFvmclhGBiQ/E9F04SJx0kZfs9sp1XhCbqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:40:21.958406Z"},"content_sha256":"890814cce6505500643d6acfd272b9cf283487bebbc52c5016c45feb48aac079","schema_version":"1.0","event_id":"sha256:890814cce6505500643d6acfd272b9cf283487bebbc52c5016c45feb48aac079"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AWQ5EUZCC5RWGIKWXGN2ZB6F6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Backdoors to Acyclic SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Serge Gaspers, Stefan Szeider","submitted_at":"2011-10-28T16:10:32Z","abstract_excerpt":"Backdoor sets, a notion introduced by Williams et al. in 2003, are certain sets of key variables of a CNF formula F that make it easy to solve the formula; by assigning truth values to the variables in a backdoor set, the formula gets reduced to one or several polynomial-time solvable formulas. More specifically, a weak backdoor set of F is a set X of variables such that there exits a truth assignment t to X that reduces F to a satisfiable formula F[t] that belongs to a polynomial-time decidable base class C. A strong backdoor set is a set X of variables such that for all assignments t to X, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6384","kind":"arxiv","version":3},"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-18T04:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU91/nwpk4MWD7j7JV83AsmwzYS10aKaT1IqfhdPUYZKPI75L+2R7EeEfdosHnpHzYQxRnZlL5W3nFNIDAtwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:40:21.959112Z"},"content_sha256":"79e4984b09af151c3ed59cd137744d2634fefd9527fc59ec4dcc72c90da7fd52","schema_version":"1.0","event_id":"sha256:79e4984b09af151c3ed59cd137744d2634fefd9527fc59ec4dcc72c90da7fd52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/bundle.json","state_url":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/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-28T23:40:21Z","links":{"resolver":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N","bundle":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/bundle.json","state":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AWQ5EUZCC5RWGIKWXGN2ZB6F6N","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":"8cf36ffb46b467c3577f7228ca013db30939f5970cc291f08e544f6e6b435a6c","cross_cats_sorted":["cs.AI","cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-28T16:10:32Z","title_canon_sha256":"fa0879dd0e0b6c88b3beaca0c133ba003a0562feb7167044148d01d3f5bf9ce9"},"schema_version":"1.0","source":{"id":"1110.6384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6384","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6384v3","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6384","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"AWQ5EUZCC5RW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWQ5EUZCC5RWGIKW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWQ5EUZC","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:79e4984b09af151c3ed59cd137744d2634fefd9527fc59ec4dcc72c90da7fd52","target":"graph","created_at":"2026-05-18T04:01:50Z","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":"Backdoor sets, a notion introduced by Williams et al. in 2003, are certain sets of key variables of a CNF formula F that make it easy to solve the formula; by assigning truth values to the variables in a backdoor set, the formula gets reduced to one or several polynomial-time solvable formulas. More specifically, a weak backdoor set of F is a set X of variables such that there exits a truth assignment t to X that reduces F to a satisfiable formula F[t] that belongs to a polynomial-time decidable base class C. A strong backdoor set is a set X of variables such that for all assignments t to X, t","authors_text":"Serge Gaspers, Stefan Szeider","cross_cats":["cs.AI","cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-28T16:10:32Z","title":"Backdoors to Acyclic SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6384","kind":"arxiv","version":3},"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:890814cce6505500643d6acfd272b9cf283487bebbc52c5016c45feb48aac079","target":"record","created_at":"2026-05-18T04:01:50Z","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":"8cf36ffb46b467c3577f7228ca013db30939f5970cc291f08e544f6e6b435a6c","cross_cats_sorted":["cs.AI","cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-28T16:10:32Z","title_canon_sha256":"fa0879dd0e0b6c88b3beaca0c133ba003a0562feb7167044148d01d3f5bf9ce9"},"schema_version":"1.0","source":{"id":"1110.6384","kind":"arxiv","version":3}},"canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","first_computed_at":"2026-05-18T04:01:50.809444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:50.809444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fcNYp5XIomC6Q8hMyh1CaJKY5YyOFSEM3hFdgCSzuJPRLekviOUsFe0IOdYhPPv/47X8JPzlsqP7lHgZ+LQEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:50.810185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.6384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890814cce6505500643d6acfd272b9cf283487bebbc52c5016c45feb48aac079","sha256:79e4984b09af151c3ed59cd137744d2634fefd9527fc59ec4dcc72c90da7fd52"],"state_sha256":"4d5e6ce02923202445dcf77964f37c3f8bd809fb83bdcd8e75476b850a505806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcfGuBFoHb+Dx34k5nIQw99OiTIfoxQHgAbFjBqUNXSYeI9+Wzp4AXJrLuWakExy2J3xd8GfurxX1EDW7Zr6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:40:21.962846Z","bundle_sha256":"7809b86f23937d371222c3844d162dd9b11cdef10a0cd5c57e32839c5bdf04ef"}}