{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:744533EEDB3VBB25KNOY2RKNZB","short_pith_number":"pith:744533EE","schema_version":"1.0","canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","source":{"kind":"arxiv","id":"1802.03638","version":2},"attestation_state":"computed","paper":{"title":"Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Andr\\'e Valdestilhas, Axel-Cyrille Ngonga Ngomo, Edgard Marx, Tommaso Soru","submitted_at":"2018-02-10T18:46:54Z","abstract_excerpt":"Graph representations of large knowledge bases may comprise billions of edges. Usually built upon human-generated ontologies, several knowledge bases do not feature declared ontological rules and are far from being complete. Current rule mining approaches rely on schemata or store the graph in-memory, which can be unfeasible for large graphs. In this paper, we introduce HornConcerto, an algorithm to discover Horn clauses in large graphs without the need of a schema. Using a standard fact-based confidence score, we can mine close Horn rules having an arbitrary body size. We show that our method"},"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":"1802.03638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-10T18:46:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9093a604f1b61547b4ac04de53b652ac3ddeeeee657eba99a65b9e26ac2cfba5","abstract_canon_sha256":"b6425ef88bd2553d0cde65d704519413cff78e9db51e6096495c5b8d81bdd900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:44.670213Z","signature_b64":"UyioyQcjoP+CX7uIGpR3lGsSvYt7Wce5B4CkoxOjO6MFoRNfVPBiFu3VogD0zI3ZWHEMYtWL9P0iRnYCyu1IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","last_reissued_at":"2026-05-18T00:23:44.669748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:44.669748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Andr\\'e Valdestilhas, Axel-Cyrille Ngonga Ngomo, Edgard Marx, Tommaso Soru","submitted_at":"2018-02-10T18:46:54Z","abstract_excerpt":"Graph representations of large knowledge bases may comprise billions of edges. Usually built upon human-generated ontologies, several knowledge bases do not feature declared ontological rules and are far from being complete. Current rule mining approaches rely on schemata or store the graph in-memory, which can be unfeasible for large graphs. In this paper, we introduce HornConcerto, an algorithm to discover Horn clauses in large graphs without the need of a schema. Using a standard fact-based confidence score, we can mine close Horn rules having an arbitrary body size. We show that our method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03638","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":"1802.03638","created_at":"2026-05-18T00:23:44.669817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03638v2","created_at":"2026-05-18T00:23:44.669817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03638","created_at":"2026-05-18T00:23:44.669817+00:00"},{"alias_kind":"pith_short_12","alias_value":"744533EEDB3V","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"744533EEDB3VBB25","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"744533EE","created_at":"2026-05-18T12:32:11.075285+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/744533EEDB3VBB25KNOY2RKNZB","json":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB.json","graph_json":"https://pith.science/api/pith-number/744533EEDB3VBB25KNOY2RKNZB/graph.json","events_json":"https://pith.science/api/pith-number/744533EEDB3VBB25KNOY2RKNZB/events.json","paper":"https://pith.science/paper/744533EE"},"agent_actions":{"view_html":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB","download_json":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB.json","view_paper":"https://pith.science/paper/744533EE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03638&json=true","fetch_graph":"https://pith.science/api/pith-number/744533EEDB3VBB25KNOY2RKNZB/graph.json","fetch_events":"https://pith.science/api/pith-number/744533EEDB3VBB25KNOY2RKNZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/action/storage_attestation","attest_author":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/action/author_attestation","sign_citation":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/action/citation_signature","submit_replication":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/action/replication_record"}},"created_at":"2026-05-18T00:23:44.669817+00:00","updated_at":"2026-05-18T00:23:44.669817+00:00"}