{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FRBNVN2DZRMHVGR2SVDXP74QL6","short_pith_number":"pith:FRBNVN2D","schema_version":"1.0","canonical_sha256":"2c42dab743cc587a9a3a954777ff905faf0f7d36f32b16335a0b5cd968ecd44d","source":{"kind":"arxiv","id":"2402.12022","version":2},"attestation_state":"computed","paper":{"title":"Distilling Large Language Models for Text-Attributed Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Bo Pan, Liang Zhao, Yifei Zhang, Yuntong Hu, Zheng Zhang","submitted_at":"2024-02-19T10:31:53Z","abstract_excerpt":"Text-Attributed Graphs (TAGs) are graphs of connected textual documents. Graph models can efficiently learn TAGs, but their training heavily relies on human-annotated labels, which are scarce or even unavailable in many applications. Large language models (LLMs) have recently demonstrated remarkable capabilities in few-shot and zero-shot TAG learning, but they suffer from scalability, cost, and privacy issues. Therefore, in this work, we focus on synergizing LLMs and graph models with their complementary strengths by distilling the power of LLMs to a local graph model on TAG learning. To addre"},"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":"2402.12022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-19T10:31:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7796aa203653a0e1f0d4cc67f7baa3d2808a338bace45e811d3b08cdde357188","abstract_canon_sha256":"5590c5670a529d640485d36e05e0f6284198368eee13d7151e4ea479de792a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:29.378301Z","signature_b64":"/RuXJdnQ22uTOQxH2cc+PqaxgmMEaiAN0cXbeVfpKFglui4npJ3NBiXrhU9fpn2dwDqINE1TFtkRjO3TtpC9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c42dab743cc587a9a3a954777ff905faf0f7d36f32b16335a0b5cd968ecd44d","last_reissued_at":"2026-07-05T08:52:29.377827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:29.377827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distilling Large Language Models for Text-Attributed Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Bo Pan, Liang Zhao, Yifei Zhang, Yuntong Hu, Zheng Zhang","submitted_at":"2024-02-19T10:31:53Z","abstract_excerpt":"Text-Attributed Graphs (TAGs) are graphs of connected textual documents. Graph models can efficiently learn TAGs, but their training heavily relies on human-annotated labels, which are scarce or even unavailable in many applications. Large language models (LLMs) have recently demonstrated remarkable capabilities in few-shot and zero-shot TAG learning, but they suffer from scalability, cost, and privacy issues. Therefore, in this work, we focus on synergizing LLMs and graph models with their complementary strengths by distilling the power of LLMs to a local graph model on TAG learning. To addre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12022","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/2402.12022/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":"2402.12022","created_at":"2026-07-05T08:52:29.377893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12022v2","created_at":"2026-07-05T08:52:29.377893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12022","created_at":"2026-07-05T08:52:29.377893+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRBNVN2DZRMH","created_at":"2026-07-05T08:52:29.377893+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRBNVN2DZRMHVGR2","created_at":"2026-07-05T08:52:29.377893+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRBNVN2D","created_at":"2026-07-05T08:52:29.377893+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.02343","citing_title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6","json":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6.json","graph_json":"https://pith.science/api/pith-number/FRBNVN2DZRMHVGR2SVDXP74QL6/graph.json","events_json":"https://pith.science/api/pith-number/FRBNVN2DZRMHVGR2SVDXP74QL6/events.json","paper":"https://pith.science/paper/FRBNVN2D"},"agent_actions":{"view_html":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6","download_json":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6.json","view_paper":"https://pith.science/paper/FRBNVN2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12022&json=true","fetch_graph":"https://pith.science/api/pith-number/FRBNVN2DZRMHVGR2SVDXP74QL6/graph.json","fetch_events":"https://pith.science/api/pith-number/FRBNVN2DZRMHVGR2SVDXP74QL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6/action/storage_attestation","attest_author":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6/action/author_attestation","sign_citation":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6/action/citation_signature","submit_replication":"https://pith.science/pith/FRBNVN2DZRMHVGR2SVDXP74QL6/action/replication_record"}},"created_at":"2026-07-05T08:52:29.377893+00:00","updated_at":"2026-07-05T08:52:29.377893+00:00"}