{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A6T5ZNPJUUHBNXYRI7O55QR3KX","short_pith_number":"pith:A6T5ZNPJ","schema_version":"1.0","canonical_sha256":"07a7dcb5e9a50e16df1147dddec23b55e1e28a26dab75dd26cac0a4432976ecc","source":{"kind":"arxiv","id":"1511.07972","version":9},"attestation_state":"computed","paper":{"title":"Learning with Memory Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Crist\\'obal Esteban, Denis Krompa{\\ss}, Stephan Baier, Volker Tresp, Yinchong Yang","submitted_at":"2015-11-25T07:06:09Z","abstract_excerpt":"Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models using latent representations of generalized entities. Latent variable models are well suited to deal with the high dimensionality and sparsity of typical knowledge graphs. In recent publications the embedding models were extended to also consider time evolutions, time patterns and subsymbolic representations. In this paper we map embedding models, which wer"},"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":"1511.07972","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-25T07:06:09Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b4e86bbda0c45fdf6e00a6a4605067778c8a2ae93ece906570fdc04875b913db","abstract_canon_sha256":"f3ca4afbc4e9b1e3ad0a5c036b0a21f7e1754396dfd93474be528054920fb93c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:23.018466Z","signature_b64":"7x5EKQvIheVGoEUvwBUxLWko6zEe/x2pI4Ew6SZJuq3zxuXAsDt4hRjwGaybIRVV44V8MK69ZlWVZ+6nX1KUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a7dcb5e9a50e16df1147dddec23b55e1e28a26dab75dd26cac0a4432976ecc","last_reissued_at":"2026-05-18T01:15:23.017855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:23.017855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning with Memory Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Crist\\'obal Esteban, Denis Krompa{\\ss}, Stephan Baier, Volker Tresp, Yinchong Yang","submitted_at":"2015-11-25T07:06:09Z","abstract_excerpt":"Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models using latent representations of generalized entities. Latent variable models are well suited to deal with the high dimensionality and sparsity of typical knowledge graphs. In recent publications the embedding models were extended to also consider time evolutions, time patterns and subsymbolic representations. In this paper we map embedding models, which wer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07972","kind":"arxiv","version":9},"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":"1511.07972","created_at":"2026-05-18T01:15:23.017936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07972v9","created_at":"2026-05-18T01:15:23.017936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07972","created_at":"2026-05-18T01:15:23.017936+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6T5ZNPJUUHB","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6T5ZNPJUUHBNXYR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6T5ZNPJ","created_at":"2026-05-18T12:29:10.953037+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/A6T5ZNPJUUHBNXYRI7O55QR3KX","json":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX.json","graph_json":"https://pith.science/api/pith-number/A6T5ZNPJUUHBNXYRI7O55QR3KX/graph.json","events_json":"https://pith.science/api/pith-number/A6T5ZNPJUUHBNXYRI7O55QR3KX/events.json","paper":"https://pith.science/paper/A6T5ZNPJ"},"agent_actions":{"view_html":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX","download_json":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX.json","view_paper":"https://pith.science/paper/A6T5ZNPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07972&json=true","fetch_graph":"https://pith.science/api/pith-number/A6T5ZNPJUUHBNXYRI7O55QR3KX/graph.json","fetch_events":"https://pith.science/api/pith-number/A6T5ZNPJUUHBNXYRI7O55QR3KX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX/action/storage_attestation","attest_author":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX/action/author_attestation","sign_citation":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX/action/citation_signature","submit_replication":"https://pith.science/pith/A6T5ZNPJUUHBNXYRI7O55QR3KX/action/replication_record"}},"created_at":"2026-05-18T01:15:23.017936+00:00","updated_at":"2026-05-18T01:15:23.017936+00:00"}