{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6OQM45U2HQ4NSIDPG2ASBEU3X2","short_pith_number":"pith:6OQM45U2","schema_version":"1.0","canonical_sha256":"f3a0ce769a3c38d9206f368120929bbe8d99d48c2a3f0eb37d774b759505a47a","source":{"kind":"arxiv","id":"2605.24867","version":1},"attestation_state":"computed","paper":{"title":"Clustering as Reasoning: A $k$-Means Interpretation of Chain-of-Thought Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.NI"],"primary_cat":"cs.AI","authors_text":"Bingheng Li, Xingtong Yu, Xuanting Xie, Yuan Fang, Zhaochen Guo, Zhao Kang, Zhifei Liao","submitted_at":"2026-05-24T04:58:44Z","abstract_excerpt":"Chain-of-Thought (CoT) prompting has shown promise in enhancing the reasoning capabilities of large language models (LLMs) on text-attributed graphs (TAGs). This work reframes CoT-based graph learning through the principle of clustering as reasoning, offering a $k$-means interpretation of how iterative reasoning operates over graph-structured data. We observe that existing graph CoT methods rely on disjoint architectures and fixed graph representations, limiting step-by-step semantic-topological interaction and interpretability. To overcome this limitation, we propose a unified framework named"},"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":"2605.24867","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-24T04:58:44Z","cross_cats_sorted":["cs.CL","cs.NI"],"title_canon_sha256":"6e7db8aefdbaf2f80d05df430302854e2ed433de71c6e806e8175b5f2adef2a7","abstract_canon_sha256":"d2d67179888b3474d7e10e3631d6f1c491bfb86ebe7aea0304793b575fb09bd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:04:02.471987Z","signature_b64":"oFExl/uyOFabQwHoEydcFvA9kXiKdg+FLVCGEB4oMxqGSyFR4mGzZJcAU1tPw29SmyTLJCMve4DhQDy47cSjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3a0ce769a3c38d9206f368120929bbe8d99d48c2a3f0eb37d774b759505a47a","last_reissued_at":"2026-05-26T01:04:02.471277Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:04:02.471277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering as Reasoning: A $k$-Means Interpretation of Chain-of-Thought Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.NI"],"primary_cat":"cs.AI","authors_text":"Bingheng Li, Xingtong Yu, Xuanting Xie, Yuan Fang, Zhaochen Guo, Zhao Kang, Zhifei Liao","submitted_at":"2026-05-24T04:58:44Z","abstract_excerpt":"Chain-of-Thought (CoT) prompting has shown promise in enhancing the reasoning capabilities of large language models (LLMs) on text-attributed graphs (TAGs). This work reframes CoT-based graph learning through the principle of clustering as reasoning, offering a $k$-means interpretation of how iterative reasoning operates over graph-structured data. We observe that existing graph CoT methods rely on disjoint architectures and fixed graph representations, limiting step-by-step semantic-topological interaction and interpretability. To overcome this limitation, we propose a unified framework named"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24867","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/2605.24867/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":"2605.24867","created_at":"2026-05-26T01:04:02.471424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24867v1","created_at":"2026-05-26T01:04:02.471424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24867","created_at":"2026-05-26T01:04:02.471424+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OQM45U2HQ4N","created_at":"2026-05-26T01:04:02.471424+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OQM45U2HQ4NSIDP","created_at":"2026-05-26T01:04:02.471424+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OQM45U2","created_at":"2026-05-26T01:04:02.471424+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/6OQM45U2HQ4NSIDPG2ASBEU3X2","json":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2.json","graph_json":"https://pith.science/api/pith-number/6OQM45U2HQ4NSIDPG2ASBEU3X2/graph.json","events_json":"https://pith.science/api/pith-number/6OQM45U2HQ4NSIDPG2ASBEU3X2/events.json","paper":"https://pith.science/paper/6OQM45U2"},"agent_actions":{"view_html":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2","download_json":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2.json","view_paper":"https://pith.science/paper/6OQM45U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24867&json=true","fetch_graph":"https://pith.science/api/pith-number/6OQM45U2HQ4NSIDPG2ASBEU3X2/graph.json","fetch_events":"https://pith.science/api/pith-number/6OQM45U2HQ4NSIDPG2ASBEU3X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2/action/storage_attestation","attest_author":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2/action/author_attestation","sign_citation":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2/action/citation_signature","submit_replication":"https://pith.science/pith/6OQM45U2HQ4NSIDPG2ASBEU3X2/action/replication_record"}},"created_at":"2026-05-26T01:04:02.471424+00:00","updated_at":"2026-05-26T01:04:02.471424+00:00"}