{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VZKMORX5W5ERIFKTBE35SGQI4X","short_pith_number":"pith:VZKMORX5","schema_version":"1.0","canonical_sha256":"ae54c746fdb7491415530937d91a08e5fd8e33f26c10aab82ef4ee2c149f2788","source":{"kind":"arxiv","id":"2404.09167","version":1},"attestation_state":"computed","paper":{"title":"Survey on Embedding Models for Knowledge Graph and its Applications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Manita Pote","submitted_at":"2024-04-14T07:15:59Z","abstract_excerpt":"Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Graph as representation for knowledge has several drawbacks like data sparsity, computational complexity and manual feature engineering. Knowledge Graph embedding tackles the drawback by representing entities and relation in low dimensional vector space by capturing the semantic relation between them. There are different KG embedding models. Here, we discuss translation based and neural network base"},"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":"2404.09167","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2024-04-14T07:15:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5503f5fcb57ad87ec49bb2215da6427d9abd9e981bf8ca87d899ce20d324f770","abstract_canon_sha256":"90d66cc47efdda149e075877cebb494890b724e73d7b5b99dc45a5480f44f7e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:46.020211Z","signature_b64":"4rD97TF/5iA2KIqDM55ZhUa8Ndq8T2sNzIxmisEAbiAr+q11e9qvgNilrr2rwldm5v4V5Wb9je/0FJbby9mfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae54c746fdb7491415530937d91a08e5fd8e33f26c10aab82ef4ee2c149f2788","last_reissued_at":"2026-07-05T08:07:46.019785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:46.019785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survey on Embedding Models for Knowledge Graph and its Applications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Manita Pote","submitted_at":"2024-04-14T07:15:59Z","abstract_excerpt":"Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Graph as representation for knowledge has several drawbacks like data sparsity, computational complexity and manual feature engineering. Knowledge Graph embedding tackles the drawback by representing entities and relation in low dimensional vector space by capturing the semantic relation between them. There are different KG embedding models. Here, we discuss translation based and neural network base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09167","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/2404.09167/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.09167","created_at":"2026-07-05T08:07:46.019839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.09167v1","created_at":"2026-07-05T08:07:46.019839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09167","created_at":"2026-07-05T08:07:46.019839+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZKMORX5W5ER","created_at":"2026-07-05T08:07:46.019839+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZKMORX5W5ERIFKT","created_at":"2026-07-05T08:07:46.019839+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZKMORX5","created_at":"2026-07-05T08:07:46.019839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08970","citing_title":"A Survey of Link Prediction in N-ary Knowledge Graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X","json":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X.json","graph_json":"https://pith.science/api/pith-number/VZKMORX5W5ERIFKTBE35SGQI4X/graph.json","events_json":"https://pith.science/api/pith-number/VZKMORX5W5ERIFKTBE35SGQI4X/events.json","paper":"https://pith.science/paper/VZKMORX5"},"agent_actions":{"view_html":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X","download_json":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X.json","view_paper":"https://pith.science/paper/VZKMORX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.09167&json=true","fetch_graph":"https://pith.science/api/pith-number/VZKMORX5W5ERIFKTBE35SGQI4X/graph.json","fetch_events":"https://pith.science/api/pith-number/VZKMORX5W5ERIFKTBE35SGQI4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X/action/storage_attestation","attest_author":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X/action/author_attestation","sign_citation":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X/action/citation_signature","submit_replication":"https://pith.science/pith/VZKMORX5W5ERIFKTBE35SGQI4X/action/replication_record"}},"created_at":"2026-07-05T08:07:46.019839+00:00","updated_at":"2026-07-05T08:07:46.019839+00:00"}