{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2R7YG5AO7NEOL2QS5CZF7WJMXJ","short_pith_number":"pith:2R7YG5AO","schema_version":"1.0","canonical_sha256":"d47f83740efb48e5ea12e8b25fd92cba757a8db42442dfdd5498ca82d8cddc5e","source":{"kind":"arxiv","id":"1503.00759","version":3},"attestation_state":"computed","paper":{"title":"A Review of Relational Machine Learning for Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Evgeniy Gabrilovich, Kevin Murphy, Maximilian Nickel, Volker Tresp","submitted_at":"2015-03-02T21:35:41Z","abstract_excerpt":"Relational machine learning studies methods for the statistical analysis of relational, or graph-structured, data. In this paper, we provide a review of how such statistical models can be \"trained\" on large knowledge graphs, and then used to predict new facts about the world (which is equivalent to predicting new edges in the graph). In particular, we discuss two fundamentally different kinds of statistical relational models, both of which can scale to massive datasets. The first is based on latent feature models such as tensor factorization and multiway neural networks. The second is based on"},"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":"1503.00759","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-02T21:35:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"70b32d93f681ea74cffd97f2412e136e1b69ba3c9123bbb0aae992de441f860e","abstract_canon_sha256":"430e2d62e4a5ce2e7b43f0292041bb3a2bb7188ce8330b2a60293aa359b3c489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.940647Z","signature_b64":"4ek97qtR/m8X2xRsZlTvWzDOZ4sVxeH2V6ir6nU1t06CdFIDdd7cFbovFwg4Yu96KSrp7iUFxS92nKogzNZqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d47f83740efb48e5ea12e8b25fd92cba757a8db42442dfdd5498ca82d8cddc5e","last_reissued_at":"2026-05-18T00:57:50.939974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.939974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Review of Relational Machine Learning for Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Evgeniy Gabrilovich, Kevin Murphy, Maximilian Nickel, Volker Tresp","submitted_at":"2015-03-02T21:35:41Z","abstract_excerpt":"Relational machine learning studies methods for the statistical analysis of relational, or graph-structured, data. In this paper, we provide a review of how such statistical models can be \"trained\" on large knowledge graphs, and then used to predict new facts about the world (which is equivalent to predicting new edges in the graph). In particular, we discuss two fundamentally different kinds of statistical relational models, both of which can scale to massive datasets. The first is based on latent feature models such as tensor factorization and multiway neural networks. The second is based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00759","kind":"arxiv","version":3},"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":"1503.00759","created_at":"2026-05-18T00:57:50.940073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00759v3","created_at":"2026-05-18T00:57:50.940073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00759","created_at":"2026-05-18T00:57:50.940073+00:00"},{"alias_kind":"pith_short_12","alias_value":"2R7YG5AO7NEO","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2R7YG5AO7NEOL2QS","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2R7YG5AO","created_at":"2026-05-18T12:29:02.477457+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/2R7YG5AO7NEOL2QS5CZF7WJMXJ","json":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ.json","graph_json":"https://pith.science/api/pith-number/2R7YG5AO7NEOL2QS5CZF7WJMXJ/graph.json","events_json":"https://pith.science/api/pith-number/2R7YG5AO7NEOL2QS5CZF7WJMXJ/events.json","paper":"https://pith.science/paper/2R7YG5AO"},"agent_actions":{"view_html":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ","download_json":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ.json","view_paper":"https://pith.science/paper/2R7YG5AO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00759&json=true","fetch_graph":"https://pith.science/api/pith-number/2R7YG5AO7NEOL2QS5CZF7WJMXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2R7YG5AO7NEOL2QS5CZF7WJMXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ/action/storage_attestation","attest_author":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ/action/author_attestation","sign_citation":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ/action/citation_signature","submit_replication":"https://pith.science/pith/2R7YG5AO7NEOL2QS5CZF7WJMXJ/action/replication_record"}},"created_at":"2026-05-18T00:57:50.940073+00:00","updated_at":"2026-05-18T00:57:50.940073+00:00"}