{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YT3XNKCQJGM2BBYI2TNMLAUT53","short_pith_number":"pith:YT3XNKCQ","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"},"canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","source":{"kind":"arxiv","id":"1301.1391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1391","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1391v2","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1391","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"YT3XNKCQJGM2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YT3XNKCQJGM2BBYI","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YT3XNKCQ","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YT3XNKCQJGM2BBYI2TNMLAUT53","target":"record","payload":{"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"},"canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","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"},"source_kind":"arxiv","source_id":"1301.1391","source_version":2,"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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oupMrRwoMTlWaYDYSE9OXi1JDenu+Q9dQzxsyfqBqrF77BSL8UspwxFaRlPGvmjtAmiWv9MH/jmJjHtDh5M3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:06.455280Z"},"content_sha256":"7828bbb53c4f1621c41b8821fbd1b63833ad6626c350dbae2852cbcd1ede3cf9","schema_version":"1.0","event_id":"sha256:7828bbb53c4f1621c41b8821fbd1b63833ad6626c350dbae2852cbcd1ede3cf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YT3XNKCQJGM2BBYI2TNMLAUT53","target":"graph","payload":{"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"},"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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naBkqURojNsEjZR/V+qigtb4Y4BU6nqsXKBW5ksxNLwMnvrNXaeAjr3abu0ns6Tl8E21iWMyiE30Pz8hzfeKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:06.455785Z"},"content_sha256":"9d756ea70ca15d8130255cef04065c8882eb8819a251ce7817d296c91af24b8c","schema_version":"1.0","event_id":"sha256:9d756ea70ca15d8130255cef04065c8882eb8819a251ce7817d296c91af24b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/bundle.json","state_url":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/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-28T21:08:06Z","links":{"resolver":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53","bundle":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/bundle.json","state":"https://pith.science/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT3XNKCQJGM2BBYI2TNMLAUT53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YT3XNKCQJGM2BBYI2TNMLAUT53","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":"4c0a382bc6b86ca81851103756180c96197ece047290b16dc78a427d5ed77485","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-08T02:29:37Z","title_canon_sha256":"16635051fd6b23764ef611b57b5d6c5484ed17facd47c6bba2a848b18dfea21e"},"schema_version":"1.0","source":{"id":"1301.1391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1391","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1391v2","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1391","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"YT3XNKCQJGM2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YT3XNKCQJGM2BBYI","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YT3XNKCQ","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:9d756ea70ca15d8130255cef04065c8882eb8819a251ce7817d296c91af24b8c","target":"graph","created_at":"2026-05-18T03:26:33Z","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":"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 ","authors_text":"Johannes Klaus Fichte, Stefan Szeider","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-08T02:29:37Z","title":"Backdoors to Normality for Disjunctive Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1391","kind":"arxiv","version":2},"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:7828bbb53c4f1621c41b8821fbd1b63833ad6626c350dbae2852cbcd1ede3cf9","target":"record","created_at":"2026-05-18T03:26:33Z","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":"4c0a382bc6b86ca81851103756180c96197ece047290b16dc78a427d5ed77485","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-08T02:29:37Z","title_canon_sha256":"16635051fd6b23764ef611b57b5d6c5484ed17facd47c6bba2a848b18dfea21e"},"schema_version":"1.0","source":{"id":"1301.1391","kind":"arxiv","version":2}},"canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4f776a8504999a08708d4dac58293eeebac85110f347ee027869a4724fed22f","first_computed_at":"2026-05-18T03:26:33.648351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:33.648351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lXMBy+Tj1kaa1qW3/MYRKedB8aE8jKEP1o4RnA7KA4D8l8SVShhQySPmfmxJFzEGO9M8R7wDX8cwOuI6iifaDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:33.648771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7828bbb53c4f1621c41b8821fbd1b63833ad6626c350dbae2852cbcd1ede3cf9","sha256:9d756ea70ca15d8130255cef04065c8882eb8819a251ce7817d296c91af24b8c"],"state_sha256":"13504b471d95cecc30cc85bb2fb55c2dccaefe35e1f827c892eccb3ce09963b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4yhYVix2fNOQLQpbsj0XPr/VA6tNee5FW/tBOj3A2YzmDEKdLOuCMky7urqsxWKIwGP6WwX5yrE6l5ry6etBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:08:06.459481Z","bundle_sha256":"1f3cbe874c387575c5e39aa49ab3e61ca2727f37a7bc8beb06a87267eab66219"}}