{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YANBCOK3XN4NWF657RR5MJ4NZV","short_pith_number":"pith:YANBCOK3","schema_version":"1.0","canonical_sha256":"c01a11395bbb78db17ddfc63d6278dcd528e86f1528c94d899461310b37876be","source":{"kind":"arxiv","id":"2312.02783","version":4},"attestation_state":"computed","paper":{"title":"Large Language Models on Graphs: A Comprehensive Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Bowen Jin, Chi Han, Gang Liu, Heng Ji, Jiawei Han, Meng Jiang","submitted_at":"2023-12-05T14:14:27Z","abstract_excerpt":"Large language models (LLMs), such as GPT4 and LLaMA, are creating significant advancements in natural language processing, due to their strong text encoding/decoding ability and newly found emergent capability (e.g., reasoning). While LLMs are mainly designed to process pure texts, there are many real-world scenarios where text data is associated with rich structure information in the form of graphs (e.g., academic networks, and e-commerce networks) or scenarios where graph data is paired with rich textual information (e.g., molecules with descriptions). Besides, although LLMs have shown thei"},"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":"2312.02783","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-12-05T14:14:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2db24a74fd950d3f69084cb8e66197a0b0d6235075e93fe76fd929a83a0d6cac","abstract_canon_sha256":"2733ed255ff27101a285b6145e3a74484f23634f4053a676cb4edbf02f692cfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:22.938963Z","signature_b64":"gKE2XRSpHvLBgvmSP9t4u8a1iFttuipgfL7iUVRgADNUGiyQrYTdRoPLyMlVIe7etnbkykUC1es2Xml26ByBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c01a11395bbb78db17ddfc63d6278dcd528e86f1528c94d899461310b37876be","last_reissued_at":"2026-07-05T09:38:22.938452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:22.938452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Models on Graphs: A Comprehensive Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Bowen Jin, Chi Han, Gang Liu, Heng Ji, Jiawei Han, Meng Jiang","submitted_at":"2023-12-05T14:14:27Z","abstract_excerpt":"Large language models (LLMs), such as GPT4 and LLaMA, are creating significant advancements in natural language processing, due to their strong text encoding/decoding ability and newly found emergent capability (e.g., reasoning). While LLMs are mainly designed to process pure texts, there are many real-world scenarios where text data is associated with rich structure information in the form of graphs (e.g., academic networks, and e-commerce networks) or scenarios where graph data is paired with rich textual information (e.g., molecules with descriptions). Besides, although LLMs have shown thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02783","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/2312.02783/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":"2312.02783","created_at":"2026-07-05T09:38:22.938522+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02783v4","created_at":"2026-07-05T09:38:22.938522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02783","created_at":"2026-07-05T09:38:22.938522+00:00"},{"alias_kind":"pith_short_12","alias_value":"YANBCOK3XN4N","created_at":"2026-07-05T09:38:22.938522+00:00"},{"alias_kind":"pith_short_16","alias_value":"YANBCOK3XN4NWF65","created_at":"2026-07-05T09:38:22.938522+00:00"},{"alias_kind":"pith_short_8","alias_value":"YANBCOK3","created_at":"2026-07-05T09:38:22.938522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31010","citing_title":"MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation","ref_index":23,"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":95,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV","json":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV.json","graph_json":"https://pith.science/api/pith-number/YANBCOK3XN4NWF657RR5MJ4NZV/graph.json","events_json":"https://pith.science/api/pith-number/YANBCOK3XN4NWF657RR5MJ4NZV/events.json","paper":"https://pith.science/paper/YANBCOK3"},"agent_actions":{"view_html":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV","download_json":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV.json","view_paper":"https://pith.science/paper/YANBCOK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02783&json=true","fetch_graph":"https://pith.science/api/pith-number/YANBCOK3XN4NWF657RR5MJ4NZV/graph.json","fetch_events":"https://pith.science/api/pith-number/YANBCOK3XN4NWF657RR5MJ4NZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV/action/storage_attestation","attest_author":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV/action/author_attestation","sign_citation":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV/action/citation_signature","submit_replication":"https://pith.science/pith/YANBCOK3XN4NWF657RR5MJ4NZV/action/replication_record"}},"created_at":"2026-07-05T09:38:22.938522+00:00","updated_at":"2026-07-05T09:38:22.938522+00:00"}