{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IJTA5YS4HVCSOZNJJUBDBNZAXQ","short_pith_number":"pith:IJTA5YS4","schema_version":"1.0","canonical_sha256":"42660ee25c3d452765a94d0230b720bc02b9d1fc51d0eac4d5b7de03e284a843","source":{"kind":"arxiv","id":"2410.19084","version":1},"attestation_state":"computed","paper":{"title":"GCoder: Improving Large Language Model for Generalized Graph Problem Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jia Li, Jianheng Tang, Jing Tang, Nuo Chen, Qifan Zhang, Wenzhong Li, Xiaobin Hong, Yuhan Li","submitted_at":"2024-10-24T18:40:36Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated strong reasoning abilities, making them suitable for complex tasks such as graph computation. Traditional reasoning steps paradigm for graph problems is hindered by unverifiable steps, limited long-term reasoning, and poor generalization to graph variations. To overcome these limitations, we introduce GCoder, a code-based LLM designed to enhance problem-solving in generalized graph computation problems. Our method involves constructing an extensive training dataset, GraphWild, featuring diverse graph formats and algorithms. We employ a multi-stage"},"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":"2410.19084","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-24T18:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"e53e54a6ecd337ab0e94013f5d1fbf6fb81de421c0e28a33ffcc91315cc4a0a9","abstract_canon_sha256":"b8e97be87d3d2c33682a2ba28305ae34cead48723475a96fc8d2457eed4d39fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:51.192412Z","signature_b64":"bnfnui7L9pdLI4SFKDOwjOHMkMPYlDIL20JptWshwVTuF+D2OzVKvkv8HhCLi73LNISdY9MDR7ZdXnQHR93jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42660ee25c3d452765a94d0230b720bc02b9d1fc51d0eac4d5b7de03e284a843","last_reissued_at":"2026-07-05T09:25:51.191891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:51.191891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GCoder: Improving Large Language Model for Generalized Graph Problem Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jia Li, Jianheng Tang, Jing Tang, Nuo Chen, Qifan Zhang, Wenzhong Li, Xiaobin Hong, Yuhan Li","submitted_at":"2024-10-24T18:40:36Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated strong reasoning abilities, making them suitable for complex tasks such as graph computation. Traditional reasoning steps paradigm for graph problems is hindered by unverifiable steps, limited long-term reasoning, and poor generalization to graph variations. To overcome these limitations, we introduce GCoder, a code-based LLM designed to enhance problem-solving in generalized graph computation problems. Our method involves constructing an extensive training dataset, GraphWild, featuring diverse graph formats and algorithms. We employ a multi-stage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19084","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/2410.19084/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":"2410.19084","created_at":"2026-07-05T09:25:51.191941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19084v1","created_at":"2026-07-05T09:25:51.191941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19084","created_at":"2026-07-05T09:25:51.191941+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJTA5YS4HVCS","created_at":"2026-07-05T09:25:51.191941+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJTA5YS4HVCSOZNJ","created_at":"2026-07-05T09:25:51.191941+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJTA5YS4","created_at":"2026-07-05T09:25:51.191941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.09891","citing_title":"ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":81,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ","json":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ.json","graph_json":"https://pith.science/api/pith-number/IJTA5YS4HVCSOZNJJUBDBNZAXQ/graph.json","events_json":"https://pith.science/api/pith-number/IJTA5YS4HVCSOZNJJUBDBNZAXQ/events.json","paper":"https://pith.science/paper/IJTA5YS4"},"agent_actions":{"view_html":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ","download_json":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ.json","view_paper":"https://pith.science/paper/IJTA5YS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19084&json=true","fetch_graph":"https://pith.science/api/pith-number/IJTA5YS4HVCSOZNJJUBDBNZAXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJTA5YS4HVCSOZNJJUBDBNZAXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ/action/storage_attestation","attest_author":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ/action/author_attestation","sign_citation":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ/action/citation_signature","submit_replication":"https://pith.science/pith/IJTA5YS4HVCSOZNJJUBDBNZAXQ/action/replication_record"}},"created_at":"2026-07-05T09:25:51.191941+00:00","updated_at":"2026-07-05T09:25:51.191941+00:00"}