{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RLAQZNAZRMCTCGWUFRSWULUI6U","short_pith_number":"pith:RLAQZNAZ","schema_version":"1.0","canonical_sha256":"8ac10cb4198b05311ad42c656a2e88f516511e3ef8027847bdcb307cdbb08852","source":{"kind":"arxiv","id":"2309.16595","version":4},"attestation_state":"computed","paper":{"title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiaqi Ma, Jin Huang, Qiaozhu Mei, Xingjian Zhang","submitted_at":"2023-09-28T16:58:37Z","abstract_excerpt":"Large language models (LLMs) are gaining increasing attention for their capability to process graphs with rich text attributes, especially in a zero-shot fashion. Recent studies demonstrate that LLMs obtain decent text classification performance on common text-rich graph benchmarks, and the performance can be improved by appending encoded structural information as natural languages into prompts. We aim to understand why the incorporation of structural information inherent in graph data can improve the prediction performance of LLMs. First, we rule out the concern of data leakage by curating a "},"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":"2309.16595","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-28T16:58:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"be6fe334b7865f2e63ad36b24c3e002858ada38c61f39f6cd2c1e7b4252f262d","abstract_canon_sha256":"a6420d1e964679712e81840c88a7a0f5c0f470295fd6615bf85c38916b7ed1a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:09.229396Z","signature_b64":"udaOpUdmiH91UPude2t9Yj+FRj4Vvhm1r1kmCfByxXwjFUjCFy//CalCELVPholMOmlUxyAicej1I36Ad63RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac10cb4198b05311ad42c656a2e88f516511e3ef8027847bdcb307cdbb08852","last_reissued_at":"2026-07-05T08:32:09.228890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:09.228890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiaqi Ma, Jin Huang, Qiaozhu Mei, Xingjian Zhang","submitted_at":"2023-09-28T16:58:37Z","abstract_excerpt":"Large language models (LLMs) are gaining increasing attention for their capability to process graphs with rich text attributes, especially in a zero-shot fashion. Recent studies demonstrate that LLMs obtain decent text classification performance on common text-rich graph benchmarks, and the performance can be improved by appending encoded structural information as natural languages into prompts. We aim to understand why the incorporation of structural information inherent in graph data can improve the prediction performance of LLMs. First, we rule out the concern of data leakage by curating a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16595","kind":"arxiv","version":4},"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/2309.16595/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":"2309.16595","created_at":"2026-07-05T08:32:09.228945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.16595v4","created_at":"2026-07-05T08:32:09.228945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16595","created_at":"2026-07-05T08:32:09.228945+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLAQZNAZRMCT","created_at":"2026-07-05T08:32:09.228945+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLAQZNAZRMCTCGWU","created_at":"2026-07-05T08:32:09.228945+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLAQZNAZ","created_at":"2026-07-05T08:32:09.228945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11583","citing_title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00052","citing_title":"AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24867","citing_title":"Clustering as Reasoning: A $k$-Means Interpretation of Chain-of-Thought Graph Learning","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29773","citing_title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30465","citing_title":"Knowledge Graph-Enhanced Zero-Shot Topic Classification: A Multi-Strategy Comparative Study","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03514","citing_title":"Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19042","citing_title":"STK-Adapter: Incorporating Evolving Graph and Event Chain for Temporal Knowledge Graph Extrapolation","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06666","citing_title":"A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U","json":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U.json","graph_json":"https://pith.science/api/pith-number/RLAQZNAZRMCTCGWUFRSWULUI6U/graph.json","events_json":"https://pith.science/api/pith-number/RLAQZNAZRMCTCGWUFRSWULUI6U/events.json","paper":"https://pith.science/paper/RLAQZNAZ"},"agent_actions":{"view_html":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U","download_json":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U.json","view_paper":"https://pith.science/paper/RLAQZNAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.16595&json=true","fetch_graph":"https://pith.science/api/pith-number/RLAQZNAZRMCTCGWUFRSWULUI6U/graph.json","fetch_events":"https://pith.science/api/pith-number/RLAQZNAZRMCTCGWUFRSWULUI6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U/action/storage_attestation","attest_author":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U/action/author_attestation","sign_citation":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U/action/citation_signature","submit_replication":"https://pith.science/pith/RLAQZNAZRMCTCGWUFRSWULUI6U/action/replication_record"}},"created_at":"2026-07-05T08:32:09.228945+00:00","updated_at":"2026-07-05T08:32:09.228945+00:00"}