{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EKOHUFAYFSD2HRCW66SPSM54HD","short_pith_number":"pith:EKOHUFAY","schema_version":"1.0","canonical_sha256":"229c7a14182c87a3c456f7a4f933bc38cf508a580e18181deb1baffa2674e5ac","source":{"kind":"arxiv","id":"1811.02304","version":2},"attestation_state":"computed","paper":{"title":"Modular Materialisation of Datalog Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Boris Motik, Ian Horrocks, Pan Hu","submitted_at":"2018-11-06T11:51:10Z","abstract_excerpt":"The semina\\\"ive algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the input facts change. Certain (combinations of) rules, however, can be handled much more efficiently using custom algorithms. To integrate such algorithms into a general reasoning approach that can handle arbitrary rules, we propose a modular framework for materialisation computation and its maintenance. We split a datalog program into modules that can be handled using specialised algorithms, and handle the remaining ru"},"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":"1811.02304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-06T11:51:10Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"faac6f65e0194ee78976412af9f348a6e3acac57391c41f3a58c3d5fff0f7253","abstract_canon_sha256":"667d627d63cbcda5017bf652cf36f12b778449a55b3e6fe9d92b6937d0670353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.861539Z","signature_b64":"GXDLfSFhMiljZqpNV/tzMP6URiJdrVun4xn0K1CesjhewKkpJgZki8HE4b6hxeHYcdKa9d5G7nEIv6i0kO8aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229c7a14182c87a3c456f7a4f933bc38cf508a580e18181deb1baffa2674e5ac","last_reissued_at":"2026-05-18T00:00:42.861188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.861188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Materialisation of Datalog Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Boris Motik, Ian Horrocks, Pan Hu","submitted_at":"2018-11-06T11:51:10Z","abstract_excerpt":"The semina\\\"ive algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the input facts change. Certain (combinations of) rules, however, can be handled much more efficiently using custom algorithms. To integrate such algorithms into a general reasoning approach that can handle arbitrary rules, we propose a modular framework for materialisation computation and its maintenance. We split a datalog program into modules that can be handled using specialised algorithms, and handle the remaining ru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02304","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":"1811.02304","created_at":"2026-05-18T00:00:42.861243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02304v2","created_at":"2026-05-18T00:00:42.861243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02304","created_at":"2026-05-18T00:00:42.861243+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKOHUFAYFSD2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKOHUFAYFSD2HRCW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKOHUFAY","created_at":"2026-05-18T12:32:22.470017+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/EKOHUFAYFSD2HRCW66SPSM54HD","json":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD.json","graph_json":"https://pith.science/api/pith-number/EKOHUFAYFSD2HRCW66SPSM54HD/graph.json","events_json":"https://pith.science/api/pith-number/EKOHUFAYFSD2HRCW66SPSM54HD/events.json","paper":"https://pith.science/paper/EKOHUFAY"},"agent_actions":{"view_html":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD","download_json":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD.json","view_paper":"https://pith.science/paper/EKOHUFAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02304&json=true","fetch_graph":"https://pith.science/api/pith-number/EKOHUFAYFSD2HRCW66SPSM54HD/graph.json","fetch_events":"https://pith.science/api/pith-number/EKOHUFAYFSD2HRCW66SPSM54HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD/action/storage_attestation","attest_author":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD/action/author_attestation","sign_citation":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD/action/citation_signature","submit_replication":"https://pith.science/pith/EKOHUFAYFSD2HRCW66SPSM54HD/action/replication_record"}},"created_at":"2026-05-18T00:00:42.861243+00:00","updated_at":"2026-05-18T00:00:42.861243+00:00"}