{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AKQKJTYMJ5LH742E4FSWWOAMWJ","short_pith_number":"pith:AKQKJTYM","canonical_record":{"source":{"id":"1608.01835","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-05T11:18:12Z","cross_cats_sorted":[],"title_canon_sha256":"9d8fd0ebecdae2d6c0e06e05162cfc30b8a01ec64e304d7eb1063b3e1be3e3f7","abstract_canon_sha256":"9bca49b71d75068f8256e1b481b6e3cd9c8fd365aa7ea91f9e3d1e2cf2891643"},"schema_version":"1.0"},"canonical_sha256":"02a0a4cf0c4f567ff344e1656b380cb26876876e0bb0f51e78be06d6d4400ffd","source":{"kind":"arxiv","id":"1608.01835","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01835","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01835v3","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01835","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"AKQKJTYMJ5LH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AKQKJTYMJ5LH742E","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AKQKJTYM","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AKQKJTYMJ5LH742E4FSWWOAMWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01835","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-05T11:18:12Z","cross_cats_sorted":[],"title_canon_sha256":"9d8fd0ebecdae2d6c0e06e05162cfc30b8a01ec64e304d7eb1063b3e1be3e3f7","abstract_canon_sha256":"9bca49b71d75068f8256e1b481b6e3cd9c8fd365aa7ea91f9e3d1e2cf2891643"},"schema_version":"1.0"},"canonical_sha256":"02a0a4cf0c4f567ff344e1656b380cb26876876e0bb0f51e78be06d6d4400ffd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.070692Z","signature_b64":"DCtpnqx9S/g7crqIZ7thiESEofus6T7gs1OoF2hh85VHmORupX6/mV4xJV9+zdkDkjJkm8k19qr3YZp3eG/kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a0a4cf0c4f567ff344e1656b380cb26876876e0bb0f51e78be06d6d4400ffd","last_reissued_at":"2026-05-18T01:09:06.070270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.070270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01835","source_version":3,"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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1B/OQL1+o9GQCYBUgPfrkcM1Cq2wavWMJbpq1fASojgTWH529B2YRvGeMKWNfQRx4KelpJFGst3/Wcs5/KdACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:58.914563Z"},"content_sha256":"db17ba6143ffe9e964d98cf8b09952aa49ac454e83337111e084a8505b11c778","schema_version":"1.0","event_id":"sha256:db17ba6143ffe9e964d98cf8b09952aa49ac454e83337111e084a8505b11c778"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AKQKJTYMJ5LH742E4FSWWOAMWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable-Unstable Semantics: Beyond NP with Normal Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Bogaerts, Shahab Tasharrofi, Tomi Janhunen","submitted_at":"2016-08-05T11:18:12Z","abstract_excerpt":"Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01835","kind":"arxiv","version":3},"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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xNW1dwiNJnqP/Vy7vvIDTSCUP1pHAQYH4hTQ0DXkcid+WsMG+OwSH/excxXed6gskJWN++X4t+FQ3iDSjqzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:58.915023Z"},"content_sha256":"29e3de73ab1b6c2826c49f4df4e934d3c1bed0ea03af98f991266629bdb8adb6","schema_version":"1.0","event_id":"sha256:29e3de73ab1b6c2826c49f4df4e934d3c1bed0ea03af98f991266629bdb8adb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/bundle.json","state_url":"https://pith.science/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/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-01T18:40:58Z","links":{"resolver":"https://pith.science/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ","bundle":"https://pith.science/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/bundle.json","state":"https://pith.science/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKQKJTYMJ5LH742E4FSWWOAMWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AKQKJTYMJ5LH742E4FSWWOAMWJ","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":"9bca49b71d75068f8256e1b481b6e3cd9c8fd365aa7ea91f9e3d1e2cf2891643","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-05T11:18:12Z","title_canon_sha256":"9d8fd0ebecdae2d6c0e06e05162cfc30b8a01ec64e304d7eb1063b3e1be3e3f7"},"schema_version":"1.0","source":{"id":"1608.01835","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01835","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01835v3","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01835","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"AKQKJTYMJ5LH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AKQKJTYMJ5LH742E","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AKQKJTYM","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:29e3de73ab1b6c2826c49f4df4e934d3c1bed0ea03af98f991266629bdb8adb6","target":"graph","created_at":"2026-05-18T01:09:06Z","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":"Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solv","authors_text":"Bart Bogaerts, Shahab Tasharrofi, Tomi Janhunen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-05T11:18:12Z","title":"Stable-Unstable Semantics: Beyond NP with Normal Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01835","kind":"arxiv","version":3},"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:db17ba6143ffe9e964d98cf8b09952aa49ac454e83337111e084a8505b11c778","target":"record","created_at":"2026-05-18T01:09:06Z","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":"9bca49b71d75068f8256e1b481b6e3cd9c8fd365aa7ea91f9e3d1e2cf2891643","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-05T11:18:12Z","title_canon_sha256":"9d8fd0ebecdae2d6c0e06e05162cfc30b8a01ec64e304d7eb1063b3e1be3e3f7"},"schema_version":"1.0","source":{"id":"1608.01835","kind":"arxiv","version":3}},"canonical_sha256":"02a0a4cf0c4f567ff344e1656b380cb26876876e0bb0f51e78be06d6d4400ffd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02a0a4cf0c4f567ff344e1656b380cb26876876e0bb0f51e78be06d6d4400ffd","first_computed_at":"2026-05-18T01:09:06.070270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:06.070270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DCtpnqx9S/g7crqIZ7thiESEofus6T7gs1OoF2hh85VHmORupX6/mV4xJV9+zdkDkjJkm8k19qr3YZp3eG/kBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:06.070692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01835","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db17ba6143ffe9e964d98cf8b09952aa49ac454e83337111e084a8505b11c778","sha256:29e3de73ab1b6c2826c49f4df4e934d3c1bed0ea03af98f991266629bdb8adb6"],"state_sha256":"598a0901ac125ddaa1ab9ba444bb6b63f3630d5e17e8e383977ecabf0d6ee11d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hpUqjp8NMAnHS1X1KPmgeQz8IRK5YOo/q/aSP/lR4B5P0PznjhGkeWn9tDNXS1t37fMpUrWYxix87svja+7ZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:40:58.917302Z","bundle_sha256":"aa76f6d00bd1fd94a6071cc3ef95149aa8af8c2691715023d29d64b7fbe5a9f7"}}