{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:E5VJT5TZXC5ASRPMFLNRVQFC4D","short_pith_number":"pith:E5VJT5TZ","schema_version":"1.0","canonical_sha256":"276a99f679b8ba0945ec2adb1ac0a2e0c3bda9aff3bc8566f3370f7a75019d92","source":{"kind":"arxiv","id":"2405.17249","version":2},"attestation_state":"computed","paper":{"title":"Assessing LLMs Suitability for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gheorghe Cosmin Silaghi, Vasile Ionut Remus Iga","submitted_at":"2024-05-27T15:04:50Z","abstract_excerpt":"Recent work has shown the capability of Large Language Models (LLMs) to solve tasks related to Knowledge Graphs, such as Knowledge Graph Completion, even in Zero- or Few-Shot paradigms. However, they are known to hallucinate answers, or output results in a non-deterministic manner, thus leading to wrongly reasoned responses, even if they satisfy the user's demands. To highlight opportunities and challenges in knowledge graphs-related tasks, we experiment with three distinguished LLMs, namely Mixtral-8x7b-Instruct-v0.1, GPT-3.5-Turbo-0125 and GPT-4o, on Knowledge Graph Completion for static kno"},"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":"2405.17249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-05-27T15:04:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3f9adbe5c5bb186827c18ab8c2d27e8f0a4bee1d5a51c4246d17e1cefd55465a","abstract_canon_sha256":"58009abc6d4d0691b08cad8a618c51bb8fcc4c93259ef16b3ee6300813f29b31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:29.035573Z","signature_b64":"faAvUyVojip7wfna/TV1gYJZh/q8/t9NyySrCjR1qf1G55GrlexWjeXm3xWJn5YKutPk3j8mBMCoKr774KecCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276a99f679b8ba0945ec2adb1ac0a2e0c3bda9aff3bc8566f3370f7a75019d92","last_reissued_at":"2026-07-05T08:45:29.035128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:29.035128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assessing LLMs Suitability for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gheorghe Cosmin Silaghi, Vasile Ionut Remus Iga","submitted_at":"2024-05-27T15:04:50Z","abstract_excerpt":"Recent work has shown the capability of Large Language Models (LLMs) to solve tasks related to Knowledge Graphs, such as Knowledge Graph Completion, even in Zero- or Few-Shot paradigms. However, they are known to hallucinate answers, or output results in a non-deterministic manner, thus leading to wrongly reasoned responses, even if they satisfy the user's demands. To highlight opportunities and challenges in knowledge graphs-related tasks, we experiment with three distinguished LLMs, namely Mixtral-8x7b-Instruct-v0.1, GPT-3.5-Turbo-0125 and GPT-4o, on Knowledge Graph Completion for static kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17249","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.17249/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":"2405.17249","created_at":"2026-07-05T08:45:29.035189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17249v2","created_at":"2026-07-05T08:45:29.035189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17249","created_at":"2026-07-05T08:45:29.035189+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5VJT5TZXC5A","created_at":"2026-07-05T08:45:29.035189+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5VJT5TZXC5ASRPM","created_at":"2026-07-05T08:45:29.035189+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5VJT5TZ","created_at":"2026-07-05T08:45:29.035189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15917","citing_title":"HyDRA: A Hybrid-Driven Reasoning Architecture for Verifiable Knowledge Graphs","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D","json":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D.json","graph_json":"https://pith.science/api/pith-number/E5VJT5TZXC5ASRPMFLNRVQFC4D/graph.json","events_json":"https://pith.science/api/pith-number/E5VJT5TZXC5ASRPMFLNRVQFC4D/events.json","paper":"https://pith.science/paper/E5VJT5TZ"},"agent_actions":{"view_html":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D","download_json":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D.json","view_paper":"https://pith.science/paper/E5VJT5TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17249&json=true","fetch_graph":"https://pith.science/api/pith-number/E5VJT5TZXC5ASRPMFLNRVQFC4D/graph.json","fetch_events":"https://pith.science/api/pith-number/E5VJT5TZXC5ASRPMFLNRVQFC4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D/action/storage_attestation","attest_author":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D/action/author_attestation","sign_citation":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D/action/citation_signature","submit_replication":"https://pith.science/pith/E5VJT5TZXC5ASRPMFLNRVQFC4D/action/replication_record"}},"created_at":"2026-07-05T08:45:29.035189+00:00","updated_at":"2026-07-05T08:45:29.035189+00:00"}