{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JBA6RLSQD3GMNHPADSXC6AKIKI","short_pith_number":"pith:JBA6RLSQ","canonical_record":{"source":{"id":"2606.06865","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-05T03:24:38Z","cross_cats_sorted":[],"title_canon_sha256":"6c947f2e8472e75b46372296a8440021481a64a1acfc8ef7791574674b849001","abstract_canon_sha256":"010d74c5baa2303a2b1201fd3a951f083cbdc680d5ad77c14eb80f02bd0e7b3d"},"schema_version":"1.0"},"canonical_sha256":"4841e8ae501eccc69de01cae2f01485207e2d3fffa521b3eb32b6cf30ac234ad","source":{"kind":"arxiv","id":"2606.06865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06865","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06865v1","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06865","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"JBA6RLSQD3GM","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_16","alias_value":"JBA6RLSQD3GMNHPA","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_8","alias_value":"JBA6RLSQ","created_at":"2026-06-08T01:04:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JBA6RLSQD3GMNHPADSXC6AKIKI","target":"record","payload":{"canonical_record":{"source":{"id":"2606.06865","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-05T03:24:38Z","cross_cats_sorted":[],"title_canon_sha256":"6c947f2e8472e75b46372296a8440021481a64a1acfc8ef7791574674b849001","abstract_canon_sha256":"010d74c5baa2303a2b1201fd3a951f083cbdc680d5ad77c14eb80f02bd0e7b3d"},"schema_version":"1.0"},"canonical_sha256":"4841e8ae501eccc69de01cae2f01485207e2d3fffa521b3eb32b6cf30ac234ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:32.511602Z","signature_b64":"yN6Gf0Vr9PZ8DBFCjVK11mClWobgLHMu8sBWuaHzw9lrEpShBFpzcrYo9ieXStHmAQmmNC0mFQA8H85Uj93bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4841e8ae501eccc69de01cae2f01485207e2d3fffa521b3eb32b6cf30ac234ad","last_reissued_at":"2026-06-08T01:04:32.510775Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:32.510775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.06865","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nhyg+dGScjwaW6b3JjqYu1JALT2IamXTG14Kgyre+c1Uo3GPm7DzLAaDc99XzLv023qFQvfvLHqDXdrTya6lBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:43:14.092617Z"},"content_sha256":"df755a73610e3c20b20dfe5fb895dcaa2a80c84cfcbb3f4a0e8a1d462eef8a16","schema_version":"1.0","event_id":"sha256:df755a73610e3c20b20dfe5fb895dcaa2a80c84cfcbb3f4a0e8a1d462eef8a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JBA6RLSQD3GMNHPADSXC6AKIKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Angela Bonifati, Kai Wang, Wei Ni, Wenjie Zhang, Yi Han, Yuting Zhang","submitted_at":"2026-06-05T03:24:38Z","abstract_excerpt":"Large language models (LLMs) have been increasingly explored for graph computation, where tasks require reasoning over structured relationships and algorithmic operations. Yet, it remains unclear when LLMs can reliably support such computation and how they should be incorporated into graph-solving pipelines. Existing surveys at the intersection of LLMs and graphs primarily focus on graph learning, text-attributed graphs, or graph-language modeling. To bridge this gap, we provide a comprehensive review of LLMs for graph computation through a role-based taxonomy. Specifically, we identify two ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06865","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/2606.06865/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD1z6/EHclYzwKaDkBzqRqDQ0PEvkZ/wRd0ZGMJlnyfw9NEAUna7NzfMguXICwDK7KuTySpJPIEdVOB4rVlFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:43:14.092989Z"},"content_sha256":"dc6d2f6f80ab14a392fbdc1851fe8c366d5c0224f6ee9da29f80f4aed1561fb4","schema_version":"1.0","event_id":"sha256:dc6d2f6f80ab14a392fbdc1851fe8c366d5c0224f6ee9da29f80f4aed1561fb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/bundle.json","state_url":"https://pith.science/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T03:43:14Z","links":{"resolver":"https://pith.science/pith/JBA6RLSQD3GMNHPADSXC6AKIKI","bundle":"https://pith.science/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/bundle.json","state":"https://pith.science/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBA6RLSQD3GMNHPADSXC6AKIKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JBA6RLSQD3GMNHPADSXC6AKIKI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"010d74c5baa2303a2b1201fd3a951f083cbdc680d5ad77c14eb80f02bd0e7b3d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-05T03:24:38Z","title_canon_sha256":"6c947f2e8472e75b46372296a8440021481a64a1acfc8ef7791574674b849001"},"schema_version":"1.0","source":{"id":"2606.06865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06865","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06865v1","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06865","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"JBA6RLSQD3GM","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_16","alias_value":"JBA6RLSQD3GMNHPA","created_at":"2026-06-08T01:04:32Z"},{"alias_kind":"pith_short_8","alias_value":"JBA6RLSQ","created_at":"2026-06-08T01:04:32Z"}],"graph_snapshots":[{"event_id":"sha256:dc6d2f6f80ab14a392fbdc1851fe8c366d5c0224f6ee9da29f80f4aed1561fb4","target":"graph","created_at":"2026-06-08T01:04:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.06865/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) have been increasingly explored for graph computation, where tasks require reasoning over structured relationships and algorithmic operations. Yet, it remains unclear when LLMs can reliably support such computation and how they should be incorporated into graph-solving pipelines. Existing surveys at the intersection of LLMs and graphs primarily focus on graph learning, text-attributed graphs, or graph-language modeling. To bridge this gap, we provide a comprehensive review of LLMs for graph computation through a role-based taxonomy. Specifically, we identify two ma","authors_text":"Angela Bonifati, Kai Wang, Wei Ni, Wenjie Zhang, Yi Han, Yuting Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-05T03:24:38Z","title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06865","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:df755a73610e3c20b20dfe5fb895dcaa2a80c84cfcbb3f4a0e8a1d462eef8a16","target":"record","created_at":"2026-06-08T01:04:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"010d74c5baa2303a2b1201fd3a951f083cbdc680d5ad77c14eb80f02bd0e7b3d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-05T03:24:38Z","title_canon_sha256":"6c947f2e8472e75b46372296a8440021481a64a1acfc8ef7791574674b849001"},"schema_version":"1.0","source":{"id":"2606.06865","kind":"arxiv","version":1}},"canonical_sha256":"4841e8ae501eccc69de01cae2f01485207e2d3fffa521b3eb32b6cf30ac234ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4841e8ae501eccc69de01cae2f01485207e2d3fffa521b3eb32b6cf30ac234ad","first_computed_at":"2026-06-08T01:04:32.510775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:32.510775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yN6Gf0Vr9PZ8DBFCjVK11mClWobgLHMu8sBWuaHzw9lrEpShBFpzcrYo9ieXStHmAQmmNC0mFQA8H85Uj93bAA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:32.511602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df755a73610e3c20b20dfe5fb895dcaa2a80c84cfcbb3f4a0e8a1d462eef8a16","sha256:dc6d2f6f80ab14a392fbdc1851fe8c366d5c0224f6ee9da29f80f4aed1561fb4"],"state_sha256":"129a035b70f5688a21280f0bf5560c58efa62f19e6fa1ed3c5babb39d29daa70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn/s1BRSIhSaehKaw9l02JciGwBH1iBWlUFrd4MEvHexwfdDcgCaNhfbSm9TRXeY68zkK1AcyYUXmkRhmFNPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:43:14.095167Z","bundle_sha256":"e28eeaff6f81d4dd1a6eafbe12707057b9a793e2a6f3b67249ba80e1f1c92e01"}}