{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S43X4NAKHA7RQOUFTEEI7TCQQX","short_pith_number":"pith:S43X4NAK","schema_version":"1.0","canonical_sha256":"97377e340a383f183a8599088fcc5085e9537dbdcef72b8764c044ddb00f93b9","source":{"kind":"arxiv","id":"1903.08948","version":1},"attestation_state":"computed","paper":{"title":"Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Abraham Bernstein, Bibek Paudel, Hai Zhu, Huajun Chen, Jiaoyan Chen, Liang Wang, Wei Zhang, Wen Zhang","submitted_at":"2019-03-21T12:26:44Z","abstract_excerpt":"Reasoning is essential for the development of large knowledge graphs, especially for completion, which aims to infer new triples based on existing ones. Both rules and embeddings can be used for knowledge graph reasoning and they have their own advantages and difficulties. Rule-based reasoning is accurate and explainable but rule learning with searching over the graph always suffers from efficiency due to huge search space. Embedding-based reasoning is more scalable and efficient as the reasoning is conducted via computation between embeddings, but it has difficulty learning good representatio"},"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":"1903.08948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T12:26:44Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6c24e10cf1edc6b79bd6db38b006b1ddb1b3a4f0f10bd7c5f0dc7ccb532bd89b","abstract_canon_sha256":"f3d1959fa46d3fbccfa088f7066575e233c68e7f5bae498da7da96a7f2c2adde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.488269Z","signature_b64":"BqXcw7prsp5jELKH8VzqOABSHq8zlTuLLdqEYaNl1NNH4qUEyn0Ox16Lk8BVovEcElErSADT/g9fRTvZ3s+LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97377e340a383f183a8599088fcc5085e9537dbdcef72b8764c044ddb00f93b9","last_reissued_at":"2026-05-17T23:50:43.487917Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.487917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Abraham Bernstein, Bibek Paudel, Hai Zhu, Huajun Chen, Jiaoyan Chen, Liang Wang, Wei Zhang, Wen Zhang","submitted_at":"2019-03-21T12:26:44Z","abstract_excerpt":"Reasoning is essential for the development of large knowledge graphs, especially for completion, which aims to infer new triples based on existing ones. Both rules and embeddings can be used for knowledge graph reasoning and they have their own advantages and difficulties. Rule-based reasoning is accurate and explainable but rule learning with searching over the graph always suffers from efficiency due to huge search space. Embedding-based reasoning is more scalable and efficient as the reasoning is conducted via computation between embeddings, but it has difficulty learning good representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08948","kind":"arxiv","version":1},"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":"1903.08948","created_at":"2026-05-17T23:50:43.487973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08948v1","created_at":"2026-05-17T23:50:43.487973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08948","created_at":"2026-05-17T23:50:43.487973+00:00"},{"alias_kind":"pith_short_12","alias_value":"S43X4NAKHA7R","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"S43X4NAKHA7RQOUF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"S43X4NAK","created_at":"2026-05-18T12:33:27.125529+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/S43X4NAKHA7RQOUFTEEI7TCQQX","json":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX.json","graph_json":"https://pith.science/api/pith-number/S43X4NAKHA7RQOUFTEEI7TCQQX/graph.json","events_json":"https://pith.science/api/pith-number/S43X4NAKHA7RQOUFTEEI7TCQQX/events.json","paper":"https://pith.science/paper/S43X4NAK"},"agent_actions":{"view_html":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX","download_json":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX.json","view_paper":"https://pith.science/paper/S43X4NAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08948&json=true","fetch_graph":"https://pith.science/api/pith-number/S43X4NAKHA7RQOUFTEEI7TCQQX/graph.json","fetch_events":"https://pith.science/api/pith-number/S43X4NAKHA7RQOUFTEEI7TCQQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX/action/storage_attestation","attest_author":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX/action/author_attestation","sign_citation":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX/action/citation_signature","submit_replication":"https://pith.science/pith/S43X4NAKHA7RQOUFTEEI7TCQQX/action/replication_record"}},"created_at":"2026-05-17T23:50:43.487973+00:00","updated_at":"2026-05-17T23:50:43.487973+00:00"}