{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CXJWX3VWKHTAPMGBIRKXLZECC6","short_pith_number":"pith:CXJWX3VW","schema_version":"1.0","canonical_sha256":"15d36beeb651e607b0c1445575e48217bb02ad35d704cd90aed0e91ea0b34380","source":{"kind":"arxiv","id":"2306.12245","version":4},"attestation_state":"computed","paper":{"title":"Bidirectional End-to-End Learning of Retriever-Reader Paradigm for Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hai-Tao Zheng, Pengjun Xie, Xingyu Lu, Yangning Li, Yinghui Li, Ying Shen, Yong Jiang","submitted_at":"2023-06-21T13:04:30Z","abstract_excerpt":"Entity Linking (EL) is a fundamental task for Information Extraction and Knowledge Graphs. The general form of EL (i.e., end-to-end EL) aims to first find mentions in the given input document and then link the mentions to corresponding entities in a specific knowledge base. Recently, the paradigm of retriever-reader promotes the progress of end-to-end EL, benefiting from the advantages of dense entity retrieval and machine reading comprehension. However, the existing study only trains the retriever and the reader separately in a pipeline manner, which ignores the benefit that the interaction b"},"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":"2306.12245","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-06-21T13:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"6d1eb63d29c39ce0dceeff86a988e20bd6b7302ed7f92d31673a7a10d11cb800","abstract_canon_sha256":"c7e53a4128782494b57c9ad50e5899f947195265c0075d71631b22fa3d51e47b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:20.735733Z","signature_b64":"lDwBP5ZQm6Sc2b4CV5cGacmcqIrjASu+63FheY50+GgyQ4hfYZ0texl2LW6luWlFbx48xv4szFwsA8xbux58DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d36beeb651e607b0c1445575e48217bb02ad35d704cd90aed0e91ea0b34380","last_reissued_at":"2026-07-05T07:58:20.735216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:20.735216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bidirectional End-to-End Learning of Retriever-Reader Paradigm for Entity Linking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hai-Tao Zheng, Pengjun Xie, Xingyu Lu, Yangning Li, Yinghui Li, Ying Shen, Yong Jiang","submitted_at":"2023-06-21T13:04:30Z","abstract_excerpt":"Entity Linking (EL) is a fundamental task for Information Extraction and Knowledge Graphs. The general form of EL (i.e., end-to-end EL) aims to first find mentions in the given input document and then link the mentions to corresponding entities in a specific knowledge base. Recently, the paradigm of retriever-reader promotes the progress of end-to-end EL, benefiting from the advantages of dense entity retrieval and machine reading comprehension. However, the existing study only trains the retriever and the reader separately in a pipeline manner, which ignores the benefit that the interaction b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12245","kind":"arxiv","version":4},"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/2306.12245/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":"2306.12245","created_at":"2026-07-05T07:58:20.735277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12245v4","created_at":"2026-07-05T07:58:20.735277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12245","created_at":"2026-07-05T07:58:20.735277+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXJWX3VWKHTA","created_at":"2026-07-05T07:58:20.735277+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXJWX3VWKHTAPMGB","created_at":"2026-07-05T07:58:20.735277+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXJWX3VW","created_at":"2026-07-05T07:58:20.735277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07184","citing_title":"Refine Knowledge of Large Language Models via Adaptive Contrastive Learning","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6","json":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6.json","graph_json":"https://pith.science/api/pith-number/CXJWX3VWKHTAPMGBIRKXLZECC6/graph.json","events_json":"https://pith.science/api/pith-number/CXJWX3VWKHTAPMGBIRKXLZECC6/events.json","paper":"https://pith.science/paper/CXJWX3VW"},"agent_actions":{"view_html":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6","download_json":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6.json","view_paper":"https://pith.science/paper/CXJWX3VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12245&json=true","fetch_graph":"https://pith.science/api/pith-number/CXJWX3VWKHTAPMGBIRKXLZECC6/graph.json","fetch_events":"https://pith.science/api/pith-number/CXJWX3VWKHTAPMGBIRKXLZECC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6/action/storage_attestation","attest_author":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6/action/author_attestation","sign_citation":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6/action/citation_signature","submit_replication":"https://pith.science/pith/CXJWX3VWKHTAPMGBIRKXLZECC6/action/replication_record"}},"created_at":"2026-07-05T07:58:20.735277+00:00","updated_at":"2026-07-05T07:58:20.735277+00:00"}