{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QMK3CTQ4D67JDNA6GEVNFELWKO","short_pith_number":"pith:QMK3CTQ4","schema_version":"1.0","canonical_sha256":"8315b14e1c1fbe91b41e312ad29176538328dbde91a4ec28f4a17a7f7b92c65f","source":{"kind":"arxiv","id":"2601.05192","version":2},"attestation_state":"computed","paper":{"title":"LELA: an LLM-based Entity Linking Approach with Zero-Shot Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fabian M. Suchanek, Nils Holzenberger, Samy Haffoudhi","submitted_at":"2026-01-08T18:15:34Z","abstract_excerpt":"Entity linking (mapping ambiguous mentions in text to entities in a knowledge base) is a foundational step in tasks such as knowledge graph construction, question-answering, and information extraction. Our method, LELA, is a modular coarse-to-fine approach that leverages the capabilities of large language models (LLMs), and works with different target domains, knowledge bases and LLMs, without any fine-tuning phase. Our experiments across various entity linking settings show that LELA is highly competitive with fine-tuned approaches, and substantially outperforms the non-fine-tuned ones."},"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":"2601.05192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-08T18:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"5f4124a0b7582c2b2e8ba2cbe5c53089ea5f75c0c042c102cf76514f1f263332","abstract_canon_sha256":"e801c6016a68f32adc75e857d5817ff991260be1175968eacd0566d9f3481fbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:51:25.068577Z","signature_b64":"QiRqyeABwj+IpVTnRj1pUc/k5iBHbdrfPsbCagV01GA/3+tWmtHzUwEmv4/Ug1ucxSdoiRTUv05ZkS20G4EqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8315b14e1c1fbe91b41e312ad29176538328dbde91a4ec28f4a17a7f7b92c65f","last_reissued_at":"2026-08-07T00:51:25.066701Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:51:25.066701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LELA: an LLM-based Entity Linking Approach with Zero-Shot Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fabian M. Suchanek, Nils Holzenberger, Samy Haffoudhi","submitted_at":"2026-01-08T18:15:34Z","abstract_excerpt":"Entity linking (mapping ambiguous mentions in text to entities in a knowledge base) is a foundational step in tasks such as knowledge graph construction, question-answering, and information extraction. Our method, LELA, is a modular coarse-to-fine approach that leverages the capabilities of large language models (LLMs), and works with different target domains, knowledge bases and LLMs, without any fine-tuning phase. Our experiments across various entity linking settings show that LELA is highly competitive with fine-tuned approaches, and substantially outperforms the non-fine-tuned ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.05192","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/2601.05192/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":"2601.05192","created_at":"2026-08-07T00:51:25.068407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.05192v2","created_at":"2026-08-07T00:51:25.068407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.05192","created_at":"2026-08-07T00:51:25.068407+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMK3CTQ4D67J","created_at":"2026-08-07T00:51:25.068407+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMK3CTQ4D67JDNA6","created_at":"2026-08-07T00:51:25.068407+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMK3CTQ4","created_at":"2026-08-07T00:51:25.068407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.26807","citing_title":"KARLA: Knowledge-base Augmented Retrieval for Language Models","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26956","citing_title":"LELA: An End-to-end LLM-based Entity Linking Framework with Zero-shot Domain Adaptation","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22501","citing_title":"BeLink: Biomedical Entity Linking Meets Generative Re-Ranking","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO","json":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO.json","graph_json":"https://pith.science/api/pith-number/QMK3CTQ4D67JDNA6GEVNFELWKO/graph.json","events_json":"https://pith.science/api/pith-number/QMK3CTQ4D67JDNA6GEVNFELWKO/events.json","paper":"https://pith.science/paper/QMK3CTQ4"},"agent_actions":{"view_html":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO","download_json":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO.json","view_paper":"https://pith.science/paper/QMK3CTQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.05192&json=true","fetch_graph":"https://pith.science/api/pith-number/QMK3CTQ4D67JDNA6GEVNFELWKO/graph.json","fetch_events":"https://pith.science/api/pith-number/QMK3CTQ4D67JDNA6GEVNFELWKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO/action/storage_attestation","attest_author":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO/action/author_attestation","sign_citation":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO/action/citation_signature","submit_replication":"https://pith.science/pith/QMK3CTQ4D67JDNA6GEVNFELWKO/action/replication_record"}},"created_at":"2026-08-07T00:51:25.068407+00:00","updated_at":"2026-08-07T00:51:25.068407+00:00"}