{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UWSSYLIJOMVJKF76O2RO7T5UGI","short_pith_number":"pith:UWSSYLIJ","canonical_record":{"source":{"id":"1007.2816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-16T17:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"b7a5acced58d32beffbef2458deae7a001af72637dd2450ecde9c5845ab5a41d","abstract_canon_sha256":"5b97620663eaddadc8b60a6b4d5744895f70a5e6947e39bfeb1e424ff90b1968"},"schema_version":"1.0"},"canonical_sha256":"a5a52c2d09732a9517fe76a2efcfb4322f6ee309f232fadcfbbb0dd7534d4c86","source":{"kind":"arxiv","id":"1007.2816","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2816","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2816v2","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2816","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"UWSSYLIJOMVJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UWSSYLIJOMVJKF76","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UWSSYLIJ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UWSSYLIJOMVJKF76O2RO7T5UGI","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-16T17:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"b7a5acced58d32beffbef2458deae7a001af72637dd2450ecde9c5845ab5a41d","abstract_canon_sha256":"5b97620663eaddadc8b60a6b4d5744895f70a5e6947e39bfeb1e424ff90b1968"},"schema_version":"1.0"},"canonical_sha256":"a5a52c2d09732a9517fe76a2efcfb4322f6ee309f232fadcfbbb0dd7534d4c86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:01.396651Z","signature_b64":"U3xQ9E0C5V+mIfOVBvuJ24pG4h2vifMiDLGUZj5OOHO0rY9AgkkF0xurDLo4ximzSZKKICmT8bHQvf/AujfaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a52c2d09732a9517fe76a2efcfb4322f6ee309f232fadcfbbb0dd7534d4c86","last_reissued_at":"2026-05-18T02:41:01.396130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:01.396130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2816","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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJ/QsLwHGTK+yIasdi85213KXWl+1X6686lrdwjQPKcNNZ2mWyDEljuDP5HJJxJKYvRbmIktwP8vDC0PUc38CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:08:58.628983Z"},"content_sha256":"2ce3f0ecde3fc855c6e3dc4fd70725142831f0ff50311b29d426a0763f8dbd77","schema_version":"1.0","event_id":"sha256:2ce3f0ecde3fc855c6e3dc4fd70725142831f0ff50311b29d426a0763f8dbd77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UWSSYLIJOMVJKF76O2RO7T5UGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miroslaw Truszczynski","submitted_at":"2010-07-16T17:07:25Z","abstract_excerpt":"We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. On the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2816","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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SBOnNCEZnv36axGszzYlzvBgLXrkC7RWcGXtdaf0/o5TvOC5kqeDlKKK4StCWFUHjLdjNc8GsB9p3QSO7k7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:08:58.629335Z"},"content_sha256":"97b3484baeaee403c0905a060b1109157a5e71a9d8831739aad2f4da033d838f","schema_version":"1.0","event_id":"sha256:97b3484baeaee403c0905a060b1109157a5e71a9d8831739aad2f4da033d838f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/bundle.json","state_url":"https://pith.science/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/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-06-24T05:08:58Z","links":{"resolver":"https://pith.science/pith/UWSSYLIJOMVJKF76O2RO7T5UGI","bundle":"https://pith.science/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/bundle.json","state":"https://pith.science/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWSSYLIJOMVJKF76O2RO7T5UGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UWSSYLIJOMVJKF76O2RO7T5UGI","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":"5b97620663eaddadc8b60a6b4d5744895f70a5e6947e39bfeb1e424ff90b1968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-16T17:07:25Z","title_canon_sha256":"b7a5acced58d32beffbef2458deae7a001af72637dd2450ecde9c5845ab5a41d"},"schema_version":"1.0","source":{"id":"1007.2816","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2816","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2816v2","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2816","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"UWSSYLIJOMVJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UWSSYLIJOMVJKF76","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UWSSYLIJ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:97b3484baeaee403c0905a060b1109157a5e71a9d8831739aad2f4da033d838f","target":"graph","created_at":"2026-05-18T02:41:01Z","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":"We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. On the","authors_text":"Miroslaw Truszczynski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-16T17:07:25Z","title":"Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2816","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:2ce3f0ecde3fc855c6e3dc4fd70725142831f0ff50311b29d426a0763f8dbd77","target":"record","created_at":"2026-05-18T02:41:01Z","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":"5b97620663eaddadc8b60a6b4d5744895f70a5e6947e39bfeb1e424ff90b1968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-16T17:07:25Z","title_canon_sha256":"b7a5acced58d32beffbef2458deae7a001af72637dd2450ecde9c5845ab5a41d"},"schema_version":"1.0","source":{"id":"1007.2816","kind":"arxiv","version":2}},"canonical_sha256":"a5a52c2d09732a9517fe76a2efcfb4322f6ee309f232fadcfbbb0dd7534d4c86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5a52c2d09732a9517fe76a2efcfb4322f6ee309f232fadcfbbb0dd7534d4c86","first_computed_at":"2026-05-18T02:41:01.396130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:01.396130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3xQ9E0C5V+mIfOVBvuJ24pG4h2vifMiDLGUZj5OOHO0rY9AgkkF0xurDLo4ximzSZKKICmT8bHQvf/AujfaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:01.396651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2816","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ce3f0ecde3fc855c6e3dc4fd70725142831f0ff50311b29d426a0763f8dbd77","sha256:97b3484baeaee403c0905a060b1109157a5e71a9d8831739aad2f4da033d838f"],"state_sha256":"26c5b54984807459fcc44f320b15861b32dde8293782e79af05a2e944fe99a76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55NJgIPg9chH1EZsZ262G3ZpwMMXHz/2Ju3kjc0uAVvwwUzb9yEu5jexmUMkqX5/LwVmcUOesEOWbMdclpS4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:08:58.631265Z","bundle_sha256":"52f512411abc237cd1ad69a49e6b7c8e01ddbc07ce4bda3cca869adc70aba175"}}