{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NZYPA4XHCGIXF5PCPH4MUI6BBQ","short_pith_number":"pith:NZYPA4XH","schema_version":"1.0","canonical_sha256":"6e70f072e7119172f5e279f8ca23c10c1d48642b88f92948b29cbecdb1c1bcaa","source":{"kind":"arxiv","id":"2310.01089","version":1},"attestation_state":"computed","paper":{"title":"GraphText: Graph Reasoning in Text Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jianan Zhao, Jian Tang, Kai Liu, Le Zhuo, Meng Qu, Michael Bronstein, Yikang Shen, Zhaocheng Zhu","submitted_at":"2023-10-02T11:03:57Z","abstract_excerpt":"Large Language Models (LLMs) have gained the ability to assimilate human knowledge and facilitate natural language interactions with both humans and other LLMs. However, despite their impressive achievements, LLMs have not made significant advancements in the realm of graph machine learning. This limitation arises because graphs encapsulate distinct relational data, making it challenging to transform them into natural language that LLMs understand. In this paper, we bridge this gap with a novel framework, GraphText, that translates graphs into natural language. GraphText derives a graph-syntax"},"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.01089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-02T11:03:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"431d1bacbfc450d2a5884bdec0e496baf82d3c02f99967b332400749598599e7","abstract_canon_sha256":"2727f22deafdf98ef509748f39dcfd42c2151356b02842f0ddc6da7fc155dd78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:14.195539Z","signature_b64":"oYSyXgI9w/h/ma6I/uR9wei8hFQ5mb5lohTt7WXc+bD92PQc/ODLPZOoWbea9VrpYUnutQEiGJPO1e5shp0XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e70f072e7119172f5e279f8ca23c10c1d48642b88f92948b29cbecdb1c1bcaa","last_reissued_at":"2026-07-05T06:56:14.195090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:14.195090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphText: Graph Reasoning in Text Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jianan Zhao, Jian Tang, Kai Liu, Le Zhuo, Meng Qu, Michael Bronstein, Yikang Shen, Zhaocheng Zhu","submitted_at":"2023-10-02T11:03:57Z","abstract_excerpt":"Large Language Models (LLMs) have gained the ability to assimilate human knowledge and facilitate natural language interactions with both humans and other LLMs. However, despite their impressive achievements, LLMs have not made significant advancements in the realm of graph machine learning. This limitation arises because graphs encapsulate distinct relational data, making it challenging to transform them into natural language that LLMs understand. In this paper, we bridge this gap with a novel framework, GraphText, that translates graphs into natural language. GraphText derives a graph-syntax"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01089","kind":"arxiv","version":1},"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.01089/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.01089","created_at":"2026-07-05T06:56:14.195142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01089v1","created_at":"2026-07-05T06:56:14.195142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01089","created_at":"2026-07-05T06:56:14.195142+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZYPA4XHCGIX","created_at":"2026-07-05T06:56:14.195142+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZYPA4XHCGIXF5PC","created_at":"2026-07-05T06:56:14.195142+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZYPA4XH","created_at":"2026-07-05T06:56:14.195142+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.15633","citing_title":"Formalizing and Mitigating Structural Distortion in LLM Attention for Graph Reasoning","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27204","citing_title":"GraphReview: Scientific Paper Evaluation via LLM-Based Graph Message Passing","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03514","citing_title":"Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04834","citing_title":"Bridging Input Feature Spaces Towards Graph Foundation Models","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05846","citing_title":"AgentGL: Towards Agentic Graph Learning with LLMs via Reinforcement Learning","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ","json":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ.json","graph_json":"https://pith.science/api/pith-number/NZYPA4XHCGIXF5PCPH4MUI6BBQ/graph.json","events_json":"https://pith.science/api/pith-number/NZYPA4XHCGIXF5PCPH4MUI6BBQ/events.json","paper":"https://pith.science/paper/NZYPA4XH"},"agent_actions":{"view_html":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ","download_json":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ.json","view_paper":"https://pith.science/paper/NZYPA4XH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01089&json=true","fetch_graph":"https://pith.science/api/pith-number/NZYPA4XHCGIXF5PCPH4MUI6BBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NZYPA4XHCGIXF5PCPH4MUI6BBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ/action/storage_attestation","attest_author":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ/action/author_attestation","sign_citation":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ/action/citation_signature","submit_replication":"https://pith.science/pith/NZYPA4XHCGIXF5PCPH4MUI6BBQ/action/replication_record"}},"created_at":"2026-07-05T06:56:14.195142+00:00","updated_at":"2026-07-05T06:56:14.195142+00:00"}