{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:744533EEDB3VBB25KNOY2RKNZB","short_pith_number":"pith:744533EE","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"},"canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","source":{"kind":"arxiv","id":"1802.03638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03638","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03638v2","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03638","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"744533EEDB3V","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"744533EEDB3VBB25","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"744533EE","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:744533EEDB3VBB25KNOY2RKNZB","target":"record","payload":{"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"},"canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","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"},"source_kind":"arxiv","source_id":"1802.03638","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:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbPl/HpDosCmIOTSSw/++UxopdmhMPOY3Khi6nxmVyq9ordG+At72jB7d8zoLaMb2/2xQ5LptPk5M/dzozPGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:51:24.067399Z"},"content_sha256":"4a611778118a3ec8ca94d61111322ec223b08c10a94b8e435086f50dd6693a28","schema_version":"1.0","event_id":"sha256:4a611778118a3ec8ca94d61111322ec223b08c10a94b8e435086f50dd6693a28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:744533EEDB3VBB25KNOY2RKNZB","target":"graph","payload":{"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"},"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:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdBlIBrxX/8zOKpXBILgosEy/0NIMU+6TaKWok4qgI3RwKBj9rKWv1bc1GNJnieQmiH2taaYf0C+8GUm+ATIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:51:24.067749Z"},"content_sha256":"95130d4b8cce50f7332e528d4e5f22f31ae0bfc49e4787999bf6a59c12825297","schema_version":"1.0","event_id":"sha256:95130d4b8cce50f7332e528d4e5f22f31ae0bfc49e4787999bf6a59c12825297"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/bundle.json","state_url":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/744533EEDB3VBB25KNOY2RKNZB/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-02T15:51:24Z","links":{"resolver":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB","bundle":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/bundle.json","state":"https://pith.science/pith/744533EEDB3VBB25KNOY2RKNZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/744533EEDB3VBB25KNOY2RKNZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:744533EEDB3VBB25KNOY2RKNZB","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":"b6425ef88bd2553d0cde65d704519413cff78e9db51e6096495c5b8d81bdd900","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-10T18:46:54Z","title_canon_sha256":"9093a604f1b61547b4ac04de53b652ac3ddeeeee657eba99a65b9e26ac2cfba5"},"schema_version":"1.0","source":{"id":"1802.03638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03638","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03638v2","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03638","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"744533EEDB3V","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"744533EEDB3VBB25","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"744533EE","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:95130d4b8cce50f7332e528d4e5f22f31ae0bfc49e4787999bf6a59c12825297","target":"graph","created_at":"2026-05-18T00:23:44Z","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":"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","authors_text":"Andr\\'e Valdestilhas, Axel-Cyrille Ngonga Ngomo, Edgard Marx, Tommaso Soru","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-10T18:46:54Z","title":"Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03638","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:4a611778118a3ec8ca94d61111322ec223b08c10a94b8e435086f50dd6693a28","target":"record","created_at":"2026-05-18T00:23:44Z","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":"b6425ef88bd2553d0cde65d704519413cff78e9db51e6096495c5b8d81bdd900","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-10T18:46:54Z","title_canon_sha256":"9093a604f1b61547b4ac04de53b652ac3ddeeeee657eba99a65b9e26ac2cfba5"},"schema_version":"1.0","source":{"id":"1802.03638","kind":"arxiv","version":2}},"canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff39ddec84187750875d535d8d454dc84e04aa1ddd37650235ef97b7b1d403f1","first_computed_at":"2026-05-18T00:23:44.669748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:44.669748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UyioyQcjoP+CX7uIGpR3lGsSvYt7Wce5B4CkoxOjO6MFoRNfVPBiFu3VogD0zI3ZWHEMYtWL9P0iRnYCyu1IAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:44.670213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a611778118a3ec8ca94d61111322ec223b08c10a94b8e435086f50dd6693a28","sha256:95130d4b8cce50f7332e528d4e5f22f31ae0bfc49e4787999bf6a59c12825297"],"state_sha256":"101e84ccf282d92b1f8f0f1f19b5e3813a0128f37f6bb8a8a4b78286fde03965"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QNqtkZyvvABp1QZsfBnoYPczVYfdKqYGGRwXd8y3xOHq8j8ypp2FHROQvp3G07emZVb542LcS+mHtJdiDkIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:51:24.069733Z","bundle_sha256":"c9b2ddf998e41f9d17948e15a700eca213cd96bca47023aff77973a93558fbf3"}}