{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HVFBBWE6ZBYPLBIYA5ZAP4SU4G","short_pith_number":"pith:HVFBBWE6","schema_version":"1.0","canonical_sha256":"3d4a10d89ec870f58518077207f254e19c48c3dd344e645319749e5b104a1930","source":{"kind":"arxiv","id":"2505.18499","version":3},"attestation_state":"computed","paper":{"title":"G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Stefanie Jegelka, Xiaojun Guo, Yifei Wang, Yisen Wang","submitted_at":"2025-05-24T04:33:41Z","abstract_excerpt":"Although Large Language Models (LLMs) have demonstrated remarkable progress, their proficiency in graph-related tasks remains notably limited, hindering the development of truly general-purpose models. Previous attempts, including pretraining graph foundation models or employing supervised fine-tuning, often face challenges such as the scarcity of large-scale, universally represented graph data. We introduce G1, a simple yet effective approach demonstrating that Reinforcement Learning (RL) on synthetic graph-theoretic tasks can significantly scale LLMs' graph reasoning abilities. To enable RL "},"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":"2505.18499","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-24T04:33:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"6535eb16ed9a13195a5237edf3844982feaf2c5fe669d5da45480b4802bc1899","abstract_canon_sha256":"16e46010ed7b3313fb18d263658c2e1f99f004f73883dc69974170db126f3c82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:40.151934Z","signature_b64":"3SsKwuuunujtnA+VcvM8tzPAi40+pBoYzhBmWNWozRRCdb+xSuhCk/SzoM1VzQ/zkJiJQIynnkjYFnJJieTtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d4a10d89ec870f58518077207f254e19c48c3dd344e645319749e5b104a1930","last_reissued_at":"2026-07-05T11:55:40.151487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:40.151487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Stefanie Jegelka, Xiaojun Guo, Yifei Wang, Yisen Wang","submitted_at":"2025-05-24T04:33:41Z","abstract_excerpt":"Although Large Language Models (LLMs) have demonstrated remarkable progress, their proficiency in graph-related tasks remains notably limited, hindering the development of truly general-purpose models. Previous attempts, including pretraining graph foundation models or employing supervised fine-tuning, often face challenges such as the scarcity of large-scale, universally represented graph data. We introduce G1, a simple yet effective approach demonstrating that Reinforcement Learning (RL) on synthetic graph-theoretic tasks can significantly scale LLMs' graph reasoning abilities. To enable RL "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18499","kind":"arxiv","version":3},"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/2505.18499/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":"2505.18499","created_at":"2026-07-05T11:55:40.151544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18499v3","created_at":"2026-07-05T11:55:40.151544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18499","created_at":"2026-07-05T11:55:40.151544+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVFBBWE6ZBYP","created_at":"2026-07-05T11:55:40.151544+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVFBBWE6ZBYPLBIY","created_at":"2026-07-05T11:55:40.151544+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVFBBWE6","created_at":"2026-07-05T11:55:40.151544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25363","citing_title":"TheoremGraph: Bridging Formal and Informal Mathematics","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06865","citing_title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","ref_index":184,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06638","citing_title":"Can RL Teach Long-Horizon Reasoning to LLMs? Expressiveness Is Key","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2603.01410","citing_title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06638","citing_title":"Can RL Teach Long-Horizon Reasoning to LLMs? Expressiveness Is Key","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06638","citing_title":"Can RL Teach Long-Horizon Reasoning to LLMs? Expressiveness Is Key","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02452","citing_title":"Position: How can Graphs Help Large Language Models?","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G","json":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G.json","graph_json":"https://pith.science/api/pith-number/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/graph.json","events_json":"https://pith.science/api/pith-number/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/events.json","paper":"https://pith.science/paper/HVFBBWE6"},"agent_actions":{"view_html":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G","download_json":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G.json","view_paper":"https://pith.science/paper/HVFBBWE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18499&json=true","fetch_graph":"https://pith.science/api/pith-number/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/graph.json","fetch_events":"https://pith.science/api/pith-number/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/action/storage_attestation","attest_author":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/action/author_attestation","sign_citation":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/action/citation_signature","submit_replication":"https://pith.science/pith/HVFBBWE6ZBYPLBIYA5ZAP4SU4G/action/replication_record"}},"created_at":"2026-07-05T11:55:40.151544+00:00","updated_at":"2026-07-05T11:55:40.151544+00:00"}