{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VDPWI3LSCFYJTID64FUEK2RQBS","short_pith_number":"pith:VDPWI3LS","schema_version":"1.0","canonical_sha256":"a8df646d72117099a07ee168456a300c94273ae9728b121b2d4a3f2dbe6cb89f","source":{"kind":"arxiv","id":"2405.19119","version":3},"attestation_state":"computed","paper":{"title":"Can Graph Learning Improve Planning in LLM-based Agents?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bohang Zhang, Caihua Shan, Dongsheng Li, Hong Cheng, Jiarui Feng, Kaitao Song, Siwei Wang, Wei Chen, Xixi Wu, Yifei Shen, Yun Xiong","submitted_at":"2024-05-29T14:26:24Z","abstract_excerpt":"Task planning in language agents is emerging as an important research topic alongside the development of large language models (LLMs). It aims to break down complex user requests in natural language into solvable sub-tasks, thereby fulfilling the original requests. In this context, the sub-tasks can be naturally viewed as a graph, where the nodes represent the sub-tasks, and the edges denote the dependencies among them. Consequently, task planning is a decision-making problem that involves selecting a connected path or subgraph within the corresponding graph and invoking it. In this paper, we "},"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":"2405.19119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-29T14:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"4eddfb50259bd6cd13a63c343c7a2cb4d77026c261353b9236a8d76e2c59d800","abstract_canon_sha256":"283e7e31e8c0eae11c5840d97fe93e1f8d43094c7ad5f2f18afc679665b7ac91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:27.225116Z","signature_b64":"fo5HNb3fYsehlNt1ib4SZ+TUNc3YAxaAE7zJSnIk/BPmexkLGcxvJ34kjdIHhPIGECRDh8DRrlamZ+0VuMOPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8df646d72117099a07ee168456a300c94273ae9728b121b2d4a3f2dbe6cb89f","last_reissued_at":"2026-07-05T09:26:27.224621Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:27.224621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Graph Learning Improve Planning in LLM-based Agents?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bohang Zhang, Caihua Shan, Dongsheng Li, Hong Cheng, Jiarui Feng, Kaitao Song, Siwei Wang, Wei Chen, Xixi Wu, Yifei Shen, Yun Xiong","submitted_at":"2024-05-29T14:26:24Z","abstract_excerpt":"Task planning in language agents is emerging as an important research topic alongside the development of large language models (LLMs). It aims to break down complex user requests in natural language into solvable sub-tasks, thereby fulfilling the original requests. In this context, the sub-tasks can be naturally viewed as a graph, where the nodes represent the sub-tasks, and the edges denote the dependencies among them. Consequently, task planning is a decision-making problem that involves selecting a connected path or subgraph within the corresponding graph and invoking it. In this paper, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19119","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/2405.19119/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":"2405.19119","created_at":"2026-07-05T09:26:27.224682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19119v3","created_at":"2026-07-05T09:26:27.224682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19119","created_at":"2026-07-05T09:26:27.224682+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDPWI3LSCFYJ","created_at":"2026-07-05T09:26:27.224682+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDPWI3LSCFYJTID6","created_at":"2026-07-05T09:26:27.224682+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDPWI3LS","created_at":"2026-07-05T09:26:27.224682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS","json":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS.json","graph_json":"https://pith.science/api/pith-number/VDPWI3LSCFYJTID64FUEK2RQBS/graph.json","events_json":"https://pith.science/api/pith-number/VDPWI3LSCFYJTID64FUEK2RQBS/events.json","paper":"https://pith.science/paper/VDPWI3LS"},"agent_actions":{"view_html":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS","download_json":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS.json","view_paper":"https://pith.science/paper/VDPWI3LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19119&json=true","fetch_graph":"https://pith.science/api/pith-number/VDPWI3LSCFYJTID64FUEK2RQBS/graph.json","fetch_events":"https://pith.science/api/pith-number/VDPWI3LSCFYJTID64FUEK2RQBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS/action/storage_attestation","attest_author":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS/action/author_attestation","sign_citation":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS/action/citation_signature","submit_replication":"https://pith.science/pith/VDPWI3LSCFYJTID64FUEK2RQBS/action/replication_record"}},"created_at":"2026-07-05T09:26:27.224682+00:00","updated_at":"2026-07-05T09:26:27.224682+00:00"}