{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PSY24EUFUXGJGSIEGFII5CBH65","short_pith_number":"pith:PSY24EUF","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"},"canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","source":{"kind":"arxiv","id":"1304.5961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5961","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5961v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5961","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"PSY24EUFUXGJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PSY24EUFUXGJGSIE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PSY24EUF","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PSY24EUFUXGJGSIEGFII5CBH65","target":"record","payload":{"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"},"canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","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"},"source_kind":"arxiv","source_id":"1304.5961","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:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mrf22Jx4W25osiVzXcfQm/7sVfmuESTx12P81MTgKY8twxjj2w7or6jIIl5XNE7lq4R9oZCLp1xah6NipeulAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:46:05.455288Z"},"content_sha256":"4068464027c4938f2a18dbace314818f2a0dd2b4011dee5a75cceff280d4e54f","schema_version":"1.0","event_id":"sha256:4068464027c4938f2a18dbace314818f2a0dd2b4011dee5a75cceff280d4e54f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PSY24EUFUXGJGSIEGFII5CBH65","target":"graph","payload":{"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"},"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:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7ZYu6IJYbFNr0Nt5AQdMZeSLk3hz/nATbyExqf4Urd3i1LkLNIW7/LSj+tX+TAXhcW4cBrjxtZrbIHlO9bDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:46:05.455974Z"},"content_sha256":"41355d3ede5eea8645c6326071d07b703cfbfc0ddea168e82c96e834e068c5d1","schema_version":"1.0","event_id":"sha256:41355d3ede5eea8645c6326071d07b703cfbfc0ddea168e82c96e834e068c5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/bundle.json","state_url":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSY24EUFUXGJGSIEGFII5CBH65/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-29T14:46:05Z","links":{"resolver":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65","bundle":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/bundle.json","state":"https://pith.science/pith/PSY24EUFUXGJGSIEGFII5CBH65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSY24EUFUXGJGSIEGFII5CBH65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PSY24EUFUXGJGSIEGFII5CBH65","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":"63c260a7586c89d5f545fa28cdd145bce9de91f11a9e97300bb2ed0329726bd2","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T14:23:11Z","title_canon_sha256":"e125b2111f6366d2af364c3ea48d722305a23d93488d726710990eb73fa62ffe"},"schema_version":"1.0","source":{"id":"1304.5961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5961","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5961v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5961","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"PSY24EUFUXGJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PSY24EUFUXGJGSIE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PSY24EUF","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:41355d3ede5eea8645c6326071d07b703cfbfc0ddea168e82c96e834e068c5d1","target":"graph","created_at":"2026-05-18T03:27:23Z","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":"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","authors_text":"Andreas Pfandler, Stefan R\\\"ummele, Stefan Szeider","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T14:23:11Z","title":"Backdoors to Abduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5961","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:4068464027c4938f2a18dbace314818f2a0dd2b4011dee5a75cceff280d4e54f","target":"record","created_at":"2026-05-18T03:27:23Z","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":"63c260a7586c89d5f545fa28cdd145bce9de91f11a9e97300bb2ed0329726bd2","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-22T14:23:11Z","title_canon_sha256":"e125b2111f6366d2af364c3ea48d722305a23d93488d726710990eb73fa62ffe"},"schema_version":"1.0","source":{"id":"1304.5961","kind":"arxiv","version":1}},"canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cb1ae1285a5cc93490431508e8827f776e23ff6acbbe521fc9d44cafafba8fc","first_computed_at":"2026-05-18T03:27:23.668139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.668139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+LQkMV7A0r5D+yd67hE/zlkgpsh0vtDK3N1DGSdhzdt4TJDX017WbioIHOWcutV2y13IaLjlZ7D3UweLt/peBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.669075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4068464027c4938f2a18dbace314818f2a0dd2b4011dee5a75cceff280d4e54f","sha256:41355d3ede5eea8645c6326071d07b703cfbfc0ddea168e82c96e834e068c5d1"],"state_sha256":"69ca9269e5e610dea22b347bbaf899058f4d36647bcff32d6070074ba557973e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSDM6i3jTrW1skiEHfZrsMpzEVo/s6zq/WO44r1JLLE7w4l+KqeMPvzLi/czCaRNXOJHldCDusUCeLsBqiCLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:46:05.459558Z","bundle_sha256":"c264630144068568cfdac773a7b74e42c21ae7bebf7dd7dd385f62c545f08655"}}