{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ROFEU4HEU4O2YGLO3SH6PNMWBM","short_pith_number":"pith:ROFEU4HE","schema_version":"1.0","canonical_sha256":"8b8a4a70e4a71dac196edc8fe7b5960b06d5fbc05c1848fa9eacd38d4d9c63ac","source":{"kind":"arxiv","id":"2412.12152","version":1},"attestation_state":"computed","paper":{"title":"GraphTool-Instruction: Revolutionizing Graph Reasoning in LLMs through Decomposed Subtask Instruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiasheng Zhang, Ke Qin, Qizhi Chen, Rongzheng Wang, Shuang Liang","submitted_at":"2024-12-11T06:12:52Z","abstract_excerpt":"Large language models (LLMs) have been demonstrated to possess the capabilities to understand fundamental graph properties and address various graph reasoning tasks. Existing methods fine-tune LLMs to understand and execute graph reasoning tasks by specially designed task instructions. However, these Text-Instruction methods generally exhibit poor performance. Inspired by tool learning, researchers propose Tool-Instruction methods to solve various graph problems by special tool calling (e.g., function, API and model), achieving significant improvements in graph reasoning tasks. Nevertheless, c"},"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":"2412.12152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T06:12:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"21c5235837e9f0667457273e9b3f654397b83efb05b64f59f3cf0e094f19efd7","abstract_canon_sha256":"54f3e77f8047e1684f7a45e5b6139c7cfa2e50c9fbf4e892f3faa4db499a96f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:10.611398Z","signature_b64":"fCVEsYpbCQWre1xAEwmgl0SOxp4qh8ulPS+w4gg78gwCtLcKXl/o9xZ1ICoeJfzFOt46UvxUYfyQarjeOloPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8a4a70e4a71dac196edc8fe7b5960b06d5fbc05c1848fa9eacd38d4d9c63ac","last_reissued_at":"2026-07-05T09:50:10.610947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:10.610947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphTool-Instruction: Revolutionizing Graph Reasoning in LLMs through Decomposed Subtask Instruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiasheng Zhang, Ke Qin, Qizhi Chen, Rongzheng Wang, Shuang Liang","submitted_at":"2024-12-11T06:12:52Z","abstract_excerpt":"Large language models (LLMs) have been demonstrated to possess the capabilities to understand fundamental graph properties and address various graph reasoning tasks. Existing methods fine-tune LLMs to understand and execute graph reasoning tasks by specially designed task instructions. However, these Text-Instruction methods generally exhibit poor performance. Inspired by tool learning, researchers propose Tool-Instruction methods to solve various graph problems by special tool calling (e.g., function, API and model), achieving significant improvements in graph reasoning tasks. Nevertheless, c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12152","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/2412.12152/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":"2412.12152","created_at":"2026-07-05T09:50:10.611007+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12152v1","created_at":"2026-07-05T09:50:10.611007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12152","created_at":"2026-07-05T09:50:10.611007+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROFEU4HEU4O2","created_at":"2026-07-05T09:50:10.611007+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROFEU4HEU4O2YGLO","created_at":"2026-07-05T09:50:10.611007+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROFEU4HE","created_at":"2026-07-05T09:50:10.611007+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22955","citing_title":"LLMs Between the Nodes: Community Discovery Beyond Vectors","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM","json":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM.json","graph_json":"https://pith.science/api/pith-number/ROFEU4HEU4O2YGLO3SH6PNMWBM/graph.json","events_json":"https://pith.science/api/pith-number/ROFEU4HEU4O2YGLO3SH6PNMWBM/events.json","paper":"https://pith.science/paper/ROFEU4HE"},"agent_actions":{"view_html":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM","download_json":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM.json","view_paper":"https://pith.science/paper/ROFEU4HE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12152&json=true","fetch_graph":"https://pith.science/api/pith-number/ROFEU4HEU4O2YGLO3SH6PNMWBM/graph.json","fetch_events":"https://pith.science/api/pith-number/ROFEU4HEU4O2YGLO3SH6PNMWBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM/action/storage_attestation","attest_author":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM/action/author_attestation","sign_citation":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM/action/citation_signature","submit_replication":"https://pith.science/pith/ROFEU4HEU4O2YGLO3SH6PNMWBM/action/replication_record"}},"created_at":"2026-07-05T09:50:10.611007+00:00","updated_at":"2026-07-05T09:50:10.611007+00:00"}