{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NFAE5GPAY3CV7EYAEJFS5YUCQ3","short_pith_number":"pith:NFAE5GPA","schema_version":"1.0","canonical_sha256":"69404e99e0c6c55f9300224b2ee28286e3edec8d3018efff2fed86b51d17516d","source":{"kind":"arxiv","id":"2207.04108","version":1},"attestation_state":"computed","paper":{"title":"ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andrea Pierleoni, Christos Christodoulopoulos, Joseph Fisher, Shubhi Tyagi, Tom Ayoola","submitted_at":"2022-07-08T19:20:42Z","abstract_excerpt":"We introduce ReFinED, an efficient end-to-end entity linking model which uses fine-grained entity types and entity descriptions to perform linking. The model performs mention detection, fine-grained entity typing, and entity disambiguation for all mentions within a document in a single forward pass, making it more than 60 times faster than competitive existing approaches. ReFinED also surpasses state-of-the-art performance on standard entity linking datasets by an average of 3.7 F1. The model is capable of generalising to large-scale knowledge bases such as Wikidata (which has 15 times more en"},"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":"2207.04108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-07-08T19:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"b436e39f1c54bfe66b0fff0c317118d7e85ec3293274e3b66dffef697555b15c","abstract_canon_sha256":"9a75393808a45a66014229c1d98c96598e80bcd6ad75694e379de5d5193e1bff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:55.558836Z","signature_b64":"Vw2n0kt7RutMQWJJm9IeOeAfPbmhf2nOj52/7CG4RlkTu0ewJTAXScJKQx+hr0zlRbaWBQA9L0SmexQmEocOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69404e99e0c6c55f9300224b2ee28286e3edec8d3018efff2fed86b51d17516d","last_reissued_at":"2026-07-05T04:38:55.558358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:55.558358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andrea Pierleoni, Christos Christodoulopoulos, Joseph Fisher, Shubhi Tyagi, Tom Ayoola","submitted_at":"2022-07-08T19:20:42Z","abstract_excerpt":"We introduce ReFinED, an efficient end-to-end entity linking model which uses fine-grained entity types and entity descriptions to perform linking. The model performs mention detection, fine-grained entity typing, and entity disambiguation for all mentions within a document in a single forward pass, making it more than 60 times faster than competitive existing approaches. ReFinED also surpasses state-of-the-art performance on standard entity linking datasets by an average of 3.7 F1. The model is capable of generalising to large-scale knowledge bases such as Wikidata (which has 15 times more en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04108","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/2207.04108/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":"2207.04108","created_at":"2026-07-05T04:38:55.558417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.04108v1","created_at":"2026-07-05T04:38:55.558417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04108","created_at":"2026-07-05T04:38:55.558417+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFAE5GPAY3CV","created_at":"2026-07-05T04:38:55.558417+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFAE5GPAY3CV7EYA","created_at":"2026-07-05T04:38:55.558417+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFAE5GPA","created_at":"2026-07-05T04:38:55.558417+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.02737","citing_title":"Knowledge Graphs for Enhancing Large Language Models in Entity Disambiguation","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3","json":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3.json","graph_json":"https://pith.science/api/pith-number/NFAE5GPAY3CV7EYAEJFS5YUCQ3/graph.json","events_json":"https://pith.science/api/pith-number/NFAE5GPAY3CV7EYAEJFS5YUCQ3/events.json","paper":"https://pith.science/paper/NFAE5GPA"},"agent_actions":{"view_html":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3","download_json":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3.json","view_paper":"https://pith.science/paper/NFAE5GPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.04108&json=true","fetch_graph":"https://pith.science/api/pith-number/NFAE5GPAY3CV7EYAEJFS5YUCQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/NFAE5GPAY3CV7EYAEJFS5YUCQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3/action/storage_attestation","attest_author":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3/action/author_attestation","sign_citation":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3/action/citation_signature","submit_replication":"https://pith.science/pith/NFAE5GPAY3CV7EYAEJFS5YUCQ3/action/replication_record"}},"created_at":"2026-07-05T04:38:55.558417+00:00","updated_at":"2026-07-05T04:38:55.558417+00:00"}