{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JR2M45GAYRBEGHBUZPDIOSYVIA","short_pith_number":"pith:JR2M45GA","canonical_record":{"source":{"id":"1803.07828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-21T10:06:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0961d01dd56d063df655a6097590bcd087428511a98190c4fe0f20970a0b444b","abstract_canon_sha256":"afcd43437346495605c437479a1e2f479bf08dcdb7849bb54a7a82eb051780e3"},"schema_version":"1.0"},"canonical_sha256":"4c74ce74c0c442431c34cbc6874b1540367311b5bbd4e3ebf3da52fcc8159ff2","source":{"kind":"arxiv","id":"1803.07828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07828","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07828v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07828","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"JR2M45GAYRBE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JR2M45GAYRBEGHBU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JR2M45GA","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JR2M45GAYRBEGHBUZPDIOSYVIA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-21T10:06:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0961d01dd56d063df655a6097590bcd087428511a98190c4fe0f20970a0b444b","abstract_canon_sha256":"afcd43437346495605c437479a1e2f479bf08dcdb7849bb54a7a82eb051780e3"},"schema_version":"1.0"},"canonical_sha256":"4c74ce74c0c442431c34cbc6874b1540367311b5bbd4e3ebf3da52fcc8159ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.091372Z","signature_b64":"5kGNXlJWrEKX4sLZD2FLX7zptqKgTs3i3rtO0uixVOmRRZ742SUnxUJC/wC3syxT7ckhw2lgDKqnXmt7WTikAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c74ce74c0c442431c34cbc6874b1540367311b5bbd4e3ebf3da52fcc8159ff2","last_reissued_at":"2026-05-18T00:01:15.090909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.090909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07828","source_version":2,"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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPePhED0ci1bId5pb+yJUc3+mqeYGhyGDAkfMQEBEeJ9K2dBB1euufuarFXF/e1c/Phuqi54Cth3PKNSvGEdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:47:42.235807Z"},"content_sha256":"b9665e4f9b9d373bdc7670eb98bdd9f79af3e904f2ef47716d178e28a9bf59f9","schema_version":"1.0","event_id":"sha256:b9665e4f9b9d373bdc7670eb98bdd9f79af3e904f2ef47716d178e28a9bf59f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JR2M45GAYRBEGHBUZPDIOSYVIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expeditious Generation of Knowledge Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alexander Bigerl, Andr\\'e Valdestilhas, Diego Esteves, Diego Moussallem, Edgard Marx, Stefano Ruberto, Tommaso Soru","submitted_at":"2018-03-21T10:06:28Z","abstract_excerpt":"Knowledge Graph Embedding methods aim at representing entities and relations in a knowledge base as points or vectors in a continuous vector space. Several approaches using embeddings have shown promising results on tasks such as link prediction, entity recommendation, question answering, and triplet classification. However, only a few methods can compute low-dimensional embeddings of very large knowledge bases without needing state-of-the-art computational resources. In this paper, we propose KG2Vec, a simple and fast approach to Knowledge Graph Embedding based on the skip-gram model. Instead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07828","kind":"arxiv","version":2},"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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0saifrkVaudKAsrH6Go7k9QdnIeNflPPziDOGCfeVqjZvQNlv5TGL2z3Hi0J/PbU1Rr7JcioDCfKb7iy7mOuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:47:42.236251Z"},"content_sha256":"00f55a33c9df16a1772798d1baa2a2262201841a8c0b1e7879d1089ec471e6e1","schema_version":"1.0","event_id":"sha256:00f55a33c9df16a1772798d1baa2a2262201841a8c0b1e7879d1089ec471e6e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/bundle.json","state_url":"https://pith.science/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/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-05-19T17:47:42Z","links":{"resolver":"https://pith.science/pith/JR2M45GAYRBEGHBUZPDIOSYVIA","bundle":"https://pith.science/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/bundle.json","state":"https://pith.science/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR2M45GAYRBEGHBUZPDIOSYVIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JR2M45GAYRBEGHBUZPDIOSYVIA","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":"afcd43437346495605c437479a1e2f479bf08dcdb7849bb54a7a82eb051780e3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-21T10:06:28Z","title_canon_sha256":"0961d01dd56d063df655a6097590bcd087428511a98190c4fe0f20970a0b444b"},"schema_version":"1.0","source":{"id":"1803.07828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07828","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07828v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07828","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"JR2M45GAYRBE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JR2M45GAYRBEGHBU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JR2M45GA","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:00f55a33c9df16a1772798d1baa2a2262201841a8c0b1e7879d1089ec471e6e1","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"Knowledge Graph Embedding methods aim at representing entities and relations in a knowledge base as points or vectors in a continuous vector space. Several approaches using embeddings have shown promising results on tasks such as link prediction, entity recommendation, question answering, and triplet classification. However, only a few methods can compute low-dimensional embeddings of very large knowledge bases without needing state-of-the-art computational resources. In this paper, we propose KG2Vec, a simple and fast approach to Knowledge Graph Embedding based on the skip-gram model. Instead","authors_text":"Alexander Bigerl, Andr\\'e Valdestilhas, Diego Esteves, Diego Moussallem, Edgard Marx, Stefano Ruberto, Tommaso Soru","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-21T10:06:28Z","title":"Expeditious Generation of Knowledge Graph Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07828","kind":"arxiv","version":2},"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:b9665e4f9b9d373bdc7670eb98bdd9f79af3e904f2ef47716d178e28a9bf59f9","target":"record","created_at":"2026-05-18T00:01:15Z","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":"afcd43437346495605c437479a1e2f479bf08dcdb7849bb54a7a82eb051780e3","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-21T10:06:28Z","title_canon_sha256":"0961d01dd56d063df655a6097590bcd087428511a98190c4fe0f20970a0b444b"},"schema_version":"1.0","source":{"id":"1803.07828","kind":"arxiv","version":2}},"canonical_sha256":"4c74ce74c0c442431c34cbc6874b1540367311b5bbd4e3ebf3da52fcc8159ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c74ce74c0c442431c34cbc6874b1540367311b5bbd4e3ebf3da52fcc8159ff2","first_computed_at":"2026-05-18T00:01:15.090909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.090909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5kGNXlJWrEKX4sLZD2FLX7zptqKgTs3i3rtO0uixVOmRRZ742SUnxUJC/wC3syxT7ckhw2lgDKqnXmt7WTikAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.091372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9665e4f9b9d373bdc7670eb98bdd9f79af3e904f2ef47716d178e28a9bf59f9","sha256:00f55a33c9df16a1772798d1baa2a2262201841a8c0b1e7879d1089ec471e6e1"],"state_sha256":"05330851b164a9485ae7b52fa747ff1877c5f16c69d9e4a6c4917ac92eac7d4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n35U1SeawzkyUIjC7H+JdmbaOTrkP2hX8CKMB7I8nYCZbt3yitRUxxdwyvpJY9BE1yXn5HMr56Xt1nN2LaO2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:47:42.239890Z","bundle_sha256":"872e797d3c2da54398835e5bb1aff4331cbd7a36250dae1939c72988d55f37ad"}}