{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OJKE2YAON7GD7ESIUOEGNRVGTE","short_pith_number":"pith:OJKE2YAO","canonical_record":{"source":{"id":"1907.10389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eadea5ab865e7a73d89e33644d2997b2423a260c35dcc7cc44bd2c03cbf9872a","abstract_canon_sha256":"a09b9f397a56aa286501d6128e257982f92bb6a30d334523211518a5a6c02fa3"},"schema_version":"1.0"},"canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","source":{"kind":"arxiv","id":"1907.10389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10389","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10389v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10389","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"OJKE2YAON7GD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OJKE2YAON7GD7ESI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OJKE2YAO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OJKE2YAON7GD7ESIUOEGNRVGTE","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eadea5ab865e7a73d89e33644d2997b2423a260c35dcc7cc44bd2c03cbf9872a","abstract_canon_sha256":"a09b9f397a56aa286501d6128e257982f92bb6a30d334523211518a5a6c02fa3"},"schema_version":"1.0"},"canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.073836Z","signature_b64":"N7YrfraWu6ZRw7KLkqP3c1GxJ6ddhtDFtIeNdplMwtzvtkAUjhU0Q2HTmZMzHtEMRD1YGr7T43PUl3Co9p7qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","last_reissued_at":"2026-05-17T23:39:38.073312Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.073312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10389","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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWEXg6mDmFEQZC+ooE5EGceOpcRgokoRocghQcWmYUmY/uXXUYb4JRfEA9+jtKBp1pSM4m7mCC9XyBzQbLUmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:51.321290Z"},"content_sha256":"8678f6a8c66f8b198a00017eb25927928237bf27bf26f73c2e4e084df98d1492","schema_version":"1.0","event_id":"sha256:8678f6a8c66f8b198a00017eb25927928237bf27bf26f73c2e4e084df98d1492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OJKE2YAON7GD7ESIUOEGNRVGTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inconsistency Proofs for ASP: The ASP-DRUPE Format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Carmine Dodaro, Jakob Rath, Johannes K. Fichte, Mario Alviano, Markus Hecher, Tobias Philipp","submitted_at":"2019-07-24T12:32:37Z","abstract_excerpt":"Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develop the new proof format ASP-DRUPE for propositional, disjunctive logic programs, inclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10389","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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P12cXA4bFJ35ru+d74N22f4dflolx/2lFhIBmruztQifPKcqWNj+cVLl+djvA8XWlHuDv99XAThQU1bhkIURDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:51.321981Z"},"content_sha256":"b2cb2fc6dd9685bb57f183493daf92b96fe9037fe3b6439d0721edbd54abc857","schema_version":"1.0","event_id":"sha256:b2cb2fc6dd9685bb57f183493daf92b96fe9037fe3b6439d0721edbd54abc857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/bundle.json","state_url":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/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-31T03:36:51Z","links":{"resolver":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE","bundle":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/bundle.json","state":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OJKE2YAON7GD7ESIUOEGNRVGTE","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":"a09b9f397a56aa286501d6128e257982f92bb6a30d334523211518a5a6c02fa3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","title_canon_sha256":"eadea5ab865e7a73d89e33644d2997b2423a260c35dcc7cc44bd2c03cbf9872a"},"schema_version":"1.0","source":{"id":"1907.10389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10389","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10389v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10389","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"OJKE2YAON7GD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OJKE2YAON7GD7ESI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OJKE2YAO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:b2cb2fc6dd9685bb57f183493daf92b96fe9037fe3b6439d0721edbd54abc857","target":"graph","created_at":"2026-05-17T23:39:38Z","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":"Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develop the new proof format ASP-DRUPE for propositional, disjunctive logic programs, inclu","authors_text":"Carmine Dodaro, Jakob Rath, Johannes K. Fichte, Mario Alviano, Markus Hecher, Tobias Philipp","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","title":"Inconsistency Proofs for ASP: The ASP-DRUPE Format"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10389","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:8678f6a8c66f8b198a00017eb25927928237bf27bf26f73c2e4e084df98d1492","target":"record","created_at":"2026-05-17T23:39:38Z","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":"a09b9f397a56aa286501d6128e257982f92bb6a30d334523211518a5a6c02fa3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","title_canon_sha256":"eadea5ab865e7a73d89e33644d2997b2423a260c35dcc7cc44bd2c03cbf9872a"},"schema_version":"1.0","source":{"id":"1907.10389","kind":"arxiv","version":1}},"canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","first_computed_at":"2026-05-17T23:39:38.073312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:38.073312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7YrfraWu6ZRw7KLkqP3c1GxJ6ddhtDFtIeNdplMwtzvtkAUjhU0Q2HTmZMzHtEMRD1YGr7T43PUl3Co9p7qDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:38.073836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8678f6a8c66f8b198a00017eb25927928237bf27bf26f73c2e4e084df98d1492","sha256:b2cb2fc6dd9685bb57f183493daf92b96fe9037fe3b6439d0721edbd54abc857"],"state_sha256":"a5bbd3f99aff2c7440f058d4acaac48f96709eb41928190f90f7b7fea7e83356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jd/KJ2ysDqdLEyvnu9CSXqD5uVKO6rAxqXQrcXYhXDypuNIBAkRK9vT8bWx2KTxF7t+/P3iQARYLMwDdiwHQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:36:51.325678Z","bundle_sha256":"140be5ca7ee4adb6aec613818e19aee65ee53d78fe022dd99abfa33c2fc17b04"}}