{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5EC7NF5ARNXLEPDDPZUM4SR3LI","short_pith_number":"pith:5EC7NF5A","canonical_record":{"source":{"id":"1406.7838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-30T18:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"dbde710d4d1ef1cc242ce737d19eab4cb63cc732c580b2bc3fa5c1a56f3d1803","abstract_canon_sha256":"c463ea16975226245b434653ef9ebcf5af180805879d0dabc10b759f9356639b"},"schema_version":"1.0"},"canonical_sha256":"e905f697a08b6eb23c637e68ce4a3b5a123fdecbd7c3750d0f7ba2574e7a13bb","source":{"kind":"arxiv","id":"1406.7838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7838","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7838v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7838","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"5EC7NF5ARNXL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5EC7NF5ARNXLEPDD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5EC7NF5A","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5EC7NF5ARNXLEPDDPZUM4SR3LI","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-30T18:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"dbde710d4d1ef1cc242ce737d19eab4cb63cc732c580b2bc3fa5c1a56f3d1803","abstract_canon_sha256":"c463ea16975226245b434653ef9ebcf5af180805879d0dabc10b759f9356639b"},"schema_version":"1.0"},"canonical_sha256":"e905f697a08b6eb23c637e68ce4a3b5a123fdecbd7c3750d0f7ba2574e7a13bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.053829Z","signature_b64":"bWBWHQL3xvvabTMQpuUh5InLDM+19OGZ23Ez3TXbe47x2LYY79IQpVQALULTdynoa5apmY4vO1O63n51LxZSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e905f697a08b6eb23c637e68ce4a3b5a123fdecbd7c3750d0f7ba2574e7a13bb","last_reissued_at":"2026-05-18T02:48:44.053234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.053234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7838","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jGWF0bG6v4eEipXX5OAAzAJTeRadwZ0FLfnwqzCpISRSvIuW7M2warSIgz+CEC0dZTyR4FKQfSZwoxvr6KYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:37:36.245125Z"},"content_sha256":"8953a72c0136e4953b9d7fa72962b744ddef27bd26efc55cda6c6e0602c58ce4","schema_version":"1.0","event_id":"sha256:8953a72c0136e4953b9d7fa72962b744ddef27bd26efc55cda6c6e0602c58ce4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5EC7NF5ARNXLEPDDPZUM4SR3LI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimal Corrections in ASP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joao Marques-Silva, Mikol\\'a\\v{s} Janota","submitted_at":"2014-06-30T18:13:36Z","abstract_excerpt":"As a programming paradigm, answer set programming (ASP) brings about the usual issue of the human error. Hence, it is desirable to provide automated techniques that could help the programmer to find the error. This paper addresses the question of computing a subset-minimal correction of a contradictory ASP program. A contradictory ASP program is often undesirable and we wish to provide an automated way of fixing it. We consider a minimal correction set of a contradictory program to be an irreducible set of rules whose removal makes the program consistent. In contrast to propositional logic, co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7838","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e45JHKGL28qH3eMuV4Sh2sDl7J6EHH9BbOm9K8boRkdbYOwixNgkr3Z8ZMAdZPKR4hb67NiWPpYqHZsZKADPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:37:36.245485Z"},"content_sha256":"de2bcdbbe5efcb773aa8d217d185d613749a997b03562bfdaa01090116a65f65","schema_version":"1.0","event_id":"sha256:de2bcdbbe5efcb773aa8d217d185d613749a997b03562bfdaa01090116a65f65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/bundle.json","state_url":"https://pith.science/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/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-21T06:37:36Z","links":{"resolver":"https://pith.science/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI","bundle":"https://pith.science/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/bundle.json","state":"https://pith.science/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EC7NF5ARNXLEPDDPZUM4SR3LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5EC7NF5ARNXLEPDDPZUM4SR3LI","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":"c463ea16975226245b434653ef9ebcf5af180805879d0dabc10b759f9356639b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-30T18:13:36Z","title_canon_sha256":"dbde710d4d1ef1cc242ce737d19eab4cb63cc732c580b2bc3fa5c1a56f3d1803"},"schema_version":"1.0","source":{"id":"1406.7838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7838","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7838v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7838","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"5EC7NF5ARNXL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5EC7NF5ARNXLEPDD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5EC7NF5A","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:de2bcdbbe5efcb773aa8d217d185d613749a997b03562bfdaa01090116a65f65","target":"graph","created_at":"2026-05-18T02:48:44Z","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":"As a programming paradigm, answer set programming (ASP) brings about the usual issue of the human error. Hence, it is desirable to provide automated techniques that could help the programmer to find the error. This paper addresses the question of computing a subset-minimal correction of a contradictory ASP program. A contradictory ASP program is often undesirable and we wish to provide an automated way of fixing it. We consider a minimal correction set of a contradictory program to be an irreducible set of rules whose removal makes the program consistent. In contrast to propositional logic, co","authors_text":"Joao Marques-Silva, Mikol\\'a\\v{s} Janota","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-30T18:13:36Z","title":"On Minimal Corrections in ASP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7838","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:8953a72c0136e4953b9d7fa72962b744ddef27bd26efc55cda6c6e0602c58ce4","target":"record","created_at":"2026-05-18T02:48:44Z","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":"c463ea16975226245b434653ef9ebcf5af180805879d0dabc10b759f9356639b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-30T18:13:36Z","title_canon_sha256":"dbde710d4d1ef1cc242ce737d19eab4cb63cc732c580b2bc3fa5c1a56f3d1803"},"schema_version":"1.0","source":{"id":"1406.7838","kind":"arxiv","version":1}},"canonical_sha256":"e905f697a08b6eb23c637e68ce4a3b5a123fdecbd7c3750d0f7ba2574e7a13bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e905f697a08b6eb23c637e68ce4a3b5a123fdecbd7c3750d0f7ba2574e7a13bb","first_computed_at":"2026-05-18T02:48:44.053234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:44.053234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bWBWHQL3xvvabTMQpuUh5InLDM+19OGZ23Ez3TXbe47x2LYY79IQpVQALULTdynoa5apmY4vO1O63n51LxZSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:44.053829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8953a72c0136e4953b9d7fa72962b744ddef27bd26efc55cda6c6e0602c58ce4","sha256:de2bcdbbe5efcb773aa8d217d185d613749a997b03562bfdaa01090116a65f65"],"state_sha256":"cdc95477c038c503c69231281d8e1bdc93fcce7d78d12285eb15d23c1ae8fdda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wP3m8tlM3iRKrxpnRqX1FDHs9DcZ1Dyw4ntMGoWfvL4X4ZHmtbx0I0XhSM51nHbTu/rPmGjp/UU6Oa9F+KGfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:37:36.247310Z","bundle_sha256":"feacd242d38c051f01bf7ec66498d1bad60c731f2f0e9f6bbd700880779646a2"}}