{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SDPR5HK6WFYJAFVUMJG32MZJ3A","short_pith_number":"pith:SDPR5HK6","schema_version":"1.0","canonical_sha256":"90df1e9d5eb1709016b4624dbd3329d80851d7be84ff78ba090005426289dc56","source":{"kind":"arxiv","id":"2311.14324","version":3},"attestation_state":"computed","paper":{"title":"Large Language Models as Topological Structure Enhancers for Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Chen Ma, Jiehao Chen, Shengyin Sun, Yuxiang Ren","submitted_at":"2023-11-24T07:53:48Z","abstract_excerpt":"The latest advancements in large language models (LLMs) have revolutionized the field of natural language processing (NLP). Inspired by the success of LLMs in NLP tasks, some recent work has begun investigating the potential of applying LLMs in graph learning tasks. However, most of the existing work focuses on utilizing LLMs as powerful node feature augmenters, leaving employing LLMs to enhance graph topological structures an understudied problem. In this work, we explore how to leverage the information retrieval and text generation capabilities of LLMs to refine/enhance the topological struc"},"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":"2311.14324","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-11-24T07:53:48Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"7a089d7e7da9a60e7691e2f2f94e5ecaddf0580a7181bf150d215d424228f9e8","abstract_canon_sha256":"eaebab1d681dca69c7866ff932b9b45751a5c9563f188d371dc36b335c085cc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:33.862818Z","signature_b64":"xHpiHQc9r/SXJSWyT7l6I3q3Q79vArTkJfcx4wNKktV/fN3a6eL2eehU8ZN0ejXy/eeTouvasAeohe/PR+9lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90df1e9d5eb1709016b4624dbd3329d80851d7be84ff78ba090005426289dc56","last_reissued_at":"2026-07-05T10:18:33.862375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:33.862375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Models as Topological Structure Enhancers for Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Chen Ma, Jiehao Chen, Shengyin Sun, Yuxiang Ren","submitted_at":"2023-11-24T07:53:48Z","abstract_excerpt":"The latest advancements in large language models (LLMs) have revolutionized the field of natural language processing (NLP). Inspired by the success of LLMs in NLP tasks, some recent work has begun investigating the potential of applying LLMs in graph learning tasks. However, most of the existing work focuses on utilizing LLMs as powerful node feature augmenters, leaving employing LLMs to enhance graph topological structures an understudied problem. In this work, we explore how to leverage the information retrieval and text generation capabilities of LLMs to refine/enhance the topological struc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14324","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/2311.14324/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":"2311.14324","created_at":"2026-07-05T10:18:33.862427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.14324v3","created_at":"2026-07-05T10:18:33.862427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14324","created_at":"2026-07-05T10:18:33.862427+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDPR5HK6WFYJ","created_at":"2026-07-05T10:18:33.862427+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDPR5HK6WFYJAFVU","created_at":"2026-07-05T10:18:33.862427+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDPR5HK6","created_at":"2026-07-05T10:18:33.862427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19877","citing_title":"Robust Anomaly Detection in Network Traffic: Evaluating Machine Learning Models on CICIDS2017","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A","json":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A.json","graph_json":"https://pith.science/api/pith-number/SDPR5HK6WFYJAFVUMJG32MZJ3A/graph.json","events_json":"https://pith.science/api/pith-number/SDPR5HK6WFYJAFVUMJG32MZJ3A/events.json","paper":"https://pith.science/paper/SDPR5HK6"},"agent_actions":{"view_html":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A","download_json":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A.json","view_paper":"https://pith.science/paper/SDPR5HK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.14324&json=true","fetch_graph":"https://pith.science/api/pith-number/SDPR5HK6WFYJAFVUMJG32MZJ3A/graph.json","fetch_events":"https://pith.science/api/pith-number/SDPR5HK6WFYJAFVUMJG32MZJ3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A/action/storage_attestation","attest_author":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A/action/author_attestation","sign_citation":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A/action/citation_signature","submit_replication":"https://pith.science/pith/SDPR5HK6WFYJAFVUMJG32MZJ3A/action/replication_record"}},"created_at":"2026-07-05T10:18:33.862427+00:00","updated_at":"2026-07-05T10:18:33.862427+00:00"}