{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DIBV7PFCHKYWOP3TSVVE4UQO2U","short_pith_number":"pith:DIBV7PFC","schema_version":"1.0","canonical_sha256":"1a035fbca23ab1673f73956a4e520ed503cc5100e21aeafcf553356467abcfc7","source":{"kind":"arxiv","id":"2502.13562","version":1},"attestation_state":"computed","paper":{"title":"Are Large Language Models In-Context Graph Learners?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Huizhe Zhang, Jintang Li, Liang Chen, Ruofan Wu, Yuchang Zhu, Zibin Zheng","submitted_at":"2025-02-19T09:14:19Z","abstract_excerpt":"Large language models (LLMs) have demonstrated remarkable in-context reasoning capabilities across a wide range of tasks, particularly with unstructured inputs such as language or images. However, LLMs struggle to handle structured data, such as graphs, due to their lack of understanding of non-Euclidean structures. As a result, without additional fine-tuning, their performance significantly lags behind that of graph neural networks (GNNs) in graph learning tasks. In this paper, we show that learning on graph data can be conceptualized as a retrieval-augmented generation (RAG) process, where s"},"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":"2502.13562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-19T09:14:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"312f4500bea7053023b7b86e559ca74aefbbab65c0b1698d4723d0efcb6c3fbc","abstract_canon_sha256":"872d9a64ce2ae8811994ded7d86cc59c583512cb0d29ab5d5068dd1b2ebb688f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:49.372218Z","signature_b64":"V7q0c9jx1crc0AT3MDXQTuhIUkz5w6MiQYMI1FgZJ+XBR7hn8dj8HavQylR6hC2XrE6pYOACSfrnqeNNqUzWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a035fbca23ab1673f73956a4e520ed503cc5100e21aeafcf553356467abcfc7","last_reissued_at":"2026-07-05T10:16:49.371710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:49.371710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are Large Language Models In-Context Graph Learners?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Huizhe Zhang, Jintang Li, Liang Chen, Ruofan Wu, Yuchang Zhu, Zibin Zheng","submitted_at":"2025-02-19T09:14:19Z","abstract_excerpt":"Large language models (LLMs) have demonstrated remarkable in-context reasoning capabilities across a wide range of tasks, particularly with unstructured inputs such as language or images. However, LLMs struggle to handle structured data, such as graphs, due to their lack of understanding of non-Euclidean structures. As a result, without additional fine-tuning, their performance significantly lags behind that of graph neural networks (GNNs) in graph learning tasks. In this paper, we show that learning on graph data can be conceptualized as a retrieval-augmented generation (RAG) process, where s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13562","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/2502.13562/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":"2502.13562","created_at":"2026-07-05T10:16:49.371773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13562v1","created_at":"2026-07-05T10:16:49.371773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13562","created_at":"2026-07-05T10:16:49.371773+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIBV7PFCHKYW","created_at":"2026-07-05T10:16:49.371773+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIBV7PFCHKYWOP3T","created_at":"2026-07-05T10:16:49.371773+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIBV7PFC","created_at":"2026-07-05T10:16:49.371773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"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":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13021","citing_title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U","json":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U.json","graph_json":"https://pith.science/api/pith-number/DIBV7PFCHKYWOP3TSVVE4UQO2U/graph.json","events_json":"https://pith.science/api/pith-number/DIBV7PFCHKYWOP3TSVVE4UQO2U/events.json","paper":"https://pith.science/paper/DIBV7PFC"},"agent_actions":{"view_html":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U","download_json":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U.json","view_paper":"https://pith.science/paper/DIBV7PFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13562&json=true","fetch_graph":"https://pith.science/api/pith-number/DIBV7PFCHKYWOP3TSVVE4UQO2U/graph.json","fetch_events":"https://pith.science/api/pith-number/DIBV7PFCHKYWOP3TSVVE4UQO2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U/action/storage_attestation","attest_author":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U/action/author_attestation","sign_citation":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U/action/citation_signature","submit_replication":"https://pith.science/pith/DIBV7PFCHKYWOP3TSVVE4UQO2U/action/replication_record"}},"created_at":"2026-07-05T10:16:49.371773+00:00","updated_at":"2026-07-05T10:16:49.371773+00:00"}