{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4JDI53LCXYYN3M3O6NTY5GFTIM","short_pith_number":"pith:4JDI53LC","schema_version":"1.0","canonical_sha256":"e2468eed62be30ddb36ef3678e98b343109af341322096b8073e79f487bd5c26","source":{"kind":"arxiv","id":"2401.15569","version":2},"attestation_state":"computed","paper":{"title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Haizhou Shi, Siliang Tang, Yaoke Wang, Yun Zhu","submitted_at":"2024-01-28T05:12:09Z","abstract_excerpt":"Rich textual and topological information of textual graphs need to be modeled in real-world applications such as webpages, e-commerce, and academic articles. Practitioners have been long following the path of adopting a shallow text encoder and a subsequent graph neural network (GNN) to solve this problem. In light of recent advancements in large language models (LLMs), it is apparent that integrating LLMs for enhanced textual encoding can substantially improve the performance of textual graphs. Nevertheless, the efficiency of these methods poses a significant challenge. In this paper, we prop"},"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":"2401.15569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-01-28T05:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"e0d6517bea716cd9a027ddf9532edf1ac56e8143c618679b0be9fdc56a6a6714","abstract_canon_sha256":"d5d30d6d1eef5d0aa57c1f18023b5c16c18672f5406f6f83dcb509ded903a542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:49.419039Z","signature_b64":"XqOdlfALELo8lhc3mp1cV/39y3aEN/GNGdTtVmI9I5Tb1GpmiMiTpWpUpgqHUj6gmmivsQBsQpdaurG6sd5gAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2468eed62be30ddb36ef3678e98b343109af341322096b8073e79f487bd5c26","last_reissued_at":"2026-07-05T08:47:49.418618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:49.418618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Haizhou Shi, Siliang Tang, Yaoke Wang, Yun Zhu","submitted_at":"2024-01-28T05:12:09Z","abstract_excerpt":"Rich textual and topological information of textual graphs need to be modeled in real-world applications such as webpages, e-commerce, and academic articles. Practitioners have been long following the path of adopting a shallow text encoder and a subsequent graph neural network (GNN) to solve this problem. In light of recent advancements in large language models (LLMs), it is apparent that integrating LLMs for enhanced textual encoding can substantially improve the performance of textual graphs. Nevertheless, the efficiency of these methods poses a significant challenge. In this paper, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15569","kind":"arxiv","version":2},"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/2401.15569/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":"2401.15569","created_at":"2026-07-05T08:47:49.418678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15569v2","created_at":"2026-07-05T08:47:49.418678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15569","created_at":"2026-07-05T08:47:49.418678+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JDI53LCXYYN","created_at":"2026-07-05T08:47:49.418678+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JDI53LCXYYN3M3O","created_at":"2026-07-05T08:47:49.418678+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JDI53LC","created_at":"2026-07-05T08:47:49.418678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11898","citing_title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2606.32016","citing_title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","ref_index":177,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30291","citing_title":"PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2504.02343","citing_title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08952","citing_title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12061","citing_title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM","json":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM.json","graph_json":"https://pith.science/api/pith-number/4JDI53LCXYYN3M3O6NTY5GFTIM/graph.json","events_json":"https://pith.science/api/pith-number/4JDI53LCXYYN3M3O6NTY5GFTIM/events.json","paper":"https://pith.science/paper/4JDI53LC"},"agent_actions":{"view_html":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM","download_json":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM.json","view_paper":"https://pith.science/paper/4JDI53LC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15569&json=true","fetch_graph":"https://pith.science/api/pith-number/4JDI53LCXYYN3M3O6NTY5GFTIM/graph.json","fetch_events":"https://pith.science/api/pith-number/4JDI53LCXYYN3M3O6NTY5GFTIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM/action/storage_attestation","attest_author":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM/action/author_attestation","sign_citation":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM/action/citation_signature","submit_replication":"https://pith.science/pith/4JDI53LCXYYN3M3O6NTY5GFTIM/action/replication_record"}},"created_at":"2026-07-05T08:47:49.418678+00:00","updated_at":"2026-07-05T08:47:49.418678+00:00"}