{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AWQ5EUZCC5RWGIKWXGN2ZB6F6N","short_pith_number":"pith:AWQ5EUZC","schema_version":"1.0","canonical_sha256":"05a1d253221763632156b99bac87c5f36c9b92ca8c6dee297bccad59ef3dc1de","source":{"kind":"arxiv","id":"1110.6384","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.6384","created_at":"2026-05-18T04:01:50.809556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.6384v3","created_at":"2026-05-18T04:01:50.809556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6384","created_at":"2026-05-18T04:01:50.809556+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWQ5EUZCC5RW","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWQ5EUZCC5RWGIKW","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWQ5EUZC","created_at":"2026-05-18T12:26:24.575870+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/AWQ5EUZCC5RWGIKWXGN2ZB6F6N","json":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N.json","graph_json":"https://pith.science/api/pith-number/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/graph.json","events_json":"https://pith.science/api/pith-number/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/events.json","paper":"https://pith.science/paper/AWQ5EUZC"},"agent_actions":{"view_html":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N","download_json":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N.json","view_paper":"https://pith.science/paper/AWQ5EUZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.6384&json=true","fetch_graph":"https://pith.science/api/pith-number/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/graph.json","fetch_events":"https://pith.science/api/pith-number/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/action/storage_attestation","attest_author":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/action/author_attestation","sign_citation":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/action/citation_signature","submit_replication":"https://pith.science/pith/AWQ5EUZCC5RWGIKWXGN2ZB6F6N/action/replication_record"}},"created_at":"2026-05-18T04:01:50.809556+00:00","updated_at":"2026-05-18T04:01:50.809556+00:00"}