{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ECAKKYA43HXSAWMSHTUHJVQE5U","short_pith_number":"pith:ECAKKYA4","schema_version":"1.0","canonical_sha256":"2080a5601cd9ef2059923ce874d604ed24fd8d9fbe65de3f2a8a6009d75d461d","source":{"kind":"arxiv","id":"2407.16127","version":1},"attestation_state":"computed","paper":{"title":"Finetuning Generative Large Language Models with Discrimination Instructions for Knowledge Graph Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Wei Hu, Xiaobin Tian, Yang Liu, Zequn Sun","submitted_at":"2024-07-23T02:25:01Z","abstract_excerpt":"Traditional knowledge graph (KG) completion models learn embeddings to predict missing facts. Recent works attempt to complete KGs in a text-generation manner with large language models (LLMs). However, they need to ground the output of LLMs to KG entities, which inevitably brings errors. In this paper, we present a finetuning framework, DIFT, aiming to unleash the KG completion ability of LLMs and avoid grounding errors. Given an incomplete fact, DIFT employs a lightweight model to obtain candidate entities and finetunes an LLM with discrimination instructions to select the correct one from t"},"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":"2407.16127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-07-23T02:25:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"affbd34903a473f50ae95f352c7f0528a45f0477bb199eec8c72a9edb247c0b9","abstract_canon_sha256":"7e61e6f61f84631c9480f20365c94a9e1be7c80a6c89873365a7d15a278efb80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:27.482823Z","signature_b64":"QB7eQfeMW5GpeTsHJnzNQZCvnlh+UliTMP/XPwW/bAIkP2GNUznb0uud+/1F0PNAGj5fT8X8oOFYpxroCUeACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2080a5601cd9ef2059923ce874d604ed24fd8d9fbe65de3f2a8a6009d75d461d","last_reissued_at":"2026-07-05T08:47:27.482240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:27.482240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finetuning Generative Large Language Models with Discrimination Instructions for Knowledge Graph Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Wei Hu, Xiaobin Tian, Yang Liu, Zequn Sun","submitted_at":"2024-07-23T02:25:01Z","abstract_excerpt":"Traditional knowledge graph (KG) completion models learn embeddings to predict missing facts. Recent works attempt to complete KGs in a text-generation manner with large language models (LLMs). However, they need to ground the output of LLMs to KG entities, which inevitably brings errors. In this paper, we present a finetuning framework, DIFT, aiming to unleash the KG completion ability of LLMs and avoid grounding errors. Given an incomplete fact, DIFT employs a lightweight model to obtain candidate entities and finetunes an LLM with discrimination instructions to select the correct one from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16127","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/2407.16127/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":"2407.16127","created_at":"2026-07-05T08:47:27.482335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.16127v1","created_at":"2026-07-05T08:47:27.482335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16127","created_at":"2026-07-05T08:47:27.482335+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECAKKYA43HXS","created_at":"2026-07-05T08:47:27.482335+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECAKKYA43HXSAWMS","created_at":"2026-07-05T08:47:27.482335+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECAKKYA4","created_at":"2026-07-05T08:47:27.482335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08165","citing_title":"Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U","json":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U.json","graph_json":"https://pith.science/api/pith-number/ECAKKYA43HXSAWMSHTUHJVQE5U/graph.json","events_json":"https://pith.science/api/pith-number/ECAKKYA43HXSAWMSHTUHJVQE5U/events.json","paper":"https://pith.science/paper/ECAKKYA4"},"agent_actions":{"view_html":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U","download_json":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U.json","view_paper":"https://pith.science/paper/ECAKKYA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.16127&json=true","fetch_graph":"https://pith.science/api/pith-number/ECAKKYA43HXSAWMSHTUHJVQE5U/graph.json","fetch_events":"https://pith.science/api/pith-number/ECAKKYA43HXSAWMSHTUHJVQE5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U/action/storage_attestation","attest_author":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U/action/author_attestation","sign_citation":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U/action/citation_signature","submit_replication":"https://pith.science/pith/ECAKKYA43HXSAWMSHTUHJVQE5U/action/replication_record"}},"created_at":"2026-07-05T08:47:27.482335+00:00","updated_at":"2026-07-05T08:47:27.482335+00:00"}