{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GDKMBNYXQMIWJQO3KQCPY7IRDZ","short_pith_number":"pith:GDKMBNYX","schema_version":"1.0","canonical_sha256":"30d4c0b717831164c1db5404fc7d111e6898e9864f0bad3a23287cd1ec6ba6cf","source":{"kind":"arxiv","id":"1411.5313","version":2},"attestation_state":"computed","paper":{"title":"Ontology Module Extraction via Datalog Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ana Armas Romero, Bernardo Cuenca Grau, Ian Horrocks, Mark Kaminski","submitted_at":"2014-11-19T18:43:28Z","abstract_excerpt":"Module extraction - the task of computing a (preferably small) fragment M of an ontology T that preserves entailments over a signature S - has found many applications in recent years. Extracting modules of minimal size is, however, computationally hard, and often algorithmically infeasible. Thus, practical techniques are based on approximations, where M provably captures the relevant entailments, but is not guaranteed to be minimal. Existing approximations, however, ensure that M preserves all second-order entailments of T w.r.t. S, which is stronger than is required in many applications, and "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.5313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-19T18:43:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"2810e1c8e750d46140cbb8f10c6f2345071f1c759a4e08686d89ab5028d848e8","abstract_canon_sha256":"6de546233988a7de9765b509e78c05c2707479b9b6a8b937ce56006503af667f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:24.835542Z","signature_b64":"EGjkhSDgA/4rBowq+MafeqcZOt6kTMCGI2Xl3icz/OYcF0pmRvKay1njJIUFHZ98RpAMhI80jLVKiq4MnBvjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30d4c0b717831164c1db5404fc7d111e6898e9864f0bad3a23287cd1ec6ba6cf","last_reissued_at":"2026-05-18T02:33:24.834918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:24.834918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ontology Module Extraction via Datalog Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ana Armas Romero, Bernardo Cuenca Grau, Ian Horrocks, Mark Kaminski","submitted_at":"2014-11-19T18:43:28Z","abstract_excerpt":"Module extraction - the task of computing a (preferably small) fragment M of an ontology T that preserves entailments over a signature S - has found many applications in recent years. Extracting modules of minimal size is, however, computationally hard, and often algorithmically infeasible. Thus, practical techniques are based on approximations, where M provably captures the relevant entailments, but is not guaranteed to be minimal. Existing approximations, however, ensure that M preserves all second-order entailments of T w.r.t. S, which is stronger than is required in many applications, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5313","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.5313","created_at":"2026-05-18T02:33:24.835014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5313v2","created_at":"2026-05-18T02:33:24.835014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5313","created_at":"2026-05-18T02:33:24.835014+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDKMBNYXQMIW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDKMBNYXQMIWJQO3","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDKMBNYX","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ","json":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ.json","graph_json":"https://pith.science/api/pith-number/GDKMBNYXQMIWJQO3KQCPY7IRDZ/graph.json","events_json":"https://pith.science/api/pith-number/GDKMBNYXQMIWJQO3KQCPY7IRDZ/events.json","paper":"https://pith.science/paper/GDKMBNYX"},"agent_actions":{"view_html":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ","download_json":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ.json","view_paper":"https://pith.science/paper/GDKMBNYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5313&json=true","fetch_graph":"https://pith.science/api/pith-number/GDKMBNYXQMIWJQO3KQCPY7IRDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GDKMBNYXQMIWJQO3KQCPY7IRDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ/action/storage_attestation","attest_author":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ/action/author_attestation","sign_citation":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ/action/citation_signature","submit_replication":"https://pith.science/pith/GDKMBNYXQMIWJQO3KQCPY7IRDZ/action/replication_record"}},"created_at":"2026-05-18T02:33:24.835014+00:00","updated_at":"2026-05-18T02:33:24.835014+00:00"}