{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IELJXSH3SXBZN75QEI7VNTEIQR","short_pith_number":"pith:IELJXSH3","canonical_record":{"source":{"id":"1906.01195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T04:59:08Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"b0f247412144cff189319ecbcf3f96bb9ac62cbb2823f82d23ea648558f92399","abstract_canon_sha256":"d809bcc91b21e4f546263a3ba572a9a014c86d02aabc3c7e07291c099d42507b"},"schema_version":"1.0"},"canonical_sha256":"41169bc8fb95c396ffb0223f56cc888477b0ff7b2e550425d0665f4cfa04fd20","source":{"kind":"arxiv","id":"1906.01195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01195","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01195v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01195","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"IELJXSH3SXBZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IELJXSH3SXBZN75Q","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IELJXSH3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IELJXSH3SXBZN75QEI7VNTEIQR","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T04:59:08Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"b0f247412144cff189319ecbcf3f96bb9ac62cbb2823f82d23ea648558f92399","abstract_canon_sha256":"d809bcc91b21e4f546263a3ba572a9a014c86d02aabc3c7e07291c099d42507b"},"schema_version":"1.0"},"canonical_sha256":"41169bc8fb95c396ffb0223f56cc888477b0ff7b2e550425d0665f4cfa04fd20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:17.604713Z","signature_b64":"9lHDIlRaq0J79lTCSISLfANv6qn6Hs/CI0Vz8uRC8nmIiAwA5gfMYmdH5qREf/T8UNAdPm+uZ5pEZSKG/8KoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41169bc8fb95c396ffb0223f56cc888477b0ff7b2e550425d0665f4cfa04fd20","last_reissued_at":"2026-05-17T23:44:17.603997Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:17.603997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01195","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-05-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNTQ92yp1Mt8kkixXYbhHBAqPnU7PYtbV08/MEgmvbehOdQYsNyYzGaTM6cEng+g+wIr8Oth9aHKkeoB/R4dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:46:21.005112Z"},"content_sha256":"b1f632dfade4560757397f31615b3f7d59a6abb526a9e7bcd986912af6babf82","schema_version":"1.0","event_id":"sha256:b1f632dfade4560757397f31615b3f7d59a6abb526a9e7bcd986912af6babf82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IELJXSH3SXBZN75QEI7VNTEIQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Charu Sharma, Deepak Nathani, Jatin Chauhan, Manohar Kaul","submitted_at":"2019-06-04T04:59:08Z","abstract_excerpt":"The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer and more expressive feature embeddings and hence also perform well on relation prediction. However, we observe that these KG embeddings treat triples independently and thus fail to cover the complex and hidden information that is inherently implicit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01195","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"},"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-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRfazSAZnIRKG0LxYWx1zYQx4MLGEajKFWWtj80gZquz0o2YrONfv2kvuXqv5hs5Jz5NBH5lfXGzn1UxU3YCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:46:21.005742Z"},"content_sha256":"7ba3fd34f9c9e0bfe0bb2e34dc15f7ac2e8bcbc3b9a4b604076d14276a800850","schema_version":"1.0","event_id":"sha256:7ba3fd34f9c9e0bfe0bb2e34dc15f7ac2e8bcbc3b9a4b604076d14276a800850"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IELJXSH3SXBZN75QEI7VNTEIQR/bundle.json","state_url":"https://pith.science/pith/IELJXSH3SXBZN75QEI7VNTEIQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IELJXSH3SXBZN75QEI7VNTEIQR/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-11T04:46:21Z","links":{"resolver":"https://pith.science/pith/IELJXSH3SXBZN75QEI7VNTEIQR","bundle":"https://pith.science/pith/IELJXSH3SXBZN75QEI7VNTEIQR/bundle.json","state":"https://pith.science/pith/IELJXSH3SXBZN75QEI7VNTEIQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IELJXSH3SXBZN75QEI7VNTEIQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IELJXSH3SXBZN75QEI7VNTEIQR","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":"d809bcc91b21e4f546263a3ba572a9a014c86d02aabc3c7e07291c099d42507b","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T04:59:08Z","title_canon_sha256":"b0f247412144cff189319ecbcf3f96bb9ac62cbb2823f82d23ea648558f92399"},"schema_version":"1.0","source":{"id":"1906.01195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01195","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01195v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01195","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"IELJXSH3SXBZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IELJXSH3SXBZN75Q","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IELJXSH3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:7ba3fd34f9c9e0bfe0bb2e34dc15f7ac2e8bcbc3b9a4b604076d14276a800850","target":"graph","created_at":"2026-05-17T23:44:17Z","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":"The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer and more expressive feature embeddings and hence also perform well on relation prediction. However, we observe that these KG embeddings treat triples independently and thus fail to cover the complex and hidden information that is inherently implicit","authors_text":"Charu Sharma, Deepak Nathani, Jatin Chauhan, Manohar Kaul","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T04:59:08Z","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01195","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:b1f632dfade4560757397f31615b3f7d59a6abb526a9e7bcd986912af6babf82","target":"record","created_at":"2026-05-17T23:44:17Z","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":"d809bcc91b21e4f546263a3ba572a9a014c86d02aabc3c7e07291c099d42507b","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T04:59:08Z","title_canon_sha256":"b0f247412144cff189319ecbcf3f96bb9ac62cbb2823f82d23ea648558f92399"},"schema_version":"1.0","source":{"id":"1906.01195","kind":"arxiv","version":1}},"canonical_sha256":"41169bc8fb95c396ffb0223f56cc888477b0ff7b2e550425d0665f4cfa04fd20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41169bc8fb95c396ffb0223f56cc888477b0ff7b2e550425d0665f4cfa04fd20","first_computed_at":"2026-05-17T23:44:17.603997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:17.603997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9lHDIlRaq0J79lTCSISLfANv6qn6Hs/CI0Vz8uRC8nmIiAwA5gfMYmdH5qREf/T8UNAdPm+uZ5pEZSKG/8KoAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:17.604713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1f632dfade4560757397f31615b3f7d59a6abb526a9e7bcd986912af6babf82","sha256:7ba3fd34f9c9e0bfe0bb2e34dc15f7ac2e8bcbc3b9a4b604076d14276a800850"],"state_sha256":"cebab2526d7c61e0cf2c28b4db0bc1327dd7b21652dd825a8b275d1a0845999d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIHGgRwKZpWunrjKIdeX07aScV6eVejr92QnAAmwOHFZTgnCFQnGkRKbgiLkbOSZw7S0l4O5yz2XZeJb8se4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:46:21.009819Z","bundle_sha256":"b5d23ba3c51f68bbdb01e8ff7d0e6b060a2d381b5a36b23a293dff815fdd1df7"}}