{"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/graphgpt-graph-learning-with-generative-pre","title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","arxiv_id":"2401.00529","date":"2023-12-31","proceeding":null,"authors":["Qifang Zhao","Weidong Ren","Tianyu Li","Xiaoxiao Xu","Hong Liu"],"abstract":"We introduce \\textit{GraphGPT}, a novel model for Graph learning by self-supervised Generative Pre-training Transformers. Our model transforms each graph or sampled subgraph into a sequence of tokens representing the node, edge and attributes reversibly using the Eulerian path first. Then we feed the tokens into a standard transformer decoder and pre-train it with the next-token-prediction (NTP) task. Lastly, we fine-tune the GraphGPT model with the supervised tasks. This intuitive, yet effective model achieves superior or close results to the state-of-the-art methods for the graph-, edge- and node-level tasks on the large scale molecular dataset PCQM4Mv2, the protein-protein association dataset ogbl-ppa and the ogbn-proteins dataset from the Open Graph Benchmark (OGB). Furthermore, the generative pre-training enables us to train GraphGPT up to 400M+ parameters with consistently increasing performance, which is beyond the capability of GNNs and previous graph transformers. The source code and pre-trained checkpoints will be released soon\\footnote{\\url{https://github.com/alibaba/graph-gpt}} to pave the way for the graph foundation model research, and also to assist the scientific discovery in pharmaceutical, chemistry, material and bio-informatics domains, etc.","url_abs":"https://arxiv.org/abs/2401.00529v1","url_pdf":"https://arxiv.org/pdf/2401.00529v1.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":"graphgpt-graph-learning-with-generative-pre","repo_url":"https://github.com/alibaba/graph-gpt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"scientific-discovery","task_name":"scientific discovery"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","task":"Link Property Prediction","dataset":"ogbl-citation2","model":"GraphGPT(d1n30)","rank_in_archive_order":1,"of":23,"metrics":{"Ext. data":"No","Number of params":"133096832","Test MRR":"0.9305 ± 0.0020","Validation MRR":"0.9295 ± 0.0022"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","task":"Link Property Prediction","dataset":"ogbl-citation2","model":"GraphGPT(SMTP)","rank_in_archive_order":3,"of":23,"metrics":{"Ext. data":"No","Number of params":"46784128","Test MRR":"0.9055 ± 0.0016","Validation MRR":"0.9042 ± 0.0014"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ppa","task":"Link Property Prediction","dataset":"ogbl-ppa","model":"GraphGPT(SMTP)","rank_in_archive_order":3,"of":26,"metrics":{"Ext. data":"No","Number of params":"145263360","Test Hits@100":"0.6876 ± 0.0067","Validation Hits@100":"0.7017 ± 0.0044"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2401.00529","atlas_url":"https://app.syntology.ai/?focus=2401.00529","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":"2401.00529"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2401.00529\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2401.00529"},"call":"get_concepts_for_paper(arxiv_id=\"2401.00529\")"}],"by_repo":[{"repo":"alibaba/graph-gpt","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2202.04200"],"harvested_for_calls":[{"arxiv_id":"2202.04200","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.04200"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.04200\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"7f14ae7a853a06ba9edb79243ad977bc28f659230404d71cc16ca4ad1a42e74c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}