{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JRM553QAW5NTXWOA55CXLI76FC","short_pith_number":"pith:JRM553QA","schema_version":"1.0","canonical_sha256":"4c59deee00b75b3bd9c0ef4575a3fe28aca6b0df33d9d0fe0d71ad8398c456b0","source":{"kind":"arxiv","id":"2310.04668","version":3},"attestation_state":"computed","paper":{"title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Haitao Mao, Haiyang Zhang, Haoyu Han, Hongzhi Wen, Hui Liu, Jiliang Tang, Wei Jin, Zhikai Chen","submitted_at":"2023-10-07T03:14:11Z","abstract_excerpt":"In recent years, there have been remarkable advancements in node classification achieved by Graph Neural Networks (GNNs). However, they necessitate abundant high-quality labels to ensure promising performance. In contrast, Large Language Models (LLMs) exhibit impressive zero-shot proficiency on text-attributed graphs. Yet, they face challenges in efficiently processing structural data and suffer from high inference costs. In light of these observations, this work introduces a label-free node classification on graphs with LLMs pipeline, LLM-GNN. It amalgamates the strengths of both GNNs and LLM"},"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":"2310.04668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-07T03:14:11Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"4185db8727afd7aab6ac9524783ee5b2fdcd22c6aab9c3b9f1ef2b5b541f8dd7","abstract_canon_sha256":"00614f2a79f00e9649bb9b1e2a04ce817ca55e61021790f3d86895977a08b528"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:48.837204Z","signature_b64":"gay/b18OflxjgbYVXRAzGnHAkbV2nZG0jyje3yPwWKAMbtBcd6pShcleYy4X+exZVz9H7DoI3CcySB/LGgzjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c59deee00b75b3bd9c0ef4575a3fe28aca6b0df33d9d0fe0d71ad8398c456b0","last_reissued_at":"2026-07-05T07:48:48.836702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:48.836702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Haitao Mao, Haiyang Zhang, Haoyu Han, Hongzhi Wen, Hui Liu, Jiliang Tang, Wei Jin, Zhikai Chen","submitted_at":"2023-10-07T03:14:11Z","abstract_excerpt":"In recent years, there have been remarkable advancements in node classification achieved by Graph Neural Networks (GNNs). However, they necessitate abundant high-quality labels to ensure promising performance. In contrast, Large Language Models (LLMs) exhibit impressive zero-shot proficiency on text-attributed graphs. Yet, they face challenges in efficiently processing structural data and suffer from high inference costs. In light of these observations, this work introduces a label-free node classification on graphs with LLMs pipeline, LLM-GNN. It amalgamates the strengths of both GNNs and LLM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04668","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/2310.04668/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":"2310.04668","created_at":"2026-07-05T07:48:48.836764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04668v3","created_at":"2026-07-05T07:48:48.836764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04668","created_at":"2026-07-05T07:48:48.836764+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRM553QAW5NT","created_at":"2026-07-05T07:48:48.836764+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRM553QAW5NTXWOA","created_at":"2026-07-05T07:48:48.836764+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRM553QA","created_at":"2026-07-05T07:48:48.836764+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"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":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.32016","citing_title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","ref_index":174,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29773","citing_title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27913","citing_title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2504.02343","citing_title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17411","citing_title":"DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs","ref_index":119,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC","json":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC.json","graph_json":"https://pith.science/api/pith-number/JRM553QAW5NTXWOA55CXLI76FC/graph.json","events_json":"https://pith.science/api/pith-number/JRM553QAW5NTXWOA55CXLI76FC/events.json","paper":"https://pith.science/paper/JRM553QA"},"agent_actions":{"view_html":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC","download_json":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC.json","view_paper":"https://pith.science/paper/JRM553QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04668&json=true","fetch_graph":"https://pith.science/api/pith-number/JRM553QAW5NTXWOA55CXLI76FC/graph.json","fetch_events":"https://pith.science/api/pith-number/JRM553QAW5NTXWOA55CXLI76FC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC/action/storage_attestation","attest_author":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC/action/author_attestation","sign_citation":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC/action/citation_signature","submit_replication":"https://pith.science/pith/JRM553QAW5NTXWOA55CXLI76FC/action/replication_record"}},"created_at":"2026-07-05T07:48:48.836764+00:00","updated_at":"2026-07-05T07:48:48.836764+00:00"}