{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y2RZC3GXIAPWIWSHHQFUIIR6LH","short_pith_number":"pith:Y2RZC3GX","schema_version":"1.0","canonical_sha256":"c6a3916cd7401f645a473c0b44223e59f7cd444324a9c182163ba89ac00b63c6","source":{"kind":"arxiv","id":"2408.13863","version":1},"attestation_state":"computed","paper":{"title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"James Kwok, Qiaolong Cai, Shizhe Diao, Yangqiu Song, Zhaowei Wang","submitted_at":"2024-08-25T15:27:21Z","abstract_excerpt":"With the increasing popularity of large language models (LLMs), reasoning on basic graph algorithm problems is an essential intermediate step in assessing their abilities to process and infer complex graph reasoning tasks. Existing methods usually convert graph-structured data to textual descriptions and then use LLMs for reasoning and computation. However, LLMs often produce computation errors on arithmetic parts in basic graph algorithm problems, such as counting number of edges. In addition, they struggle to control or understand the output of the reasoning process, raising concerns about w"},"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":"2408.13863","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-25T15:27:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"88cac948dc42653e177c7ec0f47cc0ac1f2e1f3a8a9e2977a739a26700272779","abstract_canon_sha256":"b79640ced12874dee2146dabd49f360f8f66aa0568f56195345f91614104d51e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:13.180772Z","signature_b64":"zg4roareK40tLImuwY52NT5dO2njAsdsXugGzN+QZsbdcqzda5MEzyyrxanoQQkC697ME0RsjsiHi20iYg9JBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a3916cd7401f645a473c0b44223e59f7cd444324a9c182163ba89ac00b63c6","last_reissued_at":"2026-07-05T08:59:13.180287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:13.180287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"James Kwok, Qiaolong Cai, Shizhe Diao, Yangqiu Song, Zhaowei Wang","submitted_at":"2024-08-25T15:27:21Z","abstract_excerpt":"With the increasing popularity of large language models (LLMs), reasoning on basic graph algorithm problems is an essential intermediate step in assessing their abilities to process and infer complex graph reasoning tasks. Existing methods usually convert graph-structured data to textual descriptions and then use LLMs for reasoning and computation. However, LLMs often produce computation errors on arithmetic parts in basic graph algorithm problems, such as counting number of edges. In addition, they struggle to control or understand the output of the reasoning process, raising concerns about w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13863","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/2408.13863/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":"2408.13863","created_at":"2026-07-05T08:59:13.180354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13863v1","created_at":"2026-07-05T08:59:13.180354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13863","created_at":"2026-07-05T08:59:13.180354+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2RZC3GXIAPW","created_at":"2026-07-05T08:59:13.180354+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2RZC3GXIAPWIWSH","created_at":"2026-07-05T08:59:13.180354+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2RZC3GX","created_at":"2026-07-05T08:59:13.180354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21858","citing_title":"Hypergraph as Language","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17715","citing_title":"Program Structure-aware Language Models: Targeted Software Testing beyond Textual Semantics","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH","json":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH.json","graph_json":"https://pith.science/api/pith-number/Y2RZC3GXIAPWIWSHHQFUIIR6LH/graph.json","events_json":"https://pith.science/api/pith-number/Y2RZC3GXIAPWIWSHHQFUIIR6LH/events.json","paper":"https://pith.science/paper/Y2RZC3GX"},"agent_actions":{"view_html":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH","download_json":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH.json","view_paper":"https://pith.science/paper/Y2RZC3GX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13863&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2RZC3GXIAPWIWSHHQFUIIR6LH/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2RZC3GXIAPWIWSHHQFUIIR6LH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH/action/storage_attestation","attest_author":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH/action/author_attestation","sign_citation":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH/action/citation_signature","submit_replication":"https://pith.science/pith/Y2RZC3GXIAPWIWSHHQFUIIR6LH/action/replication_record"}},"created_at":"2026-07-05T08:59:13.180354+00:00","updated_at":"2026-07-05T08:59:13.180354+00:00"}