{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PSY24EUFUXGJGSIEGFII5CBH65","short_pith_number":"pith:PSY24EUF","schema_version":"1.0","canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","source":{"kind":"arxiv","id":"1304.5961","version":1},"attestation_state":"computed","paper":{"title":"Backdoors to Abduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andreas Pfandler, Stefan R\\\"ummele, Stefan Szeider","submitted_at":"2013-04-22T14:23:11Z","abstract_excerpt":"Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, and automated planning. Unfortunately, Abduction is of high computational complexity; even propositional Abduction is \\Sigma_2^P-complete and thus harder than NP and coNP. This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT). In this work we use structural properties of the Abduction instance to break this complexity barrier. We utilize the problem structu"},"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":"1304.5961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T14:23:11Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"e125b2111f6366d2af364c3ea48d722305a23d93488d726710990eb73fa62ffe","abstract_canon_sha256":"63c260a7586c89d5f545fa28cdd145bce9de91f11a9e97300bb2ed0329726bd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.669075Z","signature_b64":"+LQkMV7A0r5D+yd67hE/zlkgpsh0vtDK3N1DGSdhzdt4TJDX017WbioIHOWcutV2y13IaLjlZ7D3UweLt/peBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","last_reissued_at":"2026-05-18T03:27:23.668139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.668139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backdoors to Abduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andreas Pfandler, Stefan R\\\"ummele, Stefan Szeider","submitted_at":"2013-04-22T14:23:11Z","abstract_excerpt":"Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, and automated planning. Unfortunately, Abduction is of high computational complexity; even propositional Abduction is \\Sigma_2^P-complete and thus harder than NP and coNP. This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT). In this work we use structural properties of the Abduction instance to break this complexity barrier. We utilize the problem structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5961","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.5961","created_at":"2026-05-18T03:27:23.668270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5961v1","created_at":"2026-05-18T03:27:23.668270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5961","created_at":"2026-05-18T03:27:23.668270+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSY24EUFUXGJ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSY24EUFUXGJGSIE","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSY24EUF","created_at":"2026-05-18T12:27:57.521954+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/PSY24EUFUXGJGSIEGFII5CBH65","json":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65.json","graph_json":"https://pith.science/api/pith-number/PSY24EUFUXGJGSIEGFII5CBH65/graph.json","events_json":"https://pith.science/api/pith-number/PSY24EUFUXGJGSIEGFII5CBH65/events.json","paper":"https://pith.science/paper/PSY24EUF"},"agent_actions":{"view_html":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65","download_json":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65.json","view_paper":"https://pith.science/paper/PSY24EUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5961&json=true","fetch_graph":"https://pith.science/api/pith-number/PSY24EUFUXGJGSIEGFII5CBH65/graph.json","fetch_events":"https://pith.science/api/pith-number/PSY24EUFUXGJGSIEGFII5CBH65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/action/storage_attestation","attest_author":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/action/author_attestation","sign_citation":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/action/citation_signature","submit_replication":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/action/replication_record"}},"created_at":"2026-05-18T03:27:23.668270+00:00","updated_at":"2026-05-18T03:27:23.668270+00:00"}