{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DFDYXTYIVYC4NTRXEENP2S2DCK","short_pith_number":"pith:DFDYXTYI","schema_version":"1.0","canonical_sha256":"19478bcf08ae05c6ce37211afd4b4312a391d1cad80d3002388d4a07d07cc065","source":{"kind":"arxiv","id":"2310.04560","version":1},"attestation_state":"computed","paper":{"title":"Talk like a Graph: Encoding Graphs for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bahare Fatemi, Bryan Perozzi, Jonathan Halcrow","submitted_at":"2023-10-06T19:55:21Z","abstract_excerpt":"Graphs are a powerful tool for representing and analyzing complex relationships in real-world applications such as social networks, recommender systems, and computational finance. Reasoning on graphs is essential for drawing inferences about the relationships between entities in a complex system, and to identify hidden patterns and trends. Despite the remarkable progress in automated reasoning with natural text, reasoning on graphs with large language models (LLMs) remains an understudied problem. In this work, we perform the first comprehensive study of encoding graph-structured data as text "},"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.04560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T19:55:21Z","cross_cats_sorted":[],"title_canon_sha256":"4ec84d9c8dfca85fcf3c723368fe94e132b3264ea3bbead20b95eddb53e21a7f","abstract_canon_sha256":"08ffdc4e2840dc030562fb38eb8c5d8313a1a667ba9a0fbb75d959a76bfaa71b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:19.962347Z","signature_b64":"MIE1Roda5UHSaeVdjzNf/NVwSxmyI4Nz/liDkgHD2oRMcfrixzWPqsbniHLK10HS6Pkwfne+7Ts7cms97G1fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19478bcf08ae05c6ce37211afd4b4312a391d1cad80d3002388d4a07d07cc065","last_reissued_at":"2026-07-05T06:58:19.962006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:19.962006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Talk like a Graph: Encoding Graphs for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bahare Fatemi, Bryan Perozzi, Jonathan Halcrow","submitted_at":"2023-10-06T19:55:21Z","abstract_excerpt":"Graphs are a powerful tool for representing and analyzing complex relationships in real-world applications such as social networks, recommender systems, and computational finance. Reasoning on graphs is essential for drawing inferences about the relationships between entities in a complex system, and to identify hidden patterns and trends. Despite the remarkable progress in automated reasoning with natural text, reasoning on graphs with large language models (LLMs) remains an understudied problem. In this work, we perform the first comprehensive study of encoding graph-structured data as text "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04560","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.04560/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.04560","created_at":"2026-07-05T06:58:19.962060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04560v1","created_at":"2026-07-05T06:58:19.962060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04560","created_at":"2026-07-05T06:58:19.962060+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFDYXTYIVYC4","created_at":"2026-07-05T06:58:19.962060+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFDYXTYIVYC4NTRX","created_at":"2026-07-05T06:58:19.962060+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFDYXTYI","created_at":"2026-07-05T06:58:19.962060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11562","citing_title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31404","citing_title":"The Sword, Shield, and Achilles' Heel: Characterizing the Linguistic Inductive Bias of Large Language Models for Spatial Reasoning in Navigation Planning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27276","citing_title":"Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2501.17549","citing_title":"Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22471","citing_title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2507.14785","citing_title":"Exploring the In-Context Learning Capabilities of LLMs for Money Laundering Detection in Financial Graphs","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2602.04244","citing_title":"GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2603.01410","citing_title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07517","citing_title":"LARAG: Link-Aware Retrieval Strategy for RAG Systems in Hyperlinked Technical Documentation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06671","citing_title":"GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18092","citing_title":"Generalization Boundaries of Fine-Tuned Small Language Models for Graph Structural Inference","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK","json":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK.json","graph_json":"https://pith.science/api/pith-number/DFDYXTYIVYC4NTRXEENP2S2DCK/graph.json","events_json":"https://pith.science/api/pith-number/DFDYXTYIVYC4NTRXEENP2S2DCK/events.json","paper":"https://pith.science/paper/DFDYXTYI"},"agent_actions":{"view_html":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK","download_json":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK.json","view_paper":"https://pith.science/paper/DFDYXTYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04560&json=true","fetch_graph":"https://pith.science/api/pith-number/DFDYXTYIVYC4NTRXEENP2S2DCK/graph.json","fetch_events":"https://pith.science/api/pith-number/DFDYXTYIVYC4NTRXEENP2S2DCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK/action/storage_attestation","attest_author":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK/action/author_attestation","sign_citation":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK/action/citation_signature","submit_replication":"https://pith.science/pith/DFDYXTYIVYC4NTRXEENP2S2DCK/action/replication_record"}},"created_at":"2026-07-05T06:58:19.962060+00:00","updated_at":"2026-07-05T06:58:19.962060+00:00"}