{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TKD7EJZYGA3PYLR6GEXLOL4ZV5","short_pith_number":"pith:TKD7EJZY","canonical_record":{"source":{"id":"2302.06229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-13T10:07:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a90db54476a9debed48b0d31682348cfad6ed7e14c5f01ae6e607585a64aeb0b","abstract_canon_sha256":"0fe3764ffbf1d376afd8caeea963729c4f3e39e7a8fb28ab48bdba8fdbe96130"},"schema_version":"1.0"},"canonical_sha256":"9a87f227383036fc2e3e312eb72f99af79ba5a5a755aa40490e13a0c07df3bc1","source":{"kind":"arxiv","id":"2302.06229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06229","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06229v1","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06229","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"TKD7EJZYGA3P","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_16","alias_value":"TKD7EJZYGA3PYLR6","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_8","alias_value":"TKD7EJZY","created_at":"2026-07-05T05:41:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TKD7EJZYGA3PYLR6GEXLOL4ZV5","target":"record","payload":{"canonical_record":{"source":{"id":"2302.06229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-13T10:07:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a90db54476a9debed48b0d31682348cfad6ed7e14c5f01ae6e607585a64aeb0b","abstract_canon_sha256":"0fe3764ffbf1d376afd8caeea963729c4f3e39e7a8fb28ab48bdba8fdbe96130"},"schema_version":"1.0"},"canonical_sha256":"9a87f227383036fc2e3e312eb72f99af79ba5a5a755aa40490e13a0c07df3bc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:03.347151Z","signature_b64":"n6pr6eH/FGzwgSK6lAhqac1ZCukZcnGlDziMEW6UrSx2i7gZjSm+nqMETA9LaddI+2cd8jH8+Qpo91JLZkOqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a87f227383036fc2e3e312eb72f99af79ba5a5a755aa40490e13a0c07df3bc1","last_reissued_at":"2026-07-05T05:41:03.346753Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:03.346753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.06229","source_version":1,"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-07-05T05:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5rfv9e/tsoctsflSpZ6GeJ9qq/tlEjzetJzXfxWh6OS3LWFMw3MaR/QtkRfYKAqDvAkfY4tfEe7Qr3Tr1fKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:09:53.675375Z"},"content_sha256":"9af77dc18303bde577ca008256c224a0627ef066176defe74ed3bc44a246a73b","schema_version":"1.0","event_id":"sha256:9af77dc18303bde577ca008256c224a0627ef066176defe74ed3bc44a246a73b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TKD7EJZYGA3PYLR6GEXLOL4ZV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Cosimo Gregucci, Daniel Hern\\'andez, Mojtaba Nayyeri, Steffen Staab","submitted_at":"2023-02-13T10:07:26Z","abstract_excerpt":"Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria. Relations in the graph may follow patterns that can be learned, e.g., some relations might be symmetric and others might be hierarchical. However, the learning capability of different embedding models varies for each pattern and, so far, no single model can learn all patterns equally well. In this paper, we combine the query representat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7bOUFeGT4v9t+vY4uU4LeVcMJMeHPDmEjPpVJbKfkEHtz9OsF9+/s2I5Zu7VcpmIccZ17Evq9GJvD/jDylIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:09:53.675902Z"},"content_sha256":"c52d0f6efca19e83b345a2d8969e938e8be9fe99356a4f2289b124ec35b6e636","schema_version":"1.0","event_id":"sha256:c52d0f6efca19e83b345a2d8969e938e8be9fe99356a4f2289b124ec35b6e636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/bundle.json","state_url":"https://pith.science/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/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-08-08T20:09:53Z","links":{"resolver":"https://pith.science/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5","bundle":"https://pith.science/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/bundle.json","state":"https://pith.science/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKD7EJZYGA3PYLR6GEXLOL4ZV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TKD7EJZYGA3PYLR6GEXLOL4ZV5","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":"0fe3764ffbf1d376afd8caeea963729c4f3e39e7a8fb28ab48bdba8fdbe96130","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-13T10:07:26Z","title_canon_sha256":"a90db54476a9debed48b0d31682348cfad6ed7e14c5f01ae6e607585a64aeb0b"},"schema_version":"1.0","source":{"id":"2302.06229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06229","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06229v1","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06229","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"TKD7EJZYGA3P","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_16","alias_value":"TKD7EJZYGA3PYLR6","created_at":"2026-07-05T05:41:03Z"},{"alias_kind":"pith_short_8","alias_value":"TKD7EJZY","created_at":"2026-07-05T05:41:03Z"}],"graph_snapshots":[{"event_id":"sha256:c52d0f6efca19e83b345a2d8969e938e8be9fe99356a4f2289b124ec35b6e636","target":"graph","created_at":"2026-07-05T05:41:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.06229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria. Relations in the graph may follow patterns that can be learned, e.g., some relations might be symmetric and others might be hierarchical. However, the learning capability of different embedding models varies for each pattern and, so far, no single model can learn all patterns equally well. In this paper, we combine the query representat","authors_text":"Cosimo Gregucci, Daniel Hern\\'andez, Mojtaba Nayyeri, Steffen Staab","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-13T10:07:26Z","title":"Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06229","kind":"arxiv","version":1},"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:9af77dc18303bde577ca008256c224a0627ef066176defe74ed3bc44a246a73b","target":"record","created_at":"2026-07-05T05:41:03Z","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":"0fe3764ffbf1d376afd8caeea963729c4f3e39e7a8fb28ab48bdba8fdbe96130","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-02-13T10:07:26Z","title_canon_sha256":"a90db54476a9debed48b0d31682348cfad6ed7e14c5f01ae6e607585a64aeb0b"},"schema_version":"1.0","source":{"id":"2302.06229","kind":"arxiv","version":1}},"canonical_sha256":"9a87f227383036fc2e3e312eb72f99af79ba5a5a755aa40490e13a0c07df3bc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a87f227383036fc2e3e312eb72f99af79ba5a5a755aa40490e13a0c07df3bc1","first_computed_at":"2026-07-05T05:41:03.346753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:41:03.346753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n6pr6eH/FGzwgSK6lAhqac1ZCukZcnGlDziMEW6UrSx2i7gZjSm+nqMETA9LaddI+2cd8jH8+Qpo91JLZkOqDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:41:03.347151Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.06229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9af77dc18303bde577ca008256c224a0627ef066176defe74ed3bc44a246a73b","sha256:c52d0f6efca19e83b345a2d8969e938e8be9fe99356a4f2289b124ec35b6e636"],"state_sha256":"6f93979bd657e6609275b4e6a79aa6e01d7bb3225aee9416c679ed8db9a268fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/XgMRYqsfdmRsNu4B4TtetggkxoUNUB3mkf3/1F+lKvF758jOrPQSAkdlFUwp3Ptd7tSqWoPG1xfDvDCErFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:09:53.681003Z","bundle_sha256":"348491712f4367f0d9f3465aa62c639ab0e765a07fd29142beee701000be3ffd"}}