{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DSY3GKR6KYB2LM7TTW5U4ULNXZ","short_pith_number":"pith:DSY3GKR6","schema_version":"1.0","canonical_sha256":"1cb1b32a3e5603a5b3f39dbb4e516dbe419b50aee7a8dbbdfa5b512a430cdac7","source":{"kind":"arxiv","id":"2310.04944","version":1},"attestation_state":"computed","paper":{"title":"Beyond Text: A Deep Dive into Large Language Models' Ability on Understanding Graph Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liang Zhao, Yuntong Hu, Zheng Zhang","submitted_at":"2023-10-07T23:25:22Z","abstract_excerpt":"Large language models (LLMs) have achieved impressive performance on many natural language processing tasks. However, their capabilities on graph-structured data remain relatively unexplored. In this paper, we conduct a series of experiments benchmarking leading LLMs on diverse graph prediction tasks spanning node, edge, and graph levels. We aim to assess whether LLMs can effectively process graph data and leverage topological structures to enhance performance, compared to specialized graph neural networks. Through varied prompt formatting and task/dataset selection, we analyze how well LLMs c"},"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":"2310.04944","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-07T23:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"8a2e118cfed6178607d15006a7b661243e431442874227872fd0c3a3cd85186c","abstract_canon_sha256":"1eee11e2e945d7117784e29644c8c1610754943844f4372ace52b4bd36dc491f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:24.750047Z","signature_b64":"igOc9i64WQen6KyCHkmQx8V8BEFG7eN4EHSan5G7OdNRvvmJAUPfKf+kd9Sm8Dvw8iOphYdQCyT4KJQm2Z2LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cb1b32a3e5603a5b3f39dbb4e516dbe419b50aee7a8dbbdfa5b512a430cdac7","last_reissued_at":"2026-07-05T06:58:24.749553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:24.749553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Text: A Deep Dive into Large Language Models' Ability on Understanding Graph Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liang Zhao, Yuntong Hu, Zheng Zhang","submitted_at":"2023-10-07T23:25:22Z","abstract_excerpt":"Large language models (LLMs) have achieved impressive performance on many natural language processing tasks. However, their capabilities on graph-structured data remain relatively unexplored. In this paper, we conduct a series of experiments benchmarking leading LLMs on diverse graph prediction tasks spanning node, edge, and graph levels. We aim to assess whether LLMs can effectively process graph data and leverage topological structures to enhance performance, compared to specialized graph neural networks. Through varied prompt formatting and task/dataset selection, we analyze how well LLMs c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04944","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/2310.04944/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":"2310.04944","created_at":"2026-07-05T06:58:24.749613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04944v1","created_at":"2026-07-05T06:58:24.749613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04944","created_at":"2026-07-05T06:58:24.749613+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSY3GKR6KYB2","created_at":"2026-07-05T06:58:24.749613+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSY3GKR6KYB2LM7T","created_at":"2026-07-05T06:58:24.749613+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSY3GKR6","created_at":"2026-07-05T06:58:24.749613+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06865","citing_title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","ref_index":195,"is_internal_anchor":false},{"citing_arxiv_id":"2603.02938","citing_title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ","json":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ.json","graph_json":"https://pith.science/api/pith-number/DSY3GKR6KYB2LM7TTW5U4ULNXZ/graph.json","events_json":"https://pith.science/api/pith-number/DSY3GKR6KYB2LM7TTW5U4ULNXZ/events.json","paper":"https://pith.science/paper/DSY3GKR6"},"agent_actions":{"view_html":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ","download_json":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ.json","view_paper":"https://pith.science/paper/DSY3GKR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04944&json=true","fetch_graph":"https://pith.science/api/pith-number/DSY3GKR6KYB2LM7TTW5U4ULNXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DSY3GKR6KYB2LM7TTW5U4ULNXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ/action/storage_attestation","attest_author":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ/action/author_attestation","sign_citation":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ/action/citation_signature","submit_replication":"https://pith.science/pith/DSY3GKR6KYB2LM7TTW5U4ULNXZ/action/replication_record"}},"created_at":"2026-07-05T06:58:24.749613+00:00","updated_at":"2026-07-05T06:58:24.749613+00:00"}