{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4UJUBZPARNHQLJ4E7OBNCN6CJJ","short_pith_number":"pith:4UJUBZPA","schema_version":"1.0","canonical_sha256":"e51340e5e08b4f05a784fb82d137c24a7b9a72b4eaa00505d6045546f970d264","source":{"kind":"arxiv","id":"2405.08011","version":3},"attestation_state":"computed","paper":{"title":"A Survey of Large Language Models for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Huang, Dawei Yin, Jiabin Tang, Nitesh Chawla, Xubin Ren","submitted_at":"2024-05-10T18:05:37Z","abstract_excerpt":"Graphs are an essential data structure utilized to represent relationships in real-world scenarios. Prior research has established that Graph Neural Networks (GNNs) deliver impressive outcomes in graph-centric tasks, such as link prediction and node classification. Despite these advancements, challenges like data sparsity and limited generalization capabilities continue to persist. Recently, Large Language Models (LLMs) have gained attention in natural language processing. They excel in language comprehension and summarization. Integrating LLMs with graph learning techniques has attracted inte"},"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":"2405.08011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-10T18:05:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bddf7f8211244c5f6595dca57c9db72681f8674a9f2acc6ed24c22e571ddc0eb","abstract_canon_sha256":"bd746994422c701b36569f592044e0150649099d1cde8c903caa4b418f958730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:35.857084Z","signature_b64":"IiwyFeGeisfuB83ZnSWch2XDKyjxj5TaqCkolqlMcwh7CgRjuVA9T+a0tLaME6w87X+OHuiVNcdZNd6ydNgrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e51340e5e08b4f05a784fb82d137c24a7b9a72b4eaa00505d6045546f970d264","last_reissued_at":"2026-07-05T09:05:35.856571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:35.856571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Large Language Models for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Huang, Dawei Yin, Jiabin Tang, Nitesh Chawla, Xubin Ren","submitted_at":"2024-05-10T18:05:37Z","abstract_excerpt":"Graphs are an essential data structure utilized to represent relationships in real-world scenarios. Prior research has established that Graph Neural Networks (GNNs) deliver impressive outcomes in graph-centric tasks, such as link prediction and node classification. Despite these advancements, challenges like data sparsity and limited generalization capabilities continue to persist. Recently, Large Language Models (LLMs) have gained attention in natural language processing. They excel in language comprehension and summarization. Integrating LLMs with graph learning techniques has attracted inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08011","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/2405.08011/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":"2405.08011","created_at":"2026-07-05T09:05:35.856641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08011v3","created_at":"2026-07-05T09:05:35.856641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08011","created_at":"2026-07-05T09:05:35.856641+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UJUBZPARNHQ","created_at":"2026-07-05T09:05:35.856641+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UJUBZPARNHQLJ4E","created_at":"2026-07-05T09:05:35.856641+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UJUBZPA","created_at":"2026-07-05T09:05:35.856641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16656","citing_title":"Data Mining in Transportation Networks with Graph Neural Networks: A Review and Outlook","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ","json":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ.json","graph_json":"https://pith.science/api/pith-number/4UJUBZPARNHQLJ4E7OBNCN6CJJ/graph.json","events_json":"https://pith.science/api/pith-number/4UJUBZPARNHQLJ4E7OBNCN6CJJ/events.json","paper":"https://pith.science/paper/4UJUBZPA"},"agent_actions":{"view_html":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ","download_json":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ.json","view_paper":"https://pith.science/paper/4UJUBZPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08011&json=true","fetch_graph":"https://pith.science/api/pith-number/4UJUBZPARNHQLJ4E7OBNCN6CJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4UJUBZPARNHQLJ4E7OBNCN6CJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ/action/storage_attestation","attest_author":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ/action/author_attestation","sign_citation":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ/action/citation_signature","submit_replication":"https://pith.science/pith/4UJUBZPARNHQLJ4E7OBNCN6CJJ/action/replication_record"}},"created_at":"2026-07-05T09:05:35.856641+00:00","updated_at":"2026-07-05T09:05:35.856641+00:00"}