{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/friendly-neighbors-contextualized-sequence-to","title":"Friendly Neighbors: Contextualized Sequence-to-Sequence Link Prediction","arxiv_id":"2305.13059","date":"2023-05-22","proceeding":null,"authors":["Adrian Kochsiek","Apoorv Saxena","Inderjeet Nair","Rainer Gemulla"],"abstract":"We propose KGT5-context, a simple sequence-to-sequence model for link prediction (LP) in knowledge graphs (KG). Our work expands on KGT5, a recent LP model that exploits textual features of the KG, has small model size, and is scalable. To reach good predictive performance, however, KGT5 relies on an ensemble with a knowledge graph embedding model, which itself is excessively large and costly to use. In this short paper, we show empirically that adding contextual information - i.e., information about the direct neighborhood of the query entity - alleviates the need for a separate KGE model to obtain good performance. The resulting KGT5-context model is simple, reduces model size significantly, and obtains state-of-the-art performance in our experimental study.","url_abs":"https://arxiv.org/abs/2305.13059v2","url_pdf":"https://arxiv.org/pdf/2305.13059v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"friendly-neighbors-contextualized-sequence-to","repo_url":"https://github.com/uma-pi1/kgt5-context","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"knowledge-graph-embedding","task_name":"Knowledge Graph Embedding"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-wikidata5m","task":"Link Prediction","dataset":"Wikidata5M","model":"KGT5-context + Description","rank_in_archive_order":2,"of":14,"metrics":{"Hits@1":"0.406","Hits@10":"0.46","Hits@3":"0.44","MRR":"0.426"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wikidata5m","task":"Link Prediction","dataset":"Wikidata5M","model":"KGT5 + Description","rank_in_archive_order":3,"of":14,"metrics":{"Hits@1":"0.357","Hits@10":"0.422","Hits@3":"0.397","MRR":"0.381"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wikidata5m","task":"Link Prediction","dataset":"Wikidata5M","model":"KGT5-context","rank_in_archive_order":4,"of":14,"metrics":{"Hits@1":"0.35","Hits@10":"0.427","Hits@3":"0.396","MRR":"0.378"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.13059","atlas_url":"https://app.syntology.ai/?focus=2305.13059","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2305.13059"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.13059\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.13059"},"call":"get_concepts_for_paper(arxiv_id=\"2305.13059\")"}],"by_repo":[{"repo":"uma-pi1/kgt5-context","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"07d698c77925446f4f0eac636f6a79d4e9dc21153378c87445028046e8fdce85","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}