{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KSVSGY5GV4JGT7NFMSR5EXWSLM","short_pith_number":"pith:KSVSGY5G","canonical_record":{"source":{"id":"1802.08201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"b7014e5b066847385d0d6a736bc0ba97fac1b9598e2defbefdeb3f4d6d393c1c","abstract_canon_sha256":"f62193cc71e79ce064612833e7f2bd932621a7a610f88a6b3dfdb642b0fc95d6"},"schema_version":"1.0"},"canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","source":{"kind":"arxiv","id":"1802.08201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08201","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08201v2","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08201","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"KSVSGY5GV4JG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KSVSGY5GV4JGT7NF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KSVSGY5G","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KSVSGY5GV4JGT7NFMSR5EXWSLM","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"b7014e5b066847385d0d6a736bc0ba97fac1b9598e2defbefdeb3f4d6d393c1c","abstract_canon_sha256":"f62193cc71e79ce064612833e7f2bd932621a7a610f88a6b3dfdb642b0fc95d6"},"schema_version":"1.0"},"canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:37.483297Z","signature_b64":"cBtHpvBQ9UHwBBd3PDOAU7B/ZDYQqJ3pQZpNkBRspdO7dE61VBugMJUCJilBiThVrNVbAthUD33BDI3JZrRvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","last_reissued_at":"2026-05-18T00:04:37.482835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:37.482835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08201","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-18T00:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWA+ORDrNEmpeIjj2yrd7Mr1s1WQekT57yGgb/mIrfbihOV/C0VEaPy7PVIZW+yacnufJm++nCalHWdHmm0DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:35.415702Z"},"content_sha256":"6d9984d00b6be25e92f04e50f12e63c884300e056120bc8505769d6dafd34434","schema_version":"1.0","event_id":"sha256:6d9984d00b6be25e92f04e50f12e63c884300e056120bc8505769d6dafd34434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KSVSGY5GV4JGT7NFMSR5EXWSLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Subsumption Algorithm for Nominal Safe $\\mathcal{ELO}_\\bot$ under Rational Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Giovanni Casini, Thomas Meyer, Umberto Straccia","submitted_at":"2018-02-22T17:54:00Z","abstract_excerpt":"Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe $\\mathcal{ELO}_\\bot$, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL.\n  Our contribution here is to define a polynomial time subsumption procedure for nominal safe $\\mathcal{ELO}_\\bot$ under RC that relies entirely on a series of classical, monotonic $\\mathcal{EL}_\\bot$ subsumption tests. Therefore, any existing classical monotonic $\\mathcal{EL}_\\bot$ r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08201","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-18T00:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YE1orCg/MFjvJWQFMuRhnXOlGVQxpLmX+pTsLUQfX8e9F5v0LpSrHdcbW7SGvaQKiPBpeduJC2Ky6DadTBRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:35.416053Z"},"content_sha256":"d8d406bc3c62d9d0770cad0e97b4bee53d249a5b42c38e5b01e46c95b64f2040","schema_version":"1.0","event_id":"sha256:d8d406bc3c62d9d0770cad0e97b4bee53d249a5b42c38e5b01e46c95b64f2040"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/bundle.json","state_url":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/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-01T06:22:35Z","links":{"resolver":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM","bundle":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/bundle.json","state":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KSVSGY5GV4JGT7NFMSR5EXWSLM","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":"f62193cc71e79ce064612833e7f2bd932621a7a610f88a6b3dfdb642b0fc95d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","title_canon_sha256":"b7014e5b066847385d0d6a736bc0ba97fac1b9598e2defbefdeb3f4d6d393c1c"},"schema_version":"1.0","source":{"id":"1802.08201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08201","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08201v2","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08201","created_at":"2026-05-18T00:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"KSVSGY5GV4JG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KSVSGY5GV4JGT7NF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KSVSGY5G","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:d8d406bc3c62d9d0770cad0e97b4bee53d249a5b42c38e5b01e46c95b64f2040","target":"graph","created_at":"2026-05-18T00:04:37Z","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":"Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe $\\mathcal{ELO}_\\bot$, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL.\n  Our contribution here is to define a polynomial time subsumption procedure for nominal safe $\\mathcal{ELO}_\\bot$ under RC that relies entirely on a series of classical, monotonic $\\mathcal{EL}_\\bot$ subsumption tests. Therefore, any existing classical monotonic $\\mathcal{EL}_\\bot$ r","authors_text":"Giovanni Casini, Thomas Meyer, Umberto Straccia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","title":"A Polynomial Time Subsumption Algorithm for Nominal Safe $\\mathcal{ELO}_\\bot$ under Rational Closure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08201","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:6d9984d00b6be25e92f04e50f12e63c884300e056120bc8505769d6dafd34434","target":"record","created_at":"2026-05-18T00:04:37Z","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":"f62193cc71e79ce064612833e7f2bd932621a7a610f88a6b3dfdb642b0fc95d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","title_canon_sha256":"b7014e5b066847385d0d6a736bc0ba97fac1b9598e2defbefdeb3f4d6d393c1c"},"schema_version":"1.0","source":{"id":"1802.08201","kind":"arxiv","version":2}},"canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","first_computed_at":"2026-05-18T00:04:37.482835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:37.482835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cBtHpvBQ9UHwBBd3PDOAU7B/ZDYQqJ3pQZpNkBRspdO7dE61VBugMJUCJilBiThVrNVbAthUD33BDI3JZrRvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:37.483297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d9984d00b6be25e92f04e50f12e63c884300e056120bc8505769d6dafd34434","sha256:d8d406bc3c62d9d0770cad0e97b4bee53d249a5b42c38e5b01e46c95b64f2040"],"state_sha256":"e8af7d05737ff8a8a58ec9fc2f0d013e514d2c2506125f45c07987c30829456a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWsSMuj+9n0SF5omow235Juk+gvpmVIWt40vTQmCsosJ+8xD9aB9VsXgpg12jwxo0sU5KxrGuloNeTBB+GxUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:35.418074Z","bundle_sha256":"5aa891afafcdb1141ea038ae79b8bbbc16ab6fbfcc7be3ce3250fecc861c433c"}}