{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6LJGKLMFDBGNOQGXRHT25B6QZL","short_pith_number":"pith:6LJGKLMF","canonical_record":{"source":{"id":"1804.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T14:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"34f31aca50d87019050b853651b3dfe7023377bba4035cdb6f23d9485df7dab3","abstract_canon_sha256":"dd9d9fc0b6d508c464f11bc990e02dd3d71c151bb4d8a862de601b84c7afdc7e"},"schema_version":"1.0"},"canonical_sha256":"f2d2652d85184cd740d789e7ae87d0caf6a5454227e7e7e3a09127a2b3708d19","source":{"kind":"arxiv","id":"1804.08480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08480","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08480v1","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08480","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"6LJGKLMFDBGN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6LJGKLMFDBGNOQGX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6LJGKLMF","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6LJGKLMFDBGNOQGXRHT25B6QZL","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T14:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"34f31aca50d87019050b853651b3dfe7023377bba4035cdb6f23d9485df7dab3","abstract_canon_sha256":"dd9d9fc0b6d508c464f11bc990e02dd3d71c151bb4d8a862de601b84c7afdc7e"},"schema_version":"1.0"},"canonical_sha256":"f2d2652d85184cd740d789e7ae87d0caf6a5454227e7e7e3a09127a2b3708d19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:48.214761Z","signature_b64":"8hcti39p5nx78E41Njf+BhEk019s5F/LkqmQnMjpNXOfrsSQIVNsSVe5M8l0t/dEU74HWTHLTtCgxYrdA7hRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d2652d85184cd740d789e7ae87d0caf6a5454227e7e7e3a09127a2b3708d19","last_reissued_at":"2026-05-18T00:17:48.214034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:48.214034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08480","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-18T00:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vrZPrjGbiloM/y9YQioiub2UmQo+2QORr7KRGAbiIxAKO1RXCwx8jr9eRqEtZOCLsvGzvKpvneZ9k9dXTSnkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:21:50.794264Z"},"content_sha256":"14f46be2bc96e3538a5b596dc35b4488e7abab61a3334bb3fd5d415354253b78","schema_version":"1.0","event_id":"sha256:14f46be2bc96e3538a5b596dc35b4488e7abab61a3334bb3fd5d415354253b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6LJGKLMFDBGNOQGXRHT25B6QZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cautious reasoning in ASP via minimal models and unsatisfiable cores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alessandro Previti, Carmine Dodaro, Marco Maratea, Mario Alviano, Matti J\\\"arvisalo","submitted_at":"2018-04-23T14:47:21Z","abstract_excerpt":"Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of the input program among the atoms in a given set of candidates, where a cautious consequence is an atom belonging to all stable models. Currently, the most efficient algorithms either iteratively verify the existence of a stable model of the input program extended with the complement of one candidate, where the candidate is heuristically selected,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08480","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-18T00:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMPqhTtuqq5rxx9seeFfIuCZTqh4++SqHJP1eTGSCAhIaGgQUjmnBAxLxB9xBbLaIA4z63C06S7HN48ibCXJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:21:50.795066Z"},"content_sha256":"64ece4fa7f4c1dcf6a241f03908ea2b2e9b401d60615ae2c03924147d31d486b","schema_version":"1.0","event_id":"sha256:64ece4fa7f4c1dcf6a241f03908ea2b2e9b401d60615ae2c03924147d31d486b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/bundle.json","state_url":"https://pith.science/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/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-31T05:21:50Z","links":{"resolver":"https://pith.science/pith/6LJGKLMFDBGNOQGXRHT25B6QZL","bundle":"https://pith.science/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/bundle.json","state":"https://pith.science/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LJGKLMFDBGNOQGXRHT25B6QZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6LJGKLMFDBGNOQGXRHT25B6QZL","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":"dd9d9fc0b6d508c464f11bc990e02dd3d71c151bb4d8a862de601b84c7afdc7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T14:47:21Z","title_canon_sha256":"34f31aca50d87019050b853651b3dfe7023377bba4035cdb6f23d9485df7dab3"},"schema_version":"1.0","source":{"id":"1804.08480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08480","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08480v1","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08480","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"6LJGKLMFDBGN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6LJGKLMFDBGNOQGX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6LJGKLMF","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:64ece4fa7f4c1dcf6a241f03908ea2b2e9b401d60615ae2c03924147d31d486b","target":"graph","created_at":"2026-05-18T00:17:48Z","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) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of the input program among the atoms in a given set of candidates, where a cautious consequence is an atom belonging to all stable models. Currently, the most efficient algorithms either iteratively verify the existence of a stable model of the input program extended with the complement of one candidate, where the candidate is heuristically selected,","authors_text":"Alessandro Previti, Carmine Dodaro, Marco Maratea, Mario Alviano, Matti J\\\"arvisalo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T14:47:21Z","title":"Cautious reasoning in ASP via minimal models and unsatisfiable cores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08480","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:14f46be2bc96e3538a5b596dc35b4488e7abab61a3334bb3fd5d415354253b78","target":"record","created_at":"2026-05-18T00:17:48Z","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":"dd9d9fc0b6d508c464f11bc990e02dd3d71c151bb4d8a862de601b84c7afdc7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T14:47:21Z","title_canon_sha256":"34f31aca50d87019050b853651b3dfe7023377bba4035cdb6f23d9485df7dab3"},"schema_version":"1.0","source":{"id":"1804.08480","kind":"arxiv","version":1}},"canonical_sha256":"f2d2652d85184cd740d789e7ae87d0caf6a5454227e7e7e3a09127a2b3708d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2d2652d85184cd740d789e7ae87d0caf6a5454227e7e7e3a09127a2b3708d19","first_computed_at":"2026-05-18T00:17:48.214034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:48.214034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8hcti39p5nx78E41Njf+BhEk019s5F/LkqmQnMjpNXOfrsSQIVNsSVe5M8l0t/dEU74HWTHLTtCgxYrdA7hRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:48.214761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14f46be2bc96e3538a5b596dc35b4488e7abab61a3334bb3fd5d415354253b78","sha256:64ece4fa7f4c1dcf6a241f03908ea2b2e9b401d60615ae2c03924147d31d486b"],"state_sha256":"8594afa9241b0437fec6244062a2adea69087b4300cc97383e5dcce6d497d7e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZoALDIxL/ywpvgHFaf4lWv5yXldI645fNbHnf8PC1a8lCpFgzs01AMXGqJhGGBatcEbmuGB5Vm0S6tOws4xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:21:50.800441Z","bundle_sha256":"b69dd7eb7661a5772a292a61c7c78f29a58fa4d33e37098835b3cb38111cf1ce"}}