{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YT3XNKCQJGM2BBYI2TNMLAUT53","short_pith_number":"pith:YT3XNKCQ","schema_version":"1.0","canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","source":{"kind":"arxiv","id":"1301.1391","version":2},"attestation_state":"computed","paper":{"title":"Backdoors to Normality for Disjunctive Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LO","authors_text":"Johannes Klaus Fichte, Stefan Szeider","submitted_at":"2013-01-08T02:29:37Z","abstract_excerpt":"Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be utilized for the efficient solution of problems that are harder than NP or co-NP. In particular, we consider the fundamental reasoning problems in propositional disjunctive answer set programming (ASP), Brave Reasoning and Skeptical Reasoning, which ask whether a given atom is contained in at least one or in all answer sets, respectively. Both problems are "},"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":"1301.1391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-08T02:29:37Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"16635051fd6b23764ef611b57b5d6c5484ed17facd47c6bba2a848b18dfea21e","abstract_canon_sha256":"4c0a382bc6b86ca81851103756180c96197ece047290b16dc78a427d5ed77485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.648771Z","signature_b64":"lXMBy+Tj1kaa1qW3/MYRKedB8aE8jKEP1o4RnA7KA4D8l8SVShhQySPmfmxJFzEGO9M8R7wDX8cwOuI6iifaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","last_reissued_at":"2026-05-18T03:26:33.648351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.648351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backdoors to Normality for Disjunctive Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LO","authors_text":"Johannes Klaus Fichte, Stefan Szeider","submitted_at":"2013-01-08T02:29:37Z","abstract_excerpt":"Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be utilized for the efficient solution of problems that are harder than NP or co-NP. In particular, we consider the fundamental reasoning problems in propositional disjunctive answer set programming (ASP), Brave Reasoning and Skeptical Reasoning, which ask whether a given atom is contained in at least one or in all answer sets, respectively. Both problems are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1391","kind":"arxiv","version":2},"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":"1301.1391","created_at":"2026-05-18T03:26:33.648418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1391v2","created_at":"2026-05-18T03:26:33.648418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1391","created_at":"2026-05-18T03:26:33.648418+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT3XNKCQJGM2","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT3XNKCQJGM2BBYI","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT3XNKCQ","created_at":"2026-05-18T12:28:09.283467+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/YT3XNKCQJGM2BBYI2TNMLAUT53","json":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53.json","graph_json":"https://pith.science/api/pith-number/YT3XNKCQJGM2BBYI2TNMLAUT53/graph.json","events_json":"https://pith.science/api/pith-number/YT3XNKCQJGM2BBYI2TNMLAUT53/events.json","paper":"https://pith.science/paper/YT3XNKCQ"},"agent_actions":{"view_html":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53","download_json":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53.json","view_paper":"https://pith.science/paper/YT3XNKCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1391&json=true","fetch_graph":"https://pith.science/api/pith-number/YT3XNKCQJGM2BBYI2TNMLAUT53/graph.json","fetch_events":"https://pith.science/api/pith-number/YT3XNKCQJGM2BBYI2TNMLAUT53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/action/storage_attestation","attest_author":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/action/author_attestation","sign_citation":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/action/citation_signature","submit_replication":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/action/replication_record"}},"created_at":"2026-05-18T03:26:33.648418+00:00","updated_at":"2026-05-18T03:26:33.648418+00:00"}