{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/let-your-graph-do-the-talking-encoding","title":"Let Your Graph Do the Talking: Encoding Structured Data for LLMs","arxiv_id":"2402.05862","date":"2024-02-08","proceeding":null,"authors":["Bryan Perozzi","Bahare Fatemi","Dustin Zelle","Anton Tsitsulin","Mehran Kazemi","Rami Al-Rfou","Jonathan Halcrow"],"abstract":"How can we best encode structured data into sequential form for use in large language models (LLMs)? In this work, we introduce a parameter-efficient method to explicitly represent structured data for LLMs. Our method, GraphToken, learns an encoding function to extend prompts with explicit structured information. Unlike other work which focuses on limited domains (e.g. knowledge graph representation), our work is the first effort focused on the general encoding of structured data to be used for various reasoning tasks. We show that explicitly representing the graph structure allows significant improvements to graph reasoning tasks. Specifically, we see across the board improvements - up to 73% points - on node, edge and, graph-level tasks from the GraphQA benchmark.","url_abs":"https://arxiv.org/abs/2402.05862v1","url_pdf":"https://arxiv.org/pdf/2402.05862v1.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":"let-your-graph-do-the-talking-encoding","repo_url":"https://github.com/google-research/talk-like-a-graph","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"let-your-graph-do-the-talking-encoding","repo_url":"https://github.com/wxxshirley/gnn4taskplan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2402.05862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05862"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wxxshirley/gnn4taskplan","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/google-research/talk-like-a-graph","reach":null}],"summary":{"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"677e3f72d6c527e5","entry":"adjacency_encoder","repo":"google-research/talk-like-a-graph","repo_kind":"official","path":"talk_like_a_graph/graph_text_encoders.py","file_url":"https://github.com/google-research/talk-like-a-graph/blob/HEAD/talk_like_a_graph/graph_text_encoders.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"677e3f72d6c527e5"}},{"code_sha256_prefix":"3aa32a56acd87ea9","entry":"create_node_string","repo":"google-research/talk-like-a-graph","repo_kind":"official","path":"talk_like_a_graph/graph_text_encoders.py","file_url":"https://github.com/google-research/talk-like-a-graph/blob/HEAD/talk_like_a_graph/graph_text_encoders.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"3aa32a56acd87ea9"}},{"code_sha256_prefix":"59aaa1bc467b3504","entry":"nx_encoder","repo":"google-research/talk-like-a-graph","repo_kind":"official","path":"talk_like_a_graph/graph_text_encoders.py","file_url":"https://github.com/google-research/talk-like-a-graph/blob/HEAD/talk_like_a_graph/graph_text_encoders.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"59aaa1bc467b3504"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}