{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BLEZ6AYEKC4L2DQH3VRFDH4THZ","short_pith_number":"pith:BLEZ6AYE","schema_version":"1.0","canonical_sha256":"0ac99f030450b8bd0e07dd62519f933e7a3a7cbfc053ec6d39333b9df6408f19","source":{"kind":"arxiv","id":"2408.05457","version":1},"attestation_state":"computed","paper":{"title":"Investigating Instruction Tuning Large Language Models on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bo-Wei Huang, Bowen Jin, Jiawei Han, Kerui Zhu, Kevin Chang, Ming Zhong, Shou-De Lin, Yizhu Jiao","submitted_at":"2024-08-10T06:54:35Z","abstract_excerpt":"Inspired by the recent advancements of Large Language Models (LLMs) in NLP tasks, there's growing interest in applying LLMs to graph-related tasks. This study delves into the capabilities of instruction-following LLMs for engaging with real-world graphs, aiming to offer empirical insights into how LLMs can effectively interact with graphs and generalize across graph tasks. We begin by constructing a dataset designed for instruction tuning, which comprises a diverse collection of 79 graph-related tasks from academic and e-commerce domains, featuring 44,240 training instances and 18,960 test sam"},"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":"2408.05457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-10T06:54:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ae378faa8c6a3e03385ac717ad27b22814451f4f654da4cbf5f696b517422a1f","abstract_canon_sha256":"111513a183b752d375a864f7e122bfb1f4b9fab27d8c2a2932e9895c3f070702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:20.569134Z","signature_b64":"uhF2eCx7tBc2JDpvTGe9/FArrkvjw8YndwRRizki88BKtLBTNtsFdWIKTtLLnmzL3GLT69BrHQJ6QNhTFeVPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac99f030450b8bd0e07dd62519f933e7a3a7cbfc053ec6d39333b9df6408f19","last_reissued_at":"2026-07-05T08:54:20.568783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:20.568783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Investigating Instruction Tuning Large Language Models on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bo-Wei Huang, Bowen Jin, Jiawei Han, Kerui Zhu, Kevin Chang, Ming Zhong, Shou-De Lin, Yizhu Jiao","submitted_at":"2024-08-10T06:54:35Z","abstract_excerpt":"Inspired by the recent advancements of Large Language Models (LLMs) in NLP tasks, there's growing interest in applying LLMs to graph-related tasks. This study delves into the capabilities of instruction-following LLMs for engaging with real-world graphs, aiming to offer empirical insights into how LLMs can effectively interact with graphs and generalize across graph tasks. We begin by constructing a dataset designed for instruction tuning, which comprises a diverse collection of 79 graph-related tasks from academic and e-commerce domains, featuring 44,240 training instances and 18,960 test sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05457","kind":"arxiv","version":1},"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/2408.05457/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":"2408.05457","created_at":"2026-07-05T08:54:20.568840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.05457v1","created_at":"2026-07-05T08:54:20.568840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05457","created_at":"2026-07-05T08:54:20.568840+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLEZ6AYEKC4L","created_at":"2026-07-05T08:54:20.568840+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLEZ6AYEKC4L2DQH","created_at":"2026-07-05T08:54:20.568840+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLEZ6AYE","created_at":"2026-07-05T08:54:20.568840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10654","citing_title":"Thinking with Knowledge Graphs: Enhancing LLM Reasoning Through Structured Data","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ","json":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ.json","graph_json":"https://pith.science/api/pith-number/BLEZ6AYEKC4L2DQH3VRFDH4THZ/graph.json","events_json":"https://pith.science/api/pith-number/BLEZ6AYEKC4L2DQH3VRFDH4THZ/events.json","paper":"https://pith.science/paper/BLEZ6AYE"},"agent_actions":{"view_html":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ","download_json":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ.json","view_paper":"https://pith.science/paper/BLEZ6AYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.05457&json=true","fetch_graph":"https://pith.science/api/pith-number/BLEZ6AYEKC4L2DQH3VRFDH4THZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BLEZ6AYEKC4L2DQH3VRFDH4THZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ/action/storage_attestation","attest_author":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ/action/author_attestation","sign_citation":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ/action/citation_signature","submit_replication":"https://pith.science/pith/BLEZ6AYEKC4L2DQH3VRFDH4THZ/action/replication_record"}},"created_at":"2026-07-05T08:54:20.568840+00:00","updated_at":"2026-07-05T08:54:20.568840+00:00"}